Search arXivSearch

arXiv · 2506.20296

On Base, Normal and Near-normal Sequences

Abstract

The base sequences BS(n+1,n) are four sequences of $\pm1$ and lengths n+1,n+1,n,n with zero auto correlation. The base sequence conjecture states that BS(n+1,n) exists for all positive integers and has been verified for $n\le40$. We present our algorithm and give construction of BS(n+1,n) for $n=41,42,43$.\\ The Normal sequences NS (n) and the Near-normal sequences NNS (n) are subclasses of BS(n+1,n). Yang conjecture asserts that there is a NNS(n) for each even integer n and has been verified for $n\le40$. We found that there is no NNS(n) for n=42 and 44 by exhaustive search, which gives the first counter case of Yang conjecture. We also show that there is no NS(n) for n=41,42,43,44,45 by exhaustive search and proves that no NS(n) exist for $n=8k-2,k \in Z_+$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xu Wang, Jiayi Zhu. 2026-02-05. On Base, Normal and Near-normal Sequences. https://arxiv.org/abs/2506.20296

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO