Xiande Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xiande Zhang has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Fei Shi
Sun Yat-sen University
21 shared publications - Gennian Ge
Capital Normal University
18 shared publications - Lin Chen
Beihang University
10 shared publications - Tingting Chen
Institute of Mathematics and Interdisciplinary Sciences, Xidian University, Xi’an, China
9 shared publications Fei Shi
School of Mathematical Sciences University of Science and Technology of China 230026 Hefei China
8 shared publications- Wenjie Zhong
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
7 shared publications
Latest Publications
- 24 March 2026
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 223
Focal-free uniform hypergraphs and codes
- 24 March 2026
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 223
Focal-free uniform hypergraphs and codes
- 10 March 2026
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 35 (3) , 356-374
Trace reconstruction of matrices and hypermatrices
A trace of a sequence is generated by deleting each bit of the sequence independently with a fixed probability. The well-studied trace reconstruction problem asks how many traces are required to reconstruct an unknown binary sequence with high probability. In this paper, we study the multidimensional version of this problem for matrices and hypermatrices, where a trace is generated by deleting each row/column of the matrix or each slice of the hypermatrix independently with a constant probability. Previously, Krishnamurthy, Mazumdar, McGregor and Pal showed that exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript d divided by left parenthesis d plus 2 right parenthesis Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{d/(d+2)}))$ traces suffice to reconstruct any unknown n times n $n\times n$ matrix (for d equals 2 $d=2$ ) and any unknown n Superscript times d $n^{\times d}$ hypermatrix. By developing a dimension reduction procedure and establishing a multivariate version of the Littlewood-type result that lower bounds sparse complex polynomials around 1 $1$ , we improve this upper bound by showing that exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript 3 divided by 7 Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{3/7}))$ traces suffice to reconstruct any unknown n times n $n\times n$ matrix, and exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript 3 divided by 5 Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{3/5}))$ traces suffice to reconstruct any unknown n Superscript times d $n^{\times d}$ hypermatrix. In contrast to the earlier bound, our new exponent is bounded away from 1 $1$ even as d $d$ becomes very large.- 10 March 2026
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 35 (3) , 356-374
Trace reconstruction of matrices and hypermatrices
A trace of a sequence is generated by deleting each bit of the sequence independently with a fixed probability. The well-studied trace reconstruction problem asks how many traces are required to reconstruct an unknown binary sequence with high probability. In this paper, we study the multidimensional version of this problem for matrices and hypermatrices, where a trace is generated by deleting each row/column of the matrix or each slice of the hypermatrix independently with a constant probability. Previously, Krishnamurthy, Mazumdar, McGregor and Pal showed that exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript d divided by left parenthesis d plus 2 right parenthesis Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{d/(d+2)}))$ traces suffice to reconstruct any unknown n times n $n\times n$ matrix (for d equals 2 $d=2$ ) and any unknown n Superscript times d $n^{\times d}$ hypermatrix. By developing a dimension reduction procedure and establishing a multivariate version of the Littlewood-type result that lower bounds sparse complex polynomials around 1 $1$ , we improve this upper bound by showing that exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript 3 divided by 7 Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{3/7}))$ traces suffice to reconstruct any unknown n times n $n\times n$ matrix, and exp left parenthesis ModifyingAbove upper O With tilde left parenthesis n Superscript 3 divided by 5 Baseline right parenthesis right parenthesis $\exp (\widetilde {O}(n^{3/5}))$ traces suffice to reconstruct any unknown n Superscript times d $n^{\times d}$ hypermatrix. In contrast to the earlier bound, our new exponent is bounded away from 1 $1$ even as d $d$ becomes very large.- Top Cited Papers
- 25 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-14
Counting cliques with prescribed intersection sizes
- 25 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-14
Top Cited PapersCounting cliques with prescribed intersection sizes
- 5 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 21
Improved bounds for codes over trees
- 5 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 21
Improved bounds for codes over trees
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Linear Programming Bounds on k -Uniform States
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (9) , 1
Linear Programming Bounds on k -Uniform States
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 21, 95-106
Improvements on permutation reconstruction from minors
We study the reconstruction problem of permutation sequences from their $ k $-minors, which are subsequences of length $ k $ with entries renumbered by $ 1,2,\ldots,k $ preserving order. This can be viewed as a generalization of permutation codes correcting deletion errors and the sequence reconstruction problem, both introduced by Levenshtein. We prove that the minimum number $ k $ such that any permutation of length $ n $ can be reconstructed from the multiset of its $ k $-minors is between $ \exp{(\Omega(\sqrt{\ln n}))} $ and $ O(\sqrt{n\ln n}) $. Our results determine a well-studied parameter $ N_d = d+o(d) $ asymptotically, which is the smallest number such that any permutation of length $ n\ge N_d $ can be reconstructed by its $ (n-d) $-minors. Previously, the bounds of $ N_d $ were $ d+\log_2 d<N_d<d^2/4+2d+4 $.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 21, 95-106
Improvements on permutation reconstruction from minors
We study the reconstruction problem of permutation sequences from their $ k $-minors, which are subsequences of length $ k $ with entries renumbered by $ 1,2,\ldots,k $ preserving order. This can be viewed as a generalization of permutation codes correcting deletion errors and the sequence reconstruction problem, both introduced by Levenshtein. We prove that the minimum number $ k $ such that any permutation of length $ n $ can be reconstructed from the multiset of its $ k $-minors is between $ \exp{(\Omega(\sqrt{\ln n}))} $ and $ O(\sqrt{n\ln n}) $. Our results determine a well-studied parameter $ N_d = d+o(d) $ asymptotically, which is the smallest number such that any permutation of length $ n\ge N_d $ can be reconstructed by its $ (n-d) $-minors. Previously, the bounds of $ N_d $ were $ d+\log_2 d<N_d<d^2/4+2d+4 $.- Open AccessThe Hilton-Milner type results of $(k, \ell)$-sum-free sets in $\mathbb F_p^n$For a prime $p \equiv 2 \pmod 3$, it is well known that the largest sum-free subsets of $\mathbb{F}_p^n$ have size $\frac{p+1}{3} p^{n-1}$, and the extremal sets must be a cuboid of the form $\{\frac{p+1}{3}, \frac{p+1}{3}+1, \ldots, \frac{2p-1}{3}\} \times \mathbb{F}_p^{n-1}$ up to isomorphism. Recently, Reiner and Zotova proved a Hilton--Milner type stability result showing that for large $p$, any sum-free set not contained in the extremal cuboid has size at most $\frac{p-2}{3} p^{n-1}$, and all possible structures attaining this bound were classified. In this paper, we develop a general Hilton--Milner theory for $(k,\ell)$-sum-free sets in $\mathbb{F}_p^n$ for $k > \ell \ge 1$. We determine the maximum size of such sets for all $p \equiv μ\pmod{k+\ell}$ with $2 \le μ\le k+\ell-1$, and show that the extremal configurations are precisely $\lceil (μ-1)/2 \rceil$ non-isomorphic cuboids. Beyond the extremal regime, we prove sharp Hilton--Milner type stability results showing that, for all sufficiently large $p$, a $(k,\ell)$-sum-free set not contained in any of these extremal cuboids is uniformly bounded away from the maximum by a gap of order $p^{n-1}$, and we determine the full structure of all sets achieving this second-best bound in several broad parameter ranges. In particular, when $2 \le μ\le k+\ell-3$ (which is tight), only two structural types occur for all $k+\ell \ge 5$; and when $μ= 2$ or $3$, we obtain a complete classification for all $k > \ell \ge 1$. Our arguments combine additive combinatorics and Fourier-analytic methods, and make use of recent progress toward the long-standing $3k-4$ conjecture, highlighting new connections between inverse additive number theory and extremal problems over finite vector spaces.Open AccessThe Hilton-Milner type results of $(k, \ell)$-sum-free sets in $\mathbb F_p^n$For a prime $p \equiv 2 \pmod 3$, it is well known that the largest sum-free subsets of $\mathbb{F}_p^n$ have size $\frac{p+1}{3} p^{n-1}$, and the extremal sets must be a cuboid of the form $\{\frac{p+1}{3}, \frac{p+1}{3}+1, \ldots, \frac{2p-1}{3}\} \times \mathbb{F}_p^{n-1}$ up to isomorphism. Recently, Reiner and Zotova proved a Hilton--Milner type stability result showing that for large $p$, any sum-free set not contained in the extremal cuboid has size at most $\frac{p-2}{3} p^{n-1}$, and all possible structures attaining this bound were classified. In this paper, we develop a general Hilton--Milner theory for $(k,\ell)$-sum-free sets in $\mathbb{F}_p^n$ for $k > \ell \ge 1$. We determine the maximum size of such sets for all $p \equiv μ\pmod{k+\ell}$ with $2 \le μ\le k+\ell-1$, and show that the extremal configurations are precisely $\lceil (μ-1)/2 \rceil$ non-isomorphic cuboids. Beyond the extremal regime, we prove sharp Hilton--Milner type stability results showing that, for all sufficiently large $p$, a $(k,\ell)$-sum-free set not contained in any of these extremal cuboids is uniformly bounded away from the maximum by a gap of order $p^{n-1}$, and we determine the full structure of all sets achieving this second-best bound in several broad parameter ranges. In particular, when $2 \le μ\le k+\ell-3$ (which is tight), only two structural types occur for all $k+\ell \ge 5$; and when $μ= 2$ or $3$, we obtain a complete classification for all $k > \ell \ge 1$. Our arguments combine additive combinatorics and Fourier-analytic methods, and make use of recent progress toward the long-standing $3k-4$ conjecture, highlighting new connections between inverse additive number theory and extremal problems over finite vector spaces.
- 24 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 39 (4) , 2311-2327
On Supersaturation for Oddtown and Eventown
We study the supersaturation problems of oddtown and eventown. Given a family [Formula: see text] of subsets of an [Formula: see text]-element set, let [Formula: see text] denote the number of distinct pairs [Formula: see text] for which [Formula: see text] is odd. We show that if [Formula: see text] consists of [Formula: see text] odd-sized subsets, then [Formula: see text], which is tight when [Formula: see text]. This disproves a conjecture by O’Neill on the supersaturation problem of oddtown. For the supersaturation problem of eventown, we show that for large enough [Formula: see text], if [Formula: see text] consists of [Formula: see text] even-sized subsets, then [Formula: see text] for any positive integer [Formula: see text]. This partially proves a conjecture by O’Neill on the supersaturation problem of eventown. Previously, the correctness of this conjecture was only verified for [Formula: see text] and 2. We further provide a lower bound which is a factor of two away from the conjectured bound for eventown, that is, [Formula: see text] for general [Formula: see text] and [Formula: see text] by using discrete Fourier analysis. Finally, some asymptotic results for the lower bounds of [Formula: see text] are given when [Formula: see text] is large for both problems.
- 24 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 39 (4) , 2311-2327
On Supersaturation for Oddtown and Eventown
We study the supersaturation problems of oddtown and eventown. Given a family [Formula: see text] of subsets of an [Formula: see text]-element set, let [Formula: see text] denote the number of distinct pairs [Formula: see text] for which [Formula: see text] is odd. We show that if [Formula: see text] consists of [Formula: see text] odd-sized subsets, then [Formula: see text], which is tight when [Formula: see text]. This disproves a conjecture by O’Neill on the supersaturation problem of oddtown. For the supersaturation problem of eventown, we show that for large enough [Formula: see text], if [Formula: see text] consists of [Formula: see text] even-sized subsets, then [Formula: see text] for any positive integer [Formula: see text]. This partially proves a conjecture by O’Neill on the supersaturation problem of eventown. Previously, the correctness of this conjecture was only verified for [Formula: see text] and 2. We further provide a lower bound which is a factor of two away from the conjectured bound for eventown, that is, [Formula: see text] for general [Formula: see text] and [Formula: see text] by using discrete Fourier analysis. Finally, some asymptotic results for the lower bounds of [Formula: see text] are given when [Formula: see text] is large for both problems.
- Open Access
Quantitative Frameproof Codes and Hypergraphs
Frameproof codes are a class of secure codes introduced by Boneh and Shaw in the context of digital fingerprinting, and have been widely studied from a combinatorial point of view. In this paper, we study a quantitative extension of frameproof codes and hypergraphs, referred to as {\it quantitative frameproof codes and hypergraphs}. We give asymptotically optimal bounds on the maximum sizes of these structures and determine their exact sizes for a broad range of parameters. In particular, we introduce a generalized version of the Erdős matching number in our proof and derive relevant estimates for it.
Open AccessQuantitative Frameproof Codes and Hypergraphs
Frameproof codes are a class of secure codes introduced by Boneh and Shaw in the context of digital fingerprinting, and have been widely studied from a combinatorial point of view. In this paper, we study a quantitative extension of frameproof codes and hypergraphs, referred to as {\it quantitative frameproof codes and hypergraphs}. We give asymptotically optimal bounds on the maximum sizes of these structures and determine their exact sizes for a broad range of parameters. In particular, we introduce a generalized version of the Erdős matching number in our proof and derive relevant estimates for it.