English
Related papers

Related papers: High-low analysis and small cap decoupling over no…

200 papers

Let $K$ be a complete non-archimedean valuation field of characteristic $0$, with non-trivial valuation, equipped with (possibly multiple) commuting bounded derivations. We prove a decomposition theorem for finite differential modules over…

Number Theory · Mathematics 2024-04-26 Shun Ohkubo

A new construction is presented of scalar-flat Kaehler metrics on non-minimal ruled surfaces. The method is based on the resolution of singularities of orbifold ruled surfaces which are closely related to rank-2 parabolically stable…

Differential Geometry · Mathematics 2007-05-23 Yann Rollin , Michael A. Singer

It is proved that the continuous bounded cohomology of SL_2(k) vanishes in all positive degrees whenever k is a non-Archimedean local field. This holds more generally for boundary-transitive groups of tree automorphisms and implies low…

Group Theory · Mathematics 2016-09-19 Michelle Bucher , Nicolas Monod

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…

Number Theory · Mathematics 2007-05-23 David Terhune

We give both a sufficient condition for and an obstruction to the derived category of a commutative ring being generated by its residue fields. As an illustration, we exhibit a ring for which Foxby's small support classifies localizing…

Commutative Algebra · Mathematics 2026-05-20 Scott Balchin , Juan Omar Gómez , Greg Stevenson

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

Combinatorics · Mathematics 2019-05-23 Anshul Adve , Colleen Robichaux , Alexander Yong

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Logic · Mathematics 2025-10-17 Jeremy Beard , Marcos Mazari-Armida

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

Logic · Mathematics 2021-09-30 Jakub Gismatullin , Katarzyna Tarasek

We present an Avoidance Principle for certain graded rings. As an application we fill a gap in the proof of a result by Brodmann, Rohrer and Sazeedeh about the antipolynomiality of the Hilbert-Samuel multiplicity of the graded components of…

Commutative Algebra · Mathematics 2013-02-11 M. Brodmann , S. Kurmann , F. Rohrer

Let X be a smooth variety over $F_p$. Let E be a number field. For each nonarchimedean place $\lambda$ of E prime to p consider the set of isomorphism classes of irreducible lisse $\bar{E}_{\lambda}$-sheaves on X with determinant of finite…

Number Theory · Mathematics 2018-03-02 Vladimir Drinfeld

We prove a modularity lifting theorem for minimally ramified deformations of two-dimensional odd Galois representations, over an arbitrary number field. The main ingredient is a generalization of the Taylor-Wiles method in which we patch…

Number Theory · Mathematics 2013-07-05 David Hansen

Consider a finite-dimensional, complex Lie algebra G and a semi-simple automorphism {\alpha}. This note aims to give a short and simple proof for explicit upper bounds for the derived length of the radical R and the rank of a Levi…

Rings and Algebras · Mathematics 2015-12-08 Wolfgang Alexander Moens

Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently computable upper and lower bounds for the independence number,…

Rings and Algebras · Mathematics 2026-05-13 Marco Aldi , Thor Gabrielsen , Daniele Grandini , Joy Harris , Kyle Kelley

We introduce the notion of E-depth of graded modules over polynomial rings to measure the depth of certain Ext modules. First, we characterize graded modules over polynomial rings with (sufficiently) large E-depth as those modules whose…

Commutative Algebra · Mathematics 2020-10-20 Giulio Caviglia , Alessandro De Stefani

Over a field of characteristic $p>2,$ the first cohomology of the 3-dimensional simple Lie algebra $\frak{sl}(2)$ with coefficients in all simple modules is determined, which implies Whitehead's first lemma is not true in prime…

Representation Theory · Mathematics 2022-06-17 Shujuan Wang , Zhaoxin Li

The restriction of a supercuspidal representation of SL_2(k), for k a local nonarchimedean field, to a maximal compact subgroup decomposes as a multiplicity-free direct sum of irreducible representations. We explicitly describe this…

Representation Theory · Mathematics 2012-12-12 Monica Nevins

We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…

Classical Analysis and ODEs · Mathematics 2025-07-04 Jianhui Li , Tongou Yang

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…

Disordered Systems and Neural Networks · Physics 2015-06-05 Pol Colomer-de-Simon , Marian Boguna

Testing for pairwise independence for the case where the number of variables may be of the same size or even larger than the sample size has received increasing attention in the recent years. We contribute to this branch of the literature…

Statistics Theory · Mathematics 2024-09-18 Axel Bücher , Cambyse Pakzad

We make progress on some questions related to polynomial approximations of ${\rm AC}^0$. It is known, by works of Tarui (Theoret. Comput. Sci. 1993) and Beigel, Reingold, and Spielman (Proc. $6$th CCC, 1991), that any ${\rm AC}^0$ circuit…

Computational Complexity · Computer Science 2020-01-01 Prahladh Harsha , Srikanth Srinivasan