English
Related papers

Related papers: Face numbers of uniform triangulations of simplici…

200 papers

The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…

Combinatorics · Mathematics 2021-09-07 Christos A. Athanasiadis , Jan-Marten Brunink , Martina Juhnke-Kubitzke

Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of…

Combinatorics · Mathematics 2015-05-26 Steven Klee , Isabella Novik

Face numbers of triangulations of simplicial complexes were studied by Stanley by use of his concept of a local $h$-vector. It is shown that a parallel theory exists for cubical subdivisions of cubical complexes, in which the role of the…

Combinatorics · Mathematics 2011-02-01 Christos A. Athanasiadis

Given an infinite field $\mathbb{k}$ and a simplicial complex $\Delta$, a common theme in studying the $f$- and $h$-vectors of $\Delta$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[\Delta]$…

Combinatorics · Mathematics 2019-07-31 Connor Sawaske

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

Combinatorics · Mathematics 2017-03-06 Karim A. Adiprasito , Anders Björner , Afshin Goodarzi

A relative simplicial complex is a collection of sets of the form $\Delta \setminus \Gamma$, where $\Gamma \subset \Delta$ are simplicial complexes. Relative complexes played key roles in recent advances in algebraic, geometric, and…

Combinatorics · Mathematics 2019-08-01 Giulia Codenotti , Lukas Katthän , Raman Sanyal

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

Combinatorics · Mathematics 2013-08-07 David Cook

The local $h$-polynomial was introduced by Stanley as a fundamental enumerative invariant of a triangulation $\Delta$ of a simplex. This polynomial is known to have nonnegative and symmetric coefficients and is conjectured to be…

Combinatorics · Mathematics 2025-07-01 Christos A. Athanasiadis

A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…

Combinatorics · Mathematics 2007-05-23 Roland Bacher , Alina Vdovina

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

Combinatorics · Mathematics 2017-02-20 Michael von Thaden , Winfried Bruns

We investigate the face numbers of simplicial complexes with Buchsbaum vertex links, especially pseudomanifolds with isolated singularities. This includes deriving Dehn-Sommerville relations for pseudomanifolds with isolated singularities…

Combinatorics · Mathematics 2015-03-17 Isabella Novik , Ed Swartz

Brenti and Welker have shown that for any simplicial complex X, the face vectors of successive barycentric subdivisions of X have roots which converge to fixed values depending only on the dimension of X. We improve and generalize this…

Combinatorics · Mathematics 2011-10-13 Emanuele Delucchi , Aaron Pixton , Lucas Sabalka

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

Combinatorics · Mathematics 2024-12-06 Anton Dochtermann , Ritika Nair , Jay Schweig , Adam Van Tuyl , Russ Woodroofe

For a simplicial complex or more generally Boolean cell complex $\Delta$ we study the behavior of the $f$- and $h$-vector under barycentric subdivision. We show that if $\Delta$ has a non-negative $h$-vector then the $h$-polynomial of its…

Combinatorics · Mathematics 2007-05-23 Francesco Brenti , Volkmar Welker

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

Let $\Delta$ be a $(d-1)$-dimensional simplicial complex and $h^ \Delta = (h_0^ \Delta ,\ldots, h_d^ \Delta)$ its $h$-vector. For a face uniform subdivision operation ${\mathcal F}$ we write $\Delta_{\mathcal F}$ for the subdivided complex…

Combinatorics · Mathematics 2024-11-05 Lili Mu , Volkmar Welker

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

Combinatorics · Mathematics 2017-11-06 Basudeb Datta , Subhojoy Gupta

In this paper we discuss face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of triangulations of simply connected $4$-manifolds: We observe that, for a triangulation $\mathcal{T}$…

Geometric Topology · Mathematics 2024-01-23 Jonathan Spreer , Lucy Tobin

We study the exponential Hilbert series (both coarsely- and finely-graded) of the Stanley-Reisner ring of an abstract simplicial complex, $\Delta$, and we introduce the $e$-vector of $\Delta$, which relates to the coefficients of the…

Combinatorics · Mathematics 2024-08-16 Wayne A. Johnson , Wiktor J. Mogilski

In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…

Combinatorics · Mathematics 2021-02-10 Michael von Thaden
‹ Prev 1 2 3 10 Next ›