Jun Ma

most citedCircular Peaks and Hilbert Series

1 citations · 1 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2008

(G,m)-multiparking functions

Hungyung Chang, Po-Yi Huang, Jun Ma +1

The conceptions of $G$ -parking functions and $G$ -multiparking functions were introduced in [15] and [12] respectively. In this paper, let $G$ be a connected graph with vertex set $…

math.CO2008

Enumerations for Permutations by Circular Peak Sets

Pierre Bouchard, Hungyung Chang, Jun Ma +1

The circular peak set of a permutation $σ$ is the set ${σ (i) ∣ σ (i - 1) < σ (i) > σ (i + 1)}$ . In this paper, we focus on the enumeration problems for permutations by circular peak sets.…

math.CO2008★ 1 cited

Circular Peaks and Hilbert Series

Pierre Bouchard, Jun Ma, Yeong-Nan Yeh

The circular peak set of a permutation $σ$ is the set ${σ (i) ∣ σ (i - 1) < σ (i) > σ (i + 1)}$ . Let $P_{n}$ be the set of all the subset $S \subseteq [n]$ such that there exists a…

math.CO2008

Enumerations of Permutations by Circular Descent Sets

Hungyung Chang, Jun Ma, Yeong-Nan Yeh

The circular descent of a permutation $σ$ is a set ${σ (i) ∣ σ (i) > σ (i + 1)}$ . In this paper, we focus on the enumerations of permutations by the circular descent set. Let $cdes_n(…

math.CO2008

Some Enumerations for Parking Functions

Po-Yi Huang, Jun Ma, Jean Yeh

In this paper, let $P_{n, n + k; \leq n + k}$ (resp. $P_{n; \leq s}$ ) denote the set of parking functions $α = (a_{1}, ..., a_{n})$ of length $n$ with $n + k$ (respe. $n$ )parkin…

math.CO2008

k-flaw Preference Sets

Po-Yi Huang, Jun Ma, Jean Yeh

In this paper, let $P_{n; \leq s; k}^{l}$ denote a set of $k$ -flaw preference sets $(a_{1}, ..., a_{n})$ with $n$ parking spaces satisfying that $1 \leq a_{i} \leq s$ for any $i$ and $…