Mathematika
Издатель: Wiley · ISSN 00255793 · 14 статей
-
Remarks on Brunn–Minkowski‐type inequalities related to the Ornstein–Uhlenbeck operator
Abstract We investigate Brunn–Minkowski‐type inequalities for the torsional rigidity and the first eigenvalue associated with the Ornstein–Uhlenbeck operator. Counterexamples are provided showing that neither concavity nor convexity...
-
Kummer‐faithfulness over p‐adic fields
Abstract The notion of a Kummer‐faithful field, introduced by Mochizuki, is expected as one of a suitable class of base fields for anabelian geometry. In this paper, we study Kummer‐faithfulness for algebraic extensions of ‐adic fields....
-
A streamlined proof of the Kakeya set conjecture in R3
Abstract We present a streamlined and simplified proof of the Kakeya set conjecture in .
-
On a sharp Fourier extension inequality on the circle with lacunary spectrum
Abstract We prove a sharp Fourier extension inequality on the circle for the Tomas–Stein exponent for functions whose spectrum satisfies .
-
The sum–product phenomenon for dense subsets of finite fields
Abstract Let be a finite field of prime order and let be a subset. In the dense regime when for some , we determine the optimal constant in the inequality The proof relies on a structural result for sumsets of dense subsets, established...
-
Self‐similarity and zeta functions of multidimensional q ‐automatic sets
Abstract This article uses methods from discrete fractal zeta functions to describe geometric features of multidimensional ‐automatic sets. Our main result attaches an almost periodic “weighted density” function whose supremum defines a...
- Issue Information
-
Wasserstein rigidity over Rn with smooth norms
Abstract We study spaces over equipped with a norm metric . We show that, if the norm is smooth enough, then the Wasserstein space is isometrically rigid whenever . We also show that, even when , we can recover the isometric rigidity of...
-
Towards the Erdős matching conjecture for 4‐uniform hypergraphs: Stability and applications
Abstract A famous conjecture of Erdős asserts that for , the maximum number of edges in an ‐vertex ‐uniform hypergraph without pairwise disjoint edges is . This problem has been central in extremal combinatorics, with substantial...
-
Incompleteness of the Ewald–Shephard space of asymmetry classes
Abstract This paper answers a long‐standing open problem concerning the completeness of the metric space of asymmetry classes introduced by Ewald and Shephard (1966). We prove that this metric space is incomplete for . Our approach...
-
Murmurations via Petersson trace formula
Abstract We prove the murmuration phenomenon, which is a correlation between signs of functional equations and Fourier coefficients, in the case of modular forms in the weight aspect. We in particular improve the range of visibility of...
-
Extreme values of class group L‐functions
Abstract We give a lower bound for the maximum value of class group ‐functions attached to at the central point and show that this value is on average at least for any .
-
Graph‐null sets
Abstract We say that a plane set is graph‐null , if there is a function such that . A plane set has the translational Kakeya property if, for every translated copy of and for every , there is a finite sequence of vertical and horizontal...
-
An effective Bombieri–Vinogradov error term for sifting problems
Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that...