English
Related papers

Related papers: Lower Bound Theorems and a Generalized Lower Bound…

200 papers

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

Combinatorics · Mathematics 2011-04-05 Steven Klee

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

Combinatorics · Mathematics 2025-12-09 Guillermo Pineda-Villavicencio , Jie Wang

In this paper, we study Lefschetz properties of Artinian reductions of Stanley-Reisner rings of balanced simplicial $3$-polytopes. A $(d-1)$-dimensional simplicial complex is said to be balanced if its graph is $d$-colorable. If a…

Combinatorics · Mathematics 2016-06-08 David Cook , Martina Juhnke-Kubitzke , Satoshi Murai , Eran Nevo

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful…

Combinatorics · Mathematics 2012-10-30 Antoine Deza , Tamon Stephen , Feng Xie

An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph $G$ whose edges are colored using two colors and a positive integer $k$, the objective in the Edge Balanced Connected Subgraph…

Data Structures and Algorithms · Computer Science 2024-04-03 P. S. Ardra , R. Krithika , Saket Saurabh , Roohani Sharma

We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…

Combinatorics · Mathematics 2025-05-21 Joshua Hinman

In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…

Combinatorics · Mathematics 2024-11-12 Krystal Guo , Ross J. Kang , Gabriëlle Zwaneveld

We prove that many normal subgroups of the extended mapping class group of a surface with punctures are geometric, that is, that their automorphism groups and abstract commensurator groups are isomorphic to the extended mapping class group.…

Geometric Topology · Mathematics 2018-10-02 Alan McLeay

We investigate an extended version of the stable Andrews-Curtis transformations, referred to as EAC transformations, and compare it with a notion of equivalence in a family of $3$-manifolds with boundary, called the {\emph{simple balanced…

Geometric Topology · Mathematics 2021-10-25 Neda Bagherifard

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

Combinatorics · Mathematics 2022-07-26 Guillermo Pineda-Villavicencio , David Yost

The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…

Combinatorics · Mathematics 2013-03-19 Antoine Deza , Frédéric Meunier , Pauline Sarrabezolles

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…

Combinatorics · Mathematics 2017-11-16 Martina Juhnke-Kubitzke , Lorenzo Venturello

The doubling conjecture predicts that a manifold admits positive scalar curvature with mean convex boundary if and only if its double admits positive scalar curvature. We show that it holds true for manifolds where the inclusion of the…

Differential Geometry · Mathematics 2026-04-15 Georg Frenck

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…

Group Theory · Mathematics 2007-05-23 Alexei D. Myasnikov , Alexei G. Myasnikov , Vladimir Shpilrain

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

Combinatorics · Mathematics 2025-12-10 Guillermo Pineda-Villavicencio , Aholiab Tritama , Jie Wang , David Yost

A common generalization of two theorems on the face numbers of Cohen-Macaulay (CM, for short) simplicial complexes is established: the first is the theorem of Stanley (necessity) and Bjorner-Frankl-Stanley (sufficiency) that characterizes…

Combinatorics · Mathematics 2009-09-08 Jonathan Browder , Isabella Novik

We define combinatorial analogues of stable and unstable minimal surfaces in the setting of weighted pseudomanifolds. We prove that, under mild conditions, such combinatorial minimal surfaces always exist. We use a technique, adapted from…

Geometric Topology · Mathematics 2019-09-18 Weiyan Huang , Daniel Medici , Nick Murphy , Haoyu Song , Scott A. Taylor , Muyuan Zhang

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly $(d+1)$-colored) triangulation of a combinatorial $d$-manifold into another balanced triangulation. These moves form a natural analog of bistellar…

Combinatorics · Mathematics 2017-08-31 Ivan Izmestiev , Steven Klee , Isabella Novik