Related papers: Symmetric measures of pseudorandomness for binary …
We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
We propose a generalization of pseudospin and spin symmetries, the SU(2) symmetries of Dirac equation with scalar and vector mean-field potentials originally found independently in the 70's by Smith and Tassie, and Bell and Ruegg. As…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…
We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and min-wise independent hashing. For random variables whose…
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…
This paper studies properties of binary runlength-limited sequences with additional constraints on their Hamming weight and/or their number of runs of identical symbols. An algebraic and a probabilistic (entropic) characterization of the…
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them…
Let $A$ be a Banach algebra with a right identity $u$ such that $uA$ is commutative and semisimple. In this paper, we investigate symmetric bi-derivations of $A$ and detremine their range. We also study symmetric bi-derivations of $A$ with…
The generalized cyclotomic binary sequences $S=S(a, b, c)$ with period $n=pq$ have good autocorrelation property where $(a, b, c)\in \{0, 1\}^3$ and $p, q$ are distinct odd primes. For some cases, the sequences $S$ have ideal or optimal…
Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…
The similarity renormalization group is used to transform Dirac Hamiltonian into a diagonal form, which the upper (lower) diagonal element becomes an operator describing Dirac (anti-)particle. The eigenvalues of the operator are verfied to…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
We consider an ensemble of $2\times 2$ normal matrices with complex entries representing operators in the quantum mechanics of 2 - level parity-time reversal (PT) symmetric systems. The randomness of the ensemble is endowed by obtaining…
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
Binary cyclic codes are worth studying due to their applications and theoretical importance. It is an important problem to construct an infinite family of cyclic codes with large minimum distance $d$ and dual distance $d^{\perp}$. In recent…
We present a Gaussian ensemble of random cyclic matrices on the real field and study their spectral fluctuations. These cyclic matrices are shown to be pseudo-symmetric with respect to generalized parity. We calculate the joint probability…