9 citations · 33 across the 33 of their papers we have counts for
14 papers · 1 filter
Bijective Enumeration and Sign-Imbalance for Permutation Depth and Excedances
Sen-Peng Eu, Tung-Shan Fu, Yuan-Hsun Lo
We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a s…
Gamma-positivity for a Refinement of Median Genocchi Numbers
Sen-Peng Eu, Tung-Shan Fu, Hsin-Hao Lai +1
We study the generating function of descent numbers for the permutations with descent pairs of prescribed parities, the distribution of which turns out to be a refinement of median…
The stresses on centrally symmetric complexes and the lower bound theorems
Isabella Novik, Hailun Zheng
In 1987, Stanley conjectured that if a centrally symmetric Cohen--Macaulay simplicial complex of dimension satisfies for some , then $h_j(Δ…
Signed Euler-Mahonian identities
Sen-Peng Eu, Zhicong Lin, Yuan-Hsun Lo
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on was given by Désarménien and Foata in 1992, and a refined version, cal…
The Undirected Optical Indices of Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
For a connected graph , an instance is a set of pairs of vertices and a corresponding routing is a set of paths specified for all vertex-pairs in . Let $\mathfrak{R}_…
The Undirected Optical Indices of Complete -ary Trees
Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang +1
The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WD…
On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry +1
A spanning tree of a properly edge-colored complete graph, , is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectur…
Toric -polynomials of hook shape lattice Path Matroid Polytopes and product of simplices
Sen-Peng Eu, Yuan-Hsun Lo, Ya-Lun Tsai
It is known that a lattice path matroid polytope can be associated with two given noncrossing lattice paths on with the same end points. In this short…
The sorting index on colored permutations and even-signed permutations
Sen-Peng Eu, Yuan-Hsun Lo, Tsai-Lien Wong
We define a new statistic on the set of colored permutations and prove that it has the same distribution as the length function. For the set of re…
Multicolored Isomorphic Spanning Trees in Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo
In this paper, we first prove that if the edges of are properly colored by colors in such a way that any two colors induce a 2-factor of which each component is a 4…
Edge-colorings of which Forbid Multicolored Cycles
Hung-Lin Fu, Yuan-Hsun Lo, Ryo-Yu Pei
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we study the proper edge-colorings of the complete bipartite graph $K_{…
Set-valued sorting index and joint equidistributions
Sen-Pen Eu, Yuan-Hsun Lo, Tsai-Lien Wong
Recently Petersen defined a new Mahonian index sor over the symmetric group and proved that and have the sa…
The sorting index and set-valued joint equidistributions of and
Sen-Peng Eu, Yuan-Hsun Lo, Tsai-Lien Wong
The sorting indices and on the Coxeter groups of type and respectively are defined by Petersen and it is proved that $(\text{inv}_B, \text{rlm…
Signed Mahonian polynomials for major and sorting indices
Huilan Chang, Sen-Peng Eu, Shishuo Fu +2
We derive some new signed Mahonian polynomials over the complex reflection group , where the "sign" is taken to be any of the -dim characters…