Related papers: A Construction for Perfect Periodic Autocorrelatio…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…
Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in…
The Kolakoski sequence is the unique infinite sequence with values in $\{1,2\}$ and first term $1$ which equals the sequence of run-lengths of itself, we call this $K(1,2).$ We define $K(m,n)$ similarly. A well-known conjecture is that the…
In this paper, we study some properties of associated sequences of special polynomials. From the properties of associated sequences of polynomials, we derive some interesting identities of special polynomials.
Let $T$ be a digraph with vertices $u_1, \dots, u_t$ ($t\ge 2$) and let $H_1, \dots, H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1, \dots, H_t]$ is a digraph with vertex set…
Borwein and Mossinghoff investigated the Rudin-Shapiro-like sequences, which are infinite families of binary sequences, usually represented as polynomials. Each family of Rudin-Shapiro-like sequences is obtained from a starting sequence…
We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
We investigate coherency properties of certain completed integral group rings, precisely for compact $p$-adic Lie groups.
For an extension of associative algebras $B\subset A$ over a field and an $A$-bimodule $X$, we obtain a Jacobi-Zariski long nearly exact sequence relating the Hochschild homologies of $A$ and $B$, and the relative Hochschild homology, all…
We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that…
We introduce the Picard group of corings. We extend the well-known exact sequence from algebras and coalgebras over fields to corings. We extend the Aut-Pic property to corings and we give some new examples of corings having this property.…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
Perfectoid versions of Abel Jacobi and Reimann Roch Theorem are proved, and perfectoid Elliptic Curve is constructed. A Perfectoid Tate Curve is defined and its cohomology computed via a \v{C}ech complex. Furthermore, perfectoid Theta…
We suggest the notion of perfect integrability for quantum spin chains and conjecture that quantum spin chains are perfectly integrable. We show the perfect integrability for Gaudin models associated to simple Lie algebras of all finite…
An $m$-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation…
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…
A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle. It is called $k$-semi-perfect if the union of any pair of…
In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…