Related papers: Numbers with three close factorizations and centra…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…
In two-dimensional models of critical non-intersecting loops, there are $\ell$-leg fields that insert $\ell\in\mathbb{N}^*$ open loop segments, and diagonal fields that change the weights of closed loops. We conjecture an exact formula for…
This is the first one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple linear groups.
A straightforward 3-point quadrature formula of closed type is derived that improves on Simpson's rule. Just using the additional information of the integrand's derivative at the two endpoints we show the error is sixth order in grid…
In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
Most strong-interaction resonances have decay channels involving three or more particles, including many of the recently discovered $X$, $Y$ and $Z$ resonances. In order to study such resonances from first principles using lattice QCD, one…
We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point…
We discuss a correlation function factorization, which relates a three-point function to the square root of three two-point functions. This factorization is known to hold for certain scaling operators at the two-dimensional percolation…
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…
We describe our recent work on the lattice formulation of N=4 three-dimensional super-Yang-Mills. Our formulation was based on the Donaldson-Witten twist, but we have also been studying the formulation based on the Blau-Thompson twist by…
In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…
This paper is a continuation of our paper about boundary rigidity and filling minimality of metrics close to flat ones. We show that compact regions close to a hyperbolic one are boundary distance rigid and strict minimal fillings. We also…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
We construct a variety of supersymmetric gauge theories on a spatial lattice, including N=4 supersymmetric Yang-Mills theory in 3+1 dimensions. Exact lattice supersymmetry greatly reduces or eliminates the need for fine tuning to arrive at…
We consider polynomial approximation over the interval $[-1,1]$ by regularized weighted discrete least squares methods with $\ell_2-$ or $\ell_1-$regularization, respectively. As the set of nodes we use Gauss quadrature points (which are…
In the paper Factorisation of division polynomials (H. Verdure, Proc. japan Academy, Ser A. 80 n. 5), Verdure gives the factorisation patterns of division polynomials of elliptic curves defined over a finite field. However, the result given…