Related papers: Regularity lemmas in a Banach space setting
We provide regularity of solutions to a large class of evolution equations on Banach spaces where the generator is composed of a static principal part plus a non-autonomous perturbation. Regularity is examined with respect to the graph norm…
Let $D\subset\mathbb C^n$ be a bounded, strongly pseudoconvex domain whose boundary $bD$ satisfies the minimal regularity condition of class $C^2$. A 2017 result of Lanzani \& Stein states that the Cauchy--Szeg\"{o} projection $S_\omega$…
This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szem\'eredi's Regularity Lemma plays a central role. We also investigate the robust outexpansion property for digraphs. Kelly showed that…
Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…
The main purpose of this paper is to develop some methods to investigate the Schwarz type lemmas of holomorphic mappings and pluriharmonic mappings in Banach spaces. Initially, we extend the classical Schwarz lemmas of holomorphic mappings…
There have been, over the last 8 years, a number of far reaching extensions of the famous original F. and M. Riesz's uniqueness theorem that states that if a bounded analytic function in the unit disc of the complex plane $\Bbb C$ has the…
Many important theorems in combinatorics, such as Szemer\'edi's theorem on arithmetic progressions and the Erd\H{o}s-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In…
F.-H. Lin studied minimal graphs of the Dirichlet problem in the hyperbolic space and proved that any such minimal graph has the same global regularity as the boundary if the dimension of the minimal graph is even and that there is an…
We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…
We establish a regularity result for the metric on any 4-dimensional extremal K\"ahler manifold, and a weak compactness theorem on the space of such metrics. Specifically, the sectional curvature at a point is bounded when the quantity…
We study the asymptotic behaviour of Betti numbers, twisted torsion and other spectral invariants of sequences of locally symmetric spaces. Our main results are uniform versions of the DeGeorge--Wallach Theorem, of a theorem of Delorme and…
A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…
Metric regularity has emerged during last 2-3 decades as one of the central concepts of variational analysis. The roots of this concept go back to a circle of fundamental regularity ideas of classical analysis embodied in such results as…
A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…
To describe a set of functions, which forms a reflexive subspace B of the classical Banach space L a special function that characterizes their average integral growth is introduced. It is shown that this function essentially depends on the…
We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for…
The primary objective of this paper is to develop methodologies for investigating Schwarz type lemmas and to present their applications in Banach spaces. First, we improve upon the main results obtained by Osserman [Proc. Am. Math. Soc.…
Finding the stability number of a graph, i.e., the maximum number of vertices of which no two are adjacent, is a well known NP-hard combinatorial optimization problem. Since this problem has several applications in real life, there is need…
We investigate a random geometric graph model introduced by Bonato and Janssen. The vertices are the points of a countable dense set $S$ in a (necessarily separable) normed vector space $X$, and each pair of points are joined independently…
We prove an optimal result of stability under $\ell_p$-sums of some concentration properties for Lipschitz maps defined on Hamming graphs into Banach spaces. As an application, we give examples of spaces with Szlenk index arbitrarily high…