Related papers: Regularity lemmas in a Banach space setting
The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Let $D\subset\mathbb C^n$ be a bounded, strongly pseudoconvex domain whose boundary $bD$ satisfies the minimal regularity condition of class $C^2$, and let $S_\omega$ denote the Cauchy--Szeg\H{o} projection defined with respect to (any)…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…
We propose a new proof technique that aims to be applied to the same problems as the Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve…
Let $\mathcal{B} (X)$ be the algebra of all bounded linear operators on an infinite-dimensional complex Banach space $X$. In this note, we show that a lemma used in the proof of the main result of [ Taghavi and Hosseinzadeh, linear and…
In this paper, we study a class of Banach spaces, called \phi-spaces. In a natural way, we associate a measure of weak compactness in such spaces and prove an analogue of Sadovskii fixed point theorem for weakly sequentially continuous…
We prove a version of Szemeredi's regularity lemma for subsets of a typical random set in F_p^n. As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.
In this paper, we study different kinds of normal properties for infinite system of arbitrarily many convex sets in a Banach space and provide the dual characterization for the normal property in terms of the extended Jamenson property for…
In this paper we investigate the extent to which the Lov\'asz Local Lemma (an important tool in probabilistic combinatorics) can be adapted for the measurable setting. In most applications, the Lov\'asz Local Lemma is used to produce a…
The regularity lemma is a stringent condition of the possible ranks of tensor blow-ups of linear subspaces of matrices. It was proved by Ivanyos, Qiao and Subrahmanyam when the underlying field is sufficiently large. We show that if the…
The recently developed notion of action convergence by Backhausz and Szegedy unifies and generalises the dense (graphon) and local-global (graphing) convergences of graph sequences. This is done through viewing graphs as operators and…
In \cite{K3} we pointed out the correspondence between a result of Shelah in model theory, i.e. a theory is unstable if and only if it has IP or SOP, and the well known compactness theorem of Eberlein and \v{S}mulian in functional analysis.…
Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…
In this paper, we prove the existence of fixed points of mappings satisfying the condition (Da), a kind of generalized nonexpansive mappings, on a weakly compact convex subset in a Banach space satisfying Opial's condition. And we use…
We consider random linear continuous operators $\Omega \to \mathcal{L}(\mathcal{X}, \mathcal{X})$ on a Banach space $\mathcal{X}$. For example, such random operators may be random quantum channels. The Law of Large Numbers is known when…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
We study the structure of the space of coarse Lipschitz maps between Banach spaces. In particular we introduce the notion of norm attaining coarse Lipschitz maps. We extend to the case of norm attaining coarse Lipschitz equivalences, a…
Statistical inverse learning theory, a field that lies at the intersection of inverse problems and statistical learning, has lately gained more and more attention. In an effort to steer this interplay more towards the variational…