Recognizing Graph Theoretic Properties with Polynomial Ideals

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Groebner bases, toric algebra, convex programming, and real algebraic geometry.Comment: 20 pages, 3 figure

Geometry of tropical moduli spaces and linkage of graphs

We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage theorem to prove that various moduli spaces of tropical curves are connected through codimension one.Comment: Final version incorporating the referees correction

Coadjoint orbits of symplectic diffeomorphisms of surfaces and ideal hydrodynamics

We give a classification of generic coadjoint orbits for the groups of symplectomorphisms and Hamiltonian diffeomorphisms of a closed symplectic surface. We also classify simple Morse functions on symplectic surfaces with respect to actions of those groups. This gives an answer to V.Arnold's problem on describing all invariants of generic isovorticed fields for the 2D ideal fluids. For this we introduce a notion of anti-derivatives on a measured Reeb graph and describe their properties.Comment: 38 pages, 11 figures; to appear in Annales de l'Institut Fourie