SU\G(𝔸)/K·U

Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (48)

Action Title Date Authors
+
Finding lower bounds on the growth and entropy of subshifts over countable groups 2025-02-17 Matthieu Rosenfeld
+ PDF Ask
An explicit condition for boundedly supermultiplicative subshifts 2024-10-25 Vuong Bui Matthieu Rosenfeld
+ PDF Ask
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters 2024-01-20 Matthieu Rosenfeld
+ PDF Ask
Reconstructing words using queries on subwords or factors 2023-01-01 Gwénaël Richomme Matthieu Rosenfeld
+ PDF Ask
On Vizing's problem for triangle-free graphs 2023-01-01 Ross J. Kang Matthieu Rosenfeld
+ PDF Ask
It is undecidable whether the growth rate of a given bilinear system is 1 2022-06-22 Matthieu Rosenfeld
+ PDF Ask
Avoiding square-free words on free groups 2022-04-26 Golnaz Badkobeh Tero Harju Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Avoiding squares over words with lists of size three amongst four symbols 2022-02-02 Matthieu Rosenfeld
+ PDF Ask
It is undecidable whether the growth rate of a given bilinear system is 1 2022-01-01 Matthieu Rosenfeld
+ PDF Ask
Finding lower bounds on the growth and entropy of subshifts over countable groups 2022-01-01 Matthieu Rosenfeld
+ PDF Ask
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge 2021-11-05 Matthieu Rosenfeld
+ PDF Ask
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets 2021-04-06 Matthieu Rosenfeld
+ PDF Ask
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge 2021-02-01 Matthieu Rosenfeld
+ PDF Ask
The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable 2021-01-01 Matthieu Rosenfeld
+ PDF Ask
Avoiding large squares in trees and planar graphs 2021-01-01 Daniel Gonçalves Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Avoiding squares over words with lists of size three amongst four symbols 2021-01-01 Matthieu Rosenfeld
+ PDF Ask
Avoiding Square-Free Words on Free Groups 2021-01-01 Golnaz Badkobeh Tero Harju Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge 2021-01-01 Matthieu Rosenfeld
+ PDF Ask
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters 2021-01-01 Matthieu Rosenfeld
+ PDF Ask
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree 2020-09-04 Matthieu Rosenfeld
+
Lower-bounds on the growth of power-free languages over large alphabets 2020-08-12 Matthieu Rosenfeld
+
Another approach to non-repetitive colorings of graphs of bounded degree 2020-06-16 Matthieu Rosenfeld
+ PDF Ask
The binomial equivalence classes of finite words 2020-05-19 Marie Lejeune Michel Rigo Matthieu Rosenfeld
+
The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable 2020-04-14 Matthieu Rosenfeld
+ PDF Ask
How far away must forced letters be so that squares are still avoidable? 2020-02-12 Matthieu Rosenfeld
+ PDF Ask
On the binomial equivalence classes of finite words 2020-01-31 Marie Lejeune Michel Rigo Matthieu Rosenfeld
+ PDF Ask
Nice formulas, $xyx$-formulas, and palindrome patterns 2020-01-01 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Another approach to non-repetitive colorings of graphs of bounded degree 2020-01-01 Matthieu Rosenfeld
+ PDF Ask
Lower-bounds on the growth of power-free languages over large alphabets 2020-01-01 Matthieu Rosenfeld
+ PDF Ask
On the binomial equivalence classes of finite words 2020-01-01 Marie Lejeune Michel Rigo Matthieu Rosenfeld
+ PDF Ask
Bounding the number of $(\sigma,\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth 2019-04-05 Matthieu Rosenfeld
+ PDF Ask
How far away must forced letters be so that squares are still avoidable 2019-03-11 Matthieu Rosenfeld
+ PDF Ask
On Some Interesting Ternary Formulas 2019-01-25 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
How far away must forced letters be so that squares are still avoidable? 2019-01-01 Matthieu Rosenfeld
+ PDF Ask
Bounding the number of $(σ,ρ)$-dominating sets in trees, forests and graphs of bounded pathwidth 2019-01-01 Matthieu Rosenfeld
+ PDF Ask
Bisplit graphs satisfy the Chen-Chvátal conjecture 2018-01-01 Laurent Beaudou Giacomo Kahn Matthieu Rosenfeld
+ PDF Ask
Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ 2018-01-01 Michaël Rao Matthieu Rosenfeld
+ PDF Ask
Bisplit graphs satisfy the Chen-Chvátal conjecture 2018-01-01 Laurent Beaudou Giacomo Kahn Matthieu Rosenfeld
+ PDF Ask
Avoidability of Formulas with Two Variables 2017-11-03 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
On Some Interesting Ternary Formulas 2017-01-01 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
On some interesting ternary formulas 2017-01-01 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Avoidability of formulas with two variables 2016-06-13 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Avoidability of Formulas with Two Variables 2016-01-01 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
Avoidability of formulas with two variables 2016-01-01 Pascal Ochem Matthieu Rosenfeld
+ PDF Ask
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. 2015-11-18 Michaël Rao Matthieu Rosenfeld
+ PDF Ask
Avoidability of long 𝑘-abelian repetitions 2015-07-15 Michaël Rao Matthieu Rosenfeld
+ PDF Ask
Avoiding two consecutive blocks of same size and same sum over $\mathbb{Z}^2$ 2015-01-01 Michaël Rao Matthieu Rosenfeld
+ PDF Ask
Avoidability of long $k$-abelian repetitions 2015-01-01 Michaël Rao Matthieu Rosenfeld

Common Coauthors

Coauthor Papers Together
Pascal Ochem 11
Michaël Rao 5
Michel Rigo 3
Marie Lejeune 3
Tero Harju 2
Golnaz Badkobeh 2
Giacomo Kahn 2
Laurent Beaudou 2
Vuong Bui 1
Daniel Gonçalves 1
Gwénaël Richomme 1
Ross J. Kang 1

Commonly Cited References

Action Title Date Authors # of times referenced
+ PDF Ask
Doubled Patterns are 3-Avoidable 2016-02-05 Pascal Ochem 11
+ PDF Ask
On a generalization of Abelian equivalence and complexity of infinite words 2013-09-12 Juhani Karhumäki Aleksi Saarela Luca Q. Zamboni 7
+ PDF Ask
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree 2020-09-04 Matthieu Rosenfeld 6
+
On nonrepetitive sequences 1974-03-01 R. C. Entringer D Jackson Joseph A. Schatz 6
+ PDF Ask
New approach to nonrepetitive sequences 2012-02-29 Jarosław Grytczuk Jakub Kozik Piotr Micek 6
+ PDF Ask
Nonrepetitive colouring via entropy compression 2015-06-24 Vida Dujmović Gwenaël Joret Jakub Kozik David R. Wood 5
+
Nonrepetitive vertex colorings of graphs 2011-11-10 Jochen Harant Stanislav Jendrol’ 5
+ PDF Ask
Planar graphs have bounded nonrepetitive chromatic number 2020-03-03 Vida Dujmović Louis Esperet Gwenaël Joret Bartosz Walczak David R. Wood 4
+ PDF Ask
Nonrepetitive colorings of graphs 2005-10-01 Noga Alon Jarosław Grytczuk 4
+ PDF Ask
Entropy compression method applied to graph colorings 2014-01-01 Daniel Gonçalves Mickaël Montassier Alexandre Pinlou 4
+ PDF Ask
Some further results on squarefree arithmetic progressions in infinite words 2019-10-17 James D. Currie Tero Harju Pascal Ochem Narad Rampersad 4
+ PDF Ask
Fixed points avoiding Abelian k-powers 2012-01-30 James D. Currie Narad Rampersad 3
+ PDF Ask
Nonrepetitive Graph Colouring 2021-09-10 David R. Wood 3
+ PDF Ask
Avoiding Three Consecutive Blocks of the Same Size and Same Sum 2014-04-01 Julien Cassaigne James D. Currie Luke Schaeffer Jeffrey Shallit 3
+ PDF Ask
Nonrepetitive colorings of graphs 2007-03-01 Sebastian Czerwiński Jarosław Grytczuk 3
+
On uniformly repetitive semigroups 1994-12-01 Giuseppe Pirillo Stefano Varricchio 3
+
Strongly non-repetitive sequences and progression-free sets 1979-09-01 F. M. Dekking 3
+
Nonrepetitive list colourings of paths 2010-09-29 Jarosław Grytczuk Jakub Przybyło Xuding Zhu 3
+ PDF Ask
Avoidability of long 𝑘-abelian repetitions 2015-07-15 Michaël Rao Matthieu Rosenfeld 3
+ PDF Ask
Nonrepetitive Colorings of Graphs—A Survey 2007-01-01 Jarosław Grytczuk 3
+ PDF Ask
On cardinalities of k-abelian equivalence classes 2016-06-23 Juhani Karhumäki Svetlana Puzynina Michaël Rao Markus A. Whiteland 2
+ PDF Ask
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence 2014-01-01 Juhani Karhumäki Aleksi Saarela Luca Q. Zamboni 2
+ PDF Ask
The Thue choice number versus the Thue chromatic number of graphs 2015-08-11 Erika Škrabuľáková 2
+ PDF Ask
Total Thue colourings of graphs 2014-12-02 Jens Schreyer Erika Škrabuľáková 2
+
Pattern avoidance on graphs 2006-12-05 Jarosław Grytczuk 2
+
On cliques in graphs 1965-03-01 J. W. Moon Leo Moser 2
+
The growth function of context-free languages 2001-03-01 Roberto Incitti 2
+
Sur un théorème de Thue 1972-07-01 F. Dejean 2
+ PDF Ask
Acyclic edge-coloring using entropy compression 2013-03-16 Louis Esperet Aline Parreau 2
+ PDF Ask
A constructive proof of the general lovász local lemma 2010-01-01 Robin A. Moser Gábor Tardos 2
+ PDF Ask
A proof of Dejean’s conjecture 2010-12-29 James D. Currie Narad Rampersad 2
+ PDF Ask
Characterisations and examples of graph classes with bounded expansion 2011-10-16 Jaroslav Nešetřil Patrice Ossona de Mendez David R. Wood 2
+ PDF Ask
Avoidability of circular formulas 2017-11-24 Guilhem Gamard Pascal Ochem Gwénaël Richomme Patrice Séébold 2
+ PDF Ask
Avoidability of Formulas with Two Variables 2017-11-03 Pascal Ochem Matthieu Rosenfeld 2
+ PDF Ask
Minimal Dominating Sets in a Tree: Counting, Enumeration, and Extremal Results 2019-01-01 Günter Rote 2
+ PDF Ask
On Some Interesting Ternary Formulas 2017-01-01 Pascal Ochem Matthieu Rosenfeld 2
+ PDF Ask
Avoiding squares over words with lists of size three amongst four symbols 2022-02-02 Matthieu Rosenfeld 2
+ PDF Ask
A general framework for hypergraph colouring 2020-01-01 Ian M. Wanless David R. Wood 2
+ PDF Ask
Notes on Nonrepetitive Graph Colouring 2008-07-28 János Barát David R. Wood 1
+ PDF Ask
On Subword Complexity of Morphic Sequences 2015-01-01 Rostislav Devyatov 1
+
A note on the joint spectral radius 1960-01-01 Gian‐Carlo Rota W. Gilbert Strang 1
+ PDF Ask
Coloring with no $2$-Colored $P_4$'s 2004-03-31 Michael O. Albertson Glenn G. Chappell H. A. Kierstead André Kündgen Radhika Ramamurthi 1
+
Finiteness property of pairs of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:mn>2</mml:mn><mml:mo>×</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math> sign-matrices via real extremal polytope norms 2009-11-04 Antonio Cicone Nicola Guglielmi Stefano Serra‐Capizzano Marino Zennaro 1
+
Personal reminiscences and remarks on the mathematical work of Tibor Gallai 1982-09-01 Paul Erdős 1
+
Lectures on modern mathematics, Vol. II 1965-01-01 I. I. Pyatetskii-Shapiro 1
+ PDF Ask
The Local Cut Lemma 2017-03-29 Anton Bernshteyn 1
+ PDF Ask
Highly nonrepetitive sequences: Winning strategies from the local lemma 2010-11-15 Wesley Pegden 1
+
A new class of graphs that satisfies the Chen-Chv\'atal Conjecture 2016-06-20 Pierre Aboulker Martı́n Matamala Paul Rochet José Zamora 1
+ PDF Ask
A Generalization of Repetition Threshold 2003-01-01 Lucian Ilie Pascal Ochem Jeffrey Shallit 1
+ PDF Ask
A De Bruijn–Erdős Theorem for Chordal Graphs 2015-03-23 Laurent Beaudou Adrian Bondy Xiaohong Chen Ehsan Chiniforooshan Maria Chudnovsky Vašek Chvátal Nicolás Fraiman Yori Zwólš 1