Related papers: Rational polynomials of simple type: a combinatori…
Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has recently introduced a polynomial sequence Q_n:=Q_n(x,y,z,t) defined by Q_1=1, Q_{n+1}=[x+nz+(y+t)(n+y\partial_y)]Q_n. In this paper we prove Chapoton's conjecture on the…
In this paper, we expand on the work of Guo and Zeng from 2007 on a generalization of the Ramanujan polynomials and planar trees. We manage to find combinatorial interpretations of this family of polynomials in terms of Greg trees, Cayley…
Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a unified concise proof of variants of this theorem, some known and some new.
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We introduce tropical Newton-Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton-Puiseux polynomial. A polynomial complexity algorithm for resolubility of a…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We give a Newton type rational interpolation formula (Theorem \ref{theo}). It contains as a special case the original Newton interpolation, as well as the recent interpolation formula of Zhi-Guo Liu, which allows to recover many important…
This work establishes simple criteria for detecting higher rational singularities via the intersection Du Bois complex and the irrationality complex of a normal variety over the complex numbers.
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…
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.
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
For a polymatroid $P$ over $[n]$, Bernardi, K\'{a}lm\'{a}n and Postnikov [\emph{Adv. Math.} 402 (2022) 108355] introduced the polymatroid Tutte polynomial $\mathscr{T}_{P}$ relying on the order $1<2<\cdots<n$ of $[n]$, which generalizes the…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We give an elementary geometric re-proof of a formula discovered by Michel Brion as well as two variants thereof. A subset of R^n gives rise to a formal Laurent series with monomials corresponding to lattice points in the set. Under…