Searcharxiv⌕ Search

arXiv subjects

Guan-Huei Duh

Publications and source records attributed to Guan-Huei Duh.

3 recordsLinked to original sources

An asymptotic distribution theory for Eulerian recurrences with applications

We study linear recurrences of Eulerian type of the form \[ P_n(v) = (α(v)n+γ(v))P_{n-1}(v) +β(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $α(v), β(v)$ and $γ(v)$ are in most cases polynomials of low degrees. We characterize the various limit laws of the coefficients of $P_n(v)$ for large $n$ using the method of moments and analytic combinatorial tools under varying $α(v), β(v)$ and $γ(v)$, and apply our results to more than two hundred of concrete examples when $β(v)\ne0$ and more than three hundred when $β(v)=0$ that we gathered from the literature and from Sloane's OEIS database. The limit laws and the convergence rates we worked out are almost all new and include normal, half-normal, Rayleigh, beta, Poisson, negative binomial, Mittag-Leffler, Bernoulli, etc., showing the surprising richness and diversity of such a simple framework, as well as the power of the approaches used.

math.CO↗

Stirling permutations, marked permutations and Stirling derangements

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a symmetric bivariate enumerative polynomials on $r$-colored marked permutations. Finally, we give an explanation of $r$-colored marked permutations by using the language of combinatorial objects.

math.CO↗

On the precise value of the strong chromatic-index of a planar graph with a large girth

A strong $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\{1,2,\ldots,k\}$ such that every pair of distinct edges at distance at most two receive different colors. The strong chromatic index $χ'_s(G)$ of a graph $G$ is the minimum $k$ for which $G$ has a strong $k$-edge-coloring. Denote $σ(G)=\max_{xy\in E(G)}\{\operatorname{deg}(x)+\operatorname{deg}(y)-1\}$. It is easy to see that $σ(G) \le χ'_s(G)$ for any graph $G$, and the equality holds when $G$ is a tree. For a planar graph $G$ of maximum degree $Δ$, it was proved that $χ'_s(G) \le 4 Δ+4$ by using the Four Color Theorem. The upper bound was then reduced to $4Δ$, $3Δ+5$, $3Δ+1$, $3Δ$, $2Δ-1$ under different conditions for $Δ$ and the girth. In this paper, we prove that if the girth of a planar graph $G$ is large enough and $σ(G)\geq Δ(G)+2$, then the strong chromatic index of $G$ is precisely $σ(G)$. This result reflects the intuition that a planar graph with a large girth locally looks like a tree.

math.CO↗