activity
20082020
most citedThe finiteness problem for automaton semigroups is undecidable

39 citations · 71 across the 16 of their papers we have counts for

collaborators

19 papers

math.NT2020

Galois covers of and number fields with large class groups

Jean Gillibert, Pierre Gillibert

For each finite subgroup of , and for each integer coprime to , we construct explicitly infinitely many Galois extensions of with group $…

math.CO2020

The VC-Dimension of Axis-Parallel Boxes on the Torus

Pierre Gillibert, Thomas Lachmann, Clemens Müllner

We show in this paper that the VC-dimension of the family of -dimensional axis-parallel boxes and cubes on the -dimensional torus are both asymptotically . This…

cs.LO2020

When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

Pierre Gillibert, Julius Jonušas, Michael Kompatscher +2

We produce a class of -categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to -categorical s…

math.RA2018★ 7 cited

Pseudo-loop conditions

Pierre Gillibert, Julius Jonušas, Michael Pinsker

We initiate the systematic study of loop conditions of arbitrary finite width. Each loop condition is a finite set of identities of a particular shape, and satisfaction of these id…

math.NT2018

Selmer groups are intersection of two direct summands of the adelic cohomology

Florence Gillibert, Jean Gillibert, Pierre Gillibert +1

We give a positive answer to a Conjecture by Manjul Bhargava, Daniel M. Kane, Hendrik W. Lenstra Jr., Bjorn Poonen and Eric Rains, concerning the cohomology of torsion subgroups of…

math.GR2017

An automaton group with undecidable order and Engel problems

Pierre Gillibert

For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an ele…