arXiv subjects

Huilan Chang

Publications and source records attributed to Huilan Chang.

3 recordsLinked to original sources

arXiv2019

Signed Mahonian polynomials for major and sorting indices

We derive some new signed Mahonian polynomials over the complex reflection group $G(r,1,n)=C_r\wr\mathfrak{S}_n$, where the "sign" is taken to be any of the $2r$ $1$-dim characters and the "Mahonian" statistics are the $\mathsf{lmaj}$ defined by Bagno and the $\mathsf{sor}$ defined by Eu et al. Various new signed Mahonian polynomials over Coxeter groups of types $B_n$ and $D_n$ are derived as well. We also investigate the signed counting polynomials on $G(r,1,n)$ for those statistics with the distribution $[r]_q[2r]_q\cdots [nr]_q$.

math.CO↗

arXiv2018

Finding non-minority balls with majority and plurality queries

Given a set of $n$ colored balls, a \textit{majority, non-minority or plurality ball} is one whose color class has size more than $n/2$, at least $n/2$ or larger than any other color class, respectively. We describe linear time algorithms for finding non-minority balls using query sets of size $q$ of the following form: the answer to a majority/plurality query $Q$ is a majority/plurality ball in $Q$ or the statement that there is no such ball in $Q$.

math.CO↗

arXiv2015

On the Bernoulli Automorphism of Reversible Linear Cellular Automata

This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This gives an affirmative answer to an open problem proposed in [Pivato, Ergodc theory of cellular automata, Encyclopedia of Complexity and Systems Science, 2009, pp.~2980-3015] for the case of reversible linear cellular automata.

math.DS↗