Related papers: Algorithm to Detect Periodicity by Interleaving Se…
Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…
An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$…
The problem of sequential anomaly detection is considered, where multiple data sources are monitored in real time and the goal is to identify the "anomalous" ones among them, when it is not possible to sample all sources at all times. A…
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
Let $b$ be an integer strictly greater than $1$. Each set of nonnegative integers is represented in base $b$ by a language over $\{0, 1, \dots, b - 1\}$. The set is said to be $b$-recognisable if it is represented by a regular language. It…
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
Systems with time delay play an important role in modeling of many physical and biological processes. In this paper we describe generic properties of systems with time delay, which are related to the appearance and stability of periodic…
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms…
We show several properties related to the structure of the family of classes of two-dimensional periodic continued fractions. This approach to the study of the family of classes of nonequivalent two dimexsional periodic continued fractions…
An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
Frequency tagging is a powerful approach to investigate the neural processing of sensory features, and is recently adapted to study the neural correlates of superordinate structures, i.e., chunks, in complex sequences such as speech and…
A multivariate, stationary time series is said to be jointly regularly varying if all its finite-dimensional distributions are multivariate regularly varying. This property is shown to be equivalent to weak convergence of the conditional…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…
It is widely believed that the continued fraction expansion of every irrational algebraic number $\alpha$ either is eventually periodic (and we know that this is the case if and only if $\alpha$ is a quadratic irrational), or it contains…
We construct stable periodic solutions for a simple form nonlinear delay differential equation (DDE) with a periodic coefficient. The equation involves one underlying nonlinearity with the multiplicative periodic coefficient. The well-known…
In this paper we give an algorithm to calculate the coefficients of the p-adic expansion of a rational numbers, and we give a method to decide whether this expansion is periodic or ultimately periodic.
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…