ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Computing
Physical
Computing
Pure sciences
Research
Civil Engineering
Architecture and Urbanism
Industrial engineer
all records (49)

Languages
English
German
Spanish
Portuguese

Countries
Australia
Ukraine
USA
Italy
Indonesia
Chile
Brazil
Czech Republic
United Kingdom
Croatia
all records (41)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (23)

Filter  
 
649  Articles
1 of 66 pages  |  10  records  |  more records»
In this paper, we present grammatical descriptions of several polynomials associated with Eulerian polynomials, including q-Eulerian polynomials, alternating run polynomials and derangement polynomials. As applications, we get several convolution formulas... see more

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural three-parameter g... see more

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has non-negative integer coefficients when expanded in terms of the gamma basis. This conjecture h... see more

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

-

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation ˜Hµ(x;q,t)=˜Hµ*(x;t,q)\widetilde{H}_\mu(\mathbf{x};q,t)=\widetilde{H}_{\mu^\ast}(\mathbf{x};... see more

Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e)=tail(... see more

In this paper, we introduce a parametric type of Bernoulli polynomials with higher level and study their characteristic and combinatorial properties. We also give determinant expressions of a parametric type of Bernoulli polynomials with higher level. The... see more

1 of 66 pages  |  10  records  |  more records»