Related papers: Two-Distance Sets over Finite Fields

We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…

We consider the maximum of the discrete two dimensional Gaussian free field (GFF) in a box, and prove that its maximum, centered at its mean, is tight, settling a long-standing conjecture. The proof combines a recent observation of…

We prove that every $L$-bilipschitz mapping $\mathbb{Z}^2\to\mathbb{R}^2$ can be extended to a $C(L)$-bilipschitz mapping $\mathbb{R}^2\to\mathbb{R}^2$ and provide a polynomial upper bound for $C(L)$. Moreover, we extend the result to every…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…

We study restriction problem in vector spaces over finite fields. We obtain finite field analogue of Mockenhaupt-Mitsis-Bak-Seenger restriction theorem, and we show that the range of the exponentials is sharp.

An extended Kleinian group whose orientation-preserving half is a Schottky group is called an extended Schottky group. These groups correspond to the real points in the Schottky space. Their geometric structures is well known and it permits…

This paper studies the strong quasiconvexity of norm and distance functions in finite-dimensional normed spaces. Although the Euclidean norm is known to be strongly quasiconvex on bounded convex sets, a complete characterization of this…

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…

This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.

In this paper, maximum principles for Euclidean and hyperbolic discrete conformal structures on polyhedral surfaces are established. These maximum principles unify and generalize the maximum principles for vertex scalings and different…

Over a global field any finite number of central simple algebras of exponent dividing $m$ is split by a common cyclic field extension of degree $m$. We show that the same property holds for function fields of two-dimensional excellent…

In this paper, we provide upper bounds on several Rubinstein-type distances on the configuration space equipped with the Poisson measure. Our inequalities involve the two well-known gradients, in the sense of Malliavin calculus, which can…

We address a problem of the upper critical field in a lattice described by a two-dimensional tight-binding model with the on-site pairing. We develop a finite-system-approach which enables investigation of magnetic and superconducting…

An upper bound for the maximum number of rational points on an hypersurface in a projective space over a finite field has been conjectured by Tsfasman and proved by Serre in 1989. The analogue question for hypersurfaces on weighted…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

We propose a non-abelian higher-spin theory in two dimensions for an infinite multiplet of massive scalar fields and infinitely many topological higher-spin gauge fields together with their dilaton-like partners. The spectrum includes local…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…