Related papers: Automatic Generation of Convolution Identities for…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
Sketch-based face recognition is an interesting task in vision and multimedia research, yet it is quite challenging due to the great difference between face photos and sketches. In this paper, we propose a novel approach for photo-sketch…
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…
In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci…
In this paper, bicomplex k-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex k-Fibonacci quaternions which are connected with bicomplex numbers and k-Fibonacci numbers are investigated. Furthermore, the…
New convolution identities of hypergeometric Bernoulli polynomials are presented. Two different approaches to proving these identities are discussed, corresponding to the two equivalent definitions of hypergeometric Bernoulli polynomials as…
In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…
An identity is proved connecting two finite sums of inverse tangents. This identity is discretized version of Jacobi's imaginary transformation for the modular angle from the theory of elliptic functions. Some other related identities are…
Using an elementary approach involving the Euler Beta function and the binomial theorem, we derive two polynomial identities; one of which is a generalization of a known polynomial identity. Two well-known combinatorial identities, namely…
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…
In this paper, we present an end-to-end approach to simultaneously learn spatio-temporal features and corresponding similarity metric for video-based person re-identification. Given the video sequence of a person, features from each frame…
Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums…
We define a length function for a perfect crystal. As an application, we derive a variant of the Rogers-Ramanujan identities which involves (a $q$-analog of) the Fibonacci numbers.
Many applications can benefit from personalized image generation models, including image enhancement, video conferences, just to name a few. Existing works achieved personalization by fine-tuning one model for each person. While being…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
We introduce a class of convolutional neural networks (CNNs) that utilize recurrent neural networks (RNNs) as convolution filters. A convolution filter is typically implemented as a linear affine transformation followed by a non-linear…
Polynomial, C-finite, Holonomic are the most common ansatz to describe the pattern of the sequences. We propose a new ansatz called X-recursive that generalize those we mentioned. We also discuss its closure properties and compare this…
The aim of this paper is to investigate some properties, recurrence relations and identities involving degenerate hyperharmonic numbers, hyperharmonic numbers and degenerate harmonic numbers. In particular, we derive an explicit expression…
Motivation: Low-complexity (LC) DNA sequences are compositionally repetitive sequences that are often associated with spurious homologous matches and variant calling artifacts. While algorithms for identifying LC sequences exist, they…