Results 31 to 40 of about 145 (113)
Combinatorics of geometrically distributed random variables: new q‐tangent and q‐secant numbers
Up‐down permutations are counted by tangent (respectively, secant) numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all coincide with the classical version. In this way, we get some new q‐tangent and q‐secant functions.
Helmut Prodinger
wiley +1 more source
Descent c-Wilf Equivalence [PDF]
Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote the number of
Quang T. Bach, Jeffrey B. Remmel
doaj +1 more source
n‐Color partitions with weighted differences equal to minus two
In this paper we study those n‐color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables.
A. K. Agarwal, R. Balasubrananian
wiley +1 more source
Equivalence classes of mesh patterns with a dominating pattern [PDF]
Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length.
Murray Tannock, Henning Ulfarsson
doaj +1 more source
Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
Let Gn = Cn□P2 be the prism graph on 2n vertices. The dominion ζ(Gn) counts the minimum dominating sets of Gn. Encoding column selections as cyclic words over a quaternary alphabet converts domination into explicit local adjacency constraints, reducing the count of minimum dominating sets to the enumeration of minimum‐weight admissible words.
Julian Allagan +4 more
wiley +1 more source
A new class of infinite products, and Euler′s totient
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 of the Probabilistic Changhee Polynomials and Their Applications
Special numbers and polynomials are very important tools in diverse fields such as mathematics, physics, engineering, science, and related disciplines, addressing problems in areas like mathematical physics, numerical analysis, differential equations, fluid dynamics, and quantum mechanics.
Jin-Woo Park +4 more
wiley +1 more source
An infinite version of the Pólya enumeration theorem
Using measure theory, the orbit counting form of Pólya′s enumeration theorem is extended to countably infinite discrete groups.
Robert A. Bekes
wiley +1 more source
Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency +10 more
wiley +1 more source
On Hilbert polynomial of certain determinantal ideals
Let X = (Xij) be an m(1) by m(2) matrix whose entries Xij, 1 ≤ i ≤ m(1), 1 ≤ j ≤ m(2); are indeterminates over a field K. Let K[X] be the polynomial ring in these m(1)m(2) variables over K. A part of the second fundamental theorem of Invariant Theory says that the ideal I[p + 1] in K[X], generated by (p + 1) by (p + 1) minors of X is prime.
Shrinivas G. Udpikar
wiley +1 more source

