Related papers: Large point-line matchings and small Nikodym sets
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We study two exactly solvable two-dimensional conformal models, the critical Ising model and the Sommerfield model, on the lattice. We show that finite-size effects are important and depend on the aspect ratio of the lattice. In particular,…
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…
Finite size effects for the Ising Model coupled to two dimensional random surfaces are studied by exploiting the exact results from the 2-matrix models. The fixed area partition function is numerically calculated with arbitrary precision by…
The first part of this work consists of a study of the ODE/IM correspondence for simply-laced affine Toda field theories. It is a first step towards a full generalisation of the results of Lukyanov and Zamolodchikov on $\hat{\mathfrak a}_1$…
Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…
We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…
We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…
The leading order finite size effects due to spin, namely that of the cubic and quartic in spin interactions, are derived for the first time for generic compact binaries via the effective field theory for gravitating spinning objects. These…
We generalize the Atiyah problem on configurations and the related Atiyah--Sutcliffe conjectures 1 and 2 using finite graphs, configurations of points and tensors. Our conjectures are intriguing geometric inequalities, defined using the…
We propose graph theoretic equivalents for existence of a finite projective plane. We then develop a new approach and see that the problem of existence of a finite projective plane of order n is linked up with a subset of sharply 2…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…
Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…
The Fateev model is somewhat special among two-dimensional quantum field theories. For different values of the parameters,it can be reduced to a variety of integrable systems. An incomplete list of the reductions includes O(3) and O(4)…
A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
The topological Tverberg theorem claims that for any continuous map of the (q-1)(d+1)-simplex to R^d there are q disjoint faces such that their images have a non-empty intersection. This has been proved for affine maps, and if $q$ is a…