Related papers: Uniform hyperfiniteness
The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…
We give a survey of the known connections between regularity conditions and amenability conditions in the setting of uniform algebras. For a uniform algebra $A$ we consider the set, $A_{lc}$, of functions in $A$ which are locally constant…
We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes' Embedding Conjecture as well as the Measurable Determinant Conjecture of L\"uck, Sauer and Wegner hold for treeable equivalence relations.
A group $\Gamma$ is said to be uniformly HS stable if any map $\varphi : \Gamma \to U(n)$ that is almost a unitary representation (w.r.t. the Hilbert Schmidt norm) is close to a genuine unitary representation of the same dimension. We…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
We examine the correspondence between the various notions of quasirandomness for k-uniform hypergraphs and sigma-algebras related to measurable hypergraphs. This gives a uniform formulation of most of the notions of quasirandomness for…
We introduce the notion of hyperfiniteness for permutation actions of countable groups on countable sets and give a geometric and analytic characterization, similar to the known characterizations for amenable actions. We also answer a…
Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…
Recently, the first author with A. Ardehali, M. Lemos, and L. Rastelli introduced the notion of graded unitarity for vertex algebras. This generalization of unitarity is motivated by the SCFT/VOA correspondence and introduces a novel…
We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…
Power-law uniform (in the operator norm) convergence on vector subspaces with their own norms in von Neumann's ergodic theorem with continuous time is considered. All possible exponents of the considered power-law convergence are found; for…
In this paper it is shown that if $\mu$ is an n-dimensional Ahlfors-David regular measure in $R^d$ which satisfies the so-called weak constant density condition, then $\mu$ is uniformly rectifiable. This had already been proved by David and…
Generalizing Block and Weinberger's characterization of amenability we introduce the notion of uniformly finite homology for a group action on a compact space and use it to give a homological characterization of topological amenability for…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…
A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…
A uniform space $X$ is said to be proximally fine if every proximally continuous map on $X$ into a uniform is uniformly continuous. We supply a proof that every topological group which is functionnaly generated by its precompact subsets is…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
The last decade has seen the development of path homology and magnitude homology -- two homology theories of directed graphs, each satisfying classic properties such as Kunneth and Mayer-Vietoris theorems. Recent work of Asao has shown that…