Cover Image

Critical exponent of binary words with few distinct palindromes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dvořáková, L'ubomíra, Ochem, Pascal, Opočenská, Daniela
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Critical exponent of ternary words with few distinct palindromes
by: Dvořáková, Ľubomíra, et al.
Published: (2025)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)

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

Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)

Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)

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

The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, 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)

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

A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)

Stability for binary scalar products
by: Kupavskii, Andrey, et al.
Published: (2024)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces
by: Brucker, Francois, et al.
Published: (2024)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
by: Sumnicht, Christopher, et al.
Published: (2024)

Recovery of cyclic words by their subwords
by: Luchinin, 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)

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

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

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

Combinatorial Nullstellensatz Techniques
by: Freed, Daniel L.
Published: (2024)

Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)

Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

The Combinatorics of Motzkin Polyominoes
by: Baril, Jean-Luc, et al.
Published: (2024)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
by: Adak, Rajat, et al.
Published: (2026)

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

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)