Related papers: Improved bounds for the Kakeya maximal conjecture …
Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…
We establish the volume conjecture for (m,2)-cables of the figure 8 knot, when m is odd. For (m,2)-cables of general knots where m is even, we show that the limit in the volume conjecture depends on the parity of the color (of the Kashaev…
We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…
A method for computing lower bounds on capacities of 2-dimensional constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf…
R. Thom's gradient conjecture states that if a gradient flow of an analytic function converges to a limit, it does so along a unique limiting direction. In this paper, we extend and settle this conjecture in the context of infinite…
Accounting for inequality constraints, such as boundedness, monotonicity or convexity, is challenging when modeling costly-to-evaluate black box functions. In this regard, finite-dimensional Gaussian process (GP) regression models bring a…
For a finite field GF(q) a Kakeya set K is a subset of GF(q)^n that contains a line in every direction. This paper derives new upper bounds on the minimum size of Kakeya sets when q is even.
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
We explicitly bound the Faltings height of a curve over Q polynomially in its Belyi degree. Similar bounds are proven for three other Arakelov invariants: the discriminant, Faltings' delta invariant and the self-intersection of the…
A Besicovitch set in AG(n,q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds…
We prove endpoint bounds for derivatives of fractional maximal functions with either smooth convolution kernel or lacunary set of radii in dimensions $n \geq 2$. We also show that the spherical fractional maximal function maps $L^{p}$ into…
Can AI based methods help us make advances in complexity theory? We provide evidence towards answering this in the affirmative, using AlphaEvolve (an LLM code mutation agent) to obtain new results in three settings: a) We improve a recent…
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
In a recent breakthrough, Dvir showed that every Kakeya set in $\F^n$ must be of cardinality at least $c_n |\F|^n$ where $c_n \approx 1/n!$. We improve this lower bound to $\beta^n |\F|^n$ for a constant $\beta > 0$. This pins down the…
We provide quantitative estimates for the supremum of the Hausdorff dimension of sets in the real line which avoid $\varepsilon$-approximations of arithmetic progressions. Some of these estimates are in terms of Szemer\'{e}di bounds. In…
We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of query learning in terms of various combinatorial quantities. Our approach is flexible and powerful…
Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…
We explore computational aspects of maximum likelihood estimation of the mixture proportions of a nonparametric finite mixture model -- a convex optimization problem with old roots in statistics and a key member of the modern data analysis…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…