Searcharxiv⌕ Search

arXiv subjects

Houshan Fu

Publications and source records attributed to Houshan Fu.

At least 19 recordsLinked to original sources

Real-rootedness and ultra log-concavity of rank-two matroid Ehrhart $h^*$-polynomials

We prove that the Ehrhart $h^*$-polynomial of a rank-two matroid with exactly three parallel classes is real-rooted whenever its smallest parallel class has size at most three. This bound is sharp: the loopless rank-two matroids with parallel-class sizes $(4,561,600)$ and $(4,a,a+29)$, for all sufficiently large integers $a$, have $h^*$-polynomials that are not real-rooted. By matroid duality, these examples disprove Ferroni's real-rootedness conjecture even for cycle matroids of theta graphs. Nevertheless, every matroid of rank two or corank two has a positive $h^*$-coefficient sequence that is ultra log-concave of order equal to the polynomial's degree. In particular, the unimodality conjecture holds in both cases.

math.CO↗

A rank bound for bases and circuits in binary matroids

Let \(b(M)\), \(d(M)\), and \(r(M)\) denote the number of bases, the number of circuits, and the rank of a matroid \(M\), respectively. Using a weighted count of fundamental circuits, we prove that every nonempty simple binary matroid \(M\) with no coloops satisfies \[ 2b(M)\ge(r(M)+1)d(M), \] with equality if and only if \(M\) is isomorphic to the Fano matroid. This settles a conjecture recorded by Oxley in 1983. For every \(e\in E(M)\), we also establish the deletion bound \(b(M\backslash e)\ge d(M)\) and characterize its equality cases. The deletion bound yields a sharp linear lower bound for basis growth under successive series extensions. Finally, under a circuit-size exclusion condition, every pair \((C,e)\) with \(C\) a circuit of a prescribed size and \(e\in C\) can be assigned a distinct basis containing \(C-e\).

math.CO↗

Real-rooted Ehrhart $h^*$-polynomials of crown posets and wheel and whirl matroids

We prove that the Ehrhart $h^*$-polynomials of crown order polytopes are real-rooted, settling a conjecture of Lundström and Saud Maia Leite. For each integer $r\ge3$, the crown order polytope on $2r$ elements and the rank-$r$ whirl base polytope have the same $h^*$-polynomial. The $h^*$-polynomials of the rank-$r$ wheel and whirl base polytopes, as well as every convex combination of the two, have $2r-2$ distinct negative roots. Their coefficient sequences are positive, unimodal, and strictly ultra log-concave of order $2r-2$.

math.CO↗

Negative edge correlation in complete bipartite graphs

We prove strict pairwise negative correlation under both the uniform forest measure and the uniform connected-subgraph measure on the complete bipartite graph $K_{m,n}$ for all $m,n\geq2$. Under the connected-subgraph measure, any two distinct edges of a fixed copy of $K_{2,2}$ remain strictly negatively correlated after conditioning on the subgraph induced by the remaining vertices.

math.CO↗

A counterexample to the circuit-cocircuit intersection conjecture

Oxley conjectured that a matroid with a circuit-cocircuit intersection of size $k\geq 4$ has one of size $k-2$. Using the standard polynomial representation of the classical extended binary Golay code, we construct an identically self-dual binary matroid of rank $12$ on $24$ elements. Its circuit-cocircuit intersection sizes are exactly $0,2,4,6,8$, and $12$, disproving the conjecture for $k=12$. The proof is self-contained and does not rely on the full weight distribution of the code or on an enumeration of all circuits.

math.CO↗

Represented Tensor Products of Binary Matroids

For binary matroids \(M,N\) representable over a common field \(\F\), the Kronecker product of their \(\F\)-representations defines a matroid \(T_{\F}(M,N)\) independent of the chosen representations. We classify when this represented tensor product is regular, cographic, graphic, or binary. For simple nonfree factors, regularity holds exactly when, up to interchange, one factor is a cactus matroid and the other is outerplanar, or one is a triangular cactus matroid and the other is series--parallel. Cographicity holds exactly in the first case. For simple factors with nonempty ground sets, graphicity holds exactly when one factor is free and the other is graphic. For fixed factors, regularity, cographicity, and graphicity are independent of the common representation field, although the isomorphism type may vary with its characteristic. Products of at least three simple nonfree factors are nonregular.

math.CO↗

Monotone Hadwiger Theorems on Spherical and Hyperbolic Convex Sets

For every $n\geq1$, we classify monotone rotation-invariant real-valued valuations on closed spherical convex sets, without assuming continuity or measurability. On proper sets, namely those contained in an open hemisphere, these are precisely the nonnegative linear combinations of the normalized spherical quermassintegrals. On all closed spherical convex sets, they are precisely the linear combinations of the spherical intrinsic volumes with nonnegative, nondecreasing coefficients. The representations are unique, and all such valuations are continuous and invariant under the full orthogonal group. In hyperbolic space, an isometry-invariant real-valued valuation on compact convex sets is continuous if and only if it is a linear combination of the Euler characteristic and the hyperbolic quermassintegrals. This representation is unique. Monotonicity is equivalent to nonnegative coefficients and implies continuity. If monotonicity is required only between nonempty sets, the Euler coefficient is unrestricted in the proper spherical and hyperbolic cases, whereas the classification on all closed spherical convex sets is unchanged. We also obtain corresponding classifications for valuations on closed convex cones that vanish at the zero cone and monotone classifications on compact projectively convex sets contained in an affine chart of real elliptic space.

math.CO↗

Log-Concavity of Conic Intrinsic Volumes

Let $n\ge1$ and $C\subseteq\mathbb{R}^n$ be a closed convex cone with conic intrinsic volumes $v_0(C),\ldots,v_n(C)$. We prove the long-standing log-concavity conjecture for this sequence, in the stronger form \[ v_k(C)^2\ge ρ_kρ_{n-k}v_{k-1}(C)v_{k+1}(C), \qquad 1\le k\le n-1, \] where, for $l\ge1$, $ρ_l=\frac{l+1}{l}\frac{ω_{l-1}ω_{l+1}}{ω_l^2}>1$ and $ω_j$ is the volume of the Euclidean unit ball in $\mathbb{R}^j$. The proof applies the Alexandrov--Fenchel inequality to the Takemura--Kuriki identity \[ V(A[k],D[n-k])=\frac{ω_kω_{n-k}}{\binom nk}v_k(C),\qquad A=C\cap B^n,\quad D=C^\circ\cap B^n, \] where $C^\circ$ is the polar cone, $B^n$ is the Euclidean unit ball, and repeated arguments are indicated by brackets. A Master Steiner argument gives the identity directly for arbitrary closed convex cones, including degenerate ones. We also give a circular-cone counterexample to the standard ultra-log-concavity normalizations.

math.CO↗

Linear relations for Tutte polynomials of semimatroids

We establish a family of linear relations for the coefficients of the Tutte polynomial of a semimatroid. We also introduce ranked central sets, a mild generalization of semimatroids, and prove that the same identities hold in this broader setting. The proof relies on the specialization $x=\frac{z}{z-1}$, $y=z$ along the hyperbola $(x-1)(y-1)=1$; under this specialization, the edge subgraph expansion over central sets reduces to the $f$-polynomial of the central set complex. As applications, we obtain explicit formulas for Tutte polynomials of affine hyperplane arrangements and for balanced Tutte polynomials of biased graphs, whose central sets are central subarrangements and balanced edge sets, respectively. Our results recover the generalized Brylawski's identities for Tutte polynomials of ranked sets, matroids and graphs.

math.CO↗

Partition-selected flow polynomials and associated arrangements

We introduce a partition-selection method to generalize the flow, chromatic, and Tutte polynomials of a graph by restricting the standard edge subgraph expansions to subgraphs given by prescribed connected vertex partitions. We establish similar deletion-contraction formulas and specialization relations for these polynomials, recovering all classical polynomial invariants when the selection is the set of all partitions. Next we study a relation between Jaeger et al.'s nonhomogeneous flows and a special class of partition-selected flow polynomials (called affine flow polynomials). Specifically, we give a geometric realization of nowhere-zero nonhomogeneous flows by restricting the edge-coordinate arrangement to affine flow spaces. The resulting characteristic polynomials coincide with Kochol's admissible assigning polynomials and with affine flow polynomials, which enumerate nowhere-zero nonhomogeneous flows over finite fields. To see the key role of the partition-selection framework, we further introduce boundary arrangements determined by the bond structure of a graph. Using the intersection posets of boundary arrangements, we obtain the classification of all restricted arrangements mentioned above, the comparison of unsigned coefficients of affine flow polynomials, and the decomposition formulas for affine flow polynomials.

math.CO↗

Convolution-type Identity for Characteristic Polynomials of Geometric Semilattices

We establish a convolution formula for the characteristic polynomial of a finite geometric semilattice $M$: \[ χ(M,st)=\sum_{X\in \underline{M}} s^{r-{\rm rk}_{\underline{M}}(X)}χ(\underline{M}^X,t)\,χ(M_{(X)},s), \] where $\underline{M}$ denotes the centralization of $M$, and $M_{(X)}$ denotes the localization at $X$. This generalizes a nice formula of Southerland, Southern, and Zhou, which is recovered at $s=1$. When specialized to hyperplane arrangements, the identity yields a new expansion closely related to Wang's convolution formula. We further provide a combinatorial interpretation of the convolution formula using the finite field method over $\mathbb{F}_{p^2}$ and $\mathbb{F}_p$.

math.CO↗

Polynomials Counting Group Colorings in Graphs

Jaeger et al. in 1992 introduced group coloring as the dual concept to group connectivity in graphs. Let $A$ be an additive Abelian group, $ f: E(G)\to A$ and $D$ an orientation of a graph $G$. A vertex coloring $c:V(G)\to A$ is an $(A, f)$-coloring if $c(v)-c(u)\ne f(e)$ for each oriented edge $e=uv$ from $u$ to $v$ under $D$. Kochol recently introduced the assigning polynomial to count nowhere-zero chains in graphs--nonhomogeneous analogues of nowhere-zero flows in \cite{Kochol2022}, and later extended the approach to regular matroids in \cite{Kochol2024}. Motivated by Kochol's work, we define the $α$-compatible graph and the cycle-assigning polynomial $P(G, α; k)$ at $k$ in terms of $α$-compatible spanning subgraphs, where $α$ is an assigning of $G$ from its cycles to $\{0,1\}$. We prove that $P(G,α;k)$ evaluates the number of $(A,f)$-colorings of $G$ for any Abelian group $A$ of order $k$ and $f:E(G)\to A$ such that the assigning $α_{D,f}$ given by $f$ equals $α$. Such an assigning is admissible. Based on Kochol's work, we derive that $k^{-c(G)}P(G,α;k)$ is a polynomial enumerating $(A,f)$-tensions and counting specific nowhere-zero chains. Furthermore, by extending Whitney's broken cycle concept to broken compatible cycles, we show that the absolute value of the coefficient of $k^{|V(G)|-i}$ in $P(G,α;k)$ associated with admissible assignings $α$ equals the number of $α$-compatible spanning subgraphs that have $i$ edges and contain no broken $α$-compatible cycles. According to the combinatorial explanation, we establish a unified order-preserving relation from admissible assignings to cycle-assigning polynomials, and further show that for any admissible assigning $α$ of $G$ with $α(e)=1$ for every loop $e$, the coefficients of $P(G,α;k)$ are nonzero and alternate in sign.

math.CO↗

Level of Faces for Exponential Sequence of Arrangements

In this paper, we introduce the bivariate exponential generating function $F_l(x,y)$ for the number of level-$l$ faces of an exponential sequence of arrangements (ESA), and establish the formula $F_l(x,y)=\big(F_1(x,y)\big)^l$ with a combinatorial interpretation. Its specialization at $x=0$ recovers a result first obtained by Chen et al. [3,4] for certain classic ESAs and later generalized to all ESAs by Southerland et al. [8]. As a byproduct, we obtain that an alternating sum of the number of level-$l$ faces is invariant with respect to the choice of ESA, and is exactly the Stirling number of the second kind. We also extend the binomial-basis expansion theorem [3,4,14] and Stanley's formula on ESAs [9] from characteristic polynomials to Whitney polynomials.

math.CO↗

Characteristic quasi-polynomials of truncated arrangements

Given an (affine) integral arrangement $\mathcal{A}$ in $\mathbb{R}^n$, the reduction of $\mathcal{A}$ modulo an arbitrary positive integer $q$ naturally yields an arrangement $\mathcal{A}_q$ in $\mathbb{Z}_q^n$. Our primary objective is to study the combinatorial aspects of the restriction $\mathcal{A}^{(B,\bm b)}$ to the solution space of $B\bm x=\bm b$, and its reduction $\mathcal{A}_q^{(B,\bm b)}$ modulo $q$. This work generalizes the earlier results of Kamiya, Takemura and Terao, as well as Chen and Wang. The purpose of this paper is threefold as follows. Firstly, we derive an explicit counting formula for the cardinality of the complement $M\big(\mathcal{A}_q^{(B,\bm b)}\big)$ of $\mathcal{A}_q^{(B,\bm b)}$; and prove that for all positive integers $q>q_0$, this cardinality coincides with a quasi-polynomial $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},q\big)$ in $q$ with a period $ρ_C$. Secondly, we weaken Chen and Wang's original hypothesis $a \mid b$ to a strictly more general condition $\gcd(a,ρ_C)\mid \gcd(b,ρ_C)$, and introduce the concept of combinatorial equivalence for positive integers. Within this framework, we establish three unified comparison relations: between the unsigned coefficients of $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},a\big)$ and $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},b\big)$; between the unsigned coefficients of distinct constituents of $χ^{\text{quasi}}\big(\mathcal{A}^{(B,\bm b)},q\big)$; and between the cardinalities of $M\big(\mathcal{A}_q^{(B,\bm b)}\big)$ and $M\big(\mathcal{A}_{pq}^{(B,\bm b)}\big)$. Thirdly, using our method, we revisit the enumerative aspects of group colorings and nowhere-zero nonhomogeneous form flows from the early work of Forge, Zaslavsky and Kochol.

math.CO↗

Multivariate Tutte polynomials of semimatroids

We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial invariants of graphs and matroids. We primarily establish their deletion-contraction recurrences, basis activities expansions, and various convolution identities. These findings naturally extend Kook-Reiner-Stanton's convolution formula and Kung's convolution-multiplication identities for the Tutte polynomials of graphs and matroids to semimatroids.

math.CO↗

A decomposition of Grassmannian associated with a hyperplane arrangement

The Grassmannian, which is the manifold of all $k$-dimensional subspaces in the Euclidean space $\mathbb{R}^n$, was decomposed through three equivalent methods connecting combinatorial geometries, Schubert cells and convex polyhedra by Gelfand, Goresky, MacPherson and Serganova. Recently, Liang, Wang and Zhao discovered a novel decomposition of the Grassmannian via an essential hyperplane arrangement, which generalizes the first two methods. However, their work was confined to essential hyperplane arrangements. Motivated by their research, we extend their results to a general hyperplane arrangement $\mathcal{A}$, and demonstrate that the $\mathcal{A}$-matroid, the $\mathcal{A}$-adjoint and the refined $\mathcal{A}$-Schubert decompositions of the Grassmannian are consistent. As a byproduct, we provide a classification for $k$-restrictions of $\mathcal{A}$ related to all $k$-subspaces through two equivalent methods: the $\mathcal{A}$-matroid decomposition and the $\mathcal{A}$-adjoint decomposition.

math.CO↗

Characteristic polynomials of semimatroids and their connections to matroids, hyperplane arrangements and graph colorings

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the unsigned coefficients of the characteristic polynomial form a unimodal and log-concave sequence, extending the Rota-Heron-Welsh Conjecture to semimatroids. Furthermore, we present convolution identities for the multiplicative characteristic and Tutte polynomials of semimatroids using the Möbius conjugation. Finally, motivated by Kochol's work, we introduce assigning matroids to establish connections among semimatroids, hyperplane arrangements, and graph colorings, with a particular focus on their characteristic polynomials.

math.CO↗

Level of Regions for Deformed Braid Arrangements

This paper primarily investigates a specific type of deformation of the braid arrangement $\mathcal{B}_n$ in $\mathbb{R}^n$, denoted by $\mathcal{B}_n^A$ and defined in (1.2). Let $r_l(\mathcal{B}_n^A)$ be the number of regions of level $l$ in $\mathcal{B}_n^A$ with the corresponding exponential generating function $R_l(A;x)$. Using the weighted digraph model introduced by Hetyei [11], we establish a bijection between regions of level $l$ in $\mathcal{B}_n^A$ and valid $m$-acyclic weighted digraphs on the vertex set $[n]$ with exactly $l$ strong components. Based on this bijection, we obtain a property analogous to a polynomial sequence of binomial type, that is, $R_l(A;x)$ satisfies the relation \[ R_l(A;x)=\big(R_1(A;x)\big)^l=R_k(A;x)R_{l-k}(A;x). \] Furthermore, the values $r_l(\mathcal{B}_n^A)$ yield a combinatorial interpretation for the coefficients in the expansion of the characteristic polynomial $χ_{\mathcal{B}_n^A}(t)$ in the basis elements $\binom{t}{l}$, that is, \[χ_{\mathcal{B}_n^A}(t)=\sum_{l=0}^n(-1)^{n-l}r_l(\mathcal{B}_n^A)\binom{t}{l}.\] If $n$, $a$ and $b$ are non-negative integers with $n\ge 2$ and $b-a\ge n-1$, for the deformation $\mathcal{B}_n^{[-a,b]}$ defined in (1.3), its characteristic polynomial has a single real root $0$ of multiplicity one when $n$ is odd, and has one more real root $\frac{n(a+b+1)}{2}$ of multiplicity one when $n$ is even.

math.CO↗