11 citations · 25 across the 18 of their papers we have counts for
5 papers · 1 filter
On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)
Joshua A. Grochow, Michael Levet
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht-Fraisse bijective pebble game in Hella's (Ann. Pure Ap…
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Michael Levet, Puck Rombach, Nicholas Sieger
In this paper, we show that computing canonical labelings of graphs of bounded rank-width is in . Our approach builds on the framework of Köbler & Verbitsky (CSR 2…
Moments of Colored Permutation Statistics on Conjugacy Classes
Jesse Campion Loth, Michael Levet, Kevin Liu +2
In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups . We first show that…
Complexity and Enumeration in Models of Genome Rearrangement
Lora Bailey, Heather Smith Blake, Garner Cochran +8
In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cu…
Permutation Statistics in Conjugacy Classes of the Symmetric Group
Jesse Campion Loth, Michael Levet, Kevin Liu +3
We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several co…