Searcharxiv⌕ Search

arXiv subjects

Sergey Fomin

Publications and source records attributed to Sergey Fomin.

At least 37 records · Page 2Linked to original sources

Webs on surfaces, rings of invariants, and clusters

We construct and study cluster algebra structures in rings of invariants of the special linear group action on collections of three-dimensional vectors, covectors, and matrices. The construction uses Kuperberg's calculus of webs on marked surfaces with boundary.

math.QA↗

Total positivity and cluster algebras

This is a brief and informal introduction to cluster algebras. It roughly follows the historical path of their discovery, made jointly with A.Zelevinsky. Total positivity serves as the main motivation.

math.RA↗

Labeled floor diagrams for plane curves

Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces in terms of floor diagrams and their generalizations. In a number of cases, these descriptions can be used to obtain explicit (direct or recursive) formulas for the corresponding enumerative invariants. In particular, we use this approach to enumerate rational curves of given degree passing through a collection of points on the complex plane and having maximal tangency to a given line. Another application of the combinatorial approach is a proof of a conjecture by P. Di Francesco -- C. Itzykson and L. Goettsche that in the case of a fixed cogenus, the number of plane curves of degree d passing through suitably many generic points is given by a polynomial in d, assuming that d is sufficiently large. Furthermore, the proof provides a method for computing these "node polynomials." A labeled floor diagram is obtained by labeling the vertices of a floor diagram by the integers 1,...,d in a manner compatible with the orientation. We show that labeled floor diagrams of genus 0 are equinumerous to labeled trees, and therefore counted by the celebrated Cayley's formula. The corresponding bijections lead to interpretations of the Kontsevich numbers (the genus-0 Gromov-Witten invariants of the projective plane) in terms of certain statistics on trees.

math.AG↗

Root systems and generalized associahedra

These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of root systems, generalized associahedra, and the combinatorics of clusters. Lectures 1-2 cover classical material: root systems, finite reflection groups, and the Cartan-Killing classification. Lectures 3-4 provide an introduction to cluster algebras from a combinatorial perspective. Lecture 5 is devoted to related topics in enumerative combinatorics.

math.CO↗

Cluster algebras and triangulated surfaces. Part I: Cluster complexes

We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of coefficients, describe this complex explicitly in terms of "tagged triangulations" of the surface, and determine its homotopy type and its growth rate.

math.RA↗

Generalized cluster complexes and Coxeter combinatorics

We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or, equivalently, to the cluster complexes for the cluster algebras of finite type. Our computation of the face numbers and h-vectors of these complexes produces the enumerative invariants defined in other contexts by C.A.Athanasiadis, suggesting links to a host of well studied problems in algebraic combinatorics of finite Coxeter groups, root systems, and hyperplane arrangements. Recurrences satisfied by the face numbers of our complexes lead to combinatorial algorithms for determining Coxeter-theoretic invariants. That is, starting with a Coxeter diagram of a finite Coxeter group, one can compute the Coxeter number, the exponents, and other classical invariants by a recursive procedure that only uses most basic graph-theoretic concepts applied to the input diagram. In types A and B, we rediscover the constructions and results obtained by E.Tzanaki .

math.CO↗

Cluster algebras IV: Coefficients

We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials associated with a particular choice of "principal" coefficients. We show that the exchange graph of a cluster algebra with principal coefficients covers the exchange graph of any cluster algebra with the same exchange matrix. We investigate two families of parametrizations of cluster monomials by lattice points, determined, respectively, by the denominators of their Laurent expansions and by certain multi-gradings in cluster algebras with principal coefficients. The properties of these parametrizations, some proven and some conjectural, suggest links to duality conjectures of V.Fock and A.Goncharov [math.AG/0311245]. The coefficient dynamics leads to a natural generalization of Al.Zamolodchikov's Y-systems. We establish a Laurent phenomenon for such Y-systems, previously known in finite type only, and sharpen the periodicity result from [hep-th/0111053]. For cluster algebras of finite type, we identify a canonical "universal" choice of coefficients such that an arbitrary cluster algebra can be obtained from the universal one (of the same type) by an appropriate specialization of coefficients.

math.RA↗

Cluster algebras: Notes for the CDM-03 conference

This is an expanded version of the notes of our lectures given at the conference "Current Developments in Mathematics 2003" held at Harvard University on November 21--22, 2003. We present an overview of the main definitions, results and applications of the theory of cluster algebras.

math.RT↗

Cluster algebras III: Upper bounds and double Bruhat cells

We continue the study of cluster algebras initiated in math.RT/0104151 and math.RA/0208229. We develop a new approach based on the notion of an upper cluster algebra, defined as an intersection of certain Laurent polynomial rings. Strengthening the Laurent phenomenon from math.RT/0104151, we show that, under an assumption of "acyclicity", a cluster algebra coincides with its "upper" counterpart, and is finitely generated. In this case, we also describe its defining ideal, and construct a standard monomial basis. We prove that the coordinate ring of any double Bruhat cell in a semisimple complex Lie group is naturally isomorphic to the upper cluster algebra explicitly defined in terms of relevant combinatorial data.

math.RT↗

Eigenvalues, singular values, and Littlewood-Richardson coefficients

We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian (or real symmetric) matrix C=A+B in terms of the combined list of eigenvalues of A and B. The answers are given by Horn-type linear inequalities. The proofs depend on a new inequality among Littlewood-Richardson coefficients.

math.AG↗

Cluster algebras II: Finite type classification

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out to be identical to the Cartan-Killing classification of semisimple Lie algebras and finite root systems, which is intriguing since in most cases, the symmetry exhibited by the Cartan-Killing type of a cluster algebra is not at all apparent from its geometric origin. The combinatorial structure behind a cluster algebra of finite type is captured by its cluster complex. We identify this complex as the normal fan of a generalized associahedron introduced and studied in hep-th/0111053 and math.CO/0202004. Another essential combinatorial ingredient of our arguments is a new characterization of the Dynkin diagrams.

math.RA↗

Polytopal realizations of generalized associahedra

In hep-th/0111053, a complete simplicial fan was associated to an arbitrary finite root system. It was conjectured that this fan is the normal fan of a simple convex polytope (a generalized associahedron of the corresponding type). Here we prove this conjecture by explicitly exhibiting a family of such polytopal realizations.

math.CO↗

Y-systems and generalized associahedra

We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems can be viewed as families of rational functions defined by certain birational recurrences formulated in terms of the underlying root system. In the course of proving periodicity, we obtain explicit formulas for all these rational functions, which turn out to always be Laurent polynomials. In a closely related development, we introduce and study a family of simplicial complexes that can be associated to arbitrary root systems. In type A, our construction produces Stasheff's associahedron, whereas in type B, it gives the Bott-Taubes polytope, or cyclohedron. We enumerate the faces of these complexes, prove that their geometric realization is always a sphere, and describe them in concrete combinatorial terms for the classical types ABCD.

hep-th↗

The Laurent phenomenon

A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of applications. In particular, we settle in the affirmative a conjecture of D$.$Gale and R$.$Robinson on integrality of generalized Somos sequences, and prove the Laurent property for several multidimensional recurrences, confirming conjectures by J$.$Propp, N$.$Elkies, and M$.$Kleber.

math.CO↗

Cluster algebras I: Foundations

In an attempt to create an algebraic framework for dual canonical bases and total positivity in semisimple groups, we initiate the study of a new class of commutative algebras.

math.RT↗

Loop-erased walks and total positivity

We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights with nonnegative coefficients. A combinatorial explanation of this phenomenon involves loop-erased walks. Applications include total positivity of hitting matrices of Brownian motion in planar domains.

math.CO↗

Stratified spaces formed by totally positive varieties

By a theorem of A.Björner, for every interval $[u,v]$ in the Bruhat order of a Coxeter group $W$, there exists a stratified space whose strata are labeled by the elements of $[u,v]$, adjacency is described by the Bruhat order, and each closed stratum (resp., the boundary of each stratum) has the homology of a ball (resp., of a sphere). Answering a question posed by Björner, we suggest a natural geometric realization of these stratified spaces for a Weyl group $W$ of a semisimple Lie group $G$, and prove its validity in the case of the symmetric group. Our stratified spaces arise as links in the Bruhat decomposition of the totally nonnegative part of the unipotent radical of $G$.

math.CO↗