Results 81 to 90 of about 208 (162)
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Super-strong Wilf equivalence classes of the symmetric group ${\mathcal S}_n$ on $n$ letters, with respect to the generalized factor order, were shown by Hadjiloucas, Michos and Savvidou (2018) to be in bijection with pyramidal sequences of consecutive ...
Ioannis Michos, Christina Savvidou
doaj +1 more source
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
On a generalization of derangement polynomials and numbers
Demonstratio MathematicaIn T. Kim, D. S. Kim, and D. V. Dolgy, Probabilistic derangement numbers and polynomials, Math. Comput. Model. Dyn. Syst. 31 (2025), no. 1, 2529188, Kim-Kim defined the probabilistic derangement polynomials and numbers and found some properties of those ...
Yun Sang Jo, Park Jin-Woo
doaj +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
Fibonacci Cartan and Lucas Cartan numbers
Open MathematicsThis study introduces Fibonacci Cartan and Lucas Cartan numbers, extending the classical Fibonacci and Lucas sequences into the framework of Cartan numbers.
Öztürk İskender, Çakır Hasan
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