Automorphisms and Some Geodesic Properties of Ortho-Grassmann Graphs

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they are compatible and adjacent (the corresponding rank-$k$ projections commute and their difference is an operator of rank $2$). Our main result is the following: if $\dim H\ne 2k$, then every automorphism of $\Gamma^{\perp}_{k}(H)$ is induced by a unitary or anti-unitary operator; if $\dim H=2k\ge 6$, then every automorphism of $\Gamma^{\perp}_{k}(H)$ is induced by a unitary or anti-unitary operator or it is the composition of such an automorphism and the orthocomplementary map. For the case when $\dim H=2k=4$ the statement fails. To prove this statement we compare geodesics of length two in ortho-Grassmann graphs and characterise compatibility (commutativity) in terms of geodesics in Grassmann and ortho-Grassmann graphs. At the end, we extend this result on generalised ortho-Grassmann graphs associated to conjugacy classes of finite-rank self-adjoint operators.

Finitely generated subgroups of free groups as formal languages and their cogrowth

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

Finitely generated subgroups of free groups as formal languages and their cogrowth

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the minimal deterministic finite automaton that recognizes $L_H$. Then we characterize the f.g. subgroups $H$ for which $L_H$ is irreducible and for such groups explicitly construct ergodic automaton that recognizes $L_H$. This construction gives us an efficient way to compute the cogrowth series $L_H(z)$ of $H$ and entropy of $L_H$. Several examples illustrate the method and a comparison is made with the method of calculation of $L_H(z)$ based on the use of Nielsen system of generators of $H$.

Folding-like techniques for CAT(0) cube complexes

In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings’s methods allow one to construct this representation algorithmically, giving effective, algorithmic answers and proofs to classical questions about subgroups of free groups. Recently Dani–Levcovitz used Stallings-like methods to study subgroups of right-angled Coxeter groups, which act geometrically on CAT(0) cube complexes. In this paper we extend their techniques to fundamental groups of non-positively curved cube complexes.

Separately polynomial functions

It is known that if $$f:{{\mathbb R}}^2\rightarrow {\mathbb R}$$ f : R 2 → R is a polynomial in each variable, then f is a polynomial. We present generalizations of this fact, when $${{\mathbb R}}^2$$ R 2 is replaced by $$G\times H$$ G × H , where G and H are topological Abelian groups. We show, e.g., that the conclusion holds (with generalized polynomials in place of polynomials) if G is a connected Baire space and H has a dense subgroup of finite rank or, for continuous functions, if G and H are connected Baire spaces. The condition of continuity can be omitted if G and H are locally compact or one of them is metrizable. We present several examples showing that the results are not far from being optimal.