Results 61 to 70 of about 1,463,977 (153)
Sharp restriction estimates for some degenerate higher codimensional quadratic surfaces
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract The Fourier restriction conjecture is a fundamental problem in harmonic analysis. In this paper, we investigate restriction estimates for degenerate higher codimensional quadratic surfaces and obtain sharp results for some types of degenerate cases.
Zhenbin Cao, Changxing Miao, Yixuan Pang
wiley +1 more source
Characteristic‐free normalized Nash blowup of toric varieties
Journal of the London Mathematical Society, Volume 114, Issue 4, October 2026.Abstract We introduce conditions on cones of normal toric varieties under which the polyhedron defining the normalized Nash blowup does not depend on the characteristic of the base field. As a consequence, we deduce several results on the resolution of singularities properties of normalized Nash blowups.
Federico Castillo +3 more
wiley +1 more source
Combinatorics in didactic games at primary school [PDF]
, 2020 The graduation thesis deals with problematics of combinatorics at primary school. It is focused on creation of a set of didactic games, which develope logical-combinatorial thinking and are based on pupils' own cognitive activity and on their active ...
Majorová, Jana
core
Bounded exponential sums with multiplicative coefficients
Mathematika, Volume 72, Issue 4, October 2026.Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
wiley +1 more source
Algebraic combinatorics and coinvariant spaces
, 2009 Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of ...
Bergeron, Francois, Francois Bergeron
core +1 more source
Abelian number fields with frobenian conditions
Mathematika, Volume 72, Issue 4, October 2026.Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
Lattice path combinatorics and applications
, 2019 Recent methods used in lattice path combinatorics and various related branches of enumerative combinatorics are grouped together and presented in this volume, together with relevant applications.
Andrews, George +2 more
core +1 more source
Zeros of polynomials in derivatives of automorphic L$L$‐functions
Mathematika, Volume 72, Issue 4, October 2026.Abstract Let Fm$\mathfrak {F}_m$ be the set of all cuspidal automorphic representations of GLm(AQ)$\mathrm{GL}_m(\mathbb {A}_{\mathbb {Q}})$, and let F(s,π)$F(s,\bm {\pi })$ be a polynomial in the derivatives of L$L$‐functions associated with representations π∈⋃m=1∞Fm$\pi \in \bigcup _{m=1}^{\infty } \mathfrak {F}_m$. We establish an asymptotic formula
Anji Dong +2 more
wiley +1 more source
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
How to pick your football team
Mathematika, Volume 72, Issue 4, October 2026.Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source