Expanding Generating Sets for Solvable Permutation Groups
DOI10.1137/17M1148979zbMath1490.20004WikidataQ129510987 ScholiaQ129510987MaRDI QIDQ3176493
Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev, V. Arvind
Publication date: 20 July 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Subgroups of symmetric groups (20B35) Computational methods for problems pertaining to group theory (20-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramanujan graphs
- Approximating probability distributions using small sample spaces
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- The solvable length of a solvable linear group
- Small-Bias Sets for Nonabelian Groups
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
- Construction of a Thin Set with small Fourier Coefficients
- Expander graphs and their applications
- Undirected connectivity in log-space
- A compact representation for permutation groups
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- Random Cayley graphs and expanders
- Explicit, almost optimal, epsilon-balanced codes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Expanding Generating Sets for Solvable Permutation Groups
