English
Related papers

Related papers: The regularity lemma is false over small fields

200 papers

We present a simple solution to a question posed by Candes, Romberg and Tao on the uniform uncertainty principle for Bernoulli random matrices. More precisely, we show that a rectangular k*n random subgaussian matrix (with k < n) has the…

Statistics Theory · Mathematics 2007-06-13 Shahar Mendelson , Alain Pajor , Nicole Tomczak-Jaegermann

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

Computational Complexity · Computer Science 2023-06-22 Per Austrin , Kilian Risse

The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…

Information Theory · Computer Science 2016-11-15 Yu Tsunoda , Yuichiro Fujiwara

We give a necessary and sufficient geometric structural condition for a stable codimension 1 integral varifold on a smooth Riemannian manifold to correspond to an embedded smooth hypersurface away from a small set of generally unavoidable…

Differential Geometry · Mathematics 2013-01-11 Neshan Wickramasekera

Let $M$ be an $n \times m$ matrix of independent Rademacher ($\pm 1$) random variables. It is well known that if $n \leq m$, then $M$ is of full rank with high probability. We show that this property is resilient to adversarial changes to…

Combinatorics · Mathematics 2021-07-01 Asaf Ferber , Kyle Luh , Gweneth McKinley

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

Data Structures and Algorithms · Computer Science 2025-04-28 Jeshu Dastidar , Tait Weicht , Alexander S. Wein

Low rank regularization, in essence, involves introducing a low rank or approximately low rank assumption for matrix we aim to learn, which has achieved great success in many fields including machine learning, data mining and computer…

Computer Vision and Pattern Recognition · Computer Science 2020-12-11 Zhanxuan Hu , Feiping Nie , Rong Wang , Xuelong Li

In this paper, we consider the singular values and singular vectors of low rank perturbations of large rectangular random matrices, in the regime the matrix is "long": we allow the number of rows (columns) to grow polynomially in the number…

Probability · Mathematics 2021-10-22 Gérard Ben Arous , Daniel Zhengyu Huang , Jiaoyang Huang

An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \in 2..n, i \le i+y[i] \le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater…

Discrete Mathematics · Computer Science 2014-06-13 Manolis Christodoulakis , P. J. Ryan , W. F. Smyth , Shu Wang

The possibility of physics beyond the standard model is studied. The requirement of finiteness of the zero point energy density and pressure or the requirement of the Lorentz invariance of the zero point stress-energy tensor in Minkowski…

High Energy Physics - Phenomenology · Physics 2019-08-02 Damian Ejlli

The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap…

Quantum Physics · Physics 2025-03-03 Andreas Klingler , Tim Netzer , Gemma De les Coves

In a recent work, Allen, B\"{o}ttcher, H\`{a}n, Kohayakawa, and Person provided a first general analogue of the blow-up lemma applicable to sparse (pseudo)random graphs thus generalising the classic tool of Koml\'{o}s, S\'{a}rk\"{o}zy, and…

Combinatorics · Mathematics 2021-11-18 Miloš Trujić

We study the consistency of having Lorentz invariance as a low energy approximation within the quantum field theory framework. A model with a scalar and a fermion field is used to show how a Lorentz invariance violating high momentum scale,…

High Energy Physics - Theory · Physics 2017-06-05 J. L. Cortes , J. Lopez-Sarrion

We give an indication that gravity coupled to an infinite number of fields might be a renormalizable theory. A toy model with an infinite number of interacting fermions in four-dimentional space-time is analyzed. The model is finite at any…

High Energy Physics - Theory · Physics 2009-10-28 N. Itzhaki

The Recurrence Axiom for a class $\mathcal{P}$ of \pos\ and a set $A$ of parameters is an axiom scheme in the language of ZFC asserting that if a statement with parameters from $A$ is forced by a poset in $\mathcal{P}$, then there is a…

Logic · Mathematics 2025-06-24 Sakaé Fuchino , Toshimichi Usuba

We analyse the so-called Marginal Instability of linear switching systems, both in continuous and discrete time. This is a phenomenon of unboundedness of trajectories when the Lyapunov exponent is zero. We disprove two recent conjectures of…

Dynamical Systems · Mathematics 2014-11-04 Vladimir Y. Protasov , Raphael M. Jungers

Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…

Statistical Mechanics · Physics 2009-07-14 A. Y. Abul-Magd

We consider the question of linear instability of an equilibrium of the Relativistic Vlasov-Maxwell (RVM) System that has a strong magnetic field. Standard instability results deal with systems where there are fewer particles with higher…

Mathematical Physics · Physics 2015-05-19 Jonathan Ben-Artzi

We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…

Optimization and Control · Mathematics 2018-05-15 Alexander Y. Kruger , D. Russell Luke , Nguyen H. Thao

Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…

History and Philosophy of Physics · Physics 2013-06-26 James D. Wells
‹ Prev 1 4 5 6 7 8 10 Next ›