Related papers: Biangular lines revisited
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…
There is a famous problem in geometric graph theory to find the chromatic number of the unit distance graph on Euclidean space; it remains unsolved. A theorem of Erdos and De-Bruijn simplifies this problem to finding the maximum chromatic…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…
We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…
Self-duality equations for Yang-Mills fields in d-dimensional Euclidean spaces consist of linear algebraic relations amongst the components of the curvature tensor which imply the Yang-Mills equations. For the extension to superspace gauge…
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the…
Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…
The two outer triangular caustics (regions of infinite magnification) of a close binary microlens move much faster than the components of the binary themselves, and can even exceed the speed of light. When $\epsilon > 1$, where $\epsilon c$…
We find the sharp range for boundedness of the discrete bilinear spherical maximal function for dimensions $d \geq 5$. That is, we show that this operator is bounded on $l^{p}(\mathbb{Z}^d)\times l^{q}(\mathbb{Z}^d) \to l^{r}(\mathbb{Z}^d)$…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the…
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n…
Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…
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 graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and…
We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…