Results 71 to 80 of about 219 (161)
Generalized Stirling permutations and forests: Higher-order Eulerian and Ward numbers [PDF]
, 2014 20 pags.; 4 figs.; Mathematics Subject Classifications: 05A05, 05A15, 05C30We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests.
Sánchez Villaseñor, Eduardo Jesús +8 more
core +1 more source
, 2002 We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 2000 Mathematics Subject Classification: 60G50, 60B15, 60K30, 05A15. 1.
Mihyun Kang
core
Slit-slide-sew bijections for oriented planar maps
We construct growth bijections for bipolar oriented planar maps and for Schnyder woods. These give direct combinatorial proofs of several counting identities for these objects. Our method mainly uses two ingredients.
Éric Fusy +2 more
core +1 more source
On (3, 1)-absorbing primary ideals in commutative rings
Open MathematicsIn this paper, we introduce and study the class of (3, 1)-absorbing primary ideals in commutative rings. We establish several characterizations and examine their relationship with classical 1-absorbing primary ideals.
Abouhalaka Alaa, Kim Hwankoo
doaj +1 more source
Zeros distribution and interlacing property for certain polynomial sequences
Open MathematicsIn this article, we first prove that the Hankel determinant of order three of the polynomial sequence {Pn(x)=∑k≥0P(n,k)xk}n≥0{\left\{{P}_{n}\left(x)={\sum }_{k\ge 0}P\left(n,k){x}^{k}\right\}}_{n\ge 0} is weakly (Hurwitz) stable, where P(n,k)P\left(n,k ...
Guo Wan-Ming
doaj +1 more source
The graham–knuth–patashnik recurrence: symmetries and continued fractions
, 2022 72 pags. -- Mathematics Subject Classifications: 05A10 (Primary); 05A15, 05A19, 30B70 (Secondary)We study the triangular array defined by the Graham–Knuth–Patashnik recurrence T (n, k) = (αn + βk + γ) T (n − 1, k) + (αn + βk + γ ) T (n − 1, k − 1) with ...
Sokal, Alan D., Salas, Jesús
core +1 more source
Further results on enumeration of perfect matchings of Cartesian product graphs
Open MathematicsCounting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation ...
Wu Tingzeng, Zeng Xiaolin
doaj +1 more source
Permutation q-enumeration with the Schur row adder
, 2010 . We q-enumerate here, by the i-major index, the class of permutations of Sn with largest increasing subsequence of size n − k and increasing rst n − k entries. The result is obtained by a surprisingly straightforward use of the Schur row adder.
Adriano M. Garsia
core
On two-parameter telephone polynomials and their structural properties
Nuclear Physics BIn this paper, we investigate the structural and analytic properties of the two-parameter telephone polynomials. Starting from the exponential generating function and the recurrence relation, we derive an explicit formula, an operational representation ...
Carlos M. da Fonseca +2 more
doaj +1 more source