Faculty

Institution

Unit

Venue

Michael Levet

Assistant Professor of Computer Science

College of Charleston

Affiliations

Department Of Computer Science

Michael Levet is currently serving as a Computer Science Assistant Professor of Computer Science at College of Charleston.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Michael Levet

College of Charleston

Assistant Professor of Computer Science

You can click a keyword to filter the displayed items

mathematics combinatorial theory applied mathematics combinatorics algebra mathematical sciences mathematical logic computer science pure mathematics discrete algorithms frattini subgroup coxeter group group structure graph theory representation theory geometric topology computational complexity theory complexity theory abstract algebra nilpotent groups ordered group smallest representation abelian normal subgroups descriptive complexity parallel complexity evolutionary biology set theory topology logic in computer science spectral theory extremal set theory lattice theory extremal graph theory descriptional complexity circuit complexity commutative algebra algebraic logic mathematical statistics algebraic combinatorics enumerative combinatorics group isomorphism directed ramsey genome rearrangement constant-depth circuit complexity relation algebras relation algebra 32 colored permutation statistics first order identifying groups single cut-and-join model pairwise rearrangement permutation statistics

Notable Scholarly Works

Notable Federal Grants

Collaborators

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture. Fundamenta Informaticae (2025)

relation algebraslogic in computer sciencemathematical logicalgebraabstract algebracombinatorial theorypure mathematicsmathematicscommutative algebra

Moments of Colored Permutation Statistics on Conjugacy Classes. Annals of Combinatorics (2025)

combinatoricsmathematical statisticscombinatorial theorymathematicsdiscrete mathematicsgroup theorycolored permutation statisticsalgebraic combinatoricsprobability theoryenumerative combinatoricsspectral theoryapplied mathematics

On the Complexity of Identifying Groups Without Abelian Normal Subgroups: Parallel, First Order, and Gi-Hardness. ArXiv.org (2025)

geometric topologycoxeter groupabelian normal subgroupsgroup structurecombinatorial theorycomputational complexitynilpotent groupsmathematicsfirst ordergroup theoryfrattini subgroupapplied mathematicsmathematical sciences

On the Constant-Depth Circuit Complexity of Generating Quasigroups. TheoretiCS (2025)

combinatoricsgeometric topologycomputational complexity theorycircuit complexitycombinatorial theorycomputational complexityconstant-depth circuit complexitymathematicsdiscrete algorithmscomplexity theorytheoretical computer sciencediscrete mathematicsapplied mathematics

On the Descriptive Complexity of Groups Without Abelian Normal Subgroups. Logical Methods in Computer Science (2025)

coxeter groupmathematical logicalgebraordered groupcombinatorial theorypure mathematicsnilpotent groupsgroup structuredescriptive complexitymathematicsgroup theoryfrattini subgroupmathematical sciences

On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman. Journal of Computer and System Sciences (2025)

algebracombinatorial theorydiscrete algorithmsmathematicsgroup theoryfrattini subgroupparallel complexity

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions. ArXiv.org (2025)

computer sciencecoxeter groupcomputational complexity theoryordered groupgroup structurecomputational complexitydiscrete algorithmsmathematicscomplexity theoryidentifying groupsgroup theoryparallel complexitymathematical sciences

Complexity and Enumeration in Models of Genome Rearrangement. Theoretical Computer Science (2024)

Lora BaileyHeather Smith BlakeGarner CochranNathan FoxMichael LevetReem MahmoudElizabeth Bailey MatsonInne SinggihGrace StadnykXinyi WangAlexander Wiedemann

computer sciencetheoretical computer scienceevolutionary biologygenome rearrangement

Count-Free Weisfeiler–Leman and Group Isomorphism. International Journal of Algebra and Computation (2024)

Nathaniel A. CollinsMichael Levet

graph theorygroup isomorphismapplied mathematics

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-And-Join Model. arXiv (Cornell University) (2024)

Bailey, LoraBlake, Heather SmithCochran, GarnerFox, NathanLevet, MichaelMahmoud, ReemSinggih, InneStadnyk, GraceWiedemann, Alexander

particle physicssingle cut-and-join modelpairwise rearrangementapplied mathematicsmachine learning

1
2
10 / page

Michael Levet

Assistant Professor of Computer Science

College of Charleston

Affiliations

Department Of Computer Science

Michael Levet is currently serving as a Computer Science Assistant Professor of Computer Science at College of Charleston.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Michael Levet

College of Charleston

Assistant Professor of Computer Science

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture. Fundamenta Informaticae (2025)

relation algebraslogic in computer sciencemathematical logicalgebraabstract algebracombinatorial theorypure mathematicsmathematicscommutative algebra

Moments of Colored Permutation Statistics on Conjugacy Classes. Annals of Combinatorics (2025)

On the Complexity of Identifying Groups Without Abelian Normal Subgroups: Parallel, First Order, and Gi-Hardness. ArXiv.org (2025)

On the Constant-Depth Circuit Complexity of Generating Quasigroups. TheoretiCS (2025)

On the Descriptive Complexity of Groups Without Abelian Normal Subgroups. Logical Methods in Computer Science (2025)

On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman. Journal of Computer and System Sciences (2025)

algebracombinatorial theorydiscrete algorithmsmathematicsgroup theoryfrattini subgroupparallel complexity

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions. ArXiv.org (2025)

Complexity and Enumeration in Models of Genome Rearrangement. Theoretical Computer Science (2024)

Lora BaileyHeather Smith BlakeGarner CochranNathan FoxMichael LevetReem MahmoudElizabeth Bailey MatsonInne SinggihGrace StadnykXinyi WangAlexander Wiedemann

computer sciencetheoretical computer scienceevolutionary biologygenome rearrangement

Count-Free Weisfeiler–Leman and Group Isomorphism. International Journal of Algebra and Computation (2024)

Nathaniel A. CollinsMichael Levet

graph theorygroup isomorphismapplied mathematics

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-And-Join Model. arXiv (Cornell University) (2024)

Bailey, LoraBlake, Heather SmithCochran, GarnerFox, NathanLevet, MichaelMahmoud, ReemSinggih, InneStadnyk, GraceWiedemann, Alexander

particle physicssingle cut-and-join modelpairwise rearrangementapplied mathematicsmachine learning

1
2
10 / page