Matthieu Rosenfeld

From MaRDI portal
Person:668060

Available identifiers

zbMath Open rosenfeld.matthieuMaRDI QIDQ668060

List of research outcomes





PublicationDate of PublicationType
Reconstructing words using queries on subwords or factors2024-10-08Paper
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61472992024-01-15Paper
Reconstructing words using queries on subwords or factors2023-01-04Paper
Avoidability of Additive Cubes over Alphabets of Four Numbers2022-10-13Paper
Avoiding squares over words with lists of size three amongst four symbols2022-08-23Paper
It is undecidable whether the growth rate of a given bilinear system is 12022-07-26Paper
Avoiding square-free words on free groups2022-06-13Paper
Finding lower bounds on the growth and entropy of subshifts over countable groups2022-04-01Paper
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge2021-11-22Paper
Lower-bounds on the growth of power-free languages over large alphabets2021-09-28Paper
Avoiding large squares in trees and planar graphs2021-06-02Paper
Avoiding Square-Free Words on Free Groups2021-04-14Paper
Avoidability of palindrome patterns2021-01-29Paper
The binomial equivalence classes of finite words2020-10-14Paper
Another approach to non-repetitive colorings of graphs of bounded degree2020-09-08Paper
How far away must forced letters be so that squares are still avoidable?2020-08-27Paper
Lower-bounds on the growth of power-free languages over large alphabets2020-08-12Paper
Nice formulas, $xyx$-formulas, and palindrome patterns2020-05-11Paper
Templates for the \(k\)-binomial complexity of the Tribonacci word2019-12-17Paper
Templates for the \(k\)-binomial complexity of the Tribonacci word2019-11-06Paper
Bisplit graphs satisfy the Chen-Chv\'atal conjecture2019-08-01Paper
Bounding the number of $(\sigma,\rho)$-dominating sets in trees, forests and graphs of bounded pathwidth2019-04-05Paper
On some interesting ternary formulas2019-03-05Paper
Avoiding or Limiting Regularities in Words2019-01-24Paper
Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$2018-10-08Paper
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable2018-03-21Paper
On some interesting ternary formulas2017-11-15Paper
Avoidability of formulas with two variables2017-11-10Paper
Avoidability of Formulas with Two Variables2016-08-30Paper
Avoidability of long 𝑘-abelian repetitions2016-07-25Paper
On Vizing's problem for triangle-free graphsN/APaper

Research outcomes over time

This page was built for person: Matthieu Rosenfeld