English
Related papers

Related papers: Inversions in parking functions

200 papers

The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…

Complex Variables · Mathematics 2018-10-24 N. I. Mahmudov , Mohammad Momenzadeh

For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…

Combinatorics · Mathematics 2023-12-13 Yen-Jen Cheng , Sen-Peng Eu , Tung-Shan Fu , Jyun-Cheng Yao

Parking sequences (a generalization of parking functions) are defined by specifying car lengths and requiring that a car attempts to park in the first available spot after its preference. If it does not fit there, then a collision occurs…

Combinatorics · Mathematics 2023-01-27 Spencer J. Franks , Pamela E. Harris , Kimberly Harry , Jan Kretschmann , Megan Vance

The aim of this paper is to give a new approach to modified $q$-Bernstein polynomials for functions of several variables. By using these polynomials, the recurrence formulas and some new interesting identities related to the second Stirling…

Number Theory · Mathematics 2019-07-04 Serkan Araci , Mehmet Acikgoz , Hassan Jolany , Armen Bagdasaryan

Up-down permutations are counted by tangent resp. 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…

Combinatorics · Mathematics 2007-05-23 Helmut Prodinger

We consider the notion of classical parking functions by introducing randomness and a new parking protocol, as inspired by the work presented in the paper ``Parking Functions: Choose your own adventure,'' (arXiv:2001.04817) by Carlson,…

Combinatorics · Mathematics 2022-11-02 Irfan Durmić , Alex Han , Pamela E. Harris , Rodrigo Ribeiro , Mei Yin

We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas,…

Combinatorics · Mathematics 2025-03-04 Garrett Nelson

In this paper, we first construct generalized $q^2$-cosine, $q^2$-sine and $q^2$-exponential functions. We then use $q^2$-exponential function in order to define and investigate a $q^2$-Fourier transform. We establish $q$-analogues of…

Mathematical Physics · Physics 2019-11-11 Sama Arjika

We describe the qFunctions Mathematica package for $q$-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for $q$-shift equations and…

Symbolic Computation · Computer Science 2019-10-29 Jakob Ablinger , Ali K. Uncu

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

Let $1\leq r\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property.…

Combinatorics · Mathematics 2017-03-08 Rui Duarte , António Guedes de Oliveira

We present (bi-)symmetric generating functions for the joint distributions of Euler-Stirling statistics on permutations, including the number of descents ($\mathsf{des}$), inverse descents ($\mathsf{ides}$), the number of left-to-right…

Combinatorics · Mathematics 2022-10-18 Emma Yu Jin

We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.

Combinatorics · Mathematics 2025-09-09 Susanna Fishel , Luis Pena

We investigate the concept of $q$-replicated arguments in symmetric functions with its connection to spectral functions of hyperbolic geometry. This construction suffices for vector generation functions in the form of $q$-series, and string…

Mathematical Physics · Physics 2018-01-17 A. A. Bytsenko , M. Chaichian , R. Luna

In this paper, we present how to use a free algebra based interval arithmetics framework in order to build better defined inclusion function for interval semi-group and for its associated vector space. One introduces the psi-algorithm,…

Numerical Analysis · Mathematics 2011-12-06 Abdelouahab Kenoufi , Nicolas Goze , Michel Goze

We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest…

Combinatorics · Mathematics 2026-02-20 Philippe Nadeau

We propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…

Statistical Mechanics · Physics 2009-11-07 M. K. Hassan , J. Schmidt , B. Blasius , J. Kurths

Consider the vector space $\mathbb{K}\mathcal{P}$ spanned by parking functions. By representing parking functions as labeled digraphs, Hivert, Novelli and Thibon constructed a cocommutative Hopf algebra PQSym$^{*}$ on…

Combinatorics · Mathematics 2015-04-08 Teresa Xueshan Li

A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…

Combinatorics · Mathematics 2023-06-13 Jennifer Elder , Pamela E. Harris , Zoe Markman , Izah Tahir , Amanda Verga
‹ Prev 1 3 4 5 6 7 10 Next ›