Related papers: Combinatorial decomposition theorem for Hitchin sy…
In this article there are two main results. The first result gives a formula, in terms of a log resolution, for the graded pieces of the Hodge filtration on the cohomology of a unitary local system of rank one on the complement of an…
A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
Let S be a closed orientable surface of genus at least two, and let C be an arbitrary (complex) projective structure on S. We show that there is a decomposition of S into pairs of pants and cylinders such that the restriction of C to each…
The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…
This paper further develops the combinatorial approach to quantization of the Hamiltonian Chern Simons theory advertised in \cite{AGS}. Using the theory of quantum Wilson lines, we show how the Verlinde algebra appears within the context of…
In \cite{kim11} we have generalized a tangency condition in the Treibich-Verdier theory \cite{trei89,tv90,trei97} about elliptic solitons to a Hitchin system. As an application of this generalization, we will define, so-called, Hitchin…
In this article we introduce the notion of a balloon animal map between broken toric varieties and construct several long exact sequences in cohomology related to them. We give a new proof of the deletion-contraction relation on hypertoric…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…
For a compact Lie group $G$ we consider a lattice gauge model given by the $G$-Hamiltonian system which consists of the cotangent bundle of a power of $G$ with its canonical symplectic structure and standard moment map. We explicitly…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
By analogy with work of Hitchin on integrable systems, we construct natural relaxations of several kinds of moduli spaces of difference equations, with special attention to a particular class of difference equations on an elliptic curve…
This paper concentrates on optical Hamiltonian systems of $T*\T^n$, i.e. those for which $\Hpp$ is a positive definite matrix, and their relationship with symplectic twist maps. We present theorems of decomposition by symplectic twist maps…
We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…
Nonholonomic mechanical systems have been attracting more interest in recent years because of their rich geometric properties and their applications in Engineering. In all generality, we discuss the reduction of a Hamilton-Jacobi theory for…
In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We define and study the properties of observables associated to any link in $\Sigma\times {\bf R}$ (where $\Sigma$ is a compact surface) using the combinatorial quantization of hamiltonian Chern-Simons theory. These observables are traces…
In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…