Related papers: Twist polynomial as a weight system for set system…
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…
The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…
We show that the shatter function of a semilinear set system on $\mathbb{R}^m$ is asymptotic to a polynomial. This confirms, for the structure $(\mathbb{R}; +, <)$, a conjecture of Chernikov and is a step towards characterizing…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal problem which asks for an output-polynomial algorithm for listing…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a natural framework in which…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
In this article, we are interested in the enumeration of Fully Packed Loops configurations on a grid with a given noncrossing matching. These quantities also appear as the groundstate components of the Completely Packed Loops model as…
The $\mathfrak{sl}_2$ weight system, corresponding to the colored Jones polynomial of knots, is one of the the simplest weight system for chord diagrams. Recent works have led to explicit computations of this weight system on chord diagrams…
We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…
In this paper, the problem of partial stabilization of nonlinear systems along a given trajectory is considered. This problem is treated within the framework of stability of a family of sets. Sufficient conditions for the asymptotic…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
Sylvester showed that the partition function can be written as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. Recently an explicit expression of the Sylvester wave as a finite sum over the Bernoulli…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
In this manuscript, we analyze the expansions of functions in orthogonal polynomials associated with a general weight function in a multidimensional setting. Such orthogonal polynomials can be obtained by Gram-Schmidt orthogonalization.…
Jerrum, Sinclair and Vigoda (2004) showed that the permanent of any square matrix can be estimated in polynomial time. This computation can be viewed as approximating the partition function of edge-weighted matchings in a bipartite graph.…
Conjectured links between the distribution of values taken by the characteristic polynomials of random orthogonal matrices and that for certain families of L-functions at the centre of the critical strip are used to motivate a series of…