Cover Image

Undecidability of Translational Tiling with 2 Polycubes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kim, Yoonhu
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 52C22 (Primary) 68Q17 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Undecidability of Tiling the Plane with a Set of 5 Polyominoes
by: Kim, Yoonhu
Published: (2025)

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
by: Ilmavirta, Joonas, et al.
Published: (2023)

Worpitzky-compatible sets and the freeness of arrangements between Shi and Catalan
by: Abe, Takuro, et al.
Published: (2024)

General uncrossing covering paths inside the axis-aligned bounding box
by: Ripà, Marco
Published: (2024)

Finite-state transducers for substitution tilings
by: Tatham, Simon
Published: (2025)

Friends-and-strangers is PSPACE-complete
by: Yang, Chao, et al.
Published: (2024)

On asymptotic Lebesgue's universal covering problem
by: Arman, Andrii, et al.
Published: (2025)

Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
by: Ye, Yuhan
Published: (2026)

Characteristic quasi-polynomials of deletions of Shi arrangements of type B and their period collapse
by: Higashitani, Akihiro, et al.
Published: (2024)

Characteristic quasi-polynomials for deformations of Coxeter arrangements of types A, B, C, and D
by: Mori, Yusuke, et al.
Published: (2022)

Closed-Form Decomposition for Simplicial Cones and PDBarv Algorithm for Lattice Point Counting
by: Tao, Sihao, et al.
Published: (2025)

Self-avoiding space-filling folding curves in dimension 3
by: Oger, Francis
Published: (2025)

Box complexes: at the crossroad of graph theory and topology
by: Daneshpajouh, Hamid Reza, et al.
Published: (2023)

On lower bounds of the density of planar periodic sets without unit distances
by: Tolmachev, Alexander
Published: (2024)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

Identifying contact graphs of sphere packings with generic radii
by: Dewar, Sean
Published: (2023)

Convex bodies of constant width with exponential illumination number
by: Arman, Andrii, et al.
Published: (2023)

Relative Helicity and Tiling Twist
by: Khesin, Boris, et al.
Published: (2024)

Computing the number of realisations of a rigid graph
by: Dewar, Sean, et al.
Published: (2025)

Generalized root systems
by: Dimitrov, Ivan, et al.
Published: (2023)

P not equal to NP
by: Delgado, Daniel Cardona
Published: (2023)

Elekes-Szabó for collinearity on cubic surfaces
by: Bays, Martin, et al.
Published: (2022)

Permanental rank versus determinantal rank of random matrices over finite fields
by: Ghasemi, Fatemeh, et al.
Published: (2025)

The antiferromagnetic Ising model beyond line graphs
by: Jerrum, Mark
Published: (2026)

Symmetric Domino Tilings of Aztec Diamonds
by: Paul, Pravakar, et al.
Published: (2024)

3D domino tilings: irregular disks and connected components under flips
by: de Marreiros, Raphael
Published: (2022)

Domino tilings of three-dimensional cylinders: regularity of hamiltonian disks
by: de Marreiros, Raphael
Published: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

Equality cases of the Alexandrov--Fenchel inequality are not in the polynomial hierarchy
by: Chan, Swee Hong, et al.
Published: (2023)

On the Chromatic Number of Grassmann Graphs
by: D'haeseleer, Jozefien, et al.
Published: (2025)

Transitive $(q-1)$-fold packings of $\rm{PG}_n(q)$
by: Hawtin, Daniel R.
Published: (2024)

On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

A Carousel Property for Compact Convex Sets
by: Song, Yiming
Published: (2025)

A property of trivalent graphs related to equidissections
by: Rudenko, Daniil
Published: (2014)

Quantitative Transversal Theorems in the Plane
by: Axelrod-Freed, Ilani, et al.
Published: (2023)

Paintbucket on graphs is PSPACE-complete
by: Saunders, Ethan J., et al.
Published: (2024)

Computational Complexity of Determining the Assembly Index
by: Masierak, Piotr
Published: (2026)

Linear operators preserving volume polynomials
by: Grund, Lukas, et al.
Published: (2025)

Optimal quantization with branched optimal transport distances
by: Pegon, Paul, et al.
Published: (2023)

Eight-Partitioning Points in 3D, and Efficiently Too
by: Aronov, Boris, et al.
Published: (2024)