Imagen de Portada

New upper bounds for the period of a negative orientable sequence

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mitchell, Chris J, Wild, Peter R
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics 05C38 94A55
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Constructing orientable and negative orientable sequences with asymptotically optimal period
por: Mitchell, Chris J, et al.
Publicado: (2026)

Orientable and negative orientable sequences
por: Mitchell, Chris J, et al.
Publicado: (2024)

Special orientable sequences
por: Mitchell, Chris J, et al.
Publicado: (2024)

Negative Avoiding Sequences
por: Mitchell, Chris J, et al.
Publicado: (2026)

An improved lower bound on the Shannon capacities of complements of odd cycles
por: Zhu, Daniel G.
Publicado: (2024)

Orientable sequences over non-binary alphabets
por: Alhakim, Abbas, et al.
Publicado: (2024)

Construction of Linear Codes from the Unit Graph $G(\mathbb{Z}_{n})$
por: Jain, Rupali S., et al.
Publicado: (2023)

$\mathit{SB}(3,n)$ has no Hamiltonian cycle when $n$ is even: a sign-of-permutation proof, with extension to all odd $m\equiv 3\pmod 4$
por: Li, Shisheng
Publicado: (2026)

Boolean Monomial Dynamical Systems
por: Colon-Reyes, Omar, et al.
Publicado: (2004)

Efficient total colorings of cubic maps of girth 4 and related topics
por: Dejter, Italo J
Publicado: (2026)

Total coloring of regular graphs of girth = degree + 1
por: Dejter, Italo J.
Publicado: (2024)

From semi-total to equitable total colorings
por: Dejter, I. J.
Publicado: (2025)

Construction of Linear Codes from the Unit Graph $G(\mathbb{Z}_{n}\oplus \mathbb{Z}_{m})$
por: Shaikh, Wajid M., et al.
Publicado: (2024)

Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques
por: Kontogeorgiou, George, et al.
Publicado: (2024)

Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences
por: Chang, Zuling, et al.
Publicado: (2024)

An upper bound on the size of a code with $s$ distances
por: Landjev, Ivan, et al.
Publicado: (2025)

The Existence and Structure of Universal Partial Cycles
por: Fillmore, Dylan, et al.
Publicado: (2023)

Ramsey sequences with bounded clique size
por: Aher, Abhishek Girish, et al.
Publicado: (2025)

The fundamental group in discrete homotopy theory
por: Kapulkin, Chris, et al.
Publicado: (2023)

Long antipaths and anticycles in oriented graphs
por: Chen, Bin, et al.
Publicado: (2024)

Better bounds for the union-closed sets conjecture using the entropy approach
por: Cambie, Stijn
Publicado: (2022)

An improvement bound on a problem of Picasarri-Arrieta and Rambaud
por: Chen, Bin, et al.
Publicado: (2026)

Odd-Ramsey numbers of complete bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2024)

Lower bounds for online size Ramsey numbers for paths
por: Adamska, Natalia, et al.
Publicado: (2025)

Paths with two blocks in oriented graphs of large minimum semi-degree
por: Chen, Bin, et al.
Publicado: (2025)

The number of edges in graphs with bounded clique number and circumference
por: Dou, Chunyang, et al.
Publicado: (2024)

New upper bounds for binary linear covering codes
por: Davydov, Alexander A., et al.
Publicado: (2025)

Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs
por: Kashima, Masaki
Publicado: (2025)

The generalizations of Hamiltonian in oriented graphs
por: Zhou, Jia, et al.
Publicado: (2024)

Cycle-factors in oriented graphs
por: Wang, Zhilan, et al.
Publicado: (2024)

Moments of Autocorrelation Demerit Factors of Binary Sequences
por: Katz, Daniel J., et al.
Publicado: (2023)

Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences
por: Katz, Daniel J., et al.
Publicado: (2023)

Arbitrary orientations of cycles in oriented graphs
por: Wang, Guanghui, et al.
Publicado: (2025)

Turán-type and tiling problems in oriented graphs
por: Chen, Ming, et al.
Publicado: (2026)

An extension of the Lindström-Gessel-Viennot theorem
por: Lee, Yi-Lin
Publicado: (2021)

Cycles in graphs and in hypergraphs: towards homology theory
por: Miroshnikov, A., et al.
Publicado: (2024)

Construction of 2-D Z-Complementary Array Code Sets with Flexible Lengths for Different System Requirements
por: Roy, Abhishek
Publicado: (2021)

A matrix for counting paths in acyclic colored digraphs
por: Bera, Sudip
Publicado: (2022)

When entropy meets Turán: new proofs and hypergraph Turán results
por: Chao, Ting-Wei, et al.
Publicado: (2024)

An improved hypergraph Mantel's Theorem
por: Iľkovič, Daniel, et al.
Publicado: (2025)