Hsiang-Chun Hsu

activity

20172022

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2022

Statistics of Partial Permutations via Catalan matrices

Yen-Jen Cheng, Sen-Peng Eu, Hsiang-Chun Hsu

A generalized Catalan matrix $(a_{n, k})_{n, k \geq 0}$ is generated by two seed sequences $s = (s_{0}, s_{1}, \dots)$ and $t = (t_{1}, t_{2}, \dots)$ together with a recurrence re…

math.CO2020

An Easy-to-implement Construction for $(k, n)$ -threshold Progressive Visual Secret Sharing Schemes

Hong-Bin Chen, Hsiang-Chun Hsu, Justie Su-Tzu Juan

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 sys…

math.CO2017

Folding Phenomenon of Major-balance Identities on Restricted Involutions

Tung-Shan Fu, Hsian-Chun Hsu, Hsin-Chieh Liao

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 sig…

math.CO2017

Signed Countings of types B and D permutations and $t, q$ -Euler Numbers

Sen-Peng Eu, Tung-Shan Fu, Hsiang-Chun Hsu +1

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}$ , alternat…

Statistics of Partial Permutations via Catalan matrices

An Easy-to-implement Construction for (k,n)-threshold Progressive Visual Secret Sharing Schemes

Folding Phenomenon of Major-balance Identities on Restricted Involutions

Signed Countings of types B and D permutations and t,q-Euler Numbers

An Easy-to-implement Construction for $(k, n)$ -threshold Progressive Visual Secret Sharing Schemes

Signed Countings of types B and D permutations and $t, q$ -Euler Numbers