English
Related papers

Related papers: A Lower Bound Theorem for strongly regular CW sphe…

200 papers

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…

Representation Theory · Mathematics 2015-04-13 Zhuo Li , You'an Cao , Zhenheng Li

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most…

Combinatorics · Mathematics 2021-01-29 Anurag Bishnoi , Simona Boyadzhiyska , Shagnik Das , Tamás Mészáros

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

General Relativity and Quantum Cosmology · Physics 2018-02-15 Edward Anderson

Here we prove that the Hilbert-Kunz mulitiplicity of a quadric hypersurface of dimension $d$ and odd characteristic $p\geq 2d-4$ is bounded below by $1+m_d$, where $m_d$ is the $d^{th}$ coefficient in the expansion of…

Algebraic Geometry · Mathematics 2021-01-12 Vijaylaxmi Trivedi

The joint spectral radius of a finite set of real $d \times d$ matrices is defined to be the maximum possible exponential rate of growth of long products of matrices drawn from that set. A set of matrices is said to have the…

Optimization and Control · Mathematics 2012-01-31 Kevin G. Hare , Ian D. Morris , Nikita Sidorov , Jacques Theys

An ordinary hypersphere of a set of points in real $d$-space, where no $d+1$ points lie on a $(d-2)$-sphere or a $(d-2)$-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly $d+1$ points of the set.…

Combinatorics · Mathematics 2021-02-11 Aaron Lin , Konrad Swanepoel

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

Combinatorics · Mathematics 2022-10-17 Amanda Burcroff

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most…

Combinatorics · Mathematics 2013-10-29 Edward D. Kim , Francisco Santos

The possible spectra of one-particle reduced density matrices that are compatible with a pure multipartite quantum system of finite dimension form a convex polytope. We introduce a new construction of inner- and outer-bounding polytopes…

Mathematical Physics · Physics 2017-12-27 Tomasz Maciazek , Valdemar Tsanov

This paper is devoted to establish a class of sharp Sobolev inequalities on the unit complex sphere as follows: 1) Case $0<d<Q=2n+2$: for any $f\in C^\infty$ and $2\leq q \leq \frac{2Q}{Q-d}$, \begin{equation*} \|f\|_q^2\leq…

Analysis of PDEs · Mathematics 2020-04-08 Yazhou Han , Shutao Zhang

For positive integers $n>d\geq k$, let $\phi(n,d,k)$ denote the least integer $\phi$ such that every $n$-vertex graph with at least $\phi$ vertices of degree at least $d$ contains a path on $k+1$ vertices. Many years ago, Erd\H{o}s,…

Combinatorics · Mathematics 2022-07-19 Binlong Li , Jie Ma , Bo Ning

The colorful simplicial depth of a collection of d+1 finite sets of points in Euclidean d-space is the number of choices of a point from each set such that the origin is contained in their convex hull. We use methods from combinatorial…

Combinatorics · Mathematics 2016-07-04 Karim Adiprasito , Philip Brinkmann , Arnau Padrol , Pavel Paták , Zuzana Patáková , Raman Sanyal

We prove that if the Hausdorff dimension of a compact subset of ${\mathbb R}^d$ is greater than $\frac{d+1}{2}$, then the set of angles determined by triples of points from this set has positive Lebesgue measure. Sobolev bounds for…

Classical Analysis and ODEs · Mathematics 2011-11-01 Alex Iosevich , Mihalis Mourgoglou , Eyvindur Palsson

In this note, we generalize a characterization of the Clifford torus due to Ros. Let $f:M\rightarrow S^{n+1}$ be an embedded closed minimal hypersurface. Assume there are $(n+2)$ great hyperspheres of $S^{n+1}$ perpendicular to each other,…

Differential Geometry · Mathematics 2020-11-02 Changping Wang , Peng Wang

In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $\lambda \geq 0$ such that…

Metric Geometry · Mathematics 2018-01-18 Zsolt Langi

We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…

Combinatorics · Mathematics 2016-10-05 Adam Sheffer

A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…

Classical Analysis and ODEs · Mathematics 2021-06-15 Yosef Yomdin

We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac{\pi}{3} + c$, has size $(1+\Theta(c))^d$ for sufficiently small $c>0$. The proof is based on a refinement of an approach by Erd\H{o}s and…

Combinatorics · Mathematics 2022-07-18 Miroslav Marinov

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

Combinatorics · Mathematics 2026-01-21 Ksenia Apolonskaya , Oleg R. Musin