Related papers: Saturation of Markov Polynomials
The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…
We give an explicit combinatorial formula for the Laurent expansion of any arc or closed curve on an unpunctured triangulated orbifold. We do this by extending the snake graph construction of Musiker, Schiffler, and Williams to unpunctured…
Markov polynomials are the Laurent-polynomial solutions of the generalised Markov equation $$X^2 + Y^2 + Z^2 = kXYZ, \quad k=\frac{x^2 + y^2 + z^2}{x y z}$$ which are the results of cluster mutations applied to the initial triple $(x, y,…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
We consider the classical problem of estimating norm of the derivative of algebraic polynomial via the norm of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by V. Markov. In this…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…
This survey discusses the classical Bernstein and Markov inequalities for the derivatives of polynomials, as well as some of their extensions to general sets.
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
We consider a natural $q$-deformation of the classical Markov numbers. This $q$-deformation is closely related to $q$-deformed rational numbers recently introduced by two of us. Both notions, those of $q$-rationals and $q$-Markov numbers,…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
We import ideas from geometry to settle Sarnak's saturation problem for a large class of algebraic varieties.
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…
Ge and Stefankovic have recently introduced a novel two-variable graph polynomial. When specialised to a bipartite graphs G and evaluated at the point (1/2,1) this polynomial gives the number of independent sets in the graph. Inspired by…
The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…
Under suitable assumptions of regularity and non-degeneracy on the covariance of the driving additive noise, any Markov solution to the stochastic Navier-Stokes equations has an associated generator of the diffusion and is the unique…
In this note we prove a spectral gap for various Markov chains on various functional spaces. While proving that a spectral gap exists is relatively common, explicit estimates seems somewhat rare.These estimates are then used to apply the…
We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.