Related papers: Higher order matching polynomials and d-orthogonal…
The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…
In this paper, we compare the $\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the…
Horizontal and vertical generating functions and recursion relations have been investigated by Comtet for triangular double sequences. In this paper we investigate the horizontal and vertical log-concavity of triangular sequences assigned…
Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
Let $X=\{X_t, t\ge0\}$ be a c\`{a}dl\`{a}g L\'{e}vy process, centered, with moments of all orders. There are two families of orthogonal polynomials associated with $X$. On one hand, the Kailath--Segall formula gives the relationship between…
Four families of generalizations of trigonometric functions were recently introduced. In the paper the functions are transformed into four families of orthogonal polynomials depending on two variables. Recurrence relations for construction…
A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in…
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=1}^n d(G,i) x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. The $n$-barbell graph $Bar_n$ with $2n$…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…
In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal…
The purpose of this paper is to obtain Fourier transforms of multivariate orthogonal structures on the paraboloid such as Laguerre polynomials on the paraboloid and Jacobi polynomials on the paraboloid, and to define two new families of…
In this work, we develop a constructive method for deriving four structure relations and a fourth-order linear differential equation satisfied by Laguerre-Hahn orthogonal polynomial sequences. The method relies on a combination of structure…
We review properties of the $q-$Hermite polynomials and indicate their links with the Chebyshev, Rogers--Szeg\"{o}, Al-Salam--Chihara, continuous $q-$% utraspherical polynomials. In particular we recall the connection coefficients between…
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…
In this paper we consider a large class of many-variable polynomials which contains generalisations of the classical Hermite, Laguerre, Jacobi and Bessel polynomials as special cases, and which occur as the polynomial part in the…
The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect…