Related papers: New recursion formula for the interior polynomial …
We construct biorthogonal polynomials for a measure over the complex plane which consists in the exponential of a potential V(z,z*) and in a set of external sources at the numerator and at the denominator. We use the pseudonorm of these…
In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…
In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…
In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.
In this paper, we propose a general method to express explicitly the inversion and the connection coefficients between two basic hypergeometric polynomial sets. As application, we consider some $d$-orthogonal basic hypergeometric…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…
We first present some identities involving the Pochhammer symbol (rising factorial). We also recall and present some new properties of the Jacobi polynomials. We use them to expand a general hypergeometric function in an orthogonal series…
In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded,…
We use a polynomial decomposition result by Stapledon to show that the numerator polynomial of the Ehrhart series of an open polytope is the difference of two symmetric polynomials with nonnegative integer coefficients. We obtain a related…
We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…