Related papers: String attractors of Rote sequences
The problem of detecting and measuring the repetitiveness of one-dimensional strings has been extensively studied in data compression and text indexing. Our understanding of these issues has been significantly improved by the introduction…
For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…
It has recently been shown that a minimal reversible nonsymmetric ring has order 256 answering a questioned original posed in a paper on a taxonomy of 2-primal rings. Answers to similar questions on minimal rings relating to this taxonomy…
The aim of this paper is to show that various known characterizations of traces on classical pseudodifferentials operators (PsiDOs) can actually be obtained by very elementary considerations on PsiDOs, using only basic properties of these…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
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…
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…
Parametric excitation of rotons by oscillating electric field exhibits a narrow resonance at the roton minimum frequency. The resonance width is in good agreement with experimental results on the microwave absorption in superfluid helium.
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
The structure of nilpotent symplectic algebras of maximal class has been studied in [8, 5]. In this paper, we study the dual subclass of algebras of minimal class. In particular, we show that symplectic alternating algebras of dimension up…
There is a common problem of operating on hash values of elements of some database. In this paper there will be analyzed informational content of such general task and how to practically approach such found lower boundaries. Minimal prefix…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…
A survey of direct and inverse type results for row sequences of Pad\'e and Hermite-Pad\'e approximation is given. A conjecture is posed on an inverse type result for type II Hermite-Pad\'e approximation when it is known that the sequence…
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings,…
The minimal pairs paradigm of comparing model probabilities for contrasting completions has proven useful for evaluating linguistic knowledge in language models, yet its application has largely been confined to binary grammaticality…