Related papers: Skip Letters for Short Supersequence of All Permut…
A method of prediction is presented to aid compression of sequences of complex-valued samples. The focus is on using prediction to reduce the average magnitude of residual values after prediction (not on the subsequent compression of the…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be…
In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…
We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.
Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…
Let $A\subseteq \mathbb Z_n$ be a subset. A sequence $S=(x_1,\ldots,x_k)$ in $\mathbb Z_n$ is said to be an $A$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ such that $a_1x_1+\cdots+a_kx_k=0$. By a square, we shall mean a…
A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…
Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…
The signature is an infinite graded sequence of statistics known to characterise a stream of data up to a negligible equivalence class. It is a transform which has previously been treated as a fixed feature transformation, on top of which a…
How small can a set be while containing many configurations? Following up on earlier work of Erd\H os and Kakutani \cite{MR0089886}, M\'ath\'e \cite{MR2822418} and Molter and Yavicoli \cite{Molter}, we address the question in two…
We establish a general method for simultaneously perturbing a convergent sequence of functions in such a way that the sequence of strong minima of the perturbed functions tend to the strong minimum of their limit.
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
A finite subset of the natural numbers is weak-Schreier if $\min S \ge |S|$, strong-Schreier if $\min S>|S|$, and maximal if $\min S = |S|$. Let $M_n$ be the number of weak-Schreier sets with $n$ being the largest element and $(F_n)_{n\geq…
Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…
The combined Universal Probability M(D) of strings x in sets D is close to max M({x}) over x in D: their ~logs differ by at most D's information j=I(D:H) about the halting sequence H. Thus if all x have complexity K(x) >k, D carries >i bits…
Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…
A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…