Related papers: On the error bounds for visible points in some cut…
A $(k; r, s; n, q)$-set (short: $(r,s)$-set) of $\mathrm{PG}(n, q)$ is a set of points $X$ with $|X| = k$ such that no $s$-space contains more than $r$ points of $X$. We investigate the asymptotic size of $(r, s)$-sets for $n$ fixed and $q…
Axisymmetric density distributions are constructed which are invisible when viewed from a range of inclination angles $i$. By adding such distributions to a model galaxy, it can be made either disky or boxy without in any way affecting its…
The visibility graph Vis(X) of a discrete point set X in the plane has vertex set X and an edge xy for every two points x,y\in X whenever there is no other point in X on the line segment between x and y. We show that for every graph G,…
We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…
We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…
Stars with excess infrared radiation from circumstellar dust are invaluable for studies of exoplanetary systems, informing our understanding on processes of planet formation and destruction alike. All-sky photometric surveys have made the…
During microlensing events with a small impact parameter, the amplification of the source flux is sensitive to the surface brightness distribution of the source star. Such events provide a means for studying the surface structure of target…
We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional…
We construct model sets arising from cut and project schemes in Euclidean spaces whose associated Delone dynamical systems have positive toplogical entropy. The construction works both with windows that are proper and with windows that have…
We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…
We study the asymptotic behaviour of the partial density function associated to sections of a positive hermitian line bundle that vanish to a particular order along a fixed divisor $Y$. Assuming the data in question is invariant under an…
Object detection remains as one of the most notorious open problems in computer vision. Despite large strides in accuracy in recent years, modern object detectors have started to saturate on popular benchmarks raising the question of how…
The star-discrepancy is a quantitative measure for the irregularity of distribution of a point set in the unit cube that is intimately linked to the integration error of quasi-Monte Carlo algorithms. These popular integration rules are…
For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k…
Precise asymptotics for moderate deviation probabilities are established for open convex sets in both the finite- and infinite-dimensional settings. Our results are based on the existence of dominating points for these sets, a related…
We study the ubiquitous super-resolution problem, in which one aims at localizing positive point sources in an image, blurred by the point spread function of the imaging device. To recover the point sources, we propose to solve a convex…
We present the first results of a serendipitous search for clusters of galaxies in deep ROSAT-PSPC pointed observations at high galactic latitude. The survey is being carried out using a Wavelet based Detection Algorithm which is not biased…
We derive an upper bound for the Assouad dimension of visible parts of self-similar sets generated by iterated function systems with finite rotation groups and satisfying the open set condition. The bound is valid for all visible parts and…
Object detection remains as one of the most notorious open problems in computer vision. Despite large strides in accuracy in recent years, modern object detectors have started to saturate on popular benchmarks raising the question of how…
An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…