Results 31 to 40 of about 217 (101)

On quantum ergodicity for higher‐dimensional cat maps modulo prime powers

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract A discrete model of quantum ergodicity of linear maps generated by symplectic matrices A∈Sp(2d,Z)$A \in \operatorname{Sp}(2d,{\mathbb {Z}})$ modulo an integer N⩾1$N\geqslant 1$, has been studied for d=1$d=1$ and almost all N$N$ by Kurlberg and Rudnick (2001, Comm. Math. Phys., 222, 201–227).
Subham Bhakta, Igor E. Shparlinski
wiley   +1 more source

Zarankiewicz bounds from distal regularity lemma

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source

Small triangles

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number Δ=Δ(N)$\Delta = \Delta (N)$ for which every collection in N$N$ points in the unit square spans a triangle with area at most Δ$\Delta$.
Dmitrii Zakharov
wiley   +1 more source

Determinacy on the edge of second‐order arithmetic, I

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract This is the first of two articles on the strength of m$m{}$‐Σ30$\bm{\Sigma }^0_3{}$‐determinacy for m∈N$m\in \mathbb {N}$, the strongest theories of determinacy contained in Hilbert's second‐order arithmetic (Z2)$(Z_2)$. In this article, we refute two natural conjectures on the strength of these principles in terms of inductive definability ...
J. P. Aguilera, P. D. Welch
wiley   +1 more source

Scattering theory for difference equations with operator coefficients

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract We investigate a class of second‐order difference equations featuring operator‐valued coefficients with the aim of approaching problems of stationary scattering theory. We focus on various compact perturbations of the discrete Laplacian given in a Hilbert space of bi‐infinite square‐summable sequences with entries from a fixed Hilbert space ...
David Sher   +3 more
wiley   +1 more source

Connected components of the space of flags of SO0(p,q)$\operatorname{SO}_0(p,q)$ transverse to a fixed pair and restrictions on Anosov subgroups

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract We count and give a parametrization of connected components in the space of flags transverse to a given transverse pair in every flag varieties of SO0(p,q)$\operatorname{SO}_0(p,q)$. We compute the effect the involution of the unipotent radical has on those components and, using methods of Dey–Greenberg–Riestenberg, we show that for certain ...
Clarence Kineider, Roméo Troubat
wiley   +1 more source

Diophantine tuples and product sets in shifted powers

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley   +1 more source

Growth functions of periodic space tessellations. [PDF]

open access: yesActa Crystallogr A Found Adv
Naskręcki B   +3 more
europepmc   +1 more source

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

open access: yesJ Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Home - About - Disclaimer - Privacy