Results 21 to 30 of about 217 (101)
Some bounds related to the 2‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 2, April 2026.Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
Non‐vanishing of Poincaré series on average
Mathematika, Volume 72, Issue 2, April 2026.Abstract We study when Poincaré series for congruence subgroups do not vanish identically. We show that almost all Poincaré series with suitable parameters do not vanish when either the weight k$k$ or the index m$m$ varies in a dyadic interval. Crucially, analyzing the problem ‘on average’ over these weights or indices allows us to prove non‐vanishing ...
Ned Carmichael, Noam Kimmel
wiley +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source
Mathematika, Volume 72, Issue 2, April 2026.Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Mathematika, Volume 72, Issue 2, April 2026.Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Mathematika, Volume 72, Issue 2, April 2026.Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Massive Spanning Forests on the Complete Graph: Exact Distribution and Local Limit
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT We provide new exact formulas for the distribution of massive spanning forests on the complete graph, which give also a new outlook on the celebrated special case of the uniform spanning tree. As a corollary we identify their local limit. This generalizes a well‐known theorem of Grimmett on the local limit of uniform spanning trees on the ...
Matteo D'Achille +2 more
wiley +1 more source
Thinning to Improve Two‐Sample Discrepancy
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT The discrepancy between two independent samples X1,…,Xn$$ {X}_1,\dots, {X}_n $$ and Y1,…,Yn$$ {Y}_1,\dots, {Y}_n $$ drawn from the same distribution on ℝd$$ {\mathbb{R}}^d $$ typically has order O(n)$$ O\left(\sqrt{n}\right) $$ even in one dimension.
Gleb Smirnov, Roman Vershynin
wiley +1 more source
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley +1 more source
Universality for Graphs of Bounded Degeneracy
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Given a family ℋ$$ \mathscr{H} $$ of graphs, a graph G$$ G $$ is called ℋ$$ \mathscr{H} $$‐universal if G$$ G $$ contains every graph of ℋ$$ \mathscr{H} $$ as a subgraph. Following the extensive research on universal graphs of small size for bounded‐degree graphs, Alon asked what is the minimum number of edges that a graph must have to be ...
Peter Allen +2 more
wiley +1 more source