Related papers: Circle discrepancy for checkerboard measures
We show that for $m$ points and $n$ lines in the real plane, the number of distinct distances between the points and the lines is $\Omega(m^{1/5}n^{3/5})$, as long as $m^{1/2}\le n\le m^2$. We also prove that for any $m$ points in the…
We prove that the total curvature of a planar graph with nonnegative combinatorial curvature is at least $\frac{1}{12}$ if it is positive. Moreover, we classify the metric structures of ambient polygonal surfaces for planar graphs attaining…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length $L$ in a convex body can match the Crofton-predicted line-intersection counts, and proved an $O\left(L^{1/3}\right)$ upper bound…
We examine the measurable chromatic number of distance colorings on the surface of 2-dimensional spheres of varying radii, showing in particular that similar arguments to those used to raise lower bounds in the plane work for all but a…
We introduce a reflected chord-arc profile for curves with orthogonal boundary condition and obtain a chord-arc estimate for embedded free boundary curve shortening flows in a convex planar domain. As a consequence, we are able to prove…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
In this paper, we prove that some renowned lower bounds in discrepancy theory admit a discrete analogue. Namely, we prove that the lower bound of the discrepancy for corners in the unit cube due to Roth holds true also for a suitable finite…
The choice of a point set, to be used in numerical integration, determines, to a large extent, the error estimate of the integral. Point sets can be characterized by their discrepancy, which is a measure of its non-uniformity. Point sets…
A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges…
We prove that curve shortening flow on the round sphere displays sharp chord-arc improvement, precisely as in the planar setting (Andrews and Bryan, Comm. Anal. Geom., 2011). As in the planar case, the sharp estimate implies control on the…
The spherical cap discrepancy is a prominent measure of uniformity for sets on the d-dimensional sphere. It is particularly important for estimating the integration error for certain classes of functions on the sphere. Building on a…
For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc…
A plane curve is called strange if its tangent line at any smooth point passes through a fixed point, called the strange point. In this paper, we study $\mathbb{A}^1$-curves on the complement of a rational strange curve of degree $p$ in…
We investigate the behavior of a complete flat metric on a surface near a puncture. We call a puncture on a flat surface regular if it has a neighborhood which is isometric to that of a point at infinity of a cone. We prove that there are…
In this paper, we study curvature estimates for nodal sets of harmonic functions in the plane. We prove that at any point $p$, the curvature of each nodal curve of any harmonic function $u$ is upper bounded by…
We consider the electromagnetic field in a cavity with a periodically oscillating perfectly reflecting boundary and show that the mathematical theory of circle maps leads to several physical predictions. Notably, well-known results in the…
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…