Related papers: Groups acting on quasi-median graphs. An introduct…
The notion of quasi-unit has been introduced by Yosida in unital Riesz spaces. Later on, a fruitful potential theoretic generalization was obtained by Arsove and Leutwiler. Due to the work of Eriksson and Leutwiler, this notion also turned…
The variety of quasigroups satisfying the identity $(xy)(zy)=xz$ mirrors the variety of groups, and offers a new look at groups and their multiplication tables. Such quasigroups are constructed from a group using right division instead of…
In \cite{BK02}, M. Bonk and B. Kleiner proved a rigidity theorem for expanding quasi-M\"obius group actions on Ahlfors $n$-regular metric spaces with topological dimension $n$. This led naturally to a rigidity result for quasi-convex…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
Loop groups G as families of mappings of the complex manifold M into another complex manifold N preserving marked points $s_0\in M$ and $y_0\in N$ are investigated. Quasi-invariant measures $\mu $ on G relative to dense subgroups $G'$ are…
We study the large-scale geometry of graph braid groups $\mathbb{B}_n(\mathsf{\Gamma})$, viewed as the fundamental groups of discrete configuration spaces $UD_n(\mathsf{\Gamma})$, which are special cube complexes in the sense of…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
It is shown that the middle quasi-homomorphisms of Fujiwara and Kapovich are precisely constant perturbations of quasi-homomorphisms. Quasi-polynomial maps are defined and their constructibility is explored. In particular, it is shown that…
This paper overviews recent developments in the classification up to quasi-isometry of finitely generated groups, and more specifically of relatively hyperbolic groups.
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. Unlike chordal graphs, chordal digraphs lack many structural properties…
The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…
These are lecture notes for a minicourse on group actions on injective spaces and Helly graphs, given at the CRM Montreal in June 2023. We review the basics of injective metric spaces and Helly graphs, emphasizing the parallel between the…
The notion of nearly abelian rational semigroup was introduced by Hinkannen and Martin. In this paper, we have introduced the notion of nearly abelian transcendental semigroup. We have extended the results of nearly abelian rational…
The article is devoted to linear quasigroups and some of their generalizations. In the first part main definitions and notions of the theory of quasigroups are given. In the second part some elementary properties of linear quasigroups and…
Crystal graphs are powerful combinatorial tools for working with the plactic monoid and symmetric functions. Quasi-crystal graphs are an analogous concept for the hypoplactic monoid and quasi-symmetric functions. This paper makes a…
We develop the foundations of the theory of quasi-visual approximations of bounded metric spaces. Roughly speaking, these are sequences of covers of a given space for which the diameters of the sets in the covers shrink to zero and for…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…