Related papers: Compression of Periodic Complementary Sequences an…
Cadences are structurally maximal arithmetic progressions of indices corresponding to equal characters in an underlying string. This paper provides a polynomial time detection algorithm for 3-cadences in grammar-compressed binary strings.…
A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0-1-sequences are…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…
In a distributed information application an encoder compresses an arbitrary vector while a similar reference vector is available to the decoder as side information. For the Hamming-distance similarity measure, and when guaranteed perfect…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
We present three classes of symmetric broadband composite pulse sequences. The composite phases are given by analytic formulas (rational fractions of $\pi$) valid for any number of constituent pulses. The transition probability is expressed…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact or approximate). In this work we are interested in the case…
The circular dictionary matching problem is an extension of the classical dictionary matching problem where every string in the dictionary is interpreted as a circular string: after reading the last character of a string, we can move back…
Given a static reference string $R$ and a source string $S$, a relative compression of $S$ with respect to $R$ is an encoding of $S$ as a sequence of references to substrings of $R$. Relative compression schemes are a classic model of…
Two arrays form a periodic complementary pair if the sum of their periodic autocorrelations is a delta function. Finding such pairs, however, is challenging for large arrays whose entries are constrained to a small alphabet. One such…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that…