Searcharxiv⌕ Search

arXiv subjects

Zejun Huang

Publications and source records attributed to Zejun Huang.

36 records · Page 2Linked to original sources
arXiv2023

Connected graphs with a given dissociation number attaining the minimum spectral radius

A dissociation set of a graph is a set of vertices which induces a subgraph with maximum degree less than or equal to one. The dissociation number of a graph is the maximum cardinality of its dissociation sets. In this paper, we study the connected graphs of order $n$ with a given dissociation number that attains the minimum spectral radius. We characterize these graphs when the dissociation number is in $\{n-1,~n-2,~\lceil2n/3\rceil,~\lfloor2n/3\rfloor,~2\}$. We also prove that these graphs are trees when the dissociation number is larger than $\lceil {2n}/{3}\rceil$.

math.CO↗
arXiv2023

Linear maps preserving (p,k) norms of tensor products of matrices

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $ϕ:M_{mn}\rightarrow M_{mn}$ satisfies $$\|ϕ(A\otimes B)\|_{(p,k)}=\|A\otimes B\|_{(p,k)} {\rm\quad for~ all\quad}A\in M_m {\rm ~and ~}B\in M_n$$ if and only if there exist unitary matrices $U,V\in M_{mn}$ such that $$ϕ(A\otimes B)=U(φ_1(A)\otimes φ_2(B))V {\rm\quad for~ all\quad}A\in M_m {\rm~ and~ }B\in M_n,$$ where $φ_s$ is the identity map or the transposition map $X\to X^T$ for $s=1,2$. The result is also extended to multipartite systems.

math.FA↗
arXiv2023

The set of stable indices of 0-1 matrices with a given order

The stable index of a 0-1 matrix $A$ is defined to be the smallest integer $k$ such that $A^{k+1}$ is not a 0-1 matrix if such an integer exists; otherwise the stable index of $A$ is defined to be infinity. We characterize the set of stable indices of 0-1 matrices with a given order.

math.CO↗
arXiv2022

Linear maps on nonnegative symmetric matrices preserving the independence number

The independence number of a square matrix $A$, denoted by $α(A)$, is the maximum order of its principal zero submatrices. Let $S_n^{+}$ be the set of $n\times n$ nonnegative symmetric matrices with zero trace. Denote by $J_n$ the $n\times n$ matrix with all entries equal to one. Given any integer $n$, we prove that a linear map $ϕ: S_n^+\rightarrow S_n^+$ satisfies $$α(ϕ(X))= α(X) {\quad\rm for~ all\quad}X\in S_n^+$$ if and only if there is a permutation matrix $P$ such that $$ϕ(X)=H\circ(P^TXP)\quad { \rm for~ all\quad}X\in S_n^+,$$ where $H=ϕ(J_n-I_n)$ with all off-diagonal entries positive.

math.CO↗
arXiv2021

Extremal digraphs avoiding distinct walks of length 3 with the same endpoints

In this paper, we determine the maximum size of digraphs on $n$ vertices in which there are no two distinct walks of length $3$ with the same initial vertex and the same terminal vertex. The digraphs attaining this maximum size are also characterized. Combining this with previous results, we obtain a full solution to a problem proposed by X. Zhan in 2007.

math.CO↗
arXiv2020

The stable index of 0-1 matrices

We introduce the concept of stable index for 0-1 matrices. Let $A$ be a 0-1 square matrix. If $A^k$ is a 0-1 matrix for every positive integer $k$, then the stable index of $A$ is defined to be infinity; otherwise, the stable index of $A$ is defined to be the smallest positive integer $k$ such that $A^{k+1}$ is not a 0-1 matrix. We determine the maximum finite stable index of all 0-1 matrices of order $n$ as well as the matrices attaining the maximum finite stable index.

math.CO↗
arXiv2019

On $k$-idempotent 0-1 matrices

Let $k\ge 2$ be an integer. If a square 0-1 matrix $A$ satisfies $A^k=A$, then $A$ is said to be $k$-idempotent. In this paper, we give a characterization of $k$-idempotent 0-1 matrices. We also determine the maximum number of nonzero entries in $k$-idempotent 0-1 matrices of a given order as well as the $k$-idempotent 0-1 matrices attaining this maximum number.

math.CO↗
arXiv2018

0-1 matrices with zero trace whose squares are 0-1 matrices

In this paper, we determine the maximum number of nonzero entries in 0-1 matrices of order $n$ with zero trace whose squares are 0-1 matrices when $n\ge 8$. The extremal matrices attaining this maximum number are also characterized.

math.CO↗
arXiv2018

Extremal digraphs avoiding an orientation of $C_4$

Let $P_{2,2}$ be the orientation of $C_4$ which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of $P_{2,2}$-free digraphs of order $n$ as well as the extremal digraphs attaining the maximum size when $n\ge 13$.

math.CO↗
arXiv2017

Linear rank preservers of tensor products of rank one matrices

Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $ϕ: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(ϕ(A_1\otimes \cdots \otimes A_k))=1\quad\hbox{whenever}\quad{\mathrm rank}\, (A_1\otimes \cdots \otimes A_k)=1 \quad \hbox{for all}\quad A_i \in M_{n_i},\, i = 1,\dots,k.$$ Applying this result, we extend two recent results on linear maps that preserving the rank of special classes of matrices.

math.FA↗
arXiv2015

Factorization of permutations

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $δ$, such that every permutation can be factored into no more than $δ$ special transpositions. This study is related to sorting algorithms, Cayley graphs, and genomics.

math.CO↗
arXiv2013

Linear maps preserving Ky Fan norms and Schatten norms of tensor products of matrices

For a positive integer $n$, let $M_n$ be the set of $n\times n$ complex matrices. Suppose $\|\cdot\|$ is the Ky Fan $k$-norm with $1 \le k \le mn$ or the Schatten $p$-norm with $1 \le p \le \infty$ ($p\ne 2$) on $M_{mn}$, where $m,n\ge 2$ are positive integers. It is shown that a linear map $ϕ: M_{mn} \rightarrow M_{mn}$ satisfying $$\|A\otimes B\| = \|ϕ(A\otimes B)\| \quad \hbox{for all} A \in M_m \hbox{and} B \in M_n$$ if and only if there are unitary $U, V \in M_{mn}$ such that $ϕ$ has the form $A\otimes B \mapsto U(φ_1(A) \otimes φ_2(B))V$, where $φ_s(X)$ is either the identity map $X \mapsto X$ or the transposition map $X \mapsto X^t$. The results are extended to tensor space $M_{n_1} \otimes \cdots \otimes M_{n_m}$ of higher level. The connection of the problem to quantum information science is mentioned.

math.FA↗
arXiv2012

Physical transformations between quantum states

Given two sets of quantum states {A_1, ..., A_k} and {B_1, ..., B_k}, represented as sets of density matrices, necessary and sufficient conditions are obtained for the existence of a physical transformation T, represented as a trace-preserving completely positive map, such that T(A_i) = B_i for i = 1, ..., k. General completely positive maps without the trace-preserving requirement, and unital completely positive maps transforming the states are also considered.

math-ph↗
arXiv2012

Linear preservers and quantum information science

Let $m,n\ge 2$ be positive integers, $M_m$ the set of $m\times m$ complex matrices and $M_n$ the set of $n\times n$ complex matrices. Regard $M_{mn}$ as the tensor space $M_m\otimes M_n$. Suppose $|\cdot|$ is the Ky Fan $k$-norm with $1 \le k \le mn$, or the Schatten $p$-norm with $1 \le p \le \infty$ ($p\ne 2$) on $M_{mn}$. It is shown that a linear map $ϕ: M_{mn} \rightarrow M_{mn}$ satisfying $$|A\otimes B| = |ϕ(A\otimes B)|$$ for all $A \in M_m$ and $B \in M_n$ if and only if there are unitary $U, V \in M_{mn}$ such that $ϕ$ has the form $A\otimes B \mapsto U(φ_1(A) \otimes φ_2(B))V$, where $φ_i(X)$ is either the identity map $X \mapsto X$ or the transposition map $X \mapsto X^t$. The results are extended to tensor space $M_{n_1} \otimes ... \otimes M_{n_m}$ of higher level. The connection of the problem to quantum information science is mentioned.

quant-ph↗