Related papers: Growth of regular partitions 2: Weak regularity

For graphs $G$ and $H$, let $G\to (H,H)$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ as a subgraph, and $\mathcal{H}(\Delta,n)=\{H:|V(H)|=n,\Delta(H)\le \Delta\}$. For fixed $\Delta$ and $n$, we say that $G$…

We develop a regularity and compactness theory for stable capillary minimal hypersurfaces in the half-space $\mathbb{H}^{n+1}$ with contact angle $\theta \in (0,\pi)$ and dimension $n \geq 2$. As a consequence, we obtain the generalized…

Dirac's classical theorem asserts that, for $n \ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, then, by the breakthrough work of Csaba,…

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$…

Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…

We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…

The "infamous upper tail problem" for $r$-uniform hypergraphs is to estimate the probability that the number of copies of a fixed hypergraph $H$ in a large binomial $r$-uniform hypergraph $\boldsymbol{G}$ exceeds its expectation by a…

We study partial regularity for nondegenerate parabolic systems of double phase type, where the growth function is given by $H(z,s)=s^p+a(z)s^q$, $z=(x,t)\in\Omega_T$, with $\tfrac{2n}{n+2}<p\le q$ and $a(z)$ a nonnegative…

Let $\{X, X_n, n\geq 1\}$ be a sequence of independent identically distributed non-degenerate random variables. Put $S_0=0, S_n = \sum^n_{i=1} X_i$ and $V_n^2=\sum^n_{i=1} X_i^2, n\ge 1.$ A weak convergence theorem is established for the…

Let $(M,g)$ be a smooth, compact, Riemannian manifold and $\{\phi_h\}$ a sequence of $L^2$-normalized Laplace eigenfunctions on $M$. For a smooth submanifold $H\subset M$, we consider the growth of the restricted eigenfunctions $\phi_h|_H$…

Recently we introduced the hypergraph matrix model (HMM), a Hermitian matrix model generalizing the classical Gaussian Unitary Ensemble (GUE). In this model the Gaussians of the GUE, whose moments count partitions of finite sets into pairs,…

The purpose of this article is twofold. First, an issue of regularity of weak solution to the problem $(P)$ (See below) is addressed. Secondly, we investigate the question of $H^s$ versus $C^0$- weighted minimizers of the functional…

This paper studies the regularity of weak solutions to a class of parabolic perturbed fractional $1$-Laplace equations. Our analysis combines finite difference quotients, energy estimates, and iterative arguments, with a key step being the…

L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…

The concept of a hyperuniformity disorder length $h$ was recently introduced for analyzing volume fraction fluctuations for a set of measuring windows. This length permits a direct connection to the nature of disorder in the spatial…

Let $H$ be an $r$-uniform hypergraph on $n$ vertices and $m$ edges, and let $d_i$ be the degree of $i\in V(H)$. Denote by $\varepsilon(H)$ the difference of the spectral radius of $H$ and the average degree of $H$. Also, denote \[…

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…

This paper formalises the concepts of weakly and weakly regularly persistent input trajectory as well as their link to the Observability Grammian and the existence and uniqueness of solutions of Moving Horizon Estimation (MHE) problems.…

By using the Szemer\'edi Regularity Lemma, Alon and Sudakov recently extended the classical Andr\'asfai-Erd\~os-S\'os theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is…