Related papers: Well-distributed great circles on S^2
We prove the following, for a universal constant $c>0$. Let $n \in \mathbb{N}$ and $1 \leq t<c\frac{n}{\log n}$. Let $F,G \subset S_n$ be families of permutations such that no $\sigma \in F$ and $\tau \in G$ agree on exactly $t-1$ values.…
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…
The subject of limit curve theorems in Lorentzian geometry is reviewed. A general limit curve theorem is formulated which includes the case of converging curves with endpoints and the case in which the limit points assigned since the…
For an elliptic curve defined over a number field, the absolute Galois group acts on the group of torsion points of the elliptic curve, giving rise to a Galois representation in $\mathrm{GL}_2(\hat{\mathbb{Z}})$. The obstructions to the…
We construct the minimal surface in AdS, relevant for the strong coupling behaviour of local supersymmetric Wilson loops in N=4 SYM for a closed contour formed out of segments of two intersecting circles. Its regularised area is calculated…
We study massive $2 \to 2$ scattering of identical scalar particles in spacetime dimensions 3 to 11 using non-perturbative S-matrix bootstrap techniques. Treating $d$ as a continuous parameter, we compute two-sided numerical bounds on…
The overlap distribution of the Sherrington-Kirkpatrick model on the Nishimori line has been proved to be self averaging for large volumes. Here we study the joint distribution of the rescaled overlaps around their common mean and prove…
We study one extremal problem on the product of power of generalized inner radii of non-overlapping domains in $\mathbb{C}^{n}$.
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…
In this article, we consider `$N$'spherical caps of area $4\pi p$ were uniformly distributed over the surface of a unit sphere. We study the random intersection graph $G_N$ constructed by these caps. We prove that for $p =…
We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…
Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…
The circular law asserts that the empirical distribution of eigenvalues of appropriately normalized $n\times n$ matrix with i.i.d. entries converges to the uniform measure on the unit disc as the dimension $n$ grows to infinity. Consider an…
We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…
We define the correlation of holes on the triangular lattice under periodic boundary conditions and study its asymptotics as the distances between the holes grow to infinity. We prove that the joint correlation of an arbitrary collection of…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…
It has been proposed some time ago that the large $N-$limit can be understood as a ``classical limit'', where commutators in some sense approach the corresponding Poisson brackets. We discuss this in the light of some recent numerical…
A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…