arXiv subjects

Pedro V. Silva

Publications and source records attributed to Pedro V. Silva.

At least 19 recordsLinked to original sources

arXiv2026

On fixed points and equalizers of injective endomorphisms of the free group at infinity

We study equalizers and fixed points of monomorphisms of free groups at infinity. We show that the action of the equalizer of two monomorphisms on the regular points of the equalizer at infinity has finitely many orbits, showing that the equalizer at infinity is, in some sense, finitely generated and generalizing a previous result of Cooper about fixed points. We additionally show that it is decidable whether an automorphism of a free group has a nontrivial fixed point at infinity. The same result is shown for monomorphisms satisfying the condition of being almost length-increasing. We remark that almost length-increasing monomorphisms are generic among endomorphisms of a free group. We also prove that being almost length-increasing is a decidable condition. We end the paper with several open problems arising from this work.

math.GR↗

arXiv2024

Geodesic languages for rational subsets and conjugates in virtually free groups

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements in a rational subset of a virtually free group is context-free. As a corollary, the doubly generalized conjugacy problem is decidable for rational subsets of finitely generated virtually free groups: there is an algorithm taking as input two rational subsets $K_1$ and $K_2$ of a virtually free group that decides whether there is one element of $K_1$ conjugate to an element of $K_2$. For free groups, we prove that the same problem is decidable with rational constraints on the set of conjugators.

math.GR↗

arXiv2023

On the pseudovariety of groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$

We introduce the pseudovariety of finite groups $\mathbf{U} = \displaystyle\bigvee_{p \in \mathbb{P}} {\bf Ab}(p) \ast {\bf Ab}(p-1)$, where $\mathbb{P}$ is the set of all primes. We show that $\mathbf{U}$ consists of all finite supersolvable groups with elementary abelian derived subgroup and abelian Sylow subgroups, being therefore decidable. We prove that it is decidable whether or not a finitely generated subgroup of a free group is closed or dense for the pro-${\bf U}$ topology. We consider also the pseudovariety of finite groups ${\bf Ab}(p) \ast {\bf Ab}(d)$ (where $p$ is a prime and $d$ divides $p-1$). We study the pro-$({\bf Ab}(p) \ast {\bf Ab}(d))$ topology on a free group and construct the unique generator of minimum size of the pseudovariety ${\bf Ab}(p) \ast {\bf Ab}(d)$. Finally, we prove that the variety of groups generated by ${\bf U}$ is the variety of all metabelian groups, obtaining also results on the varieties generated by a Baumslag-Solitar group of the form $BS(1,q)$ for $q$ prime.

math.GR↗

arXiv2023

Topics in Boolean Representable Simplicial Complexes

We study a number of topics in the theory of Boolean Representable Simplicial Complexes (BRSC). These include various operators on BRSC. We look at shellability in higher dimensions and propose a number of new conjectures.

math.CO↗

arXiv2023

On the closure of cyclic subgroups of a free group in pro-V topologies

We determine the closure of a cyclic subgroup $H$ of a free group for the pro-{\bf V} topology when {\bf V} is an extension-closed pseudovariety of finite groups. We show that $H$ is always closed for the pro-nilpotent topology and compute its closure for the pro-$\mathbf{G}_p$ and pro-$\mathbf{V}_p$ topologies, where $\mathbf{G}_p$ and $\mathbf{V}_p$ denote respectively the pseudovariety of finite $p$-groups and the pseudovariety of finite groups having a normal Sylow $p$-subgroup with quotient an abelian group of exponent dividing $p-1$. More generally, given any nonempty set $P$ of primes, we consider the pseudovariety $\mathbf{G}_P$ of all finite groups having order a product of primes in $P$.

math.GR↗

arXiv2023

The pro-supersolvable topology on a free group: deciding denseness

Let $F$ be a free group of arbitrary rank and let $H$ be a finitely generated subgroup of $F$. Given a pseudovariety $\mathbf{V}$ of finite groups, i.e. a class of finite groups closed under taking subgroups, quotients and finitary direct products, we endow $F$ with its pro-$\mathbf{V}$ topology. Our main result states that it is decidable whether $H$ is $\mathbf{Su}$-dense, where $\mathbf{Su}\subset \mathbf{S}$ denote respectively the pseudovarieties of all finite supersolvable groups and all finite solvable groups. Our motivation stems from the following open problem: is it decidable whether $H$ is $\mathbf{S}$-dense?

math.GR↗

arXiv2023

The pro-$k$-solvable topology on a free group

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian topology finitely generated? We show also that if the latter question has a positive answer, then we can effectively construct a basis for the closure, and the closure has decidable membership problem in any case. Moreover, it is decidable whether $H$ is closed for the pro-${\bf V}$ topology when ${\bf V}$ is an equational pseudovariety of finite groups, such as the pseudovariety ${\bf S}_k$ of all finite solvable groups with derived length $\leq k$. We also connect the pro-abelian topology with the topologies defined by abelian groups of bounded exponent.

math.GR↗

arXiv2022

Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs

We prove that the class of finitely presented inverse monoids whose Schützenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Schützenberger automata are context-free. On the other hand, we show that there is a finitely presented inverse monoid with hyperbolic Schützenberger graphs and an unsolvable word problem.

math.GR↗

arXiv2022

On the rational subsets of the monogenic free inverse monoid

We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid $F$. It is also decidable whether or not a rational subset of $F$ is recognizable. We prove that a submonoid of $F$ is rational if and only if it is finitely generated. We also prove that the membership problem for rational subsets of a finite $\mathcal{J}$-above monoid is decidable, covering the case of free inverse monoids.

math.GR↗

arXiv2022

Finitely presented inverse semigroups with finitely many idempotents in each $\mathcal D$-class and non-Hausdorff universal groupoids

The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^*$-algebras for inverse semigroups satisfying this condition that have a Hausdorff universal groupoid, or more generally for direct limits of inverse semigroups satisfying this condition and having Hausdorff universal groupoids. It is not difficult to see that a finitely presented inverse semigroup with a non-Hausdorff universal groupoid cannot be a direct limit of inverse semigroups with Hausdorff universal groupoids. We construct here countably many non-isomorphic finitely presented inverse semigroups with finitely many idempotents in each $\mathcal D$-class and non-Hausdorff universal groupoids. At this time there is not a clear $C^*$-algebraic technique to prove these inverse semigroups have stably finite complex algebras.

math.GR↗

arXiv2021

A tribute to Mario Petrich

This paper was written as a tribute to Mario Petrich, a major figure in the history of semigroup theory. Publication is posthumous in view of his recent death.

math.GR↗

arXiv2021

Holonomy theorem for finite semigroups

We provide a simple proof of the Holonomy Theorem using a new Lyndon-Chiswell length function on the Karnofsky-Rhodes expansion of a semigroup. Unexpectedly, we have both a left and a right action on the Chiswell tree by elliptic maps.

math.GR↗

arXiv2020

On the lattice of subgroups of a free group: complements and rank

A $\vee$-complement of a subgroup $H \leqslant \mathbb{F}_n$ is a subgroup $K \leqslant \mathbb{F}_n$ such that $H \vee K = \mathbb{F}_n$. If we also ask $K$ to have trivial intersection with $H$, then we say that $K$ is a $\oplus$-complement of $H$. The minimum possible rank of a $\vee$-complement (resp. $\oplus$-complement) of $H$ is called the $\vee$-corank (resp. $\oplus$-corank) of $H$. We use Stallings automata to study these notions and the relations between them. In particular, we characterize when complements exist, compute the $\vee$-corank, and provide language-theoretical descriptions of the sets of cyclic complements. Finally, we prove that the two notions of corank coincide on subgroups that admit cyclic complements of both kinds.

math.GR↗

arXiv2019

Eraser morphisms and membership problem in groups and monoids

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case, and show that it has decidable membership problem. We establish several algorithmic properties of the class of finite-${\cal{J}}$-above (inverse) monoids. We prove that the image of the eraser morphism in the free inverse monoid case (and more generally, in the finite-${\cal{J}}$-above case) has decidable membership problem, and relate its kernel to the free group fragile words.

math.GR↗

arXiv2019

Extensions of automorphisms of self-similar groups

In this work we study automorphisms of synchronous self-similar groups, the existence of extensions to automorphisms of the full group of automorphisms of the infinite rooted tree on which these groups act on. When they do exist, we obtain conditions for the continuity of such extensions with respect to the depth metric, but we also construct examples of groups where such extensions do not exist. We study the case of the lamplighter group $\mathcal{L}_k = \mathbb{Z}_k \wr \mathbb{Z}$

math.GR↗

arXiv2018

On finitely generated submonoids of virtually free groups

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups.

math.GR↗

arXiv2017

Local finiteness for Green's relations in semigroup varieties

A semigroup variety V is said to be locally K-finite, where K stands for any of Green's relations H, R, L, D, or J, if every finitely generated semigroup from V has only finitely many K-classes. We characterize locally K-finite varieties of finite axiomatic rank in the language of "forbidden objects".

math.GR↗

arXiv2017

On the Dowling and Rhodes lattices and wreath products

Dowling and Rhodes defined different lattices on the set of triples (Subset, Partition, Cross Section) over a fixed finite group G. Although the Rhodes lattice is not a geometric lattice, it defines a matroid in the sense of the theory of Boolean representable simplicial complexes. This turns out to be the direct sum of a complete matroid with a lift matroid of the complete biased graph over G. As is well known, the Dowling lattice defines the frame matroid over a similar biased graph. This gives a new perspective on both matroids and also an application of matroid theory to the theory of finite semigroups. We also make progress on an important question for these classical matroids: what are the minimal Boolean representations and the minimum degree of a Boolean matrix representation?

math.CO↗