Related papers: A New Operation on Sequences: the Boustrouphedon T…
The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…
Integro-differential methods, currently exploited in calculus, provide an inexhaustible source of tools to be applied to a wide class of problems, involving the theory of special functions and other subjects. The use of integral transforms…
A linear sequence transformation is defined that accelerates the convergence of the negative binomial series when the terms of the binomial have the same sign. The transformed series can be used to extend the region of applicability of the…
Recently, researchers have started applying convolutional neural networks (CNNs) with one-dimensional convolutions to clinical tasks involving time-series data. This is due, in part, to their computational efficiency, relative to recurrent…
In this paper, we study classes of subexcedant functions enumerated by the Bell numbers and present bijections on set partitions. We present a set of permutations whose transposition arrays are the restricted growth functions, thus defining…
Current state-of-the-art machine translation systems are based on encoder-decoder architectures, that first encode the input sequence, and then generate an output sequence based on the input encoding. Both are interfaced with an attention…
Online detection of changes in stochastic systems, referred to as sequential change detection or quickest change detection, is an important research topic in statistics, signal processing, and information theory, and has a wide range of…
A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…
Estimation of permutation entropy (PE) using Bayesian statistical methods is presented for systems where the ordinal pattern sampling follows an independent, multinomial distribution. It is demonstrated that the PE posterior distribution is…
Permutation decoding is a process that utilizes the permutation automorphism group of a linear code to correct errors in received words. Given a received word, a set of automorphisms, called a PD set, moves errors out of the information…
As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in…
A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…
In this paper an extension of the concept of Geronimus transformation for sequences of $d$-orthogonal polynomials $\{P_n\}$ is introduced. The transformed sequences $\{P^{(k)}_n\}$, for $ k=1,\ldots, d,$ are analyzed and some relationships…
Transformers in their common form are inherently limited to operate on whole token sequences rather than on one token at a time. Consequently, their use during online inference on time-series data entails considerable redundancy due to the…
We introduce a transformation for converting a series in a parameter, \lambda, to a series in the inverse of the parameter \lambda^{-1}. By applying the transform on simple examples, it becomes apparent that there exist relations between…
Pyramid transforms are constructive methods for analyzing sequences in a multiscale fashion. Traditionally, these transforms rely on stationary upsampling and downsampling operations. In this paper, we propose employing nonstationary…
With the success of language pretraining, it is highly desirable to develop more efficient architectures of good scalability that can exploit the abundant unlabeled data at a lower cost. To improve the efficiency, we examine the…
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…
We propose a novel method, called the dimension-changing transformation (DCT), to compute one-loop Feynman integrals and recently introduced fixed-branch integrals to arbitrary orders in $\epsilon$. The DCT relates one-loop Feynman…
This paper is devoted to the study of eigen-sequences for some important operators acting on sequences. Using functional equations involving generating functions, we completely solve the problem of characterizing the fixed sequences for the…