The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs

DOI10.1142/S0218196717500412zbMath1483.20110arXiv1705.09577OpenAlexW2964110945MaRDI QIDQ4596405

Chrystopher L. Nehaniv, Gábor Horváth, Károly Podoski

Publication date: 1 December 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.09577

zbMATH Keywords

permutation groupsKrohn-Rhodes complexitycomplete invariants for graphsflow semigroup of digraphsinvariants for digraphsRhodes's conjecture

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Symmetric groups (20B30) General theory for finite permutation groups (20B05)

Related Items (2)

Optimisation via encodings: a renormalisation group perspective ⋮ Structural aspects of semigroups based on digraphs

Uses Software

• Algorithm 447

Cites Work

• A note on finding the bridges of a graph
• Graph puzzles, homotopy, and the alternating group
• Structural aspects of semigroups based on digraphs
• Lower bounds for complexity of finite semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs