English
Related papers

Related papers: New Kakeya estimates using Gromov's algebraic lemm…

200 papers

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

Combinatorics · Mathematics 2024-01-17 Martin Otto

Consider $n$ points $x_1,\ldots,x_n$ in finite-dimensional euclidean space, each having one of two colors. Suppose there exists a separating hyperplane (identified with its unit normal vector $w)$ for the points, i.e a hyperplane such that…

Machine Learning · Statistics 2020-11-24 Elvis Dohmatob

In recent years, high-order finite element methods on high-order meshes have attracted considerable attention. This work investigates the isoparametric upwind discontinuous Galerkin method for the radiation transport equation on a bounded…

Numerical Analysis · Mathematics 2026-05-06 Changhui Yao , Yunpan Ma , Lingxiao Li

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…

Number Theory · Mathematics 2024-12-02 Greg Martin , Chi Hoi Yip

Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this…

Information Theory · Computer Science 2022-11-22 Artemy Kolchinsky , Brendan D. Tracey

In this paper, we study continuous Kakeya line and needle configurations, of both the oriented and unoriented varieties, in connected Lie groups and some associated homogenous spaces. These are the analogs of Kakeya line (needle) sets…

Algebraic Topology · Mathematics 2013-03-06 Brendan Murphy , Jonathan Pakianathan

New lower and upper bounds on the reliability function of typewriter channels are given. Our lower bounds improve upon the (multiletter) expurgated bound of Gallager, furnishing a new and simple counterexample to a conjecture made in 1967…

Information Theory · Computer Science 2017-11-02 M. Dalai , Y. Polyanskiy

We propose localization techniques for computing Gromov-Witten invariants of maps from Riemann surfaces with boundaries into a Calabi-Yau, with the boundaries mapped to a Lagrangian submanifold. The computations can be expressed in terms of…

High Energy Physics - Theory · Physics 2007-05-23 Tom Graber , Eric Zaslow

We prove upper and lower bounds for the number of lines in general position that are rich in a Cartesian product point set. This disproves a conjecture of Solymosi and improves work of Elekes, Borenstein and Croot, and Amirkhanyan, Bush,…

Combinatorics · Mathematics 2018-11-02 Brendan Murphy

We present a novel way to classify Calabi-Yau threefolds by systematically studying their infinite volume limits. Each such limit is at infinite distance in Kahler moduli space and can be classified by an associated limiting mixed Hodge…

High Energy Physics - Theory · Physics 2021-12-21 Thomas W. Grimm , Fabian Ruehle , Damian van de Heisteeg

We prove that the maximal operator obtained by taking averages at scale 1 along $N$ arbitrary directions on the sphere, is bounded in $L^2(\R^3)$ by $N^{1/4}{\log N}$. When the directions are $N^{-1/2}$ separated, we improve the bound to…

Classical Analysis and ODEs · Mathematics 2014-02-26 Ciprian Demeter

Centrality measures quantify the importance of a node in a network based on different geometric or diffusive properties, and focus on different scales. Here, we adopt a geometrical viewpoint to define a multi-scale centrality in networks.…

Physics and Society · Physics 2022-09-21 Shazia'Ayn Babul , Karel Devriendt , Renaud Lambiotte

We prove Cheeger-Gromov convergence for a subsequence of a given sequence of manifolds-with-boundary of bounded geometry. The method of the proof is to reduce, via height functions, the problem to the setting of Hamilton's compactnes…

Differential Geometry · Mathematics 2026-02-24 Olaf Müller

Katz and Zahl used a planebrush argument to prove that Kakeya sets in $\mathbb{R}^4$ have Hausdorff dimension at least 3.059. In the special case when the Kakeya set is plany, their argument gives a better lower bound of 10/3. We give a…

Classical Analysis and ODEs · Mathematics 2026-01-13 Izabella Łaba , Mukul Rai Choudhuri , Joshua Zahl

We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.…

Combinatorics · Mathematics 2017-03-13 David Bevan , Grahame Erskine , Robert Lewis

The arithmetic Kakeya conjecture, formulated by Katz and Tao in 2002, is a statement about addition of finite sets. It is known to imply a form of the Kakeya conjecture, namely that the upper Minkowski dimension of a Besicovitch set in…

Number Theory · Mathematics 2017-12-07 Ben Green , Imre Ruzsa

Given a family G of rectangles, to which one associates a tree [G], one defines a natural number $\lambda$ [G] called its analytic split and satisfying, for all 1 < p < $\infty$ log($\lambda$ [G]) p MG p p where MG is the Hardy-Littlewood…

Classical Analysis and ODEs · Mathematics 2022-04-05 Anthony Gauvan

Recently a new family of enumerative invariants called leaky Hurwitz numbers was introduced by Cavalieri-Markwig-Ranganathan in the context of logarithmic intersection theory. They admit an interpretation via tropical covers where the…

Algebraic Geometry · Mathematics 2026-03-09 Marvin Anas Hahn , Reinier Kramer

In Part I of this paper, we introduced a class of certain algebras of finite dimension over a field. All these algebras are split, symmetric and local. Here we continue to investigate their Loewy structure. We show that in many cases their…

Representation Theory · Mathematics 2019-12-09 Thomas Breuer , László Héthelyi , Erzsébet Horváth , Burkhard Külshammer

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder