Results 31 to 40 of about 1,248 (76)

A generalized formula of Hardy

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 2, Page 369-378, 1994., 1994
We give new formulae applicable to the theory of partitions. Recent work suggests they also relate to quasi‐crystal structure and self‐similarity. Other recent work has given continued fractions for the type of functions herein. Hardy originally gave such formulae as ours in early work on gap power series which led to his and Littlewood′s High Indices ...
Geoffrey B. Campbell
wiley   +1 more source

Some recurrence formulas for the Hermite polynomials and their squares

open access: yesOpen 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

Postorder Preimages [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all ...
Colin Defant
doaj   +1 more source

A new class of infinite products, and Euler′s totient

open access: yesInternational 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

Differential equations associated with generalized Bell polynomials and their zeros

open access: yesOpen Mathematics, 2016
In this paper, we study differential equations arising from the generating functions of the generalized Bell polynomials.We give explicit identities for the generalized Bell polynomials.
Ryoo Seoung Cheon
doaj   +1 more source

A bijection between the set of nesting-similarity classes and L & P matchings [PDF]

open access: yesDiscrete 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

Some identities for enumerators of circulant graphs

open access: yes, 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

open access: yesInternational 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]

open access: yesDiscrete 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

Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$ [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy