Related papers: On solid density of Cayley digraphs on finite Abel…
We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology…
The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…
Using probabilistic methods, we prove new rigidity results for groups and pseudo-groups of diffeomorphisms of one dimensional manifolds with intermediate regularity class ({\em i.e.} between $C^1$ and $C^2$). In particular, we demonstrate…
Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…
Let G be a locally compact Abelian group, and let X, Y be two open sets in G. We investigate the extremal constant C(X,Y) defined to be the supremum of integrals of functions f from the class F(X,Y), where F(X,Y) is the family of positive…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
We prove some finiteness results for discrete isometry groups $\Gamma$ of uniformly packed CAT$(0)$-spaces $X$ with uniformly bounded codiameter (up to group isomorphism), and for CAT$(0)$-orbispaces $M = \Gamma \backslash X$ (up to…
Let $\Gamma=(V,E)$ be a graph of order $n$. A {\em closed distance magic labeling} of $\Gamma$ is a bijection $\ell : V \to \{1,2, \ldots, n\}$ for which there exists a positive integer $r$ such that $\sum_{x \in N[u]} \ell(x) = r$ for all…
A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…
Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…
Sidorenko's conjecture asserts that every bipartite graph $H$ has the property that, for any host graph $G$, the homomorphism density from $H$ to $G$ is asymptotically at least as large as in a quasirandom graph with the same edge density…
Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…
We study the geometry of compact geodesic spaces with trivial first Betti number admitting large finite groups of isometries. We show that if a finite group $G$ acts by isometries on a compact geodesic space $X$ whose first Betti number…
We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…
In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…
The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We prove an entropy formula for certain expansive actions of a countable discrete residually finite group $\Gamma $ by automorphisms of compact abelian groups in terms of Fuglede-Kadison determinants. This extends an earlier result proved…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…