21 citations · 51 across the 14 of their papers we have counts for
5 papers · 1 filter
Realizable cycle structures in digraphs
J. Fromentin, P. -L Giscard, T. Karaboghossian
Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of…
Experiments on growth series of braid groups
Jean Fromentin
We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our ex…
Gapsets and numerical semigroups
Shalom Eliahou, Jean Fromentin
For g 0, let n g denote the number of numerical semi-groups of genus g. A conjecture by Maria Bras-Amorós in 2008 states that the inequality n g n g--1 + n g--2 should…
Near-misses in Wilf's conjecture
Shalom Eliahou, Jean Fromentin
Let S N be a numerical semigroup with multiplicity m, conductor c and minimal generating set P. Let L = S [0, c -- 1] and W(S) = |P||L| -- c. In 1978, Herbert Wi…
Exploring the tree of numerical semigroups
Jean Fromentin, Florent Hivert
In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits part…