Sync-maximal permutation groups equal primitive permutation groups
type: Item
instance of: scholarly article
title: Sync-maximal permutation groups equal primitive permutation groups
DOI: 10.1007/978-3-030-93489-7_4
author: Stefan Hoffmann
publication date: 2022-11-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.13527
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614740
zbMATH Keywords: finite automata
zbMATH Keywords: synchronization
zbMATH Keywords: set of synchronizing words
zbMATH Keywords: primitive permutation groups
zbMATH Keywords: sync-maximal groups
MaRDI profile type: Publication
OpenAlex ID: W4285545936
cites work: Matrix Mortality and the Černý-Pin Conjecture
cites work: Q4452055
cites work: Synchronizing generalized monotonic automata
cites work: Primitive permutation groups and strongly factorizable transformation semigroups
cites work: Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups
cites work: Primitive groups synchronize non-uniform maps of extreme ranks
cites work: Between primitive and 2-transitive: synchronization and its friends
cites work: Synchronizing groups and automata
cites work: Algebraic synchronization criterion and computing reset words
cites work: Completely Reachable Automata
cites work: A characterization of completely reachable automata
cites work: Q4231664
cites work: Q5509690
cites work: Q5629545
cites work: The Černý conjecture and 1-contracting automata
cites work: Les automates circulaires biaisés vérifient la conjecture de Černý
cites work: Reset Sequences for Monotonic Automata
cites work: Semicomputable points in Euclidean spaces
cites work: Q5208373
cites work: An extremal problem for two families of sets
cites work: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
cites work: Constrained synchronization and commutativity
cites work: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
cites work: Q3862379
cites work: Q4779162
cites work: Synchronizing Sequences for Probabilistic Automata
cites work: Q5606985
cites work: Q5306174
cites work: Synchronization of Automata with One Undefined or Ambiguous Transition
cites work: Reset complexity of ideal languages over a binary alphabet
cites work: Reset Complexity of Ideal Languages Over a Binary Alphabet
cites work: Primitive permutation groups and their section-regular partitions.
cites work: Q4141148
cites work: Q4171566
cites work: Q3332252
cites work: On two Combinatorial Problems Arising from Automata Theory
cites work: Q4884899
cites work: Reset words for commutative and solvable automata
cites work: Estimation of the length of reset words for automata with simple idempotents
cites work: An improvement to a recent upper bound for synchronizing words of finite automata
cites work: Q5551185
cites work: The Černý conjecture for one-cluster automata with prime length cycle
cites work: Q3304155
cites work: Q5387708
cites work: Synchronizing Automata and the Černý Conjecture
cites work: Synchronizing automata preserving a chain of partial orders
Recommended article: Some Primitive Permutation Groups
Recommended article: The primitive permutation groups of certain degrees
Recommended article: Q5115506
Recommended article: Primitive groups synchronize non-uniform maps of extreme ranks
Recommended article: Multiplicity-free and self-paired primitive permutation groups
Recommended article: Groups with maximal subgroups of Sylow subgroups \(\sigma\)-permutably embedded
Recommended article: X-permutable maximal subgroups of Sylow subgroups of finite groups
Recommended article: Finite groups with \(X\)-permutable maximal subgroups of Sylow subgroups.
Recommended article: Synchronising primitive groups of diagonal type exist
Recommended article: Permutation-like matrix groups with a maximal cycle of prime square length
description: scientific article; zbMATH DE number 7614740