Expanding Generating Sets for Solvable Permutation Groups

DOI10.1137/17M1148979MaRDI QIDQ3176493zbMATH OpenWikidataFDO

Authors Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev

Publication date 20 July 2018

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/17M1148979

zbMATH Keywords

solvable groupsexpanderspermutation groups

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subgroups of symmetric groups (20B35) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Computational methods for problems pertaining to group theory (20-08)

Recommendations

• Near-optimal expanding generator sets for solvable permutation groups
• Generalized permutation characters of solvable groups
• A note on invariable generation of nonsolvable permutation groups
• Solvable generation of finite groups
• Sylow permutability in generalized soluble groups
• Generating finite soluble groups
• scientific article; zbMATH DE number 1239920
• scientific article; zbMATH DE number 1109636
• Permutability in finite soluble groups
• Invariable generation of permutation and linear groups

Cites work

• scientific article; zbMATH DE number 475362 (Why is no real title available?)
• scientific article; zbMATH DE number 475380 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• A compact representation for permutation groups
• Approximating probability distributions using small sample spaces
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Construction of a Thin Set with small Fourier Coefficients
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs
• Expander graphs and their applications
• Explicit, almost optimal, epsilon-balanced codes
• Ramanujan graphs
• Random Cayley graphs and expanders
• Simple Constructions of Almost k-wise Independent Random Variables
• Small-Bias Sets for Nonabelian Groups
• The solvable length of a solvable linear group
• Undirected connectivity in log-space

Cited in

(2)

• The remote point problem, small bias spaces, and expanding generator sets
• Near-optimal expanding generator sets for solvable permutation groups

This page was built for publication: Expanding Generating Sets for Solvable Permutation Groups

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