Near-Optimal Expanding Generator Sets for Solvable Permutation Groups

被引：0

作者：

Arvind, Vikraman ^{[1
]}

Mukhopadhyay, Partha ^{[2
]}

Nimbhorkar, Prajakta ^{[2
]}

Vasudev, Yadu ^{[1
]}

机构：

[1] Inst Math Sci, Madras 600113, Tamil Nadu, India

[2] Chennai Math Inst, Siruseri, India

来源：

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012 | 2012年 / 7464卷

关键词：

CONSTRUCTION; GRAPHS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let G = < S > be a solvable subgroup of the symmetric group Sn given as input by the generator set S. We give a deterministic polynomial-time algorithm that computes an expanding generator set of size (O) over tilde (n(2)) for G. As a byproduct of our proof, we obtain a new explicit construction of epsilon-bias spaces of size (O) over tilde (n poly(log d))(1/epsilon)(O(1)) for the groups Z(d)(n).

引用

页码：112 / 123

页数：12

共 50 条

[31] Discrete choice experiments: An overview on constructing D-optimal and near-optimal choice sets
Alamri, Abdulrahman S.
Stelios, Georgiou
Stella, Stylianou
[J]. HELIYON, 2023, 9 (07)
[32] Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
Indyk, Piotr
Mahabadi, Sepideh
Gharan, Shayan Oveis
Rezaei, Alireza
[J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
[33] Hitting Sets with Near-Optimal Error for Read-Once Branching Programs
Braverman, Mark
Cohen, Gil
Garg, Sumegha
[J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 353 - 362
[34] Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices
Das, Shibsankar
Parampalli, Udaya
Majhi, Sudhan
Liu, Zilong
[J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2284 - 2288
[35] A genetic algorithm approach to the selection of near-optimal subsets from large sets
Whiting, P.
Poon, P. W.
Carter, J. N.
[J]. GECCO 2005: Genetic and Evolutionary Computation Conference, Vols 1 and 2, 2005, : 2203 - 2204
[36] SOLVABLE 3/2-TRANSITIVE PERMUTATION GROUPS
PASSMAN, DS
[J]. JOURNAL OF ALGEBRA, 1967, 7 (02) : 192 - &
[37] BLOCKS, SOLVABLE PERMUTATION-GROUPS, AND LANDAU THEOREM
KULSHAMMER, B
[J]. JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1989, 398 : 180 - 186
[38] The minimal base size of primitive solvable permutation groups
Seress, A
[J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1996, 53 : 243 - 255
[39] Primitive Permutation Groups with a Solvable Subconstituent of Degree 7
Wu, Zhengfei
Xu, Shangjin
Shi, Jiangtao
[J]. INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2019, 50 (01): : 121 - 135
[40] Universal Near-Optimal Feedbacks
S. Nobakhtian
R. J. Stern
[J]. Journal of Optimization Theory and Applications, 2000, 107 : 89 - 122

← 1 2 3 4 5 →