Net Occurrences in Fibonacci and Thue-Morse Words
Fuente:
arXiv
Saved in:
| Main Authors: | Guo, Peaker, Kishi, Kaisei |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025)
by: Kishi, Kaisei, et al.
Published: (2025)
The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)
by: Banbara, Mutsunori, et al.
Published: (2026)
EPTAS for Hard Graph Cut Problems for Dense Graphs
by: Deguchi, Kaisei, et al.
Published: (2026)
by: Deguchi, Kaisei, et al.
Published: (2026)
p-complete square-free Word-representation of Word-representable Graphs
by: Das, Biswajit, et al.
Published: (2025)
by: Das, Biswajit, et al.
Published: (2025)
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)
by: Mozhui, Khyodeno, et al.
Published: (2025)
Word-Representation of Melon Graphs
by: Mozhui, Khyodeno, et al.
Published: (2026)
by: Mozhui, Khyodeno, et al.
Published: (2026)
Word-Representability of Shift Graphs
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
Exhaustive Generation of Pattern-Avoiding s-Words
by: Buick, Samuel, et al.
Published: (2025)
by: Buick, Samuel, et al.
Published: (2025)
Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
On Lexicographic Product and Multi-Word-Representability
by: Kenkireth, Benny George, et al.
Published: (2026)
by: Kenkireth, Benny George, et al.
Published: (2026)
On Occurrence-Preserving Morphisms
by: Kishi, Kaisei, et al.
Published: (2026)
by: Kishi, Kaisei, et al.
Published: (2026)
Word-Representability of Well-Partitioned Chordal Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
Representation Number of Word-Representable Split Graphs
by: Dwary, Tithi, et al.
Published: (2025)
by: Dwary, Tithi, et al.
Published: (2025)
On the Word-Representability of 5-Regular Circulant Graphs
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Characterization of Double-Arborescences and their Minimum-Word-Representants
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Characterization of Word-Representable Graphs using Modular Decomposition
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)
by: Srinivasan, Eshwar, et al.
Published: (2025)
Consecutive Power Occurrences in Sturmian Words
by: Bell, Jason, et al.
Published: (2024)
by: Bell, Jason, et al.
Published: (2024)
Some Fibonacci-Related Sequences
by: Cloitre, Benoit, et al.
Published: (2023)
by: Cloitre, Benoit, et al.
Published: (2023)
Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
by: Moradi, Delaram, et al.
Published: (2026)
by: Moradi, Delaram, et al.
Published: (2026)
The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)
by: Guo, Shanshan, et al.
Published: (2024)
Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)
by: Gerke, S., et al.
Published: (2026)
Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Pattern Avoidance for Fibonacci Sequences using $k$-Regular Words
by: Downing, Emily, et al.
Published: (2023)
by: Downing, Emily, et al.
Published: (2023)
Binary Words Containing Few Abelian Squares
by: Fazekas, Szilard Zsolt, et al.
Published: (2026)
by: Fazekas, Szilard Zsolt, et al.
Published: (2026)
Random 0/1-polytopes expand rapidly
by: Guo, He, et al.
Published: (2026)
by: Guo, He, et al.
Published: (2026)
Greedy Gray Codes for some Restricted Classes of Binary Words
by: Hassler, Nathanaël, et al.
Published: (2024)
by: Hassler, Nathanaël, et al.
Published: (2024)
Balanced Fibonacci word rectangles, and beyond
by: Shallit, Jeffrey, et al.
Published: (2025)
by: Shallit, Jeffrey, et al.
Published: (2025)
Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)
by: Goetze, Miriam, et al.
Published: (2025)
On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)
by: Gollin, J. Pascal, et al.
Published: (2025)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)
by: Bonnet, Édouard, et al.
Published: (2025)
Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)
by: Mariot, Luca, et al.
Published: (2025)
Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)
by: Jean, Devin, et al.
Published: (2025)
Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Similar Items
-
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025) -
The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026) -
EPTAS for Hard Graph Cut Problems for Dense Graphs
by: Deguchi, Kaisei, et al.
Published: (2026) -
p-complete square-free Word-representation of Word-representable Graphs
by: Das, Biswajit, et al.
Published: (2025) -
Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)