Related papers: Uniform hyperfiniteness

In this note we prove that if a finitely generated amenable group admits a regular map to a direct product of a hyperbolic space and a euclidean space, then it must be virtually nilpotent. We deduce that an amenable group regularly embeds…

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…

We show that the big Ramsey degrees of every countable universal $u$-uniform $\omega$-edge-labeled hypergraph are infinite for every $u\geq 2$. Together with a recent result of Braunfeld, Chodounsk\'y, de Rancourt, Hubi\v{c}ka, Kawach, and…

We investigate unitarisability of groups by looking at actions on the cone of positive invertible operators of a Hilbert space. This way, we give a geometric prove to a result by Gilles Pisier on the existence of some universal constants…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

Let K be a fine hyperbolic graph and G be a group acting on K with finite quotient. We prove that G is exact provided that all vertex stabilizers are exact. In particular, a relatively hyperbolic group is exact if all its peripheral groups…

We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…

An embedding $i \mapsto p_i\in \mathbb{R}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mathbb{R}^{k}$ satisfying $q_i^T q_j = p_i^T p_j$ for $i = j$…

A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph…

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…

Consider a simple locally finite hypergraph on a countable vertex set, where each edge represents one unit of load which should be distributed among the vertices defining the edge. An allocation of load is called balanced if load cannot be…

A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…

Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…

A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…

In this paper, we study degree conditions for the existence of large matchings in uniform hypergraphs. We prove that for integers $k,l,n$ with $k\ge 3$, $k/2<l<k$, and $n$ large, if $H$ is a $k$-uniform hypergraph on $n$ vertices and…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-uniform hypergraphs, such as email networks and co-authorship…