Related papers: On tight spherical designs

Wang tiles enable efficient pattern compression while avoiding the periodicity in tile distribution via programmable matching rules. However, most research in Wang tilings has considered tiling the infinite plane. Motivated by emerging…

Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in…

We consider the number of configurations of a surface in two dimensions that has a prescribed length and encloses a prescribed perimeter with respect to a baseline. An approximate analytical treatment in a semi--continuum compares…

Let $X$ be a smooth projective variety of dimension $n\geq 2$. It is shown that a finite configuration of points on $X$ subject to certain geometric conditions possesses rich inner structure. On the mathematical level this inner structure…

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice…

We study U(1) twist fields in a two-dimensional lattice theory of massive Dirac fermions. Factorized formulas for finite-lattice form factors of these fields are derived using elliptic parametrization of the spectral curve of the model,…

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

We utilize lattice simulations of the dimensionally reduced effective field theory (EQCD) to determine the quark number susceptibility of QCD at high temperature ($T>2T_c$). We also use analytic continuation to obtain results at finite…

A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…

Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs…

We study ideal lattices in $\mathbb{R}^2$ coming from real quadratic fields, and give an explicit method for computing all well-rounded twists of any such ideal lattice. We apply this to ideal lattices coming from Markoff numbers to…

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

We give two flexible and degenerate constructions related to a theorem of Thurston. First, we produce geodesic segments for Thurston's asymmetric metric on Teichm\"uller space $\mathcal{T}(S_g)$ that remain geodesics after adding arbitrary…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…