Related papers: New bounds for equiangular lines and spherical two…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…
A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…
A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.
In this paper Seidel matrices are studied, and their spectrum and several related algebraic properties are determined for order $n\leq 13$. Based on this Seidel matrices with exactly three distinct eigenvalues of order $n\leq 23$ are…
We show that the maximum cardinality of an equiangular line system in $\mathbb R^{18}$ is at most $59$. Our proof includes a novel application of the Jacobi identity for complementary subgraphs. In particular, we show that there does not…
An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in…
We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…
Let $E^n$ denote the (real) $n$-dimensional Euclidean space. It is not known whether an equilateral set in the $\ell_1$ sum of $E^a$ and $E^b$, denoted here as $E^a \oplus_1 E^b$, has maximum size at least $\dim(E^a \oplus_1 E^b) + 1 = a +…
An equilateral dimension of a normed space is a maximal number of pairwise equidistant points of this space. The aim of this paper is to study the equilateral dimension of certain classes of finite dimensional normed spaces. The well-known…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
By giving a thin width of $0<\delta\ll 1$ to both a unit circle and a unit line, we set an annulus and a tube on the Euclidean plane $\mathbb{R}^2$. Consider the maximal means $M_\delta$ over dilations of the annulus, and $N_\delta$ over…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…
Let $\mathscr{S}_n(q)$ denote the set of symmetric bilinear forms over an $n$-dimensional $\mathbb{F}_q$-vector space. A subset $\mathcal{C}$ of $\mathscr{S}_n(q)$ is called a $d$-code if the rank of $A-B$ is larger than or equal to $d$ for…
A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…
We revisit here a fundamental result on planar triangulations, namely that the flip distance between two triangulations is upper-bounded by the number of proper intersections between their straight-segment edges. We provide a complete and…
A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the minimum angle…