Related papers: A Class of Exponential Sequences with Shift-Invari…
We find the complete equivalence group of a class of (1+1)-dimensional second-order evolution equations, which is infinite-dimensional. The equivariant moving frame methodology is invoked to construct, in the regular case of the…
Exceptional sequences are certain ordered sequences of quiver representations. We introduce a class of objects called strand diagrams and use this model to classify exceptional sequences of representations of a quiver whose underlying graph…
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…
A divisibility sequence is a sequence of integers $\{d_n\}$ such that $d_m$ divides $d_n$ if $m$ divides $n$. Results of Bugeaud, Corvaja, Zannier, among others, have shown that the gcd of two divisibility sequences corresponding to…
We introduce an invertible operation on finite sequences of positive integers and call it "kneading". Kneading preserves three invariants of sequences -- the parity of the length, the sum of the entries, and one we call the "alternant". We…
An operational approach to the Collatz Conjecture is presented. Scenarios are defined as strings of characters "s" (for "spike") and "d" (for "down") which symbolize the Collatz operations (3m+1)/2 and m/2 in a Collatz Series connecting two…
For integers $m \geq 2$, we study divergent continued fractions whose numerators and denominators in each of the $m$ arithmetic progressions modulo $m$ converge. Special cases give, among other things, an infinite sequence of divergence…
Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…
Representing examples in a way that is compatible with the underlying classifier can greatly enhance the performance of a learning system. In this paper we investigate scalable techniques for inducing discriminative features by taking…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Ascent sequences were introduced by Bousquet-M\'elou, Claesson, Dukes and Kitaev, and are in bijection with unlabeled $(2+2)$-free posets, Fishburn matrices, permutations avoiding a bivincular pattern of length $3$, and Stoimenow matchings.…
We create a sequence version of calculus. First, we define equivalence, some fundamental operations, differential, and integral for sequences. Then, we propose sequence versions of identity function, power function, exponential function,…
Let $\A$ be a finitary hereditary abelian category and $D(\A)$ be its reduced Drinfeld double Hall algebra. By giving explicit formulas in $D(\A)$ for left and right mutations, we show that the subalgebras of $D(\A)$ generated by…
In the present paper we continue the project of systematic construction of invariant differential operators on the example of the non-compact algebras sp(n,R), in detail for n=6. Our choice of these algebras is motivated by the fact that…
The main objective of this paper is to introduce classes of $I$-convergent triple difference sequence spaces, $c_{0I}^{3}(\Delta,\digamma)$, $c_{I}^{3}(\Delta,\digamma)$, $\ell_{\infty I}^{3}(\Delta,\digamma)$, $M_{I}^{3}(\Delta,\digamma)$…
Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…
The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…
For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller than the minimum distance of C. Schwartz and Vardy…
A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finetti's theorem characterizes all $\{0,1\}$-valued exchangeable sequences as a "mixture" of…