Related papers: Non-intersecting path explanation for block Pfaffi…
We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…
In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
Extension of Feynman's path integral to quantum mechanics of noncommuting spatial coordinates is considered. The corresponding formalism for noncommutative classical dynamics related to quadratic Lagrangians (Hamiltonians) is formulated.…
A topological quantum field theory of non-abelian differential forms is investigated from the point of view of its possible applications to description of polynomial invariants of higher-dimensional two-component links. A path-integral…
In this work we present an explicit representation of the orthonormal Bernstein polynomials and demonstrate that they can be generated from a linear combination of non-orthonormal Bernstein polynomials. In addition, we report a set of $n$…
Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
I analyze an unexpected connection between multiple orthogonal polynomials, $d$-orthogonal polynomials, production matrices and branched continued fractions. This work can be viewed as a partial extension of Viennot's combinatorial theory…
In a recent preprint, Lai showed that the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents", which differ only in width, factors nicely, and the same is true for the quotient of…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…
We apply methods of derived and non-commutative algebraic geometry to understand intersection theoretic phenomena on arithmetic schemes. Specifically, we categorify Bloch's intersection number (in the formulation provided by Kato--Saito).…