Cover Image

Locked Polyomino Tilings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tucker-Foltz, Jamie
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics 37B52 G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Bijection between Stacked Directed Polyominoes and Motzkin Paths with Alternative Catastrophes
by: Schager, Florian, et al.
Published: (2024)

Enumeration of Polyominoes up to Size N=59
by: Shirakawa, Toshihiro
Published: (2025)

Binary Words Containing Few Abelian Squares
by: Fazekas, Szilard Zsolt, et al.
Published: (2026)

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

Dyck Paths Enumerated by the Q-bonacci Numbers
by: Barcucci, Elena, et al.
Published: (2024)

On The Roots of Independence Polynomial: Quantifying The Gap
by: Prakash, Om, et al.
Published: (2025)

The Converse of the Real Orthogonal Holant Theorem
by: Young, Ben
Published: (2024)

Helly-type problems from a topological perspective
by: Paták, Pavel, et al.
Published: (2026)

Almost optimum $\ell$-covering of $\mathbb{Z}_n$
by: Shi, Ke, et al.
Published: (2022)

Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
by: Dong, Shiying
Published: (2024)

Ammann Bars for Octagonal Tilings
by: Fernique, Thomas, et al.
Published: (2022)

Facet-Hamiltonicity
by: Akitaya, Hugo, et al.
Published: (2024)

Breaking the Symmetries of Amenable Graphs
by: Cheng, Christine T.
Published: (2025)

Extending Wormald's Differential Equation Method to One-sided Bounds
by: Bennett, Patrick, et al.
Published: (2023)

Erdős Matching (Conjecture) Theorem
by: Mishra, Tapas Kumar
Published: (2026)

An Improved Lower Bound on the Number of Pseudoline Arrangements
by: Kühnast, Fernando Cortés, et al.
Published: (2024)

A Row-wise Algorithm for Graph Realization
by: van der Hulst, Rolf, et al.
Published: (2024)

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

The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)

Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)

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

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
by: Streit, Robert P., et al.
Published: (2024)

A chiral aperiodic monotile
by: Smith, David, et al.
Published: (2023)

An aperiodic monotile
by: Smith, David, et al.
Published: (2023)

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
by: Bom, David, et al.
Published: (2025)

On the Metric Dimension of $K_a \times K_b \times K_c$
by: Gledel, Valentin, et al.
Published: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Growth Forms of Tilings
by: Hilgers, Peter, et al.
Published: (2025)

Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)

Rises for Measuring Local Distributivity in Lattices
by: Abdulla, Mohammad, et al.
Published: (2025)

Enumerating moves in the optimal solution of the Tower of Hanoi
by: Belbachir, Hacène, et al.
Published: (2022)

Error-Correcting Graph Codes
by: Kopparty, Swastik, et al.
Published: (2024)

Morphic Sequences: Complexity and Decidability
by: Henry, Raphael
Published: (2024)

Robot Positioning Using Torus Packing for Multisets
by: Chen, Chung Shue, et al.
Published: (2024)

Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
by: Cai, Jin-Yi, et al.
Published: (2025)

A first efficient algorithm for enumerating all the extreme points of a bisubmodular polyhedron
by: Matsui, Yasuko, et al.
Published: (2024)

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025)