arXiv subjects

Michal Ferov

Publications and source records attributed to Michal Ferov.

14 recordsLinked to original sources

arXiv2026

The Scale of ($P$)-closed Groups Acting On Trees

Reid--Smith parametrised ($P$)-closed groups acting on trees using graph-based combinatorial structures known as local action diagrams. Properties of the acting (topological) group, such as being locally compact, compactly generated, discrete or simple, are reflected in its local action diagram. In this article, we describe the translations of ($P$)-closed groups and their axes in terms of local action diagrams. As applications, we determine the scale function of ($P$)-closed groups and characterise unimodular as well as uniscalar ($P$)-closed groups. The latter provides one possible answer to a question of Thomas Weigel.

math.GR↗

arXiv2024

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗

arXiv2023

Bounding conjugacy depth functions for wreath products of finitely generated abelian groups

In this article, we study the asymptotic behaviour of conjugacy separability for wreath products of abelian groups. We fully characterise the asymptotic class in the case of lamplighter groups and give exponential upper and lower bounds for generalised lamplighter groups. In the case where the base group is infinite, we give superexponential lower and upper bounds. We apply our results to obtain lower bounds for conjugacy depth functions of various wreath products of groups where the acting group is not abelian.

math.GR↗

arXiv2023

On the non-discreteness of automorphism groups of Cayley graphs of Coxeter groups

In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the automorphism group of their Cayley graph with respect to the standard generating set is not discrete when equipped with the permutation topology. As an application, we also provide new explicit constructions of vertex-transitive graphs of infinite degree that have locally compact automorphism groups.

math.GR↗

arXiv2023

Conjugacy depth function for generalised lamplighter groups

In this article, we completely characterize the asymptotic behavior of conjugacy separability for the lamplighter groups. More generally, we give exponential upper and lower bounds for all wreath products of finitely generated abelian groups where the acting group is infinite and base group is finite.

math.GR↗

arXiv2022

Quantifying conjugacy separability in wreath products of groups

We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy separability of $A$ and $B$, the growth of $\mathcal{C}$-cyclic subgroup separability of $B$, and the $\mathcal{C}$-residual girth of $B.$ As an application, we provide a characterisation of when $A \wr B$ is $p$-conjugacy separable. We use this characterisation to the provide for each prime $p$ an example of wreath products with infinite base group that are $p$-conjugacy separable. We also provide asymptotic upper bounds for conjugacy separability for wreath products of nilpotent groups which include the lamplighter groups and provide asymptotic upper bounds for conjugacy separability of the free metabelian groups. Along the way, we provide a polynomial upper bound for the shortest conjugator between two elements of length at most $n$ in a finitely generated nilpotent group.

math.GR↗

arXiv2022

Survey on effective separability

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is related to algorithmic problems in groups such as the word problem. A more recent perspective tries to study the order of the smallest finite quotient in which one detects the subset under consideration depending on its complexity, measured using the word norm on a finitely generated group. In this survey, we present what is currently known in the field of effective separability and give an overview of the open questions for several classes of groups.

math.GR↗

arXiv2020

Density of Metric Small Cancellation in Finitely Presented Groups

Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no information about "small" group presentations. In this note, we give closed-form formulas for both lower and upper bounds on the density of small cancellation presentations, and compare our results with experimental data.

math.GR↗

arXiv2019

Separating cyclic subgroups in graph products of groups

We prove that the property of being cyclic subgroup separable, that is having all cyclic subgroups closed in the profinite topology, is preserved under forming graph products. Furthermore, we develop the tools to study the analogous question in the pro-$p$ case. For a wide class of groups we show that the relevant cyclic subgroups - which are called $p$-isolated - are closed in the pro-$p$ topology of the graph product. In particular, we show that every $p$-isolated cyclic subgroup of a right-angled Artin group is closed in the pro-$p$ topology, and we fully characterise such subgroups.

math.GR↗

arXiv2018

Applications of L systems to group theory

L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages. In this paper we show that many of the languages naturally appearing in group theory, and that were known to be indexed or context-sensitive, are in fact ET0L and in many cases EDT0L. For instance, the language of primitives in the free group on two generators, the Bridson-Gilman normal forms for the fundamental groups of 3-manifolds or orbifolds, and the co-word problem of Grigorchuk's group can be generated by L systems. To complement the result on primitives in free groups, we show that the language of primitives, and primitive sets, in free groups of rank higher than two is context-sensitive. We also show the existence of EDT0L and ET0L languages of intermediate growth.

math.GR↗

arXiv2016

Separability properties of automorphisms of graph products of groups

We study properties of automorphisms of graph products of groups. We show that graph product $Γ\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has non-trivial pointwise inner automorphisms. We use this result to study residual finiteness of $\mathop{Out}(Γ\mathcal{G})$. We show that if all vertex groups are finitely generated residually finite and the vertex groups corresponding to central vertices satisfy certain technical (yet natural) condition, then $\mathop{Out}(Γ\mathcal{G})$ is residually finite. Finally, we generalise this result to graph products of residually $p$-finite groups to show that if $Γ\mathcal{G}$ is a graph product of finitely generated residually $p$-finite groups such that the vertex groups corresponding to central vertices satisfy the $p$-version of the technical condition then $\mathop{Out}(Γ\mathcal{G})$ is virtually residually $p$-finite. We use this result to prove bi-orderability of Torreli groups of some graph products of finitely generated residually torsion-free nilpotent groups.

math.GR↗

arXiv2016

Enhancing LambdaMART Using Oblivious Trees

Learning to rank is a machine learning technique broadly used in many areas such as document retrieval, collaborative filtering or question answering. We present experimental results which suggest that the performance of the current state-of-the-art learning to rank algorithm LambdaMART, when used for document retrieval for search engines, can be improved if standard regression trees are replaced by oblivious trees. This paper provides a comparison of both variants and our results demonstrate that the use of oblivious trees can improve the performance by more than $2.2\%$. Additional experimental analysis of the influence of a number of features and of a size of the training set is also provided and confirms the desirability of properties of oblivious decision trees.

cs.IR↗

arXiv2015

Residual properties of graph products of groups

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local embeddability into various classes of groups is stable under graph products. In particular, we prove that graph products of residually amenable groups are residually amenable, and that locally embeddable into amenable groups are closed under taking graph products.

math.GR↗

arXiv2015

On conjugacy separability of graph products of groups

We show that the class of $\mathcal{C}$-hereditarily conjugacy separable groups is closed under taking arbitrary graph products whenever the class $\mathcal{C}$ is an extension closed variety of finite groups. As a consequence we show that the class of $\mathcal{C}$-conjugacy separable groups is closed under taking arbitrary graph products. In particular, we show that right angled Coxeter groups are hereditarily conjugacy separable and 2-hereditarily conjugacy separable, and we show that infinitely generated right angled Artin groups are hereditarily conjugacy separable and $p$-hereditarily conjugacy separable for every prime number $p$.

math.GR↗