arXiv subjects

Ziqing Xiang

Publications and source records attributed to Ziqing Xiang.

10 recordsLinked to original sources

arXiv2026

Natural graph spectra

In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph matrices}, which are matrices defined by applying a fixed sequence of elementary operations to the adjacency matrix. This class includes many standard matrices such as the adjacency matrix, the Seidel matrix, the Laplacian matrix, and the distance matrix. We give an affirmative answer to the question of van Dam and Haemers by proving the existence of a natural graph matrix whose spectrum determines random graphs up to isomorphism. The proof introduces a new algebraic framework called {\em double algebras}, which provides a simple sufficient condition for spectral determination. This sufficient condition is then shown to hold for random graphs.

math.CO↗

arXiv2025

The non-existence of some Moore polygons and spectral Moore bounds

In this paper, we study the maximum order $v(k,θ)$ of a connected $k$-regular graph whose second largest eigenvalue is at most $θ$. From Alon-Boppana and Serre, we know that $v(k,θ)$ is finite when $θ< 2\sqrt{k-1}$ while the work of Marcus, Spielman, and Srivastava implies that $v(k,θ)$ is infinite if $θ\geq 2\sqrt{k-1}$. Cioabă, Koolen, Nozaki, and Vermette obtained a general upper bound on $v(k, θ)$ via Nozaki's linear programming bound and determined many values of $v(k,θ)$. The graphs attaining this bound are distance-regular and are called Moore polygons. Damerell and Georgiacodis proved that there are no Moore polygons of diameter $6$ or more. For smaller diameters, there are infinitely many Moore polygons. We complement these results by proving two nonexistence results for Moore polygons with specific parameters. We also determine new values of $v(k,θ)$: $v(4, \sqrt{2}) = 14$ and $v(5, \sqrt{2}) = v(5,\sqrt{5}-1)=16$. The former is achieved by the co-Heawood graph, and the latter by the folded $5$-cube. We verify that any connected $5$-regular graph with second eigenvalue $λ_2$ exceeding $1$ satisfies $λ_2 \geq \sqrt{5} - 1$, and that the unique $5$-regular graph attaining equality in this bound has $10$ vertices. We prove a stronger form of a 2015 conjecture of Kolokolnikov related to the second eigenvalue of cubic graphs of given order, and observe that other recent results on the second eigenvalue of regular graphs are consequences of the general upper bound theorem on $v(k,θ)$ mentioned above.

math.CO↗

arXiv2025

Quantum wreath products and Schur--Weyl duality II

In the first part of this series, the authors introduced the quantum wreath product, providing a unified framework that encompasses numerous results previously addressed only through case-by-case analysis. This paper shifts focus to the fundamental construction of modules over these products, termed wreath modules. Our approach utilizes parabolic induction on tensor products combined with a sophisticated labeling scheme based on multipartitions. While the underlying constructions are technically involved, they offer a transparent realization of several prominent module families. Specifically, these wreath modules recover and unify: Simple modules over the Ariki-Koike algebra; Specht and simple modules over the Hu algebra; (anti)spherical modules and Kashiwara-Miwa-Stern modules over the affine Hecke algebra and its pro-p Iwahori variants. Finally, we demonstrate that these wreath modules for the Hu algebra serve as a critical component in solving the Ginzburg-Guay-Opdam-Rouquier problem. This solution enables a concrete realization of Category O for the rational Cherednik algebra in Type D.

math.RT↗

arXiv2025

On Lattice Tilings of Asymmetric Limited-Magnitude Balls $\cB(n,2,m,m-1)$

Limited-magnitude errors modify a transmitted integer vector in at most $t$ entries, where each entry can increase by at most $\kp$ or decrease by at most $\km$. This channel model is particularly relevant to applications such as flash memories and DNA storage. A perfect code for this channel is equivalent to a tiling of $\Z^n$ by asymmetric limited-magnitude balls $\cB(n,t,\kp,\km)$. In this paper, we focus on the case where $t=2$ and $\km=\kp-1$, and we derive necessary conditions on $m$ and $n$ for the existence of a lattice tiling of $\cB(n,2,m,m-1)$. Specifically, we prove that if such a tiling exists, then either $4\leq m \leq 512$ and $n<7.23m+4$, or $m>512$ and $n<4m$. In particular, for $m=2$ and $m=3$, we show that no lattice tiling of $\cB(n,2,2,1)$ or $\cB(n,2,3,2)$ exists for any $n\geq 3$.

math.CO↗

arXiv2025

Codes with symmetric distances

For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant weight $n$ and symmetric distances, then \[ |C| \leq \binom{2 n - 1}{|S(C)|}. \] This result can be interpreted using the language of Johnson association schemes. More generally, we give a framework to study codes with symmetric distances in Q-bipartite Q-polynomial association schemes, and provide upper bounds for such codes. Moreover, we use number theoretic techniques to determine when the equality holds.

math.CO↗

arXiv2024

Quantum wreath products and Schur-Weyl duality I

In this paper the authors introduce a new notion called the quantum wreath product, which is the algebra $B \wr_Q \mathcal{H}(d)$ produced from a given algebra $B$, a positive integer $d$, and a choice $Q=(R,S,ρ,σ)$ of parameters. Important examples {that arise from our construction} include many variants of the Hecke algebras, such as the Ariki-Koike algebras, the affine Hecke algebras and their degenerate version, Wan-Wang's wreath Hecke algebras, Rosso-Savage's (affine) Frobenius Hecke algebras, Kleshchev-Muth's affine zigzag algebras, and the Hu algebra that quantizes the wreath product $Σ_m \wr Σ_2$ between symmetric groups. In the first part of the paper, the authors develop a structure theory for the quantum wreath products. Necessary and sufficient conditions for these algebras to afford a basis of suitable size are obtained. Furthermore, a Schur-Weyl duality is established via a splitting lemma and mild assumptions on the base algebra $B$. Our uniform approach encompasses many known results which were proved in a case by case manner. The second part of the paper involves the problem of constructing natural subalgebras of Hecke algebras that arise from wreath products. Moreover, a bar-invariant basis of the Hu algebra via an explicit formula for its extra generator is also described.

math.RT↗

arXiv2023

Classification of tight $2s$-designs with $s \geq 2$

Tight $2 s$-designs are the $2 s$-$(v, k, λ)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs. It has been widely conjectured since 1970s that there are no other nontrivial tight designs. In this paper, we give a proof of this conjecture. In the proof, an upper bound $v \ll s$ is shown by analyzing the parameters of the designs and the coefficients of the Wilson polynomials, and a lower bound $v \gg s (\ln s)^2$ is shown by using estimates on prime gaps.

math.CO↗

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↗

arXiv2019

On $q$-Schur algebras corresponding to Hecke algebras of type B

In this paper the authors investigate the $q$-Schur algebras of type B that were constructed earlier using coideal subalgebras for the quantum group of type A. The authors present a coordinate algebra type construction that allows us to realize these $q$-Schur algebras as the duals of the $d$th graded components of certain graded coalgebras. Under suitable conditions an isomorphism theorem is proved that demonstrates that the representation theory reduces to the $q$-Schur algebra of type A. This enables the authors to address the questions of cellularity, quasi-hereditariness and representation type of these algebras. Later it is shown that these algebras realize the $1$-faithful quasi hereditary covers of the Hecke algebras of type B. As a further consequence, the authors demonstrate that these algebras are Morita equivalent to Rouquier's finite-dimensional algebras that arise from the category ${\mathcal O}$ for rational Cherednik algebras for the Weyl group of type B. In particular, we have introduced a Schur-type functor that identifies the type B Knizhnik-Zamolodchikov functor.

math.RT↗

arXiv2018

Support varieties for Hecke algebras

Let ${\mathcal H}_{q}(d)$ be the Iwahori-Hecke algebra for the symmetric group, where $q$ is a primitive $l$th root of unity. In this paper we develop a theory of support varieties which detects natural homological properties such as the complexity of modules. The theory the authors develop has a canonical description in an affine space where computations are tractable. The ideas involve the interplay with the computation of the cohomology ring due to Benson, Erdmann and Mikaelian, the theory of vertices due to Dipper and Du, and branching results for cohomology by Hemmer and Nakano. Calculations of support varieties and vertices are presented for permutation, Young and classes of Specht modules. Furthermore, a discussion of how the authors' results can be extended to other Hecke algebras for other classical groups is presented at the end of the paper.

math.RT↗