Hsiang-Chun Hsu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hsiang-Chun Hsu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Tung-Shan Fu
National Pingtung University
6 shared publications - Sen-Peng Eu
Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan, ROC
4 shared publications - Gerard Jennhwa Chang
Department of Mathematics National Taiwan University 10617 Taipei Taiwan
3 shared publications - Hsin-Chieh Liao3 shared publications
- De-Nian Yang
Academia Sinica, Taipei, Taiwan
1 shared publication - Hong-Bin Chen
Department of Applied Mathematics National Chung Hsing University 40249 Taichung Taiwan
1 shared publication
Latest Publications
- Open Access
Meanders and Dyck-Path Billiards
We study a statistic $\mathsf{traj}$ on the ordered pairs $(P,Q)$ of Dyck paths of size $n$, which counts the number of billiard trajectories in the grid polygon enclosed by $P$ and $-Q$, where $-Q$ is the path obtained by reflecting $Q$ over the ground line. It turns out to coincide with the component statistic of meanders. In terms of grid polygon, we establish an involution on the set of such ordered pairs $(P,Q)$ which either increases or decreases $\mathsf{traj}(P,Q)$ by 1. This proves a result by Di Francesco--Golinelli--Guitter that the numbers of semimeanders (meanders, respectively) of order $n$ with even and odd numbers of components are equal if $n$ is even and differ by a Catalan number (the square of a Catalan number, respectively) if $n$ is odd. Some results about $(-1)$-evaluation of the generating functions for the statistic $\mathsf{traj}$ on restricted sets of Dyck paths are also presented.Open AccessMeanders and Dyck-Path Billiards
We study a statistic $\mathsf{traj}$ on the ordered pairs $(P,Q)$ of Dyck paths of size $n$, which counts the number of billiard trajectories in the grid polygon enclosed by $P$ and $-Q$, where $-Q$ is the path obtained by reflecting $Q$ over the ground line. It turns out to coincide with the component statistic of meanders. In terms of grid polygon, we establish an involution on the set of such ordered pairs $(P,Q)$ which either increases or decreases $\mathsf{traj}(P,Q)$ by 1. This proves a result by Di Francesco--Golinelli--Guitter that the numbers of semimeanders (meanders, respectively) of order $n$ with even and odd numbers of components are equal if $n$ is even and differ by a Catalan number (the square of a Catalan number, respectively) if $n$ is odd. Some results about $(-1)$-evaluation of the generating functions for the statistic $\mathsf{traj}$ on restricted sets of Dyck paths are also presented. - Open Access
- 30 July 2025
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 59, 3
Meanders and Dyck-Path Billiards
We study a statistic traj on the ordered pairs (P,Q) of Dyck paths of size n, which counts the number of billiard trajectories in the grid polygon enclosed by P and −Q, where −Q is the path obtained by reflecting Q over the ground line. In terms of grid polygon, we establish an involution on the set of such ordered pairs (P,Q) which either increases or decreases traj(P,Q) by 1. This proves a result by Di Francesco–Golinelli–Guitter that the numbers of semimeanders (meanders, respectively) of order n with even and odd numbers of components are equal if n is even and differ by a Catalan number (the square of a Catalan number, respectively) if n is odd. Some results about (−1)-evaluation of the generating functions for the statistic traj on restricted sets of Dyck paths are also presented.
- 30 July 2025
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 59, 3
Open AccessMeanders and Dyck-Path Billiards
We study a statistic traj on the ordered pairs (P,Q) of Dyck paths of size n, which counts the number of billiard trajectories in the grid polygon enclosed by P and −Q, where −Q is the path obtained by reflecting Q over the ground line. In terms of grid polygon, we establish an involution on the set of such ordered pairs (P,Q) which either increases or decreases traj(P,Q) by 1. This proves a result by Di Francesco–Golinelli–Guitter that the numbers of semimeanders (meanders, respectively) of order n with even and odd numbers of components are equal if n is even and differ by a Catalan number (the square of a Catalan number, respectively) if n is odd. Some results about (−1)-evaluation of the generating functions for the statistic traj on restricted sets of Dyck paths are also presented.
- Open Access
An Easy-to-implement Construction for $(k,n)$-threshold Progressive Visual Secret Sharing Schemes
Visual cryptography encrypts the secret image into $n$ shares (transparency) so that only stacking a qualified number of shares can recover the secret image by the human visual system while no information can be revealed without a large enough number of shares. This paper investigates the $(k,n)$-threshold Visual Secret Sharing (VSS) model, where one can decrypt the original image by stacking at least $k$ shares and get nothing with less than $k$ shares. There are two main approaches in the literature: codebook-based schemes and random-grid-based schemes; the former is the case of this paper. In general, given any positive integers $k$ and $n$, it is not easy to design a valid scheme for the $(k,n)$-threshold VSS model. In this paper, we propose a simple strategy to construct an efficient scheme for the $(k,n)$-threshold VSS model for any positive integers $2\leq k\leq n$. The crucial idea is to establish a seemingly unrelated connection between the $(k,n)$-threshold VSS scheme and a mathematical structure -- the generalized Pascal's triangle. This paper improves and extends previous results in four aspects: Our construction offers a unified viewpoint and covers several known results; The resulting scheme has a progressive-viewing property that means the more shares being stacked together the clearer the secret image would be revealed. The proposed scheme can be constructed explicitly and efficiently based on the generalized Pascal's triangle without a computer. Performance of the proposed scheme is comparable with known results.Open AccessAn Easy-to-implement Construction for $(k,n)$-threshold Progressive Visual Secret Sharing Schemes
Visual cryptography encrypts the secret image into $n$ shares (transparency) so that only stacking a qualified number of shares can recover the secret image by the human visual system while no information can be revealed without a large enough number of shares. This paper investigates the $(k,n)$-threshold Visual Secret Sharing (VSS) model, where one can decrypt the original image by stacking at least $k$ shares and get nothing with less than $k$ shares. There are two main approaches in the literature: codebook-based schemes and random-grid-based schemes; the former is the case of this paper. In general, given any positive integers $k$ and $n$, it is not easy to design a valid scheme for the $(k,n)$-threshold VSS model. In this paper, we propose a simple strategy to construct an efficient scheme for the $(k,n)$-threshold VSS model for any positive integers $2\leq k\leq n$. The crucial idea is to establish a seemingly unrelated connection between the $(k,n)$-threshold VSS scheme and a mathematical structure -- the generalized Pascal's triangle. This paper improves and extends previous results in four aspects: Our construction offers a unified viewpoint and covers several known results; The resulting scheme has a progressive-viewing property that means the more shares being stacked together the clearer the secret image would be revealed. The proposed scheme can be constructed explicitly and efficiently based on the generalized Pascal's triangle without a computer. Performance of the proposed scheme is comparable with known results. - Open Access
- 1 October 2018
- Published by The Mathematical Society of the Republic of China in Taiwanese Journal of Mathematics
- Vol. 22 (5) , 1031-1050
Folding Phenomenon of Major-balance Identities on Restricted Involutions
Project Euclid - mathematics and statistics online
- 1 October 2018
- Published by The Mathematical Society of the Republic of China in Taiwanese Journal of Mathematics
- Vol. 22 (5) , 1031-1050
Open AccessFolding Phenomenon of Major-balance Identities on Restricted Involutions
Project Euclid - mathematics and statistics online
- 26 February 2018
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (2) , 373-381
A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets
- 26 February 2018
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (2) , 373-381
A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets
- Open Access
Signed Countings of types B and D permutations and $t,q$-Euler Numbers
It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively). Josuat-Verg\`{e}s obtained a $q$-analog of the results respecting the number of crossings of a permutation. One of the goals in this paper is to extend the results to the permutations (derangements, respectively) of types B and D, on the basis of the joint distribution in statistics excedances, crossings and the number of negative entries obtained by Corteel, Josuat-Verg\`{e}s and Kim. Springer numbers are analogous Euler numbers that count the alternating permutations of type B, called snakes. Josuat-Verg\`{e}s derived bivariate polynomials $Q_n(t,q)$ and $R_n(t,q)$ as generalized Euler numbers via successive $q$-derivatives and multiplications by $t$ on polynomials in $t$. The other goal in this paper is to give a combinatorial interpretation of $Q_n(t,q)$ and $R_n(t,q)$ as the enumerators of the snakes with restrictions.Open AccessSigned Countings of types B and D permutations and $t,q$-Euler Numbers
It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively). Josuat-Verg\`{e}s obtained a $q$-analog of the results respecting the number of crossings of a permutation. One of the goals in this paper is to extend the results to the permutations (derangements, respectively) of types B and D, on the basis of the joint distribution in statistics excedances, crossings and the number of negative entries obtained by Corteel, Josuat-Verg\`{e}s and Kim. Springer numbers are analogous Euler numbers that count the alternating permutations of type B, called snakes. Josuat-Verg\`{e}s derived bivariate polynomials $Q_n(t,q)$ and $R_n(t,q)$ as generalized Euler numbers via successive $q$-derivatives and multiplications by $t$ on polynomials in $t$. The other goal in this paper is to give a combinatorial interpretation of $Q_n(t,q)$ and $R_n(t,q)$ as the enumerators of the snakes with restrictions. - Open Access
- 12 January 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (1) , P1.33
Fixed Points of the Evacuation of Maximal Chains on Fuss Shapes
For a partition $\lambda$ of an integer, we associate $\lambda$ with a slender poset $P$ the Hasse diagram of which resembles the Ferrers diagram of $\lambda$. Let $X$ be the set of maximal chains of $P$. We consider Stanley's involution $\epsilon:X\rightarrow X$, which is extended from Schützenberger's evacuation on linear extensions of a finite poset. We present an explicit characterization of the fixed points of the map $\epsilon:X\rightarrow X$ when $\lambda$ is a stretched staircase or a rectangular shape. Unexpectedly, the fixed points have a nice structure, i.e., a fixed point can be decomposed in half into two chains such that the first half and the second half are the evacuation of each other. As a consequence, we prove anew Stembridge's $q=-1$ phenomenon for the maximal chains of $P$ under the involution $\epsilon$ for the restricted shapes.- 12 January 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (1) , P1.33
Open AccessFixed Points of the Evacuation of Maximal Chains on Fuss Shapes
For a partition $\lambda$ of an integer, we associate $\lambda$ with a slender poset $P$ the Hasse diagram of which resembles the Ferrers diagram of $\lambda$. Let $X$ be the set of maximal chains of $P$. We consider Stanley's involution $\epsilon:X\rightarrow X$, which is extended from Schützenberger's evacuation on linear extensions of a finite poset. We present an explicit characterization of the fixed points of the map $\epsilon:X\rightarrow X$ when $\lambda$ is a stretched staircase or a rectangular shape. Unexpectedly, the fixed points have a nice structure, i.e., a fixed point can be decomposed in half into two chains such that the first half and the second half are the evacuation of each other. As a consequence, we prove anew Stembridge's $q=-1$ phenomenon for the maximal chains of $P$ under the involution $\epsilon$ for the restricted shapes. - Open Access
Folding Phenomenon of Major-balance Identities on Restricted Involutions
In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a $\lfloor\frac{n}{2}\rfloor\times\lceil\frac{n}{2}\rceil$ rectangle. Moreover, we prove affirmatively a question about refined major-balance identity on the $123$-avoiding involutions, respecting the number of descents.Open AccessFolding Phenomenon of Major-balance Identities on Restricted Involutions
In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a $\lfloor\frac{n}{2}\rfloor\times\lceil\frac{n}{2}\rceil$ rectangle. Moreover, we prove affirmatively a question about refined major-balance identity on the $123$-avoiding involutions, respecting the number of descents. - Open Access
Multicast Traffic Engineering for Software-Defined Networks
Although Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, current literature mostly focuses on unicast communications. Compared to traffic engineering for multiple unicast flows, multicast traffic engineering for multiple trees is very challenging not only because minimizing the bandwidth consumption of a single multicast tree by solving the Steiner tree problem is already NP-Hard, but the Steiner tree problem does not consider the link capacity constraint for multicast flows and node capacity constraint to store the forwarding entries in Group Table of OpenFlow. In this paper, therefore, we first study the hardness results of scalable multicast traffic engineering in SDN. We prove that scalable multicast traffic engineering with only the node capacity constraint is NP-Hard and not approximable within, which is the number of destinations in the largest multicast group. We then prove that scalable multicast traffic engineering with both the node and link capacity constraints is NP-Hard and not approximable within any ratio. To solve the problem, we design an approximation algorithm, named Multi-Tree Routing and State Assignment Algorithm (MTRSA), for the first case and extend it to the general multicast traffic engineering problem. The simulation and implementation results demonstrate that the solutions obtained by the proposed algorithm outperform the shortest-path trees and Steiner trees. Most importantly, MTRSA is computation-efficient and can be deployed in SDN since it can generate the solution with numerous trees in a short time.
Open AccessMulticast Traffic Engineering for Software-Defined Networks
Although Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, current literature mostly focuses on unicast communications. Compared to traffic engineering for multiple unicast flows, multicast traffic engineering for multiple trees is very challenging not only because minimizing the bandwidth consumption of a single multicast tree by solving the Steiner tree problem is already NP-Hard, but the Steiner tree problem does not consider the link capacity constraint for multicast flows and node capacity constraint to store the forwarding entries in Group Table of OpenFlow. In this paper, therefore, we first study the hardness results of scalable multicast traffic engineering in SDN. We prove that scalable multicast traffic engineering with only the node capacity constraint is NP-Hard and not approximable within, which is the number of destinations in the largest multicast group. We then prove that scalable multicast traffic engineering with both the node and link capacity constraints is NP-Hard and not approximable within any ratio. To solve the problem, we design an approximation algorithm, named Multi-Tree Routing and State Assignment Algorithm (MTRSA), for the first case and extend it to the general multicast traffic engineering problem. The simulation and implementation results demonstrate that the solutions obtained by the proposed algorithm outperform the shortest-path trees and Steiner trees. Most importantly, MTRSA is computation-efficient and can be deployed in SDN since it can generate the solution with numerous trees in a short time.
- 21 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 191-198
Max-Coloring of Vertex-Weighted Graphs
- 21 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 191-198
Max-Coloring of Vertex-Weighted Graphs