Imagen de Portada

Undecidability of the block gluing classes of homshifts

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chandgotia, Nishant, Gangloff, Silvère, de Menibus, Benjamin Hellouin, Oprocha, Piotr
Formato:	Preprint
Publicado:	2025
Materias:	Dynamical Systems Computational Complexity Discrete Mathematics 37B51 05C60 68Q17
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the cohomology of homshifts
por: Chandgotia, Nishant, et al.
Publicado: (2025)

Minimality and computability of languages of G-shifts
por: Amir, Djamel Eddine, et al.
Publicado: (2025)

Short-range and long-range order: a transition in block-gluing behavior in Hom shifts
por: Gangloff, Silvere, et al.
Publicado: (2022)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
por: Edwards, Darren J.
Publicado: (2025)

Computational Complexity of Minimal Trap Spaces in Boolean Networks
por: Moon, Kyungduk, et al.
Publicado: (2022)

Finitely Dependent Processes on Subshifts
por: Chandgotia, Nishant, et al.
Publicado: (2026)

Homomorphically Full Oriented Graphs
por: Bellitto, Thomas, et al.
Publicado: (2022)

Characterisation of the Set of Ground States of Uniformly Chaotic Finite-Range Lattice Models
por: Gayral, Léo, et al.
Publicado: (2023)

Subshifts defined by nondeterministic and alternating plane-walking automata
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2024)

Trifferent codes with small lengths
por: Kurz, Sascha
Publicado: (2023)

Structure and computability of preimages in the Game of Life
por: Salo, Ville, et al.
Publicado: (2023)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

Parametrized complexity of relations between multidimensional subshifts
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2025)

Two-player Domino games
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2023)

Results on three problems on isolation of graphs
por: Borg, Peter, et al.
Publicado: (2026)

WalkSAT is linear on random 2-SAT
por: Berenbrink, Petra, et al.
Publicado: (2024)

Non-Robustness of the Zero-Temperature-Limit Gibbs Measures to Perturbations of the Potential
por: Gayral, Léo, et al.
Publicado: (2025)

Ulam meets Turing: constructing quadratic maps with non-computable SRB measures
por: Rojas, Cristóbal, et al.
Publicado: (2024)

Complexity of learning matchings and half graphs via edge queries
por: Mande, Nikhil S., et al.
Publicado: (2025)

On the algorithmic descriptive complexity of attractors in topological dynamics
por: Rojas, Cristobal, et al.
Publicado: (2023)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

String attractors and bi-infinite words
por: Béaur, Pierre, et al.
Publicado: (2024)

Edge open packing: complexity, algorithmic aspects, and bounds
por: Brešar, Boštjan, et al.
Publicado: (2024)

Linear extensions of finite posets
por: Chan, Swee Hong, et al.
Publicado: (2023)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Graph polynomials: some questions on the edge
por: Farr, Graham, et al.
Publicado: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
por: Chatterjee, Arnab, et al.
Publicado: (2025)

Regenerative Ulam-von Neumann Algorithm: An Innovative Markov chain Monte Carlo Method for Matrix Inversion
por: Ghosh, Soumyadip, et al.
Publicado: (2024)

Folding One Polyhedral Metric Graph into Another
por: Chung, Lily, et al.
Publicado: (2024)

Density of group languages in shift spaces
por: Berthé, Valérie, et al.
Publicado: (2024)

Trail Trap: a variant of Partizan Edge Geography
por: Buchanan, Calum, et al.
Publicado: (2024)

Sum-of-squares lower bounds for Non-Gaussian Component Analysis
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Boltzmann Distribution on "Short" Integer Partitions with Power Parts: Limit Laws and Sampling
por: Peyen, Jean C., et al.
Publicado: (2023)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
por: Cicerone, Serafino, et al.
Publicado: (2025)

Complexity of chess domination problems
por: Langlois-Rémillard, Alexis, et al.
Publicado: (2022)

Symbol Frequencies in Surjective Cellular Automata
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2025)

On balanceable and simply balanceable regular graphs
por: Ahanjideh, Milad, et al.
Publicado: (2024)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
por: Pak, Igor, et al.
Publicado: (2025)

Vanishing of Schubert coefficients in probabilistic polynomial time
por: Pak, Igor, et al.
Publicado: (2025)

Two block gluing constructions
por: Salo, Ville, et al.
Publicado: (2026)