Related papers: A lower bound on opaque sets

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We also construct an algorithm to determine whether a…

We show that for $n$ at least $10^{11}$, any 2-coloring of the $n$-dimensional grid $[4]^n$ contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due…

We provide a new proof of the classical result that any closed rectifiable Jordan curve Gamma in space being piecewise of class C^2 bounds at least one immersed minimal surface of disc-type, under the additional assumption that the total…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…

We prove uniform boundedness statements for semistable pure sheaves on projective manifolds. For example, we prove that the set of isomorphism classes of pure sheaves of dimension 2 that are slope semistable with respect to ample classes…

Building on work by Chabauty from 1941, Coleman proved in 1985 an explicit bound for the number of rational points of a curve $C$ of genus $g\ge 2$ defined over a number field $F$, with Jacobian of rank at most $g-1$. Namely, in the case…

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Determining an upper bound on $s$ for vertex-primitive $s$-arc-transitive digraphs has been an open problem of considerable interest since a question asked by Praeger in 1990. Although much progress has been made and an upper bound is…

The circumference of a graph is the length of its longest cycles. Jackson established a conjecture of Bondy by showing that the circumference of a 3-connected cubic graph of order $n$ is $\Omega(n^{0.694})$. Bilinski {\it et al.} improved…

In 1983, Z\u{a}linescu showed that the squared norm of a uniformly convex normed space is uniformly convex on bounded subsets. We extend this result to the metric setting of uniformly convex hyperbolic spaces. We derive applications to the…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

In 1925, Jarnik defined a sequence of convex polygons for use in constructing curves containing many lattice points relative to their curvatures. Properly scaled, these polygons converge to a certain limiting curve. In this paper we…

Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…