Related papers: Attractors of sequences coding $\beta$-integers
The average length and average relaxation time of attractors in sequence processing neural networks are investigated. The simulation results show that a critical point of $\alpha $, the loading ratio, is found. Below the turning point, the…
An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \in 2..n, i \le i+y[i] \le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater…
We consider the problem of finding repetitive structures and inherent patterns in a given string $\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\s{u}$ of a string $\s{s}$ is both a prefix and a suffix of $\s{s}$…
Given a permutation pi, the application of prefix reversal f^(i) to pi reverses the order of the first i elements of pi. The problem of Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou…
The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with…
We study the properties of the distance between attractors in Random Boolean Networks, a prominent model of genetic regulatory networks. We define three distance measures, upon which attractor distance matrices are constructed and their…
Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is…
In this paper, we study representations of real numbers in the positional numeration system with negative basis, as introduced by Ito and Sadahiro. We focus on the set $\Z_{-\beta}$ of numbers whose representation uses only non-negative…
Index Coding has received considerable attention recently motivated in part by real-world applications and in part by its connection to Network Coding. The basic setting of Index Coding encodes the problem input as an undirected graph and…
Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampling scheme allowing for more efficient pattern searches…
An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
Global random attractors and random point attractors for random dynamical systems have been studied for several decades. Here we introduce two intermediate concepts: $\Delta$-attractors are characterized by attracting all deterministic…
We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…
We call an interval $[x,y]$ in a poset {\em small} if $y$ is the join of some elements covering $x$. In this paper, we study the chains of paths from a given arbitrary (binary) path $P$ to the maximum path having only small intervals. More…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
Computing the {\em matching statistics} of a string $P[1..m]$ with respect to a text $T[1..n]$ is a fundamental problem which has application to genome sequence comparison. In this paper, we study the problem of computing the matching…
Andr\'as Bir\'o and Vera S\'os prove that for any subgroup $G$ of $\T$ generated freely by finitely many generators there is a sequence $A\subset \N$ such that for all $\beta \in \T$ we have ($\|.\|$ denotes the distance to the nearest…
Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…