Related papers: Improved bounds for radial projections in the plan…

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

In this paper, we show that the oriented diameter of any $n$-vertex $2$-connected near triangulation is at most $\lceil{\frac{n}{2}}\rceil$ (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang…

The Hilbert scheme of n points in the projective plane parameterizes degree n zero-dimensional subschemes of the projective plane. We examine the dual cones of effective divisors and moving curves on the Hilbert scheme. By studying…

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

Let X be a simplicial complex on the vertex set V. The rational Leray number L(X) of X is the minimal d such that the rational reduced homology of any induced subcomplex of X vanishes in dimensions d and above. Let \pi be a simplicial map…

Given two finite posets $\mathcal P$ and $\mathcal Q$, their Ramsey number, denoted by $R(\mathcal P,\mathcal Q)$, is defined to be the smallest integer $N$ such that any blue/red colouring of the vertices of the hypercube $Q_N$ has either…

Let X be a zero-dimensional scheme in P1 \times P1. Then X has a minimal free resolution of length 2 if and only if X is ACM. In this paper we determine a class of reduced schemes whose resolutions, similarly to the ACM case, can be…

Motivated by recent results on radial projections and applications to the celebrated Falconer distance problem, we study radial projections in the setting of finite fields. More precisely, we extend results due to Mattila and Orponen…

It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting point constellations in certain projective geometries. For example, the expurgated Nordstrom-Robinson code, a nonlinear binary [14,6,6]-code…

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…

Let $M$ be a non-compact connected Riemann surface of finite type, and $R\subset\subset M$ be a relatively compact domain such that $H_{1}(M,\Z)=H_{1}(R,\Z)$. Let $\tilde R\longrightarrow R$ be a covering. We study the algebra…

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an…

In this paper we introduce and analyze the learning scenario of \emph{coupled nonlinear dimensionality reduction}, which combines two major steps of machine learning pipeline: projection onto a manifold and subsequent supervised learning.…

We show that the lower bound for the optimal directional discrepancy with respect to the class of rectangles in $\mathbb{R}^2$ rotated in a restricted interval of directions $[-\theta, \theta]$ with $\theta < \frac{\pi}{4}$ is of the order…

We develop various lower bounds for the numerical radius $w(A)$ of a bounded linear operator $A$ defined on a complex Hilbert space, which improve the existing inequality $w^2(A)\geq \frac{1}{4}\|A^*A+AA^*\|$. In particular, for $r\geq 1$,…

Let $T\subset \R^{m+1}$ be a strictly convex domain bounded by a smooth hypersurface $X=\partial T$. In this paper we find lower bounds on the number of billiard trajectories in $T$ which have a prescribed intial point $A\in X$, a…

We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known…

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…

In this paper, we contribute a proof that minimum radius balls over metric spaces with the Heine-Borel property are always LP type. Additionally, we prove that weak metric spaces, those without symmetry, also have this property if we fix…

We formulate a variational principle for a collection of projectors in an indefinite inner product space. The existence of minimizers is proved in various situations.