:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Berthé, Valérie, Puzynina, Svetlana
Format:	Preprint
Published:	2022
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2205.07707
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Recovery of cyclic words by their subwords
by: Luchinin, Sergey, et al.
Published: (2024)

WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)

Obstructions to return preservation for episturmian morphisms
by: Berthé, Valérie, et al.
Published: (2024)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)

Enumeration in the lattice of $q$-decreasing words
by: Baril, Jean-Luc, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
by: Berthe, Gaétan, et al.
Published: (2024)

Minimum length word-representants of graph products
by: Srinivasan, Eshwar, et al.
Published: (2024)

Maximal number of subword occurrences in a word
by: Fang, Wenjie
Published: (2024)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)

Extended branching Rauzy induction
by: Dolce, Francesco, et al.
Published: (2025)

On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Spectral Moment of Order Four and the Uniqueness of the CCZ class of Dublin APN Permutation
by: Gillot, Valérie, et al.
Published: (2025)

Normality of 8-Bit Bent Function
by: Gillot, Valérie, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Unbounded length minimal synchronizing words for quantum channels over qutrits
by: Kjos-Hanssen, Bjørn, et al.
Published: (2026)

Period-rigidity of one-relator groups
by: Esnay, Solène J., et al.
Published: (2025)

Conformally rigid graphs
by: Steinerberger, Stefan, et al.
Published: (2024)

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

On the normality of Boolean quartics
by: Gillot, Valérie, et al.
Published: (2024)

Balanced Fibonacci word rectangles, and beyond
by: Shallit, Jeffrey, et al.
Published: (2025)

Density of group languages in shift spaces
by: Berthé, Valérie, et al.
Published: (2024)

The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)

Counting overlapping pairs of words
by: Rivals, Eric, et al.
Published: (2024)

Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)

A two-phase Volume of Fluid approach to model rigid-perfectly plastic granular materials
by: Düsterhöft-Wriggers, Wibke, et al.
Published: (2024)

Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
by: Parnas, Michal
Published: (2026)

Space-time reversible graph rewriting
by: Arrighi, Pablo, et al.
Published: (2025)

A note on hardness of promise hypergraph colouring
by: Wrochna, Marcin
Published: (2022)

Tree-layout based graph classes: proper chordal graphs
by: Paul, Christophe, et al.
Published: (2022)

On the parameterized complexity of computing tree-partitions
by: Bodlaender, Hans L., et al.
Published: (2022)

Approximation algorithms for job scheduling with block-type conflict graphs
by: Furmańczyk, Hanna, et al.
Published: (2022)

Coloring Mixed and Directional Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2022)