Imagen de Portada

Self-Orthogonal Cellular Automata

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mariot, Luca, Mazzone, Federico
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Combinatorial Designs and Cellular Automata: A Survey
por: Manzoni, Luca, et al.
Publicado: (2025)

Enumeration of Sets of Mutually Orthogonal Latin Rectangles
por: Jäger, Gerold, et al.
Publicado: (2019)

Orthogonality between acyclic subdigraphs and paths in digraphs
por: Silva, Caroline A. de Paula, et al.
Publicado: (2026)

Improving SAT Solvers on Orthogonal Latin Square Problems
por: Barnoff, Aaron, et al.
Publicado: (2026)

Progress on Self Identifying Codes
por: Jean, Devin, et al.
Publicado: (2025)

Transitive Sets of Mutually Orthogonal Latin Squares
por: Keita, Amadou, et al.
Publicado: (2026)

Larger Nearly Orthogonal Sets over Finite Fields
por: Haviv, Ishay, et al.
Publicado: (2024)

The Gray graph is pseudo 2-factor isomorphic
por: Abreu, Marien, et al.
Publicado: (2025)

Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
por: Azam, Naveed Ahmed, et al.
Publicado: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
por: Goedgebeur, Jan, et al.
Publicado: (2024)

The Converse of the Real Orthogonal Holant Theorem
por: Young, Ben
Publicado: (2024)

Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
por: Carton, Olivier, et al.
Publicado: (2024)

Nearly Orthogonal Sets over Finite Fields
por: Chawin, Dror, et al.
Publicado: (2024)

On the Convergence of Elementary Cellular Automata under Sequential Update Modes
por: Donoso-Leiva, Isabel, et al.
Publicado: (2025)

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

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

Determining a graph from its reconfiguration graph
por: Berthe, Gaétan, et al.
Publicado: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
por: Bourneuf, Romain, et al.
Publicado: (2025)

Induced Minors and Region Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
por: Dailly, Antoine, et al.
Publicado: (2025)

Accelerated Cops and Robbers
por: Kinnersley, William B., et al.
Publicado: (2025)

Faces in rectilinear drawings of complete graphs
por: Balko, Martin, et al.
Publicado: (2025)

4-tangrams are 4-avoidable
por: Ochem, Pascal, et al.
Publicado: (2025)

Computer-assisted graph theory: a survey
por: Jooken, Jorik
Publicado: (2025)

String Graph Obstacles of High Girth and of Bounded Degree
por: Chudnovsky, Maria, et al.
Publicado: (2025)

Row Impartial Terminus
por: Gottlieb, Eric, et al.
Publicado: (2025)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
por: Weiß, Meike, et al.
Publicado: (2025)

On expectations and variances in the hard-core model on bounded degree graphs
por: Davies, Ewan, et al.
Publicado: (2025)

Chromatic discrepancy of locally $s$-colourable graphs
por: Corsini, Timothée, et al.
Publicado: (2025)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

What is and is not inside a Cayley graph?
por: Knauer, Kolja, et al.
Publicado: (2025)

How to see the forest for the trees
por: Bérczi-Kovács, Erika, et al.
Publicado: (2025)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
por: Bafna, Mehul, et al.
Publicado: (2025)

Throttling for metric dimension and its variants
por: Brimkov, Boris, et al.
Publicado: (2025)

Note about the complexity of the acyclic orientation with parity constraint problem
por: Gravier, Sylvain, et al.
Publicado: (2025)

On the order-diameter ratio of girth-diameter cages
por: Cambie, Stijn, et al.
Publicado: (2025)

Odd coloring graphs with linear neighborhood complexity
por: Davies, James, et al.
Publicado: (2025)

Disproving two conjectures on the Hamiltonicity of Venn diagrams
por: Brenner, Sofia, et al.
Publicado: (2025)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
por: Gutin, Gregory, et al.
Publicado: (2025)