Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Daniele D'Angeli"'
Publikováno v:
International Journal of Group Theory, Vol 12, Iss 2, Pp 55-66 (2023)
Graph automaton groups constitute a special class of automaton groups constructed from a graph. In this paper, we show that the action of any graph automaton group on each level of the rooted regular tree gives rise to a Gelfand pair. In particular,
Externí odkaz:
https://doaj.org/article/c192fcbe9b43439e93497ae2bb0815a0
Publikováno v:
Advances in Group Theory and Applications, Vol 11, Pp 75-112 (2021)
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two elements and
Externí odkaz:
https://doaj.org/article/47dd89610bec4a34952982d112e23147
Publikováno v:
International Journal of Group Theory, Vol 9, Iss 2, Pp 69-80 (2020)
Fragile words have been already considered in the context of automata groups. Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words. Among other properties, we show that there
Externí odkaz:
https://doaj.org/article/cfc2ee402ea541a3b59da03cc7f3a86e
Autor:
Daniele D'Angeli, Emanuele Rodaro
Publikováno v:
International Journal of Group Theory, Vol 7, Iss 3, Pp 95-109 (2018)
We address the problem of finding examples of non-bireversible transducers defining free groups, we show examples of transducers with sink accessible from every state which generate free groups, and, in general, we link this problem to the non-existe
Externí odkaz:
https://doaj.org/article/5c90be21f1f643f3ab6544d3bc972120
Publikováno v:
Discrete Applied Mathematics. 307:32-49
We determine the exact value of the Wiener index, the edge-Wiener index, and the vertex-edge-Wiener index of the Basilica graphs, i.e., the sequence of finite Schreier graphs associated with the action of the Basilica group on the rooted binary tree.
Publikováno v:
Israel Journal of Mathematics. 245:535-542
Publikováno v:
Linear Algebra and its Applications. 613:241-270
Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line graph $L(\
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is isomorphic to the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba239345b0cdc5238297c6a01b7c35ec
http://arxiv.org/abs/2205.09035
http://arxiv.org/abs/2205.09035
Publikováno v:
Theoretical Computer Science. 809:418-429
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k. This defini
We generalize three classical characterizations of line graphs to line graphs of signed and gain graphs: the Krausz's characterization, the van Rooij and Wilf's characterization and the Beineke's characterization. In particular, we present a list of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a35d5e18915c9069962434779ffd4001
http://arxiv.org/abs/2101.09677
http://arxiv.org/abs/2101.09677