Related papers: Combinatorial Stokes formulas via minimal resoluti…
In this book we prove unified classification results for equivariant principal bundles when the topological structure group is truncated. The conceptually transparent proof invokes a smooth Oka principle, which becomes available after…
The Lovasz Local Lemma [EL75] is a powerful tool to prove the existence of combinatorial objects meeting a prescribed collection of criteria. The technique can directly be applied to the satisfiability problem, yielding that a k-CNF formula…
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…
The purpose of this article is to study the relation between combinatorial equivalence and topological conjugacy, specifically how a certain type of combinatorial equivalence implies topological conjugacy. We introduce the concept of…
We study several duality isomorphisms between equivariant bivariant K-theory groups, generalising Kasparov's first and second Poincare duality isomorphisms. We use the first duality to define an equivariant generalisation of Lefschetz…
A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…
Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…
A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…
In this paper we study the Buchstaber invariant of simplicial complexes, which comes from toric topology. With each simplicial complex $K$ on $m$ vertices we can associate a moment-angle complex $\mathcal Z_K$ with a canonical action of the…
The disjoint paths problem is a fundamental problem in algorithmic graph theory and combinatorial optimization. For a given graph $G$ and a set of $k$ pairs of terminals in $G$, it asks for the existence of $k$ vertex-disjoint paths…
We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…
We compute the equivariant K-theoretic Donaldson--Thomas invariants of $[\mathbb{C}^2/\mu_r]\times \mathbb{C}$ using factorization and rigidity techniques. For this, we develop a generalization of Okounkov's factorization technique that…
In 1940s Steenrod asked if every homology class $z\in H_n(X,\mathbb{Z})$ of every topological space $X$ can be realised by an image of the fundamental class of an oriented closed smooth manifold. Thom found a non-realisable 7-dimensional…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…
A duality is discussed for Lie group bundles vs. certain tensor categories with non-simple identity, in the setting of Nistor-Troitsky gauge-equivariant K-theory. As an application, we study C*-algebra bundles with fibre a fixed-point…