English
Related papers

Related papers: Sets of unit vectors with small pairwise sums

200 papers

In this paper, we investigate two properties concerning the unimodality of the $\delta$-vectors of lattice polytopes, which are log-concavity and alternatingly increasingness. For lattice polytopes $\mathcal{P}$ of dimension $d$, we prove…

Combinatorics · Mathematics 2015-04-17 Akihiro Higashitani

The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…

Data Analysis, Statistics and Probability · Physics 2017-12-14 Juan Luis Esteban , Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez

It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension…

Dynamical Systems · Mathematics 2026-04-21 Meysam Nassiri , Mojtaba Zareh Bidaki

We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…

Soft Condensed Matter · Physics 2007-05-23 Peter Sheridan Dodds , Joshua S. Weitz

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

In 1984, Frankl and Pach proved that, for positive integers $n$ and $d$, the maximum size of a $(d+1)$-uniform set family $\mathcal{F}$ on an $n$-element set with VC-dimension at most $d$ is at most ${n\choose d}$; and they suspected that…

Combinatorics · Mathematics 2025-08-21 Tianchi Yang , Xingxing Yu

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Number Theory · Mathematics 2020-12-16 Changhao Chen , Bryce Kerr , Igor Shparlinski

We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…

Mathematical Physics · Physics 2020-12-02 Edoardo Mainini , Bernd Schmidt

In complex vector spaces maximal sets of equiangular lines, known as SICs, are related to real quadratic number fields in a dimension dependent way. If the dimension is of the form $n^2+3$ the base field has a fundamental unit of negative…

Quantum Physics · Physics 2020-05-29 Ingemar Bengtsson

A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the Hermitian inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is…

Combinatorics · Mathematics 2015-03-23 Jonathan Jedwab , Amy Wiebe

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…

Information Theory · Computer Science 2008-01-28 Lizhen Yang , Ling Dong , Kefei Chen

Let $w=(w_1,\dots,w_d)$ be a $d$-tuple of positive real numbers such that $\sum_{i}w_i =1$ and $w_1\geq \cdots \geq w_d$. A $d$-dimensional vector $x=(x_1,\dots,x_d)\in\mathbb{R}^d$ is said to be $w$-singular if for every $\epsilon>0$ there…

Number Theory · Mathematics 2024-04-10 Taehyeong Kim , Jaemin Park

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

General Mathematics · Mathematics 2007-12-20 Binhai Zhu

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Metric Geometry · Mathematics 2016-12-01 Alexey Glazyrin , Wei-Hsuan Yu

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

In this paper, we present the results of a computer investigation of asymptotics for maximum dimensions of linear and projective representations of the symmetric group. This problem reduces to the investigation of standard and strict Young…

Combinatorics · Mathematics 2020-06-19 Vasilii Duzhin , Nikolay Vasilyev

A double-normal pair of a finite set $S$ of points from $R^d$ is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ perpendicular to $pq$. A double-normal pair $pq$ is…

Metric Geometry · Mathematics 2019-02-20 János Pach , Konrad Swanepoel

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

Combinatorics · Mathematics 2020-01-22 Gwendal Collet , Michael Drmota , Lukas Daniel Klausner

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\V$ be a finite set system defined over an $n$-point set $X$; we view $\V$ as a set of indicator vectors over the…

Computational Geometry · Computer Science 2014-12-18 Esther Ezra

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

Combinatorics · Mathematics 2025-02-14 Hailong Dao , Manik Dhar , Izabella Łaba , Ben Lund
‹ Prev 1 3 4 5 6 7 10 Next ›