English
Related papers

Related papers: The regularity lemma is false over small fields

200 papers

The regularity of the Rees ring of the edge ideal of a finite simple graph is studied. We show that the matching number is a lower and matching number~$+1$ is an upper bound of the regularity, if the Rees algebra is normal. In general the…

Commutative Algebra · Mathematics 2019-05-07 Jürgen Herzog , Takayuki Hibi

We explore the phenomenology of a stabilized modulus field in the Randall-Sundrum scenario. It is found that if the large separation between branes arises from a small bulk scalar mass then the modulus (i.e. radion) is likely to be lighter…

High Energy Physics - Phenomenology · Physics 2011-05-05 Walter D. Goldberger , Mark B. Wise

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

We argue that the study of the statistics of the landscape of string vacua provides the first potentially predictive -- and also falsifiable -- framework for string theory. The question of whether the theory does or does not predict low…

High Energy Physics - Theory · Physics 2017-08-23 Michael Dine

The regularity theory of the Campanato space $\mathcal{L}^{(q,\lambda)}_k(\Omega)$ has found many applications within the regularity theory of solutions to various geometric variational problems. Here we extend this theory from…

Differential Geometry · Mathematics 2022-10-13 Paul Minter

The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…

Numerical Analysis · Mathematics 2024-12-20 Ilse C. F. Ipsen , Arvind K. Saibaba

We show how a class of multi-field scalar-field theories in a Lorentz-breaking background imposes consistency conditions on its effective theory of a single field and provides an example of order-unity violation of a naively applied…

High Energy Physics - Theory · Physics 2021-11-03 Katsuki Aoki , Shinji Mukohyama , Ryo Namba

The continuum limit and scaling properties of an asymptotically free field theory regularized on a random lattice are compared with those on a regular square lattice. We work on random lattices parametrized by a degree of ``randomness''…

High Energy Physics - Lattice · Physics 2009-10-22 B. Alles , M. Beccaria , L. Del Debbio , R. Del Real

We give a mechanical example concerning the fact that some regularity is necessary in KAM theory. We consider the model given by the vertical bouncing motion of a ball on a periodically moving plate. Denoting with $f$ the motion of the…

Dynamical Systems · Mathematics 2020-04-22 Stefano Marò

Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we…

Machine Learning · Computer Science 2017-11-03 Morteza Ashraphijuo , Xiaodong Wang , Vaneet Aggarwal

Random matrix theory (RMT) provides a successful model for quantum systems, whose classical counterpart has a chaotic dynamics. It is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Last decade witnessed…

Chaotic Dynamics · Physics 2011-09-27 A. Y. Abul-Magd

Mathematical inequalities, combined with atomic-physics sum rules, enable one to derive lower and upper bounds for the Rosseland and/or Planck mean opacities. The resulting constraints must be satisfied, either for pure elements or…

Atomic Physics · Physics 2023-11-17 Jean-Christophe Pain , Patricia Croset

If Lorentz symmetry is broken, it must have occurred dynamically, via a vector or tensor field whose potential energy forces it to take on a non-zero background expectation value "in vacuum". If the set of minima of this potential (the…

High Energy Physics - Theory · Physics 2017-08-23 Michael D. Seifert

Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ with many more rows…

Machine Learning · Computer Science 2024-12-10 Gregory Dexter , Christos Boutsikas , Linkai Ma , Ilse C. F. Ipsen , Petros Drineas

We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…

Commutative Algebra · Mathematics 2013-08-28 Giulio Caviglia , Matteo Varbaro

We consider sets of reals $X$ endowed with the Sorgenfrey lower limit topology denoted $X[\leq]$. Przymusi\'nski proved that if $X$ is a $Q$-set then $(X[\leq])^2$ is normal. While the converse is not in general true we consider examples of…

General Topology · Mathematics 2026-04-22 Paul Szeptycki , Hongwei Wen

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

Number Theory · Mathematics 2020-10-13 Faustin Adiceam , Erez Nesharim , Fred Lunnon

We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…

Combinatorics · Mathematics 2010-11-08 Peter Keevash

We prove a regularity theorem for harmonic maps into Teichm\"uller space. More specifically, if $u$ is a harmonic map from a Riemannian domain to the metric completion of Teichm\"uller space with respect to the Weil-Petersson metric, and…

Differential Geometry · Mathematics 2025-09-09 Yitong Sun

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…

Computational Complexity · Computer Science 2009-02-13 Kenya Ueno