Related papers: Classification of near-normal sequences
The normal sequences NS(n) and near-normal sequences NN(n) play an important role in the construction of orthogonal designs and Hadamard matrices. They can be identified with certain base sequences (A;B;C;D), where A and B have length n+1…
Base sequences BS(m,n) are quadruples (A;B;C;D) of {+1,-1}-sequences, with A and B of length m and C and D of length n, such that the sum of their nonperiodic autocorrelation functions is a delta-function. Normal sequences NS(n) are base…
Base sequences BS(m,n) are quadruples (A;B;C;D) of {+1,-1}-sequences, A and B of length m and C and D of length n, the sum of whose non-periodic auto-correlation functions is zero. Base sequences and some special subclasses of BS(n+1,n)…
The base sequences BS(n+1,n) are four sequences of $\pm1$ and lengths n+1,n+1,n,n with zero auto correlation. The base sequence conjecture states that BS(n+1,n) exists for all positive integers and has been verified for $n\le40$. We present…
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…
Base sequences BS(n+1,n) are quadruples of {1,-1}-sequences (A;B;C;D), with A and B of length n+1 and C and D of length n, such that the sum of their nonperiodic autocorrelation functions is a delta-function. The base sequence conjecture,…
We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation…
Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B and twice that of C,D is a delta-function (i.e., vanishes…
The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…
Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…
First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…
We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…
It was shown that adversarial examples improve object recognition. But what about their opposite side, easy examples? Easy examples are samples that the machine learning model classifies correctly with high confidence. In our paper, we are…
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
W. M. Schmidt, A. D. Pollington, and F. Schweiger have studied when normality with respect to one expansion is equivalent to normality with respect to another expansion. Following in their footsteps, we show that when $Q$ is an eventually…
While many different models for $(\infty,1)$-categories are currently being used, it is known that they are Quillen equivalent to one another. Several higher-order analogues of them are being developed as models for $(\infty,…
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…