Results 41 to 50 of about 1,313 (102)
Some recurrence formulas for the Hermite polynomials and their squares
Open Mathematics, 2018 In this paper, by making use of the generating function methods and Padé approximation techniques, we establish some new recurrence formulas for the Hermite polynomials and their squares.
He Yuan, Yang Fengzao
doaj +1 more source
A bijection between the set of nesting-similarity classes and L & P matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Matchings are frequently used to model RNA secondary structures; however, not all matchings can be realized as RNA motifs. One class of matchings, called the L $\&$ P matchings, is the most restrictive model for RNA secondary structures in the Largest ...
Megan A. Martinez, Manda Riehl
doaj +1 more source
Inverse and Moore-Penrose inverse of Toeplitz matrices with classical Horadam numbers
, 2017 For integers s,k with s 0 and k 0 , we define a class of lower triangular Toeplitz matrices U (s,k) n of type (s,k) , whose non-zero entries are the classical Horadam numbers U (a,b) i .
Shouqiang Shen, W. Liu, Lihua Feng
semanticscholar +1 more source
On Bennett's conjecture and complete monotonicity
Mathematical Inequalities & Applications, 2019 Bennett [1] gave a generalization of Schur’s theorem in order to study various momentpreserving transformations. Recently, Su [5] confirmed a monotonicity conjecture of Bennett which is related to the generalized Schur’s theorem and Haber’s inequality ...
U. Abel, Vitaliy Kushnirevych
semanticscholar +1 more source
A new class of infinite products, and Euler′s totient
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 3, Page 417-422, 1994., 1993 We introduce some new infinite products, the simplest being where ϕk is the set of positive integers less than and relatively prime to k, valid for |y|∧|qy| both less than unity, with q ≠ 1. The idea of a q‐analogue for the Euler totient function is suggested.
Geoffrey B. Campbell
wiley +1 more source
Some identities for enumerators of circulant graphs
, 2001 We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders.
Liskovets, Valery A.
core +1 more source
Infinite products over visible lattice points
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 4, Page 637-654, 1994., 1993 About fifty new multivariate combinatorial identities are given, connected with partition theory, prime products, and Dirichlet series. Connections to Lattice Sums in Chemistry and Physics are alluded to also.
Geoffrey B. Campbell
wiley +1 more source
Consecutive Patterns in Inversion Sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 An inversion sequence of length $n$ is an integer sequence $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}
Juan S. Auli, Sergi Elizalde
doaj +1 more source
Frobenius-Euler polynomials and umbral calculus in the p-adic case
, 2012 In this paper, we study some p-adic Frobenius-Euler measure related to umbral calculus in the p-adic case. Finally, we derive some identities of Frobenius-Euler polynomials from our study.MSC:05A10, 05A19.
Dae San Kim +3 more
semanticscholar +1 more source
Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in the set of ...
Dun Qiu, Jeffrey Remmel
doaj +1 more source