Related papers: From acute sets to centrally symmetric $2$-neighbo…

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

We show that the maximal non-central hyperplane sections of the regular n-simplex of side-length sqrt 2 at a fixed distance t to the centroid are those parallel to a face of the simplex, if $\sqrt{(n-2)/(3(n+1))} < t <…

The maximum of the absolute value of a real homogeneous polynomial of degree $d\ge 3$ on the unit sphere corresponds to the spectral norm of the induced real $d$-symmetric tensor $\mathcal{S}$. We give two sequences of upper bounds on the…

Until recently, the simplest known flexible polyhedron was Steffen's polyhedron on nine vertices. However, in 2024, an embedded flexible polyhedron on eight vertices was announced. It attains the known lower bound for the number of…

We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…

Fix integers $m \ge 2$, $s\ge 5$ and $d\ge 2s+2$. Here we describe the possible symmetric tensor ranks $\le 2d+s-7$ of all symmetric tensors (or homogeneous degree $d$ polynomials) in $m+1$ variables with border rank $s$.

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

It is shown here that the diameter of the $d$-dimensional cyclohedron is not greater than $\lceil 5d/2\rceil-2$. It is also shown that the $5/2$ coefficient in this upper bound is asymptotically sharp. More precisely, the $d$-dimensional…

We show that the spectral norm of a $d$-mode real or complex symmetric tensor in $n$ variables can be computed by finding the fixed points of the corresponding polynomial map. For a generic complex symmetric tensor the number of fixed…

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…

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

In this article, we classify all symmetric generalized numerical semigroups in $\mathbb{N}^d$ of embedding dimension $2d+1$. Consequently, we show that in this case the property of being symmetric is equivalent to have a unique maximal gap…

How many copies of a fixed odd cycle, $C_{2m+1}$, can a planar graph contain? We answer this question asymptotically for $m\in\{2,3,4\}$ and prove a bound which is tight up to a factor of $3/2$ for all other values of $m$. This extends the…

Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices $v,w$ are in the…

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

We present a simple construction of an acute set of size $2^{d-1}+1$ in $\mathbb{R}^d$ for any dimension $d$. That is, we explicitly give $2^{d-1}+1$ points in the $d$-dimensional Euclidean space with the property that any three points form…