Tingzeng Wu

activity

20242026

collaborators

11 papers

math.CO2026

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

Jianxuan Luo, Tingzeng Wu, Hong-Jian Lai

Let $M$ be a simple matroid of rank $r$ on the ground set $[n] = {1, \dots, n}$ , let $T_{M} (x, y)$ denote its Tutte polynomial, and let $OS (M)$ …

math.CO2026

A sharp upper bound on the number of spanning forests of regular graphs

T. Wu, S. Lu, X. Dong

Let $G$ be a simple graph on $n$ vertices, and let $F (G)$ denote the number of its spanning forests. Bencs and Csikvári [Upper bound for the number of spanning forests of regular g…

math.CO2026

On the Greedoid Tutte Polynomial for simple rooted graphs

Jianxuan Luo, Tingzeng Wu, Hong-Jian Lai

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 imp…

math.CO2026

Immanantal polynomials of the linear combination matrices of graphs

Xiangshuai Dong, Tingzeng Wu

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 m…

math.CO2025

Hook immanantal equalities for linear combination matrices of (di)graphs and their applications

Xiangshuai Dong, Tingzeng Wu, HongJian Lai

Let $χ_{λ}$ be an irreducible character of the symmetric group $S_{n}$ . For an $n \times n$ matrix $M = (m_{ij})$ , define the immanant of $M$ corresponding to $χ_{λ}$ by \begin{eqnarray*…

math.CO2025

Non-uniform pairwise cross $t$ -intersecting families

Yongjiang Wu, Yongtao Li, Tingzeng Wu +1

Let $n \geq t \geq 1$ and $A_{1}, A_{2}, \dots, A_{m} \subseteq 2^{[n]}$ be non-empty families. We say that they are pairwise cross $t$ -intersecting if $|A…

math.CO2025

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Tingzeng Wu

Let $M = (m_{ij})$ be an $n \times n$ matrix. The second immanant of matrix $M$ is defined by \begin{eqnarray*} d_{2}(M)=\sum_{σ\in S_{n}}χ_{2}(σ)\prod_{s=1}^{n}m_{sσ(s)}, \end{eqnarr…

math.CO2025

Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices

Tingzeng Wu, Xiangshuai Dong, Huazhong Lü

Let $U (n, τ)$ be the set of all {\rm(0,1)}-matrices of order $n$ with exactly $τ$ 0's. Brualdi et al. investigated the maximum permanents of all matrices in $\mathscr{U}(n…

math.CO2025

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Tingzeng Wu, Yafan Geng, Hong-Jian Lai

Let $M = (m_{ij})$ be an $n \times n$ matrix. The second immanant of matrix $M$ is defined by \begin{eqnarray*} d_{2}(M)=\sum_{σ\in S_{n}}χ_{2}(σ)\prod_{s=1}^{n}m_{sσ(s)}, \end{eqnarr…

math.CO2025

Improved bounds for the coefficient of flow polynomials

Tingzeng Wu, Shuang Ma, Hong-Jian Lai

Let $G$ be a connected bridgeless $(n, m)$ -graph which may have loops and multiedges, and let $F (G, t)$ denote the flow polynomial of $G$ . Dong and Koh \cite{Dong1} established an up…

math.CO2024

Solution to an open problem on Laplacian ratio

T. Wu

Let G be a graph. The Laplacian ratio of G is the permanent of the Laplacian matrix of G divided by the product of degrees of all vertices. The computational complexity of Laplacia…

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

A sharp upper bound on the number of spanning forests of regular graphs

On the Greedoid Tutte Polynomial for simple rooted graphs

Immanantal polynomials of the linear combination matrices of graphs

Hook immanantal equalities for linear combination matrices of (di)graphs and their applications

Non-uniform pairwise cross t-intersecting families

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Brualdi-Goldwasser-Michael problem for maximum permanents of {\rm(0,1)}-matrices

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Improved bounds for the coefficient of flow polynomials

Solution to an open problem on Laplacian ratio

Non-uniform pairwise cross $t$ -intersecting families