10 documentos corresponden a la consulta.
Palabras contadas: dickenstein: 10
Cox, D. - Dickenstein, A.
Proc. Am. Math. Soc. 2005;133(11):3153-3162
2005
Temas: Toric variety
Descripción: Let X be a complete toric variety with homogeneous coordinate ring S. In this article, we compute upper and lower bounds for the codimension in the critical degree of ideals of S generated by dim(X) + 1 homogeneous polynomials that do not vanish simultaneously on X. ©2005 American Mathematical Society.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Tobis, E.A.
Discrete Appl Math 2010;158(5):444-452
2010
Temas: Cycles - Graph labeling - Incidence matrix - Kernel - Toric ideal - Following problem - Graph labelings - Incidence matrices - Labelings - Multiplicative version
Descripción: Let G = (V, E) be a graph and d a positive integer. We study the following problem: for which labelings fE : E → Zd is there a labeling fV : V → Zd such that fE (i, j) = fV (i) + fV (j) (mod d), for every edge (i, j) ∈ E? We also explore the connections of the equivalent multiplicative version to toric ideals. We derive a polynomial algorithm to answer these questions and to obtain all possible solutions. © 2009 Elsevier B.V. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Sturmfels, B.
J. Symb. Comput. 2002;34(2):119-135
2002
Descripción: New formulae are given for Chow forms, discriminants and resultants arising from (not necessarily normal) toric varieties of codimension 2. The Newton polygon of the discriminant is determined exactly. © 2002 Elsevier Science Ltd. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Cattani, E. - Dickenstein, A.
J. Complexity 2007;23(1):82-107
2007
Temas: # P-complete - Binomial ideal - Complete intersection - Computational methods - Polynomials - Problem solving - Vectors - Binomials - Complete intersection - Polynomial time
Descripción: We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is finite. We give a combinatorial formula for computing the total number of affine solutions (with or without multiplicity) from which we deduce that this counting problem is # P-complete. We discuss special cases in which this formula may be computed in polynomial time; in particular, this is true for generic exponent vectors. © 2006 Elsevier Inc. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Feichtner, E.M. - Sturmfels, B.
J. Am. Math. Soc. 2007;20(4):1111-1133
2007
Descripción: Fil:Dickenstein, A. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Cattani, E. - Curran, R. - Dickenstein, A.
Proc. Am. Math. Soc. 2007;135(2):329-335
2007
Descripción: We present examples that show that in dimension higher than one or codimension higher than two, there exist toric ideals IA such that no binomial ideal contained in IA and of the same dimension is a complete intersection. This result has important implications in sparse elimination theory and in the study of the Horn system of partial differential equations. © 2006 American Mathematical Society.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Matusevich, L.F. - Sadykov, T.
Adv. Math. 2005;196(1):78-123
2005
Descripción: We undertake the study of bivariate Horn systems for generic parameters. We prove that these hypergeometric systems are holonomic, and we provide an explicit formula for their holonomic rank as well as bases of their spaces of complex holomorphic solutions. We also obtain analogous results for the generalized hypergeometric systems arising from lattices of any rank. © 2004 Elsevier Inc. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Gianni, P. - Recio, T.
J. Symb. Comput. 2007;42(1-2):1-3
2007
Descripción: Fil:Dickenstein, A. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Dickenstein, A. - Di Rocco, S. - Piene, R.
Adv. Math. 2009;222(1):240-254
2009
Descripción: We show that any smooth Q-normal lattice polytope P of dimension n and degree d is a strict Cayley polytope if n ≥ 2 d + 1. This gives a sharp answer, for this class of polytopes, to a question raised by V.V. Batyrev and B. Nill. © 2009 Elsevier Inc. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo
Craciun, G. - Dickenstein, A. - Shiu, A. - Sturmfels, B.
J. Symb. Comput. 2009;44(11):1551-1565
2009
Temas: Birch's Theorem - Chemical reaction network - Complex balancing - Deficiency zero - Detailed balancing - Matrix-tree theorem - Moduli space - Polyhedron - Toric ideal - Trajectory
Descripción: Toric dynamical systems are known as complex balancing mass action systems in the mathematical chemistry literature, where many of their remarkable properties have been established. They include as special cases all deficiency zero systems and all detailed balancing systems. One feature is that the steady state locus of a toric dynamical system is a toric variety, which has a unique point within each invariant polyhedron. We develop the basic theory of toric dynamical systems in the context of computational algebraic geometry and show that the associated moduli space is also a toric variety. It is conjectured that the complex balancing state is a global attractor. We prove this for detailed balancing systems whose invariant polyhedron is two-dimensional and bounded. © 2009 Elsevier Ltd. All rights reserved.
...ver más Tipo de documento: info:ar-repo/semantics/artículo