Related papers: The regularity lemma is false over small fields
We give a stability theoretic proof of the algebraic regularity lemma of Tao, making use of a lemma of Hrushovski. We also point out that the underlying results hold at the level of measurable theories and structures in the sense of Elwes,…
Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B. Szegedy: Szemer\'edi's Lemma for the analyst, Geometric…
A non-vanishing vacuum expectation value for an antisymmetric tensor field leads to the violation of Lorentz invariance on the brane. This violation is controlled by the $\theta_{\mu \nu}$ parameter, which has a dimension of inverse mass…
Stability and causality are investigated for quantum field theories incorporating Lorentz and CPT violation. Explicit calculations in the quadratic sector of a general renormalizable lagrangian for a massive fermion reveal that no…
We give a proof of Szemeredi's regularity lemma in the special case of a graph with bounded VC dimension and show that it is possible to obtain "merely" doubly exponential bounds on the size of the partition in this case.
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…
We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…
We study sparse hypergraphs which satisfy a mild pseudorandomness condition known as $L_p$ regularity. We prove appropriate regularity and counting lemmas, and we extend the relative removal lemma of Tao in this setting. This answers a…
Let $A$ be a real matrix. The term rank of $A$ is the smallest number $t$ of lines (that is, rows or columns) needed to cover all the nonzero entries of $A$. We prove a conjecture of Li et al. stating that, if the rank of $A$ exceeds $t-3$,…
We investigate the compatibility of Lorentz-violating quantum field theories with the requirements of causality and stability. A general renormalizable model for free massive fermions indicates that these requirements are satisfied at low…
We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…
This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force…
Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the…
Smooth solutions to the axially symmetric Navier-Stokes equations obey the following maximum principle:$\|ru_\theta(r,z,t)\|_{L^\infty}\leq\|ru_\theta(r,z,0)\|_{L^\infty}.$ We first prove the global regularity of solutions if…
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…
Let $f$ be a transcendental entire function. The fast escaping set $A(f)$, various regularity conditions on the growth of the maximum modulus of $f$, and also, more recently, the quite fast escaping set $Q(f)$ have all been used to make…
We prove a regularity lemma with respect to arbitrary Keisler measures mu on V, nu on W where the bipartite graph (V,W,R) is definable in a saturated structure M and the formula R(x,y) is stable. The proof is rather quick and uses local…
In this paper, we study the regularity assumptions commonly adopted in bilevel optimization with constrained lower-level problems, including the linear independence constraint qualification, the strict complementary slackness condition, and…
We obtain the law of large numbers (LLN) and the central limit theorem (CLT) for weakly dependent non-stationary arrays of random fields with asymptotically unbounded moments. The weak dependence condition for arrays of random fields is…