Searcharxiv⌕ Search

arXiv subjects

Tingzeng Wu

Publications and source records attributed to Tingzeng Wu.

At least 19 recordsLinked to original sources

Near-synchronous multiphoton quantum interference

Nonclassical multiphoton interference is an important resource for optical quantum information processing, and its output statistics depend on the distinguishability of the input photons. In this paper, using time delay as a tunable parameter, we theoretically analyze the interference behavior of independent pure-state single photons with identical Gaussian spectral envelopes under near-synchronous conditions. Using the immanant representation of the single-photon internal-state overlap matrix to express the weights of the exchange-symmetry components, we determine the leading asymptotic behavior and approximation error of each weight, and characterize the weight suppression laws when different groups of photons become synchronized on different scales. Given the local identity classes of the delay functions and the vanishing orders of pairwise delay differences, the vanishing orders of the weights of the exchange-symmetry components can be computed in polynomial time by integer minimum-cost flow. On this basis, we provide a network-independent total-variation error bound for the complete output photon-number distribution, establish a quantitative relationship among the photon spectral width, synchronization precision, and interference statistics deviation, and provide a quantitative basis for the analysis and approximation of near-synchronous multiphoton interference.

quant-ph↗

Upper bounds for the number of spanning forests of a graph

Let $G$ be a simple graph on $n$ vertices, and let $F(G)$ denote the number of spanning forests of $G$. Bencs and Csikvári proved that every $r$-regular graph $G$ with $r\ge 2$ satisfies $F(G)\le r^n$. Motivated by this result, they conjectured that if $G$ has minimum degree at least $3$, then $F(G)\leq \prod_{i=1}^n d_i$, where $(d_1, d_2, \dots, d_n)$ is the degree sequence of $G$. In this paper, we prove that graphs with minimum degree at least $n/3$ $(n\geq7)$ satisfy $F(G)\leq \prod_{i=1}^n d_i$. We also construct a counterexample to the conjecture. We therefore further study the enumeration of spanning forests in general graphs, proving an upper bound in terms of the degree sequence and characterizing the extremal graphs attaining this bound. In addition, using the matrix-forest theorem, we obtain an upper bound for the number of spanning forests of a connected graph in terms of its algebraic connectivity, and characterize the extremal graphs attaining this bound.

math.CO↗

Upper bounds on all-terminal reliability polynomials in terms of cycle basis lengths

Let $G=(V(G),E(G))$ be a connected multigraph with $n$ vertices and $m$ edges. The all-terminal reliability polynomial of $G$ can be written as $R_G(q)=(1-q)^{n-1}\sum\limits_{i=0}^{d}H_iq^i$ where $d=m-n+1$ is the cycle rank, each edge fails independently with probability $q\in[0,1]$, and $H_0,\ldots,H_d$ are the associated coefficients. A cycle basis, which consists of cycles that form a basis of the cycle space of a graph, is an important tool for characterizing its cycle structure. The structural properties of cycle bases, together with the associated length optimization problems and construction algorithms, have been extensively studied. In this context, Colbourn posed the following open problem, which concerns upper bounds on the reliability coefficients in terms of cycle-basis lengths: For all-terminal reliability, is it true that if $G$ has a cycle basis containing cycles of lengths $c_1,\ldots,\allowbreak c_{m-n+1}$, then $H_i \le\sum\limits_{\substack{I\subseteq\{1,\ldots,m-n+1\},|I|=i}}\prod\limits_{j\in I}(c_j-1)$? In this paper, we establish a result that resolves this open problem.

math.CO↗

On the Complexity of Extending Prescribed Linear Forests to Hamiltonian Cycles in Hypercubes

Let $Q_n$ be the $n$-dimensional hypercube, and let $P\subseteq E(Q_n)$ be a set of prescribed edges. It is known that, for $n\ge 2$, every such set $P$ with $|P|\leq 2n-3$ whose edges form a linear forest is contained in a Hamiltonian cycle of $Q_n$. This bound is sharp for general linear forests. The computational complexity of deciding whether a prescribed edge set of a hypercube can be extended to a Hamiltonian cycle was posed as an open question by Dvořák [SIAM J. Discrete Math. 19 (2005) 135--144]. We prove that the problem is NP-complete even when the prescribed edges form a spanning linear forest with no isolated vertices. We give a polynomial-time reduction from a restricted 3-SAT problem, using local spanning path-forest gadgets for variables and clauses that are uniformly embedded in the hypercube. The same reduction therefore establishes NP-hardness of two versions of Hamiltonian-cycle extension problems for general prescribed edge sets.

cs.CC↗

Orlik-Solomon algebras determine the Tutte polynomials of matroids of rank at most three

Let $\mathcal{M}$ be a simple matroid of rank $r$ on the ground set $[n]=\{1,\ldots,n\}$, let $T_{\mathcal{M}}(x,y)$ denote its Tutte polynomial, and let $\mathrm{OS}(\mathcal{M})$ denote its Orlik-Solomon $\mathbb{C}$-algebra. We say that $\mathrm{OS}(\mathcal{M})$ determines $T_{\mathcal{M}}(x,y)$ if, for every simple matroid $\mathcal{N}$, an isomorphism $\mathrm{OS}(\mathcal{M})\cong\mathrm{OS}(\mathcal{N})$ of $\mathbb{C}$-algebras, without regard to the grading, implies $T_{\mathcal{M}}(x,y)=T_{\mathcal{N}}(x,y)$. Falk conjectured that the Orlik-Solomon $\mathbb{C}$-algebra of every simple matroid of rank three determines its Tutte polynomial. We prove that this holds for every simple matroid of rank at most three, thereby resolving Falk's conjecture.

math.CO↗

On two problems concerning the geodesic transversal number of graphs

We establish sharp upper and lower bounds on the geodesic transversal number of hypercubes. We also obtain a lower bound on the geodesic transversal number of Hamming graphs. As applications, we provide negative answers to two open problems concerning the geodesic transversal number.

math.CO↗

Immanantal polynomials of the linear combination matrices of graphs

The immanant is a generalized matrix function associated with irreducible characters of the symmetric group. The immanantal polynomial of matrix $M$ is defined as the immanant of matrix $(xI - M)$, where $I$ is the identity matrix. The characteristic polynomials and permanental polynomials of graph matrices (adjacency matrix, Laplacian matrix, signless Laplacian matrix and $A_α(G)$ matrix) have been extensively studied, yielding fascinating results. As a unification of the characteristic polynomial and permanental polynomial, the immanantal polynomial has also attracted attention and led to several important findings. In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a combinatorial interpretation of the coefficients of the immanantal polynomials for the linear combination matrices of graphs, and we also characterize the bounds of these coefficients. These bounds implicitly encompass the existing results of Chan and Lam on trees and bipartite graphs. Furthermore, we give a solution to the open problem posed by Merris. Second, we characterize the first six coefficients of the hook immanantal polynomial. And the necessary and sufficient condition under which the linear combination matrices of two regular graphs have the same hook immanantal polynomial is proved. Third, we generalize the Frobenius--König theorem and the Laplace expansion theorem to immanants. Using these two theorems, we show that the star degree of a graph is always a lower bound for the multiplicity of a certain root of the immanantal polynomial of its linear combination matrix. Finally, we derive formulas for the first six coefficients of the hook immanantal polynomial for several important graph matrices.

math.CO↗

On the nonnegativity of monomial immanants for hook partitions

Let $A=(a_{ij})$ be an $n\times n$ real matrix and let $λ$ be a partition of $n$. Let $ϕ^λ$ be the class function dual to the Young permutation character, and let $$ ϕ^λ[A] = \sum_{σ\in\mathfrak{S}_n}ϕ^λ(σ) \prod_{i=1}^{n}a_{iσ(i)} $$ be the corresponding monomial immanant. Stembridge [Canad. J. Math. 44 (1992), pp. 1079-1099] posed the following open problem: If all minors of $A$ of order at most $r$ are nonnegative, and the partition $λ$ has length at most $r$, is it true that $ϕ^λ[A]\ge 0$? This paper solves the problem for all hook partitions.

math.CO↗

On the Tutte polynomial of series-parallel posets

The Tutte polynomial is a bivariate polynomial that has been extensively studied in graph and matroid theory. Gordon was the first to study the Tutte polynomial $T(P;x,y)$ of the greedoid induced by a poset $P$, including the special case of series-parallel posets. In particular, Gordon and McMahon conjectured that, for any two series-parallel posets $P$ and $Q$, the equality $T(P;x,y)=T(Q;x,y)$ holds if and only if $P\cong Q$. In studying this conjecture, Gordon introduced a subclass $\mathcal{P}$ of series-parallel posets and proved that this equivalence holds for all $P,Q\in\mathcal{P}$. In this paper, we introduce a new subclass $\mathrm H$ of series-parallel posets and prove that $\mathcal P\subseteq\mathrm H$. Moreover, we show that, for every $P\in\mathrm H$ and every $Q\in\mathrm{SP}$, the equality $T(P;x,y)=T(Q;x,y)$ holds if and only if $P\cong Q$, thereby extending Gordon's result.

math.CO↗

Solution to an open problem on the computational complexity of immanant

Immanants are a class of generalized matrix functions associated with the irreducible characters of the symmetric group. Bürgisser [SIAM J. Comput., 30 (2000), pp. 1023--1040] proved that the computation of hook immanants and immanants corresponding to rectangular Young diagrams of polynomially growing width is VNP-complete under $p$-projections. And he posed an open problem: whether the family of immanants corresponding to rectangular Young diagrams of width $2$ is VNP-complete under $p$-projections. This paper gives a solution to this problem. We prove that, over any field of characteristic zero, the immanant families associated with rectangular Young diagrams of width $2$ and of length $2$ are both VNP-complete under $p$-projections.

math.CO↗

On the Greedoid Tutte Polynomial for simple rooted graphs

The Tutte polynomial, through its rank-generating formula, provides a unified framework for describing various combinatorial structures of graphs and matroids, and serves as an important polynomial invariant connecting graph theory, matroid theory, and their related applications. Let $G=(V(G),E(G),r(G))$ be a simple rooted graph, where $V(G)$ is the vertex set, $E(G)$ is the edge set, and $r(G)$ is the root. Let $Γ(G)$ be the greedoid induced by the rooted graph $G$, and let its greedoid Tutte polynomial be denoted by $T(Γ(G);x,y)$. Let $r=r(G)$, $L_r(G)=\{v\in V(G)\setminus\{r\}: rv\in E(G),\ d_G(v)=1\}$, and $\ell_r(G)=|L_r(G)|$. Gordon and McMahon proposed the following conjecture: for rooted graphs, $\operatorname{ord}_{x}T(Γ(G);x,y)=\ell_r(G)$, where $\operatorname{ord}_{x}T(Γ(G);x,y)=\max\{a\in\mathbb Z_{\geq0}:x^a\mid T(Γ(G);x,y)\}$, that is, the highest power of $x$ dividing $T(Γ(G);x,y)$ is equal to the number of leaf vertices adjacent to the root. In this paper, we proved that this conjecture holds for all simple rooted graphs.

math.CO↗

Spectral extremal hypergraphs without long Berge cycles

Let $r\ge 3$ and $k\ge 2r+1$ be fixed integers. We determine, for all sufficiently large $n$, the maximum adjacency-tensor spectral radius of an $n$-vertex $r$-uniform hypergraph containing no Berge cycle of length at least $k$. Write $s=\left\lfloor\frac{k-1}{2}\right\rfloor$. If $k=2s+1$ is odd, the unique extremal hypergraph consists of all $r$-sets containing at most one vertex outside a fixed $s$-set. If $k=2s+2$ is even, one additionally includes all $r$-sets containing a fixed pair outside the $s$-set together with $r-2$ vertices inside it. Consequently, the maximum spectral radius is given as \[ \operatorname{spex}_r(n,k) = \left[ \binom{s}{r-1} \left(\frac{r-1}{s}\right)^{(r-1)/r} +o(1) \right]n^{(r-1)/r}. \]

math.CO↗

An improved range for the maximum critically $t$-intersecting hypergraphs

Let $k>t\ge 1$ be integers and set $d=k-t$. A $k$-uniform hypergraph $\mathcal F$ is called $t$-intersecting if any two edges intersect in at least $t$ vertices, and is called $t$-critical if its minimum $t$-transversal has size $k$. Frankl proved that, for $k\ge d^4$,$|\mathcal F|\le \binom{k+d}{d},$ with equality only for the complete $k$-graph on $k+d$ vertices, and conjectured that the same conclusion should hold when $k>c d^2$ for some constant $c$. In this paper we confirm this conjecture for $c=30$. The proof relies on Frankl's fixed-edge decomposition and Füredi's pseudo-sunflower method.

math.CO↗

Non-uniform pairwise cross $t$-intersecting families

Let $ n\geq t\geq 1$ and $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ be non-empty families. We say that they are pairwise cross $t$-intersecting if $|A_i\cap A_j|\geq t$ holds for any $A_i\in \mathcal{A}_i$ and $A_j\in \mathcal{A}_j$ with $i\neq j$. In the case where $m=2$ and $\mathcal{A}_1=\mathcal{A}_2$, determining the maximum size $M(n,t)$ of a non-uniform $t$-intersecting family of sets over $[n]$ was solved by Katona (1964), and enhanced by Frankl (2017), and recently by Li and Wu (2024). In this paper, we establish the following upper bound: if $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ are non-empty pairwise cross $t$-intersecting families, then $$ \sum_{i=1}^m |\mathcal{A}_i| \leq \max \left\{ \sum_{k=t} ^{n}\binom{n}{k} + m - 1, \, m M(n, t) \right\}. $$ Furthermore, we provide a complete characterization of the extremal families that achieve the bound. Our result not only generalizes an old result of Katona (1964) for a single family, but also extends a theorem of Frankl and Wong (2021) for two families. Moreover, our result could be viewed as a non-uniform version of a recent theorem of Li and Zhang (2025). The key in our proof is to utilize the generating set method and the pushing-pulling method together.

math.CO↗

Thresholds for the Frankl-Wang $3/7$ conjecture on maximum-degree ratios

Let $\mathcal{F}\subset\binom{[n]}{k}$ be an intersecting family, $Δ(\mathcal{F})=\max_{x\in[n]}|\{F\in\mathcal{F}:x\in F\}|$, and $\varrho(\mathcal{F})=Δ(\mathcal{F})/|\mathcal{F}|$. Frankl and Wang conjectured that if $n>100k$ and $|\mathcal{F}|>\binom{n-3}{k-3}$, then $\varrho(\mathcal{F})\ge 3/7$; the constant $3/7$ is sharp because of the Fano-plane construction. In this note we obtain three results. First, we show that no linear threshold $n>Ck$ can be sufficient: using a truncated Fano-plane construction we exhibit, for every constant $C$ and all large $k$, an intersecting family with $n>Ck$, $|\mathcal{F}|>\binom{n-3}{k-3}$, yet $\varrho(\mathcal{F})<3/7$. In particular, the original condition $n>100k$ does not guarantee the conclusion. Second, for $k=3$ we prove that $\varrho(\mathcal{F})\ge 3/7$ holds for every nonempty intersecting $3$-uniform family; the proof is nontrivial and does not rely on any assumption on $n$ or $|\mathcal{F}|$. Third, using the classical pseudo-sunflower bound $|\mathcal{F}|\le t^k$ (for families containing no pseudo-sunflower of size $t+1$), we obtain a completely explicit polynomial threshold for all $k\ge4$: if $n>(k-3)(7k^4+k)+3$ and $|\mathcal{F}|>\binom{n-3}{k-3}$, then $\varrho(\mathcal{F})\ge 3/7$. In particular, the simplified bound $n>7k^5$ is sufficient for every $k\ge4$.

math.CO↗

Bollobás-type inequalities for subspaces via weight invariance

Let $V$ be an $n$-dimension real vector space with a direct sum decomposition $V = V_1 \oplus \cdots \oplus V_r$. Let $\mathcal{P} = \{(A_i, B_i) : i \in [m]\}$ be a skew Bollobás system of subspaces of $V$ such that each $i\in [m]$, $ A_i = \bigoplus_{k=1}^r (A_i \cap V_k)$ and $ B_i = \bigoplus_{k=1}^r (B_i \cap V_k)$. We prove that $$\sum_{i=1}^{m} \prod_{k=1}^{r} \left[ \binom{a_{i,k} + b_{i,k}}{a_{i,k}} (1 + a_{i,k} + b_{i,k})^{-1} \right] \leq 1,$$ where $a_{i,k} = \dim(A_i \cap V_k)$ and $b_{i,k} = \dim(B_i \cap V_k)$. This extends a recent result of Yue from set systems to finite dimensional subspaces. We then consider Tuza's theorem on weak Bollobás system for $d$-tuples. We give an alternative proof of the original set version of Tuza, and also establish its vector space analogue. Precisely, let $\mathcal{P} = \{(A_i^{(1)}, \ldots, A_i^{(d)}) : i \in [m]\}$ be a skew Bollobás system of $d$-tuples of subspaces of finite dimensional space $V$ with $a^{(\ell)}_i=\dim (A_i^{(\ell)})$. Then, for any positive real numbers $p_1, \ldots, p_d$ satisfying $p_1 + \cdots + p_d = 1$, we prove that $ \sum_{i=1}^{m} \prod_{\ell=1}^{d} p_{\ell}^{a_i^{(\ell)}} \leq 1. $

math.CO↗

On complexity of substructure connectivity and restricted connectivity of graphs

The connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose deletion disconnects $G$ and leaves each component of $G-S$ with more than $k$ vertices (resp. $δ(G-S)\geq h$). In contrast, structure (substructure) connectivity of $G$ is defined as the minimum number of vertex-disjoint subgraphs whose deletion disconnects $G$. As generalizations of the concept of connectivity, structure (substructure) connectivity, restricted connectivity and $R^h$-restricted connectivity have been extensively studied from the combinatorial point of view. Very little is known about the computational complexity of these variants, except for the recently established NP-completeness of $k$-restricted edge-connectivity. In this paper, we prove that the problems of determining structure, substructure, restricted, and $R^h$-restricted connectivity are all NP-complete.

cs.CC↗

The number of rooted spanning forests of bicirculant graphs

A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a closed formula for the number of rooted spanning forests of $Γ$. Moreover, we investigate some arithmetic properties of the number of rooted spanning forests of $Γ$, and find its asymptotic behaviour as $n$ tends infinity.

math.CO↗