Related papers: Equality of morphic sequences
Boolean functions and binary sequences are main tools used in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences with period a power of two. We establish a…
We give equivalent conditions for a monomial sequence to be a d-sequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal…
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
We define a family of meta-Fibonacci sequences where the order of the of recursion at stage n is a variable r(n), and the n^{th} term of a sequence is the sum of the previous r(n) terms. For the terms of any such sequence, we give upper and…
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…
We consider in general two-block substitutions and their fixed points. We prove that some of them have a simple structure: their fixed points are morphic sequences. Others are intrinsically more complex, such as the Kolakoski sequence. We…
Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…
This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…
Dynamical sampling deals with frames of the form $\{T^n\varphi\}_{n=0}^\infty$, where $T \in B(\mathcal{H})$ belongs to certain classes of linear operators and $\varphi\in\mathcal{H}$. The purpose of this paper is to investigate a new…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…
In this article, we study short exact sequences of finitary 2-representations of a weakly fiat 2-category. We provide a correspondence between such short exact sequences with fixed middle term and coidempotent subcoalgebras of a coalgebra…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…
We define a morphic subshift as a subshift generated by the image of a substitution subshift by another substitution. In other words, it is the subshift associated with a ultimately periodic directive sequence. We present an efficient…