Related papers: An improvement on Furstenberg's intersection probl…

Let F be the complete flag variety over Spec(Z) with the tautological filtration 0 \subset E_1 \subset E_2 \subset ... \subset E_n=E of the trivial bundle E over F. The trivial hermitian metric on E(\C) induces metrics on the quotient line…

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an…

J.H.C. Whitehead introduced the concept of crossed modules in the early 20th century. These crossed modules are crucial for algebraic models of 2-type homotopy, which involve connected spaces with no higher than second-degree homotopy…

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga…

In our previous work, we provided an algebraic proof of the Zinger's comparison formula between genus one Gromov-Witten invariants and reduced invariants when the target space is a complete intersection of dimension two or three in a…

The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that…

We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if $\log r / \log s$ is irrational and $X$ and $Y$ are $\times r$- and $\times s$-invariant subsets of $[0,1]$, respectively,…

The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…

We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…

We identify the Kontsevich-Penner matrix integral, for finite size $n$, with the isomonodromic tau function of a $3\times 3$ rational connection on the Riemann sphere with $n$ Fuchsian singularities placed in correspondence with the…

This article describes the geometry of isomorphisms between complements of geometrically irreducible closed curves in the affine plane $\mathbb{A}^2$, over an arbitrary field, which do not extend to an automorphism of $\mathbb{A}^2$. We…

We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

We study a class of measures on the real line with a kind of self-similar structure, which we call dynamically driven self-similar measures, and contain proper self-similar measures such as Bernoulli convolutions as special cases. Our main…

We investigate inequalities for partial sums of complex numbers with bounded modulus and zero total sum, a topic referred to as "polygonal confinement". Starting from Steinitz's classical result, we provide detailed constructions yielding…

In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…

In the late 90's, Tom Wolff introduced the circle tangency counting problem in his expository article on the Kakeya conjecture. For collections of well-spaced circles, we break the $N^{3/2}$-barrier, proving that a set of $N$ well-spaced…

We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred to as $(3,3)$-hypergraphs. It is the first polynomial time…

We prove that there are intersection graphs of axis-aligned boxes in $\mathbb{R}^3$ and intersection graphs of straight lines in $\mathbb{R}^3$ that have arbitrarily large girth and chromatic number.