Related papers: Uniform Lower Bound for Intersection Numbers 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…

Let $\overline{\mathcal{M}}_{g,n}$ be the moduli stack parametrizing Deligne-Mumford stable $n$-pointed genus $g$ curves and let $\overline{M}_{g,n}$ be its coarse moduli space: the Deligne-Mumford compactification of the moduli space of…

Let $\mathcal{M}_g$ be the moduli space of hyperbolic surfaces of genus $g$ endowed with the Weil-Petersson metric. In this paper, we show that for any $\epsilon>0$, as $g\to \infty$, for a generic surface in $\mathcal{M}_g$, the error term…

We study polynomial-time approximation algorithms for two closely-related problems, namely computing shortcuts and transitive-closure spanners (TC spanners). For a directed unweighted graph $G=(V, E)$ and an integer $d$, a set of edges…

We prove the following, for a universal constant $c>0$. Let $n \in \mathbb{N}$ and $1 \leq t<c\frac{n}{\log n}$. Let $F,G \subset S_n$ be families of permutations such that no $\sigma \in F$ and $\tau \in G$ agree on exactly $t-1$ values.…

In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined…

The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

We give estimates for the approximation numbers of composition operators on $H^2$, in terms of some modulus of continuity. For symbols whose image is contained in a polygon, we get that these approximation numbers are dominated by $\e^{- c…

We show that the algebraic intersection form of hyperbolic surfaces of genus $g$ has a minimum in the moduli space and that the minimum grows in the order $(\log g)^{-2}$ in terms of the genus. We also describe the asymptotic behavior of…

The minimum number of self-intersection points for members of a free homotopy class of curves on the punctured torus is bounded above in terms of the number L of letters required for a minimal description of the class in terms of the…

We study the problem of $d$-gonality of the modular curve $X_0(N)$. As a result, we can give an upperbound of the level $N$ by means of $d$. This generalizes Ogg's result on hyperelliptic modular curves ($d = 2$). As a corollary of this…

Nearest neighbor cells in $R^d,d\in\mathbb{N}$, are used to define coefficients of divergence ($\phi$-divergences) between continuous multivariate samples. For large sample sizes, such distances are shown to be asymptotically normal with a…

We apply methods of derived and non-commutative algebraic geometry to understand intersection theoretic phenomena on arithmetic schemes. Specifically, we categorify Bloch's intersection number (in the formulation provided by Kato--Saito).…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…

We establish lower bounds on the ambient dimension for an intersection of hypersurfaces to have a dense collection of ``level $\ell$" points, in the sense introduced by Arnold-Shimura, given as a polynomial in the numbers of hypersurfaces…

The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to…

We prove a general likely intersections theorem, a counterpart to the Zilber-Pink conjectures, under the assumption that the Ax-Schanuel property and some mild additional conditions are known to hold for a given category of complex quotient…