English
Related papers

Related papers: Face Numbers of Shellable CW Balls and Spheres

200 papers

The fatness of a 4-polytope or 3-sphere is defined as $(f_1+f_2-20)/(f_0+f_3-10)$. We construct arbitrarily fat, strongly regular CW 3-spheres that are both shellable and dual shellable. These spheres have $f$-vectors…

Combinatorics · Mathematics 2025-09-26 Joshua Hinman

We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…

Computational Geometry · Computer Science 2012-11-27 Menelaos I. Karavelas , Christos Konaxis , Eleni Tzanaki

The paper is a generalization of a result of I. Dolgachev, M. Mendes Lopes, and R. Pardini. We prove that a smooth projective complex surface $X$, not necessarily minimal, contains $h^{1,1}(X)-1$ disjoint $(-2)$-curves if and only if $X$ is…

Algebraic Geometry · Mathematics 2009-12-29 JongHae Keum

We prove that if a complete connected $n$-dimensional Riemannian manifold $M$ has radial sectional curvature at a base point $p\in M$ bounded from below by the radial curvature function of a two-sphere of revolution $\widetilde M$ belonging…

Differential Geometry · Mathematics 2016-07-19 Nathaphon Boonnam

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

Metric Geometry · Mathematics 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…

Probability · Mathematics 2016-08-30 Gilles Bonnet , Pierre Calka , Matthias Reitzner

We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…

Number Theory · Mathematics 2007-07-16 J. C. Lagarias , N. J. A. Sloane

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

We show that $m$ points and $n$ two-dimensional algebraic surfaces in $\mathbb{R}^4$ can have at most $O(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n)$ incidences, provided that the algebraic surfaces behave like pseudoflats with $k$ degrees…

Combinatorics · Mathematics 2018-07-18 Joshua Zahl

We consider a family $\mathscr{F}$ of meromorphic functions defined in a domain $D$, a holomorphic function $\psi$ and a homogeneous differential polynomial $ P[f] $ of degree $d$ with weight $w$. In this paper, we prove the normality of…

Complex Variables · Mathematics 2026-03-13 Kuntal Mandal , Bipul Pal

Kalai proved that the simplicial polytopes with g_2=0 are the stacked polytopes. We characterize the g_2=1 case. Specifically, we prove that every simplicial d-polytope (d>=4) which is prime and with g_2=1 is combinatorially equivalent…

Combinatorics · Mathematics 2009-12-10 Eran Nevo , Eyal Novinsky

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

For fixed weights w_1,...,w_n, and for d>0, we let B denote a collection of d*n balls, with d balls of weight w_i for each i=1,...,n. We consider the problem of assigning the balls to n bins with capacities C_1,...,C_n, in such a way that…

Combinatorics · Mathematics 2019-09-06 Claudiu Raicu

Ballico proved that a smooth projective variety $X$ of degree $d$ over a finite field of $q$ elements admits a smooth hyperplane section if $q\geq d(d-1)^{\dim X}$. In this paper, we refine this criterion for higher codimensional linear…

Algebraic Geometry · Mathematics 2024-02-28 Shamil Asgarli , Lian Duan , Kuan-Wen Lai

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

Combinatorics · Mathematics 2022-08-16 Yulin Chang , Huifen Ge , Jie Han , Guanghui Wang

This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…

Analysis of PDEs · Mathematics 2022-06-10 Yannick Privat , Rémi Robin , Mario Sigalotti

This article proves hypersurfaces of degree d in projective n-space are "rationally simply-connected" if $d^2 \leq n$. In a forthcoming paper, de Jong and I prove a slightly weaker result when $d^2 \leq n+1$.

Algebraic Geometry · Mathematics 2007-05-23 Jason Michael Starr

We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…

Combinatorics · Mathematics 2022-09-07 Giulia Codenotti , Francisco Santos , Matthias Schymura

We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and…

Discrete Mathematics · Computer Science 2015-06-23 Oliver Knill