相关论文: Explicit enumeration of triangulations with multip…

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…

In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

We study Tate motives with integral coefficients through the lens of tensor triangular geometry. For some base fields, including the field of algebraic numbers and the algebraic closure of a finite field, we arrive at a complete description…

We prove Poincare's Conjecture that every simply connected, closed three-manifold is topologically equivalent to the three-sphere. The proof is founded on the algebraic formulation discovered by J. Stallings.

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…

Let G be a graph in a 3-manifold M. We compress the pair (M,G) along admissible 2-spheres as long as possible. What we get is a root of (M,G). Our main result is that for any pair (M,G) the root exists and is unique. As a corollary we get…

Let $\Phi$ be an irreducible crystallographic root system and $\mathcal P$ its root polytope, i.e., its convex hull. We provide a uniform construction, for all root types, of a triangulation of the facets of $\mathcal P$. We also prove…

We show that the manifold $X=S^2\times S^3$ has infinitely many structures of a fiber bundle over the base $B=S^2.$ In fact for every lens space $L(p,1)$ there is a fibration $L(p,1)\to X\to B.$

We prove that if G is a triangulation of the torus and \chi(G) \neq 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.

We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…

In this work, we present a boundary and hole detection approach that traverses all the boundaries of an edge-manifold triangular mesh, irrespectively of the presence of singular vertices, and subsequently determines and labels all holes of…

We present examples in three symmetry classes of topological insulators in one or two dimensions where the proof of the bulk-edge correspondence is particularly simple. This serves to illustrate the mechanism behind the bulk-edge principle…

In this paper we prove that any triangulation of a 2-dimensional sphere with a strict 4-coloring on its vertices can seen as the boundary of a triangulation of a 3-dimensional disk with the same vertices and preserving the 4-coloring.

By computing all cyclotomic points on some algebraic varieties, we get an independent and efficient way to find all rational $a^3b$-monotiles for the sphere, thereby completing the classification of edge-to-edge monohedral quadrilateral…

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…

A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S^i\times\S^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the…