Search arXivSearch

arXiv · 2006.00440

The complex conjugate invariants of Clifford groups

Abstract

Nebe, Rains and Sloane studied the polynomial invariants for real and complex Clifford groups and they relate the invariants to the space of complete weight enumerators of certain self-dual codes. The purpose of this paper is to show that very similar results can be obtained for the invariants of the complex Clifford group $\mathcal{X}_m$ acting on the space of conjugate polynomials in $2^m$ variables of degree $N_1$ in $x_f$ and of degree $N_2$ in their complex conjugates $\overline{x_f}$. In particular, we show that the dimension of this space is $2$, for $(N_1,N_2)=(5,5)$. This solves the Conjecture 2 given in Zhu, Kueng, Grassl and Gross affirmatively. In other words if an orbit of the complex Clifford group is a projective $4$-design, then it is automatically a projective $5$-design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eiichi Bannai, Manabu Oura, Da Zhao. 2020-05-31. The complex conjugate invariants of Clifford groups. https://arxiv.org/abs/2006.00440

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO