Expanding Generating Sets for Solvable Permutation Groups
DOI10.1137/17M1148979zbMATH Open1490.20004WikidataQ129510987 ScholiaQ129510987MaRDI QIDQ3176493FDOQ3176493
Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev, Vikraman Arvind
Publication date: 20 July 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
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
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)
Cites Work
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Expander graphs and their applications
- Undirected connectivity in log-space
- Simple Constructions of Almost k-wise Independent Random Variables
- Title not available (Why is that?)
- Ramanujan graphs
- Title not available (Why is that?)
- Random Cayley graphs and expanders
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Title not available (Why is that?)
- The solvable length of a solvable linear group
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Construction of a Thin Set with small Fourier Coefficients
- Title not available (Why is that?)
- A compact representation for permutation groups
- Approximating probability distributions using small sample spaces
- Explicit, almost optimal, epsilon-balanced codes
- Small-Bias Sets for Nonabelian Groups
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
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)
