English
Related papers

Related papers: Face vectors of subdivided simplicial complexes

200 papers

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Combinatorics · Mathematics 2013-02-19 Michał Lasoń

In this work, we construct a new data type for hadronic jets in which the traditional point-cloud representation is transformed into a simplicial complex consisting of vertices, or 0-simplexes. An angular resolution scale, $r$, is then…

High Energy Physics - Phenomenology · Physics 2023-12-12 Tejes Gaertner , Jared Reiten

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

Combinatorics · Mathematics 2020-08-25 Alan Lew

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Combinatorics · Mathematics 2021-03-08 Christos A. Athanasiadis , Eleni Tzanaki

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

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Combinatorics · Mathematics 2007-05-23 Anders Björner

The main object of this work is the top-dimensional Laplacian operator of a simplicial complex $K$. We study its spectral limiting behavior under a given non-trivial subdivision procedure $\text{div}$. It will be shown that in case…

Combinatorics · Mathematics 2023-01-02 Julian Märte

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no…

Combinatorics · Mathematics 2025-11-04 Soohyun Park

Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vectors of multiplicial polytopes depend only on their face…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer

Inspired by recent results of Ein, Lazarsfeld, Erman and Zhou on the non-vanishing of Betti numbers of high Veronese subrings, we describe the behaviour of the Betti numbers of Stanley-Reisner rings associated with iterated barycentric or…

Commutative Algebra · Mathematics 2014-12-10 Aldo Conca , Martina Juhnke-Kubitzke , Volkmar Welker

In this paper, we answer two questions on local $h$-vectors, which were asked by Athanasiadis. First, we characterize all possible local $h$-vectors of quasi-geometric subdivisions of a simplex. Second, we prove that the local…

Combinatorics · Mathematics 2017-04-27 Martina Juhnke-Kubitzke , Satoshi Murai , Richard Sieg

The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Victor Reiner , Lauren Williams

Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…

Combinatorics · Mathematics 2017-03-17 Amir Abu-Fraiha , Roy Meshulam

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

Combinatorics · Mathematics 2009-06-04 Michael Goff

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Aaron M. Bruening , Joshua Stewart

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

Combinatorics · Mathematics 2021-09-20 Eran Nevo

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive…

Combinatorics · Mathematics 2016-10-12 Karim A. Adiprasito , Bruno Benedetti , Frank H. Lutz

We study face numbers of simplicial complexes that triangulate manifolds (or even normal pseudomanifolds) with boundary. Specifically, we establish a sharp lower bound on the number of interior edges of a simplicial normal pseudomanifold…

Combinatorics · Mathematics 2016-04-18 Satoshi Murai , Isabella Novik

We find some general lower bounds of the sum of certain families of multigraded Betti numbers of any simplicial complex with a vertex coloring.

Algebraic Topology · Mathematics 2019-02-04 Li Yu