arXiv subjects

Chin-Yen Lee

Publications and source records attributed to Chin-Yen Lee.

6 recordsLinked to original sources

arXiv2026

Embedding the $n$-Qubit Projective Clifford Group into a Symmetric Group

In this paper, we construct a symmetric group ${\rm Sym}_{2(4^n-1)}$, which contains a subgroup isomorphic to the $n$-qubit projective Clifford group $\mathcal{C}_n$. To establish this result, we investigate the centralizers of the $z$ gate and the phase gate within the $n$-qubit projective Clifford group, utilizing the normal form of the Clifford operators. As a byproduct, we also provide a presentation of the inertia subgroup of $\mathcal{C}_n$.

math.GR↗

arXiv2025

A skew group ring of $\mathbb Z/2\mathbb Z$ over $U(\mathfrak{sl}_2)$, Leonard triples and odd graphs

We employ a skew group ring of $\mathbb Z/2\mathbb Z$ over $U(\mathfrak{sl}_2)$ to construct modules over the universal Bannai--Ito algebra. In addition, we give the conditions under which the defining generators act as Leonard triples on the resulting modules. As a combinatorial realization, we establish an algebra homomorphism from the universal Bannai--Ito algebra onto the Terwilliger algebra of an odd graph. This homomorphism provides a unified description of Leonard triples on all irreducible modules over the Terwilliger algebra.

math.CO↗

arXiv2024

The real equiangular tight frames obtained from rank $3$ graphs

We present all nontrivial real equiangular tight frames $\{φ_m\}_{m=1}^M$ in $\mathbb{R}^N$ obtained as spherical embeddings of primitive rank $3$ graphs on $M$ vertices, and those such that one of their associated $M$ strongly regular graphs on $M-1$ vertices is a primitive rank $3$ graph.

math.CO↗

arXiv2023

On character table of Clifford groups

Based on a presentation of $\mathcal{C}_n$ and the help of [GAP], we construct the character table of the Clifford group $\mathcal{C}_n$ for $n=1,2,3$. As an application, we can efficiently decompose the (higher power of) tensor product of the matrix representation in those cases. Our results recover some known results in [HWW, WF] and reveal some new phenomena. We prove that when $n \geq 3$, (1) the trivial character is the only linear character for $\mathcal{C}_n$ and hence $\mathcal{C}_n$ equals to its commutator subgroup, (2) the $n$-qubit Pauli group $\mathcal{P}_n$ is the only proper non-trivial normal subgroup of $\mathcal{C}_n$, (3) the matrix representation $\mathcal{M}_{2^n}$ is a faithful representation for $\mathcal{C}_n$. As a byproduct, we give a presentation of the finite symplectic group $Sp(2n,2)$ in terms of generators and relations.

math.RT↗

arXiv2023

Graphlet and Orbit Computation on Heterogeneous Graphs

Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly explored in heterogeneous graphs, which comprise various types of nodes and edges. Finding graphlets and orbits for heterogeneous graphs is difficult because of the heterogeneity and abundance of semantic information. We consider heterogeneous graphs, which can be treated as colored graphs. By applying the canonical label technique, we determine the graph isomorphism problem with multiple states on nodes and edges. With minimal parameters, we build all non-isomorphic graphs and associated orbits. We provide a Python package that can be used to generate orbits for colored directed graphs and determine the frequency of orbit occurrence. Finally, we provide four examples to illustrate the use of the Python package.

cs.SI↗

arXiv2022

On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3)

Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lisoněk in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by Lisoněk has a distinguished structure of a coherent configuration of type $(2,2;3)$ and is embedded in two concentric spheres in $\mathbb R^8$. In this paper we study whether there exists any other similar embedding of a coherent configuration of type $(2,2;3)$ as a $2$-distance set in $\mathbb R^n$, without assuming any restriction on the size of the set. We prove that there exists no such example other than that of Lisoněk. The key ideas of our proof are as follows: (i) study the geometry of the embedding of the coherent configuration in Euclidean spaces and to drive diophantine equations coming from this embedding. (ii) solve diophantine equations with certain additional conditions of integrality of some parameters of the combinatorial structure by using the method of auxiliary equations.

math.CO↗