On the extension problem for partial permutations

DOI10.1090/S0002-9939-03-06860-6MaRDI QIDQ4806416zbMATH OpenFDO

Authors Benjamin Steinberg, K. Auinger

Publication date 14 May 2003

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9939-03-06860-6

zbMATH Keywords

extension problemfinite groupsfinite monoidsfinite semigroupsgroup identitiesgroup kernelsmembership problempointlike setspseudovarietiesundecidable problems

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Quasivarieties and varieties of groups (20E10) Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• Extensions by local groups
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• Decidability of finite quasivarieties generated by certain transformation semigroups.
• On the decidability of membership in the global of a monoid pseudovariety.

Cited in

(31)

• An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
• The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups
• The \(\kappa\)-word problem over \(\mathsf{DRH}\)
• The word problem for -terms over the pseudovariety of local groups
• Varieties
• Profinite topologies
• Recognizing pro-\(\mathrm{R}\) closures of regular languages
• On the power pseudovariety \(\mathbf{PCS}\).
• On non-commuting sets in finite soluble CC-groups.
• Pointlike sets with respect to R and J.
• Pointlike sets for varieties determined by groups
• UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS
• On -reducibility of pseudovarieties of the form V D
• Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
• Reducibility of Joins Involving Some Locally Trivial Pseudovarieties
• Some Results on the Sarkovskii Partial Ordering of Permutations
• scientific article; zbMATH DE number 3851178 (Why is no real title available?)
• On the decidability of membership in the global of a monoid pseudovariety.
• STABLE PAIRS
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• Tameness of joins involving the pseudovariety of local semilattices.
• Representations of relatively free profinite semigroups, irreducibility, and order primitivity
• Extending permutation arrays: improving MOLS bounds
• Semidirect product with an order-computable pseudovariety and tameness.
• On the relative solvability of certain inverse monoids.
• Pseudovarieties of semigroups
• Tameness of pseudovariety joins involving R.
• Pointlike sets and separation: a personal perspective
• A counterexample to a conjecture concerning concatenation hierarchies

This page was built for publication: On the extension problem for partial permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806416)