Related papers: Autocorrelation-Run Formula for Binary Sequences
The use of empirical characteristic functions for inference problems, including estimation in some special parametric settings and testing for goodness of fit, has a long history dating back to the 70s (see for example, Feuerverger and…
A binary relation over a free monoid is synchronous if it can be recognized by a synchronous automaton that reads its two tapes simultaneously. We consider the case where the free monoid is generated by a single element (which makes it…
We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…
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…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…
Temporal correlations in the time series observed in various systems have been characterized by the autocorrelation function. Such correlations can be explained by heavy-tailed interevent time distributions as well as by correlations…
The concept of boolean autonomous deterministic regular asynchronous system has its origin in switching theory, the theory of modeling the switching circuits from the digital electrical engineering. The attribute boolean vaguely refers to…
Many types of point singularity have a topological index, or 'charge', associated with them. For example the phase of a complex field depending on two variables can either increase or decrease on making a clockwise circuit around a simple…
The paperfolding sequences form an uncountable class of infinite sequences over the alphabet $\{ -1, 1 \}$ that describe the sequence of folds arising from iterated folding of a piece of paper, followed by unfolding. In this note we observe…
We propose a new autocorrelation measure for functional time series that we term spherical autocorrelation. It is based on measuring the average angle between lagged pairs of series after having been projected onto the unit sphere. This new…
A sequence is a fractal sequence if it contains itself as a proper subsequence. (The self-containment property resembles that of visual fractals) A doubly fractal sequence of integers is defined by operations called upper trimming and lower…
We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are either 0, 1 or -1. The only known Barker sequences have length 2, 3, 4, 5, 7, 11 or 13. It is an old conjecture that no longer Barker sequences…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
A binary renewal process is a stochastic process $\{X_n\}$ taking values in $\{0,1\}$ where the lengths of the runs of 1's between successive zeros are independent. After observing ${X_0,X_1,...,X_n}$ one would like to predict the future…
This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of their variants studied in the setting of knowledge…
A random coefficient autoregressive process is deeply investigated in which the coefficients are correlated. First we look at the existence of a strictly stationary causal solution, we give the second-order stationarity conditions and the…
The momentum or velocity autocorrelation function C(t) for a tagged oscillator in a finite harmonic system decays like that of an infinite system for short times, but exhibits erratic behavior at longer time scales. We introduce the…