Related papers: Tangency counting for well-spaced circles
String propagation on a cone with deficit angle $2\pi(1-{1\over N})$ is considered for the purpose of computing the entropy of a large mass black hole. The entropy computed using the recent results on condensation of twisted-sector tachyons…
We develop a notion of projections between sets of probability measures using the geometric properties of the 2-Wasserstein space. It is designed for general multivariate probability measures, is computationally efficient to implement, and…
In this note, we examine the arrangements of lines and configurations of points that emerge from Fermat (von Dyck) and Komiya-Kuribayashi quartics. These quartics are characterized by having the maximum number of lines of maximal tangency,…
Entanglement is a key quantum phenomena and understanding transitions between phases of matter with different entanglement properties are an interesting probe of quantum mechanics. We numerically study a model of a 2D tensor network…
Thanks to missions like Kepler and TESS, we now have access to tens of thousands of high precision, fast cadence, and long baseline stellar photometric observations. In principle, these light curves encode a vast amount of information about…
The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…
A new method is introduced for solving Laplace problems on 2D regions with corners by approximation of boundary data by the real part of a rational function with fixed poles exponentially clustered near each corner. Greatly extending a…
Recently Wolff obtained a nearly sharp $L^2$ bilinear restriction theorem for bounded subsets of the cone in general dimension. We obtain the endpoint of Wolff's estimate and generalize to the case when one of the subsets is large. As a…
We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…
We consider a mechanical system with impact and n degrees of freedom, written in generalized coordinates. The system is not necessarily Lagrangian. The representative point of the system must remain inside a set of constraints K; the…
This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
The first purpose of this paper is to solve completely the finite field cone restriction conjecture in four dimensions with $-1$ non-square. The second is to introduce a new approach to study incidence problems via restriction theory. More…
From a database of direct numerical simulations of homogeneous and isotropic turbulence, generated in periodic boxes of various sizes, we extract the spherically symmetric part of moments of velocity increments and first verify the…
We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines. About 88 years later, Zaslavsky (1975) even…
We study the problem of computing a convex region with bounded area and diameter that contains the maximum number of points from a given point set $P$. We show that this problem can be solved in $O(n^6k)$ time and $O(n^3k)$ space, where $n$…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More…