Related papers: Counting points in thin sets: A survey

A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

Let $Q_n$ be the $n$-dimensional Hamming cube and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically \[2n2^{N/4},\] as was conjectured by Ilinca and the first author in connection with a question of…

A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…

A class of subsets designated as very thin subsets of natural numbers has been studied and seen that theory of convergence may be rediscovered if very thin sets are given to play main role instead of thin or finite sets which removes some…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

A kind of fixed-point problem in the area of discrete tomography is proposed and investigated. Our chief concern in this paper is the case of square windows in the plane. Dealing with the arrays which are bounded, of polynomial growth, and…

In 1964 A. Bruckner observed that any bounded open set in the plane has an inscribed triangle, that is a triangle contained in the open set and with the vertices lying on the boundary. We prove that this triangle can be taken uniformly fat,…

This paper initiates the systematic study of the number of points of bounded height on symmetric squares of weak Fano varieties. We provide a general framework for establishing the point count on $\text{Sym}^2 X$. In the specific case of…

The surface area of a set which is only observed as a binary pixel image is often estimated by a weighted sum of pixel configurations counts. In this paper we examine these estimators in a design based setting -- we assume that the observed…

In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…

Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…

We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…

We consider the problem of bounding large deviations for non-i.i.d. random variables that are allowed to have arbitrary dependencies. Previous works typically assumed a specific dependence structure, namely the existence of independent…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…