English
Related papers

Related papers: Highly neighborly centrally symmetric spheres

200 papers

Mixtures of hard hyperspheres in odd space dimensionalities are studied with an analytical approximation method. This technique is based on the so-called Rational Function Approximation and provides a procedure for evaluating equations of…

Soft Condensed Matter · Physics 2015-03-17 René D. Rohrmann , Andrés Santos

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…

Combinatorics · Mathematics 2026-02-25 Stefan Glock , Olaf Parczyk , Silas Rathke , Tibor Szabó

In 1992 Thomas Bier presented a strikingly simple method to produce a huge number of simplicial (n-2)-spheres on 2n vertices as deleted joins of a simplicial complex on n vertices with its combinatorial Alexander dual. Here we interpret his…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Andreas Paffenholz , Jonas Sjöstrand , Günter M. Ziegler

We prove a relatively simple combinatorial characterization of simplicial $d$-spheres on $d+4$ vertices. Our criteria are given in terms of the intersection patterns of a simplicial complex's family of minimal non-faces. Namely, let…

Combinatorics · Mathematics 2025-08-04 Shuai Huang , Jasper Miller , Daniel Rose-Levine , Steven Simon

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

Metric Geometry · Mathematics 2016-01-19 J. Jerónimo-Castro , E. Makai

The rich variety of densest columnar structures of identical hard spheres inside a cylinder can surprisingly be constructed from a simple and computationally fast sequential deposition of cylinder-touching spheres, if the cylinder-to-sphere…

Mathematical Physics · Physics 2015-05-30 Ho-Kei Chan

The uniqueness of the $L_p$-Minkowski problem has been a long standing problem in convex geometry. In the groundbreaking paper by Brendle-Choi-Daskalopoulos (Acta Math, {\bf219}, 2017), a full uniqueness result was shown for the subcritical…

Analysis of PDEs · Mathematics 2025-11-14 Shi-Zhong Du

In 1987, Kalai proved that stacked spheres of dimension $d\geq 3$ are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension $d=2$. In this article, we give…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

We prove that a simplicial 2-sphere satisfying a certain condition is the underlying simplicial complex of a 3-dimensional non-singular complete fan. In particular, this implies that any simplicial 2-sphere with $\leq 18$ vertices is the…

Combinatorics · Mathematics 2016-04-29 Yusuke Suyama

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and…

We introduce the $k$-stellated spheres and compare and contrast them with $k$-stacked spheres. It is shown that for $d \geq 2k$, any $k$-stellated sphere of dimension $d$ bounds a unique and canonically defined $k$-stacked ball. In…

Geometric Topology · Mathematics 2012-01-31 Bhaskar Bagchi , Basudeb Datta

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

We show that if an open set in $\mathbb{R}^d$ can be fibered by unit $n$-spheres, then $d \geq 2n+1$, and if $d = 2n+1$, then the spheres must be pairwise linked, and $n \in \left\{ 0, 1, 3, 7 \right\}$. For these values of $n$, we…

Geometric Topology · Mathematics 2024-05-22 Daniel Asimov , Florian Frick , Michael Harrison , Wesley Pegden

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

Number Theory · Mathematics 2019-08-27 William Banks , Paul Pollack , Carl Pomerance

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…

Metric Geometry · Mathematics 2018-07-05 J. Jerónimo-Castro , E. Makai,

In this work we present a new family of properly embedded free boundary minimal hypersurfaces of revolution with circular boundaries in the horizon of the $n$-dimensional Schwarzschild space, $n\geq3$. In particular, we answer a question…

Differential Geometry · Mathematics 2022-10-17 Ezequiel Barbosa , David Moya

For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…

Combinatorics · Mathematics 2023-05-30 Alex Cohen , Cosmin Pohoata , Dmitrii Zakharov

We improve the estimates for the Ekeland--Hofer--Zehnder capacity of convex bodies by Gluskin and Ostrover. In the course of our argument we show that a closed characteristic of minimal action on the boundary of a centrally symmetric convex…

Metric Geometry · Mathematics 2018-01-03 Arseniy Akopyan , Roman Karasev

In this paper our main result states that there exist exactly three combinatorially distinct centrally-symmetric 12-vertex-triangulations of the product of two 2-spheres with a cyclic symmetry. We also compute the automorphism groups of the…

Combinatorics · Mathematics 2007-05-23 G. Lassmann , E. Sparla

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Combinatorics · Mathematics 2010-10-12 George B. Purdy , Justin W. Smith
‹ Prev 1 4 5 6 7 8 10 Next ›