Related papers: Well-distributed great circles on S^2

The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…

In recent work by Mossel and Ross, it was asked how large $q$ has to be for a random jigsaw puzzle with $q$ different shapes of "jigs" to have exactly one solution. The jigs are assumed symmetric in the sense that two jigs of the same type…

We consider a light-like Wilson loop in N=4 SYM evaluated on a regular n-polygon contour. Sending the number of edges to infinity the polygon approximates a circle and the expectation value of the light-like WL is expected to tend to the…

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

We show for $A,B\subset\mathbb{R}^d$ of equal volume and $t\in (0,1/2]$ that if $|tA+(1-t)B|< (1+t^d)|A|$, then (up to translation) $|\text{co}(A\cup B)|/|A|$ is bounded. This establishes the sharp threshold for Figalli and Jerison's…

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

Branched n-coverings of Riemann surfaces are described by a 2d lattice gauge theory of the symmetric group S(n) defined on a cell discretization of the surface. We study the theory in the large-n limit, and we find a rich phase diagram with…

Let $G=SL_2(\mathbb R)^d$ and $\Gamma=\Gamma_0^d$ with $\Gamma_0$ a lattice in $SL_2(\mathbb R)$. Let $S$ be any "curved" submanifold of small codimension of a maximal horospherical subgroup of $G$ relative to an $\mathbb R$-diagonalizable…

This paper gives an explicit argument to show strong boundedness for ${\rm Sp}_{2n}(R)$ for $R$ a ring of S-algebraic integers or a semi-local ring. This gives a quantitative version of a related abstract result in a previous paper of the…

We find closed formulas for the overlaps of Bethe eigenstates of $\mathfrak{gl}(N)$ symmetric spin chains and integrable boundary states. We derive the general overlap formulas for $\mathfrak{gl}(M)\oplus\mathfrak{gl}(N-M)$ symmetric…

A long standing conjecture of Richter and Thomassen states that the total number of intersection points between any $n$ simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same…

In the projective space $\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly…

We study the topology of admissible-loop spaces on a step-two Carnot group G. We use a Morse-Bott theory argument to study the structure and the number of geodesics on G connecting the origin with a 'vertical' point (geodesics are critical…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

We studied the geometrical and topological rules underlying the dispositions and the size distribution of non-overlapping, polydisperse circle-packings. We found that the size distribution of circles that densely cover a plane follows the…

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let $B_n$ be the number of nonisomorphic…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…