Related papers: Higher order matching polynomials and d-orthogonal…

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…

This paper presents a first result of a long term research project dealing with the construction of d-orthogonal polynomials with Hahn's property. We shall show that the latter class could be characterized by expanding a polynomial as a…

A dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. %The domination number $G$, denoted $\gamma (G)$, is the cardinality of the smallest…

Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…

Orthogonality of the Jacobi and of Laguerre polynomials, P_n^(a,b) and L_n^(a), is established for a,b complex (a,b not negative integers and a+b different from -2,-3,...) using the Hadamard finite part of the integral which gives their…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

We show that every complete intersection of Laurent polynomials in an algebraic torus is isomorphic to a complete intersection of master functions in the complement of a hyperplane arrangement, and vice versa. We call this association Gale…

Let $G$ be a simple graph of order $n$ and size $m$. The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial…

Two families (type $A$ and type $B$) of confluent hypergeometric polynomials in several variables are studied. We describe the orthogonality properties, differential equations, and Pieri type recurrence formulas for these families. In the…

We investigate generalized Laurent multiple orthogonal polynomials on the unit circle satisfying simultaneous orthogonality conditions with respect to $r$ probability measures or linear functionals on the unit circle. We show that these…

In 1996, Edelman and Reiner defined the two higher Stasheff--Tamari orders on triangulations of cyclic polytopes and conjectured them to coincide. We open up an algebraic angle for approaching this conjecture by showing how these orders…

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…

The aim of this paper is to bring into the picture a new phenomenon in the theory of orthogonal matrix polynomials satisfying second order differential equations. The last few years have witnessed some examples of a (fixed) family of…

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…

We study Wronskians of Appell polynomials indexed by integer partitions. These families of polynomials appear in rational solutions of certain Painlev\'e equations and in the study of exceptional orthogonal polynomials. We determine their…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an…

We define the cyclic matching sequencibility of a graph to be the largest integer $d$ such that there exists a cyclic ordering of its edges so that every $d$ consecutive edges in the cyclic ordering form a matching. We show that the cyclic…

Classical moment functionals (Hermite, Laguerre, Jacobi, Bessel) can be characterized as those linear functionals whose moments satisfy a second order linear recurrence relation. In this work, we use this characterization to link the theory…