English
Related papers

Related papers: Simplicial complexes with many facets are vertex d…

200 papers

Motivated by potential applications in network theory, engineering and computer science, we study $r$-ample simplicial complexes. These complexes can be viewed as finite approximations to the Rado complex which has a remarkable property of…

Algebraic Topology · Mathematics 2023-09-14 Chaim Even-Zohar , Michael Farber , Lewis Mead

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Rings and Algebras · Mathematics 2021-10-08 Hua-Lin Huang , Huajun Lu , Yu Ye , Chi Zhang

We prove that for every $d\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for…

Combinatorics · Mathematics 2018-01-26 Xavier Goaoc , Pavel Paták , Zuzana Patáková , Martin Tancer , Uli Wagner

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Graphics · Computer Science 2019-04-03 Franco Morando

Let $M$ be a model set meeting two simple conditions: (1) the internal space $H$ is a product of $R^n$ and a finite group, and (2) the window $W$ is a finite union of disjoint polyhedra. Then any point pattern with finite local complexity…

Dynamical Systems · Mathematics 2018-07-10 Johannes Kellendonk , Lorenzo Sadun

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

In this paper, we study face vectors of simplicial posets that are the face posets of cell decompositions of topological manifolds without boundary. We characterize all possible face vectors of simplicial posets whose geometric realizations…

Combinatorics · Mathematics 2010-10-05 Satoshi Murai

We call the $\delta$-vector of an integral convex polytope of dimension $d$ flat if the $\delta$-vector is of the form $(1,0,\ldots,0,a,\ldots,a,0,\ldots,0)$, where $a \geq 1$. In this paper, we give the complete characterization of…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

Combinatorics · Mathematics 2019-01-23 Aleksandr Maksimenko

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

Combinatorics · Mathematics 2025-07-02 Denys Bulavka , 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

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed…

Differential Geometry · Mathematics 2007-05-23 Robert Connelly , Jean-Marc Schlenker

In this paper, we show that Oda's question holds for $n$-dimensional simplicial reflexive polytope $P$ and lattice polytope $Q$ containing the origin, when the vertex of $Q$ is either a vertex of $P$ or the origin, provided that $P$ has no…

Combinatorics · Mathematics 2025-11-07 Binnan Tu

For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of…

Algebraic Topology · Mathematics 2019-11-15 Andrew Newman

A subset of Euclidean space will be said to be $n$-smooth if it has an $n$-dimensional tangent plane at each of its points. Let ${\frak d}_n$ denote the least number $n$-smooth sets into which $n+1$-dimensional Euclidean space can be…

Logic · Mathematics 2016-09-06 Juris Steprāns

We introduce a new family of pure simplicial complexes, called the $r$-co-connected complex of $G$ with respect to $A$, $\Sigma_r(A,G)$, where $r\geq 1$ is a natural number, $G$ is a simple graph, and $A$ is a subset of vertices.…

Combinatorics · Mathematics 2026-02-04 Priyavrat Deshpande , Amit Roy , Rutuja Sawant

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…

Combinatorics · Mathematics 2021-02-25 Jared Culbertson , Anton Dochtermann , Dan P. Guralnik , Peter F. Stiller

For a subvariety of a smooth projective variety, consider the family of smooth hypersurfaces of sufficiently large degree containing it, and take the quotient of the middle cohomology of the hypersurfaces by the cohomology of the ambient…

Algebraic Geometry · Mathematics 2007-05-23 Ania Otwinowska , Morihiko Saito

Let $G$ be a finite abelian group of order $n$ and let $\Delta_{n-1}$ denote the $(n-1)$-simplex on the vertex set $G$. The sum complex $X_{A,k}$ associated to a subset $A \subset G$ and $k < n$, is the $k$-dimensional simplicial complex…

Combinatorics · Mathematics 2018-01-22 Orr Beit-Aharon , Roy Meshulam

We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any alpha*k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound…

Computational Geometry · Computer Science 2020-07-21 G. Aloupis , J. Cardinal , S. Collette , S. Langerman , D. Orden , P. Ramos
‹ Prev 1 8 9 10 Next ›