Related papers: Multigraph limits, unbounded kernels, and Banach s…
The Kruskal-Katona theorem together with a theorem of Razborov determine the closure of the set of points defined by the homomorphism density of the edge and the triangle in finite graphs. The boundary of this region is a countable union of…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
This paper models the theory of abstract harmonic spaces in the syntax of the continuous first-order logic of Banach lattices. It addresses a topological question asking when a one-to-one harmonic map onto smooth manifolds $M^n$ is a…
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…
Countable projective limits of countable inductive limits, called PLB-spaces, of weighted Banach spaces of continuous functions have recently been investigated by Agethen, Bierstedt and Bonet. We extend their investigation to the case of…
Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…
We consider a random geometric graph model, where pairs of vertices are points in a metric space and edges are formed independently with fixed probability $p$ between pairs within threshold distance $\delta $. A countable dense set in a…
Given a Banach space we consider the $\sigma$-ideal of all of its subsets which are covered by countably many hyperplanes and investigate its standard cardinal characteristics as the additivity, the covering number, the uniformity, the…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We show that a bounded linear operator on a Banach space with closed range has range-kernel complementarity if and only if its generalized amplitude is less than $\pi$. An application to the strong convergence of the iterations of a bounded…
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…
In this short note, we give some new results on continuous bounded cohomology groups of topological semigroups with values in complex field. We show that the second continuous bounded cohomology group of a compact metrizable semigroup, is a…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We consider non-zero endomorphisms of the Dales and Davie algebras of infinitely differentiable functions on intervals in the real line. We discuss necessary and sufficient conditions for a selfmap of the interval to induce a compact…
Given a sequence of graphs $G_n$ and a fixed graph $H$, denote by $T(H, G_n)$ the number of monochromatic copies of the graph $H$ in a uniformly random $c$-coloring of the vertices of $G_n$. In this paper we study the joint distribution of…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
We define bounded cohomology of $t$-discrete measured groupoids with coefficients into measurable bundles of Banach spaces. Our approach via homological algebra extends the classic theory developed by Ivanov and by Monod. As a consequence,…