To any Hamiltonian action of a reductive algebraic group $G$ on a smooth irreducible symplectic variety $X$ we associate certain combinatorial invariants: Cartan space, Weyl group, weight and root lattices. For cotangent bundles our invariants essentially coincide with those arising in the theory of equivarant embeddings. Using our approach we establish some properties of the latter invariants.
We study the algebraic rank of a divisor on a graph, an invariant defined using divisors on algebraic curves dual to the graph. We prove it satisfies the Riemann-Roch formula, a specialization property, and the Clifford inequality. We prove that it is at most equal to the (usual) combinatorial rank, and that equality holds in many cases, though not in general.
We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and Hrushovski in the case of algebraically closed fields. The classification of projective planes in algebraic combinatorial geometries in arbitrary fields of characteristic zero will also be given.
The interplay between algebro-geometric and combinatorial Brill-Noether theory is studied. The Brill-Noether variety of a graph shown to be non-empty if the Brill-Noether number is non-negative, as a consequence of the analogous fact for smooth projective curves. Similarly, the existence of a graph for which the Brill-Noether variety is empty implies the emptiness of the corresponding Brill-Noether variety for a general curve. The main tool is a refinement of Baker's Specialization Lemma.
We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be viewed as a version of the Viro gluing theorem, relating topology of algebraic hypersurfaces to the combinatorics of subdivisions of convex lattice polytopes. If a subdivision is convex, then according to the Viro theorem a combinatorial hypersurface is isotopic to an algebraic one. We study combinatorial hypersurfaces resulting from non-convex subdivisions of c…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry is often concerned with the problem of bounding the behaviour of arbitrary finite collections of geometric objects such as points, lines, or circles with respect to geometric operations such as incidence or distance. Given the presence of arbitrary finite sets in these problems, the methods used to attack these problems have primarily been combinatorial in na…
Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We introduce combinatorial resultants, a new operation on graphs that captures properties of the Sylvester resultant of two polynomials in the algebraic rigidity matroid. We show that every rigidity circuit has a construction tree from $K_4$ graphs based on this operation. Our algorithm performs an algebraic elimination guided by the construction tree, and uses cla…
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with combinatorial, algebraic, and topological flavor.
We study a generalization of the isomonodromic deformation to the case of connections with irregular singularities. We call this generalization Isostokes Deformation. A new deformation parameter arises: one can deform the formal normal forms of connections at irregular points. We study this part of the deformation, giving an algebraic description. Then we show how to use loop groups and hypercohomology to write explicit hamiltonians. We work on an arbitrary complete algebraic curve, the structure group is an arbitrary semisimiple group.
We study the structure of combinatorial Burnside groups, which receive equivariant birational invariants of actions of finite groups on algebraic varieties.
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants defined on graphs can be introduced to algebraic varieties in a natural manner. By the functor, we will define the combinatorial norm of a morphism of schemes. Then we will obtain some properties of morphisms of norm not great than one. The topics discussed here can be applied to study the discrete Morse theory on arithmetic schemes and Kontsevich's theory of grap…
Following the work of Gangl, Goncharov and Levin in [GGL], we will give a combinatorial framework for motivic study of iterated integrals on the affine line. We will show that under a certain genericity condition these combinatorial objects yield to elements in the motivic Hopf algebra constructed in Bloch-Kriz [BK]. It will be shown that the Hodge realization of these elements coincides with the Hodge structure induced from the fundamental torsor of path of punctured affine line.
A subgroup H of an algebraic group G is said to be strongly solvable if H is contained in a Borel subgroup of G. This paper is devoted to establishing relationships between the following three combinatorial classifications of strongly solvable spherical subgroups in reductive complex algebraic groups: Luna's general classification of arbitrary spherical subgroups restricted to the strongly solvable case, Luna's 1993 classification of strongly solvable wonderful subgroups, and the author's 2011 classification of strongly solvable spherical subgroups. We give a detailed presentation of all the t…
The classic Cayley identity states that \det(\partial) (\det X)^s = s(s+1)...(s+n-1) (\det X)^{s-1} where X=(x_{ij}) is an n-by-n matrix of indeterminates and \partial=(\partial/\partial x_{ij}) is the corresponding matrix of partial derivatives. In this paper we present straightforward combinatorial proofs of a variety of Cayley-type identities, both old and new. The most powerful of these proofs employ Grassmann algebra (= exterior algebra) and Grassmann-Berezin integration. Among the new identities proven here are a pair of "diagonal-parametrized" Cayley identities, a pair of "Laplacian-par…
This is the first of two papers devoted to showing how the rich algebraic formalism of Eliashberg-Givental-Hofer's symplectic field theory (SFT) can be used to define higher algebraic structures on the symplectic cohomology of open symplectic manifolds. Using the SFT of Hamiltonian mapping tori we show how to define a homotopy extension of the well-known Lie bracket on symplectic cohomology. Apart from discussing applications to the existence of closed Reeb orbits, we outline how the $L_{\infty}$-structure is conjecturally related via mirror symmetry to the extended deformation theory of compl…
In this paper we provide a characterization of smooth algebraic varieties endowed with a faithful algebraic torus action in terms of a combinatorial description given by Altmann and Hausen. Our main result is that such a variety X is smooth if and only if it is locally isomorphic in the étale topology to the affine space endowed with a linear torus action. Furthermore, this is the case if and only if the combinatorial data describing X is locally isomorphic in the étale topology to the combinatorial data describing affine space endowed with a linear torus action. Finally, we provide an effecti…
Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects computationally accessible. Tropical polynomials play a fundamental role in this, especially for the case of algebraic geometry. On the other hand, many algebraic questions behind tropical polynomials remain open. In this paper we address four basic questions on tropical polynomials closely related to their computational properties: 1. Given a polynomial wit…
We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We then give a combinatorial classification of reductive monoids by means of the theory of spherical varieties.
Motivated by Gauss's first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing matching arises from some harmonic curve, and deduce from this that every basketball arises from some …