Related papers: Compression of Periodic Complementary Sequences an…
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences…
The predictive advantage of combining several different predictive models is widely accepted. Particularly in time series forecasting problems, this combination is often dynamic to cope with potential non-stationary sources of variation…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
The sequence pairs of length $2^{m}$ projected from complementary array pairs of Type-II of size $\mathbf{2}^{(m)}$ and mixed Type-II/III and of size $\mathbf{2}^{(m-1)}\times2$ are complementary sequence pairs Type-II and Type-III…
We study the compressibility of enumerations in the context of Kolmogorov complexity, focusing on strong and weak forms of compression and their gain: the amount of auxiliary information embedded in the compressed enumeration. The existence…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
This article describes lossless compression algorithms for multisets of sequences, taking advantage of the multiset's unordered structure. Multisets are a generalisation of sets where members are allowed to occur multiple times. A multiset…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and…
Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…
A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…
We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…
The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…
To deploy machine learning models on-device, practitioners use compression algorithms to shrink and speed up models while maintaining their high-quality output. A critical aspect of compression in practice is model comparison, including…
Let R be an associative ring with unity and let M be an R-module. We call M (ample) Rad-supplementing if M has a (ample) Rad-supplement in every extension. If M is Rad-supplementing, then every direct summand of M is Rad-supplementing, but…
We introduce universally robust sequences for dynamical decoupling, which simultaneously compensate pulse imperfections and the detrimental effect of a dephasing environment to an arbitrary order, work with any pulse shape, and improve…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
We present a method for storing multiple models within a single set of parameters. Models can coexist in superposition and still be retrieved individually. In experiments with neural networks, we show that a surprisingly large number of…
We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…