Related papers: Self-descriptive Sequences directed by two Periodi…
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…
It is shown that a random binary process with impulse-like autocorrelation can be generated by randomizing the length of symbols occurring in a random Bernoulli process. Such randomization is achieved by random (or judiciously designed…
In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…
It is shown that Jamison sequences, introduced in 2007 by Badea and Grivaux ([C. Badea and S. Grivaux, Unimodular eigenvalues, uniformly distributed sequences and linear dynamics, Adv. Math. 211 (2007), no. 2, 766--793]), arise naturally in…
Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…
Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwenian sequences}, first with values $\pm 1$, then with values…
The paper concerns the problem of predicting the effect of actions or interventions on a system from a combination of (i) statistical data on a set of observed variables, and (ii) qualitative causal knowledge encoded in the form of a…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
After giving an overview of the existing theory regarding the periods of sequences defined by linear recurrences over finite fields, we give explicit descriptions of the sets of periods that arise if one considers all sequences over…
Finite discrete Huffman sequences, together with their extension to n-dimensional arrays, are highly valued because their discrete aperiodic auto-correlations optimally approximate the continuum form of the delta function. We present here…
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…
In the present paper, we define two directed pseudo graphs. Then, we investigate the adjacency matrices of the defined graphs and show that the permanents of the adjacency matrices are Jacobsthal and Jacobsthal-Lucas numbers.
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
In this paper we formally define the family of sequences know as "Pea Pattern". We then analyse its behaviour and conditions for fixed and periodic points. The paper ends with a list of fixed points and cycles.
The pure $O$-sequences of the form $(1,a,a,\ldots)$ are classified.
The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…
In this study, several interesting iterative sequences were investigated. First, we define the iterative sequences. We fix function f(n). An iterative sequence starts with a natural number n, and calculates the sequence f(n),f(f(n)),…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
The paper deals with real valued sequences and its distribution on real line.
Sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. Among the known sequences, cyclotomic families have the optimal autocorrelation property. In this paper, we…