Results 101 to 110 of about 68,778 (203)

Soft bounds for local triple products and the subconvexity‐QUE implication for GL2$\mathrm{GL}_2$

open access: yesMathematika, Volume 71, Issue 4, October 2025.
Abstract We give a soft proof of a uniform upper bound for the local factors in the triple product formula, sufficient for deducing effective and general forms of quantum unique ergodicity (QUE) from subconvexity.
Paul D. Nelson
wiley   +1 more source

On type IV superorthogonality

open access: yesMathematika, Volume 71, Issue 4, October 2025.
Abstract We prove the direct and the converse inequalities for type IV superorthogonality in the vector‐valued setting. The converse one is also new in the scalar setting.
Jianghao Zhang
wiley   +1 more source

Monotonicity of functionals associated to product measures via their Fourier transform and applications

open access: yesMathematika, Volume 71, Issue 4, October 2025.
Abstract Let μ$\mu$ be a probability measure on R$\mathbb {R}$. We give conditions on the Fourier transform of its density for functionals of the form H(a)=∫Rnh(⟨a,x⟩)μn(dx)$H(a)=\int _{\mathbb {R}^n}h(\langle a,x\rangle)\mu ^n(dx)$ to be Schur monotone. As applications, we put certain known and new results under the same umbrella, given by a condition
Andreas Malliaris
wiley   +1 more source

Crossing estimates for the Ising model on general s‐embeddings

open access: yesProceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley   +1 more source

A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]

open access: yesMethodsX
Hinding N   +6 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy