Related papers: A note on lower bounds for arithmetic regularity p…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
A partition of a (hyper)graph is $\varepsilon$-homogenous if the edge densities between almost all clusters are either at most $\varepsilon$ or at least $1-\varepsilon$. Suppose a $3$-graph has the property that the link of every vertex has…
When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…
Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…
A partial regularity theorem is presented for minimisers of $k$th-order functionals subject to a quasiconvexity and general growth condition. We will assume a natural growth condition governed by an $N$-function satisfying the $\Delta_2$…
In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…
In this paper we present a new proof of the sufficiency theorem for strong local minimizers concerning $C^1$-extremals at which the second variation is strictly positive. The results are presented in the quasiconvex setting, in accordance…
The purpose of this paper is twofold. One is to enrich from a geometrical point of view the theory of octonionic slice regular functions. We first prove a boundary Schwarz lemma for slice regular self-mappings of the open unit ball of the…
We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…
We prove boundary H\"older and Lipschitz regularity for a class of degenerate elliptic, second order, inhomogeneous equations in non-divergence form structured on the left-invariant vector fields of the Heisenberg group. Our focus is on the…
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…
In this paper, we establish an $\varepsilon$-regularity theorem for minimizers of an Alt-Phillips type functional subject to constraint maps. We prove that under sufficiently small energy, the minimizers exhibit regularity, and hence…
In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our…
It is shown that the order and the lower order of growth are equal for all non-trivial solutions of $f^{(k)}+A f=0$ if and only if the coefficient $A$ is analytic in the unit disc and $\log^+ M(r,A)/\log(1-r)$ tends to a finite limit as…
We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…
Let $X$ be an inner product space, let $G$ be a group of orthogonal transformations of $X$, and let $R$ be a bounded $G$-stable subset of $X$. We define very weak and very strong regularity for such pairs $(R,G)$ (in the sense of…
Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…
We show that if $f : \mathbb{A}_{\bar{\mathbb{Q}}}^r \to \mathbb{A}_{\bar{\mathbb{Q}}}^r$ is a regular self-map and $P \in \mathbb{A}^r(\bar{\mathbb{Q}})$ has $\limsup_{n \in \mathbb{N}} \frac{\log{h_{\mathrm{aff}}(f^nP)}}{\log{n}} < 1/r$,…
Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…
We establish maximal local regularity results of weak solutions or local minimizers of \[ \operatorname{div} A(x, Du)=0 \quad\text{and}\quad \min_u \int_\Omega F(x,Du)\,dx, \] providing new ellipticity and continuity assumptions on $A$ or…