6 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR9 papers
- Institut de Recherche en Informatique FondamentaleFR3 papers
- Université Paris CitéFR3 papers
- Université Paris-SaclayFR3 papers
- Aalborg UniversityDK2 papers
- Czech Academy of Sciences, Institute of SociologyCZ2 papers
- Herzliya Medical CenterIL2 papers
- Laboratoire Méthodes FormellesFR2 papers
- Masaryk UniversityCZ2 papers
- Paris-Est SupFR2 papers
- Radboud University NijmegenNL2 papers
- Sorbonne Paris CitéFR2 papers
3 papers · 1 filter
Quadratic Equations in Graph Products of Groups and the Exponent of Periodicity
Volker Diekert, Silas Natterer, Alexander Thumm
In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word , it is the largest exponent…
The group identification problem for -groups of small order
Bettina Eick, Henrik Schanze
We investigate which group-theoretic invariants are powerful in distinguishing among non-isomorphic p-groups. Based on this, we devise an effective algorithm to solve the group ide…
On the Diophantine problem related to power circuits
Alexander Rybalov
Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn f…