Image de couverture de livre

Morphic Sequences: Complexity and Decidability

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Henry, Raphael
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics G.2.1.
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Orthogonality of Generalized Pattern Sequences
par: Li, Shuo
Publié: (2024)

Robot Positioning Using Torus Packing for Multisets
par: Chen, Chung Shue, et autres
Publié: (2024)

A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
par: Matsui, Yasuko, et autres
Publié: (2024)

Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
par: Cai, Jin-Yi, et autres
Publié: (2025)

Natural Measures on Polyominoes Induced by the Abelian Sandpile Model
par: Sportiello, Andrea
Publié: (2024)

Dyck Paths Enumerated by the Q-bonacci Numbers
par: Barcucci, Elena, et autres
Publié: (2024)

A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
par: Schager, Florian, et autres
Publié: (2024)

The Converse of the Real Orthogonal Holant Theorem
par: Young, Ben
Publié: (2024)

On The Roots of Independence Polynomial: Quantifying The Gap
par: Prakash, Om, et autres
Publié: (2025)

Binary Words Containing Few Abelian Squares
par: Fazekas, Szilard Zsolt, et autres
Publié: (2026)

Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
par: Dong, Shiying
Publié: (2024)

Incremental computation of the set of period sets
par: Rivals, Eric
Publié: (2024)

Reduction of the graph isomorphism problem to equality checking of $n$-variables polynomials and the algorithms that use the reduction
par: Prolubnikov, Alexander
Publié: (2015)

Breaking the Symmetries of Amenable Graphs
par: Cheng, Christine T.
Publié: (2025)

Extending Wormald's Differential Equation Method to One-sided Bounds
par: Bennett, Patrick, et autres
Publié: (2023)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
par: Gillman, David, et autres
Publié: (2026)

Pattern Avoidance for Fibonacci Sequences using $k$-Regular Words
par: Downing, Emily, et autres
Publié: (2023)

Pop Stacks with a Bypass
par: Cioni, Lapo, et autres
Publié: (2024)

An Improved Lower Bound on the Number of Pseudoline Arrangements
par: Kühnast, Fernando Cortés, et autres
Publié: (2024)

Erdős Matching (Conjecture) Theorem
par: Mishra, Tapas Kumar
Publié: (2026)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
par: Könen, David, et autres
Publié: (2023)

Constructions, bounds, and algorithms for peaceable queens
par: Clinch, Katie, et autres
Publié: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
par: Streit, Robert P., et autres
Publié: (2024)

Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete
par: Koepke, Finn Orson
Publié: (2025)

The Hierarchy of Saturating Matching Numbers
par: Simon, Hans U., et autres
Publié: (2025)

Almost optimum $\ell$-covering of $\mathbb{Z}_n$
par: Shi, Ke, et autres
Publié: (2022)

Locked Polyomino Tilings
par: Tucker-Foltz, Jamie
Publié: (2023)

WELLDOC property for words generated by morphisms
par: Puzynina, Svetlana, et autres
Publié: (2026)

On the Metric Dimension of $K_a \times K_b \times K_c$
par: Gledel, Valentin, et autres
Publié: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
par: Shota, Kan, et autres
Publié: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
par: Bom, David, et autres
Publié: (2025)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
par: Adamson, Duncan, et autres
Publié: (2023)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
par: Cavallaro, Dario, et autres
Publié: (2026)

Dual VC Dimension Obstructs Sample Compression by Embeddings
par: Chase, Zachary, et autres
Publié: (2024)

Spherical dimension
par: Chornomaz, Bogdan, et autres
Publié: (2025)

Optimal covering of rectangular grid graphs with tours of constrained length
par: Bereg, Sergey, et autres
Publié: (2025)

Error-Correcting Graph Codes
par: Kopparty, Swastik, et autres
Publié: (2024)

Enumerating moves in the optimal solution of the Tower of Hanoi
par: Belbachir, Hacène, et autres
Publié: (2022)

Enumeration of Polyominoes up to Size N=59
par: Shirakawa, Toshihiro
Publié: (2025)