Searcharxiv⌕ Search

arXiv subjects

Jianxuan Luo

Publications and source records attributed to Jianxuan Luo.

4 recordsLinked to original sources

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↗

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 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↗

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↗