We give an efficient deterministic algorithm that outputs an expanding generating set for any
finite abelian group. The size of the generating set is close to the randomized construction of …

The present thesis focuses on the design and analysis of randomized algorithms for
accelerating several linear algebraic tasks. In particular, we develop simple, efficient …

Abstract Let G=〈 S〉 be a solvable permutation group given as input by the generating set
SIe G is a solvable subgroup of the symmetric group Sn. We give a deterministic polynomial …

Let G=⟨S⟩ be a solvable permutation group given as input by the generating set S, that is,
G is a solvable subgroup of the symmetric group S_n. We give a deterministic polynomial …

A primary research goal in the study of expander graphs is the construction of explicit
expander graph families. Namely, we want to construct a family of graphs {Gn} n∈ N, where …

A primary research goal in the study of expander graphs is the construction of explicit
expander graph families. Namely, we want to construct a family of graphs {Gn} n∈ N, where …

Let G=< S> be a solvable subgroup of the symmetric group S n given as input by the
generator set S. We give a deterministic polynomial-time algorithm that computes an …

Let $ G=< S> $ be a solvable permutation group of the symmetric group $ S_n $ given as
input by the generating set $ S $. We give a deterministic polynomial-time algorithm that …

The purpose of this dissertation is to explicitly construct families of expander graphs out of
families of finite soluble groups. In short, we study expansion in soluble groups. This line of …