Back
  1. Home
  2. Profile of Matthieu Rosenfeld (ULiège)
Profil

Rosenfeld Matthieu

See author's contact details
Main Referenced Co-authors
Lejeune, Marie  (3)
Rigo, Michel  (3)
Beaudou, Laurent (1)
Kahn, Giacomo (1)
Main Referenced Keywords
combinatorics on words (2); Tribonacci word (2); Binomial coefficients (1); binomial coefficients (1); Bisplit graphs (1);
Main Referenced Disciplines
Mathematics (5)
Computer science (1)

Publications (total 5)

The most downloaded
248 downloads
Lejeune, M., Rigo, M., & Rosenfeld, M. (2019). Templates for the k-binomial complexity of the Tribonacci word. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/234215. https://hdl.handle.net/2268/234215

The most cited

6 citations (Scopus®)

Lejeune, M., Rigo, M., & Rosenfeld, M. (2020). Templates for the k-binomial complexity of the Tribonacci word. Advances in Applied Mathematics, 112. doi:10.1016/j.aam.2019.101947 https://hdl.handle.net/2268/244495

Rosenfeld, M. (2020). How far away must forced letters be so that squares are still avoidable? Mathematics of Computation, 89 (326), 3057-3071. doi:10.1090/MCOM/3535
Peer Reviewed verified by ORBi

Lejeune, M., Rigo, M., & Rosenfeld, M. (2020). Templates for the k-binomial complexity of the Tribonacci word. Advances in Applied Mathematics, 112. doi:10.1016/j.aam.2019.101947
Peer Reviewed verified by ORBi

Lejeune, M., Rigo, M., & Rosenfeld, M. (September 2019). Templates for the k-binomial complexity of the Tribonacci word. Lecture Notes in Computer Science, 11682, 238-250. doi:10.1007/978-3-030-28796-2_19
Peer reviewed

Lejeune, M., Rigo, M., & Rosenfeld, M. (2019). Templates for the k-binomial complexity of the Tribonacci word. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/234215.

Beaudou, L., Kahn, G., & Rosenfeld, M. (2019). Bisplit graphs satisfy the Chen-Chvátal conjecture. Discrete Mathematics and Theoretical Computer Science, 21 (1), 5509.
Peer Reviewed verified by ORBi

Contact ORBi