Related papers: A refined Gallai-Edmonds structure theorem for wei…
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…
We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.
In this note we present an infinite family of 2-connected graphs such that their matching polynomials have only integer zeros. This answers in negative a question of Akbari et al. [Graphs with integer matching polynomial zeros, Discrete…
This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.
In this paper, we introduce polynomials (in $t$) of signed relative derangements that track the number of signed elements. The polynomials are clearly seen to be in a sense symmetric. Note that relative derangements are those without any…
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…
Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…
This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…
The study of spanning trees and related structures is central in graph theory, closely connected to understanding functions between finite sets. This paper generalizes the established relationship between rooted trees and eventually…
Recently, Nunge studied Eulerian polynomials on segmented permutations, namely \emph{generalized Eulerian polynomials}, and further asked whether their coefficients form unimodal sequences. In this paper, we prove the stability of the…
We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…
Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…
I give a short and completely elementary proof of Takagi's 1921 theorem on the zeros of a composite polynomial $f(d/dz) \, g(z)$.
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n,k,m}$ is the number of Dyck paths of semilength $n$ with $k$…
We describe the Fundamental Theorem on Symmetric Polynomials (FTSP), exposit a classical proof, and offer a novel proof that arose out of an informal course on group theory. The paper develops this proof in tandem with the pedagogical…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…