Related papers: Sequence pairs with asymptotically optimal aperiod…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
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…
A precompact group topology $\tau$ on an abelian group $G$ is called {\em single sequence characterized} (for short, {\em ss-characterized}) if there is a sequence $\mathbf{u}= (u_n)$ in $G$ such that $\tau$ is the finest precompact group…
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
We first prove, for pairs consisting of a simply connected complex reductive group together with a connected subgroup, the equivalence between two different notions of Gelfand pairs. This partially answers a question posed by Gross, and…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
This paper aims to search for new optimal and sub-optimal Odd Binary Z-Complimentary Pairs (OBZCPs) for lengths up to 49. As an alternative to the celebrated binary Golay complementary pairs, optimal OBZCPs are the best almost-complementary…
In this article, $q$-regular sequences in the sense of Allouche and Shallit are analysed asymptotically. It is shown that the summatory function of a regular sequence can asymptotically be decomposed as a finite sum of periodic fluctuations…
This paper investigates the asymptotic behaviour of solutions to certain infinite systems of coupled recurrence relations. In particular, we obtain a characterisation of those initial values which lead to a convergent solution, and for…
Pearson's correlation is an important summary measure of the amount of dependence between two variables. It is natural to want to generalise the concept of correlation as a single number that measures the inter-relatedness of three or more…
We consider the class of Rudin-Shapiro-like polynomials, whose $L^4$ norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial $f(z)=f_0+f_1 z + \cdots + f_d z^d$ is identified with the sequence…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…
The aim of this short note is to generalise the result of Rampersad--Shallit saying that an automatic sequence and a Sturmian sequence cannot have arbitrarily long common factors. We show that the same result holds if a Sturmian sequence is…
Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…
Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…
We consider a binary sequence generated by thresholding a hidden continuous sequence. The hidden variables are assumed to have a compound symmetry covariance structure with a single parameter characterizing the common correlation. We study…
A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is…
A sequence $\{x_{n}\}_1^\infty$ in $[0,1)$ is called Borel-Cantelli (BC) if for all non-increasing sequences of positive real numbers $\{a_n\}$ with $\underset{i=1}{\overset{\infty}{\sum}}a_i=\infty$ the set…
For a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…