researcher

M. Rigo

38 papers hereh-index 191.4k citations142 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author6
first author5
middle author13
last author13

Across the 37 of 38 papers where every author was matched, so the position is known.

fields

cs.FL16
math.CO10
cs.CC5
cs.DM4
cs.OH1
math.DS1

same name

M. Rigo — 7 papers, h 3
M. Rigo — 3 papers, h 2
M. Rigo — 3 papers, h 6
M. Rigo — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

19992022

most citedGeneralized Pascal triangle for binomial coefficients of words

14 citations · 54 across the 28 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014

Deciding game invariance

Eric Duchêne, Aline Parreau, Michel Rigo

Duchêne and Rigo introduced the notion of invariance for take-away games on heaps. Roughly speaking, these are games whose rulesets do not depend on the position. Given a sequence…

cs.FL2014

A new approach to the $2$ -regularity of the $ℓ$ -abelian complexity of $2$ -automatic sequences

Aline Parreau, Michel Rigo, Eric Rowland +1

We prove that a sequence satisfying a certain symmetry property is $2$ -regular in the sense of Allouche and Shallit, i.e., the $Z$ -module generated by its $2$ -kernel is fi…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Deciding game invariance

A new approach to the 2-regularity of the ℓ-abelian complexity of 2-automatic sequences

A new approach to the $2$ -regularity of the $ℓ$ -abelian complexity of $2$ -automatic sequences