Related papers: Circle discrepancy for checkerboard measures

We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) is compatible…

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

While galaxy rotation curves provide one of the most powerful methods for measuring dark matter profiles in the inner regions of rotation-supported galaxies, at the dwarf scale there are factors that can complicate this analysis. Given the…

Using an optimal containment approach, we quantify the asymmetry of convex bodies in $\mathbb{R}^n$ with respect to reflections across affine subspaces of a given dimension. We prove general inequalities relating these ''Minkowski…

Aims. The main purpose of this paper is to study time delays between the light variations in different wavebands for a sample of quasars. Measuring a reliable time delay for a large number of quasars may help constraint the models of their…

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…

In the confetti percolation model, or two-coloured dead leaves model, radius one disks arrive on the plane according to a space-time Poisson process. Each disk is coloured black with probability $p$ and white with probability $1-p$. In this…

We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\tfrac12\,(1+\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$…

We prove three theorems about solutions of $\Delta u + e^{2u} = 0$ in the plane. The first two describe explicitly all concave and quasiconcave solutions. The third theorem says that the diameter of the plane with respect to the metric with…

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by…

We say that a simple, closed curve $\gamma$ in the plane has bounded convex curvature if for every point $x$ on $\gamma$, there is an open unit disk $U_x$ and $\varepsilon_x>0$ such that $x\in\partial U_x$ and $B_{\varepsilon_x}(x)\cap…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line…

For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…

We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

The discrepancy function measures the deviation of the empirical distribution of a point set in $[0,1]^d$ from the uniform distribution. In this paper, we study the classical discrepancy function with respect to the BMO and exponential…