Key research themes
1. What are the complexity classifications of equation satisfiability problems in finite solvable groups?
This research area investigates the computational complexity of deciding whether polynomial equations over finite solvable groups have solutions within those groups. It is significant because it bridges group theory and computational complexity, aiming to understand which solvable groups permit efficient algorithmic treatment of equations and which do not, potentially impacting cryptography and automated reasoning in algebraic structures.
2. How do solvable groups and their structural properties manifest through graph-theoretic constructions based on conjugacy and commutativity?
This research theme explores associating finite groups, particularly solvable ones, with graphs defined via conjugacy classes and solvability conditions, such as the solvable conjugacy class graph. Investigations focus on graph invariants (connectivity, clique number, genus) and their relation to group-theoretic properties. This approach offers novel combinatorial tools for understanding subgroup interactions and solvability criteria.
3. What algebraic and arithmetic constraints characterize solvable group actions, representations, and related structures?
This theme focuses on the algebraic and number-theoretic properties defining solvable groups via their linear actions, permutation representations, and automorphisms, especially under coprime group actions. It covers classifications of solvable groups arising from conditions on invariant Sylow numbers, character degree graphs, and orbit structures, as well as representation-theoretic identification using element orders and spectra.