English
Related papers

Related papers: Small examples of non-constructible simplicial bal…

200 papers

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

Let $M$ be an $n$-vertex combinatorial triangulation of a $\ZZ_2$-homology $d$-sphere. In this paper we prove that if $n \leq d + 8$ then $M$ must be a combinatorial sphere. Further, if $n = d + 9$ and $M$ is not a combinatorial sphere then…

Geometric Topology · Mathematics 2012-05-29 Bhaskar Bagchi , Basudeb Datta

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…

Combinatorics · Mathematics 2011-02-03 Steven Klee , Isabella Novik

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

Combinatorics · Mathematics 2023-12-25 Oliver Knill

We study the 10 noncommutative spheres obtained by liberating, twisting, and liberating+twisting the real and complex spheres $S^{N-1}_\mathbb R,S^{N-1}_\mathbb C$. At the axiomatic level, we show that, under very strong axioms, these 10…

Operator Algebras · Mathematics 2015-12-09 Teodor Banica

For any $n\geq 6$ we construct almost strongly minimal geometries of type $\bullet \overset{n}{-} \bullet \overset{n}{-}\bullet$ which are $2$-ample but not $3$-ample.

Logic · Mathematics 2017-10-05 Katrin Tent , Isabel Müller

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

Combinatorics · Mathematics 2025-12-02 Jon V. Kogan

We construct spherical harmonics for fuzzy spheres of even and odd dimensions, generalizing the correspondence between finite matrix algebras and fuzzy two-spheres. The finite matrix algebras associated with the various fuzzy spheres have a…

High Energy Physics - Theory · Physics 2014-11-18 Sanjaye Ramgoolam

We investigate the decomposition problem of balls into finitely many congruent pieces in dimension $d=2k$. In addition, we prove that the $d$ dimensional unit ball $B_d$ can be divided into finitely many congruent pieces if $d=4$ or $d\ge…

Metric Geometry · Mathematics 2016-01-27 Gergely Kiss , Gábor Somlai

We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.

Combinatorics · Mathematics 2007-06-13 David Eppstein

A discrete (finite-difference) analogue of differential forms is considered, defined on simplicial complexes, including triangulations of continuous manifolds. Various operations are explicitly defined on these forms, including exterior…

Geometric Topology · Mathematics 2009-11-13 V. Dolotin , A. Morozov , Sh. Shakirov

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this…

Geometric Topology · Mathematics 2007-10-02 Bhaskar Bagchi , Basudeb Datta

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

Computational Geometry · Computer Science 2011-06-14 Menelaos I. Karavelas , Eleni Tzanaki

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…

Combinatorics · Mathematics 2024-03-26 Yuhi Kamio

Branched covers are applied frequently in topology - most prominently in the construction of closed oriented PL d-manifolds. In particular, strong bounds for the number of sheets and the topology of the branching set are known for dimension…

Combinatorics · Mathematics 2008-01-23 Nikolaus Witte

We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…

Combinatorics · Mathematics 2026-01-14 Andrew Newman , Marta Pavelka

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

A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…

Combinatorics · Mathematics 2023-05-16 Minho Cho , Jinha Kim

In 1987 Brehm and K\"uhnel showed that any combinatorial $d$-manifold with less than $3d/2+3$ vertices is PL homeomorphic to the sphere and any combinatorial $d$-manifold with exactly $3d/2+3$ vertices is PL homeomorphic to either the…

Combinatorics · Mathematics 2024-11-20 Alexander A. Gaifullin

Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…

Combinatorics · Mathematics 2024-04-25 Bela Bajnok