AbstractWe show that the matrix of chromatic joins, that is associated with the revised Birkhoff–Lewis equations, can be expressed completely in terms of functions defined on a generalization of the Temperley–Lieb algebra. We give a self-contained account of the aspects of the Temperley–Lieb algebra that are essential to this context since these are not easily obtainable in this form. Of interest in the theory of these equations are recursions for the inverse of the matrix of chromatic joins. We show that the approach given here is a natural one which provides clear insight into the investigation of the properties of the inverse, and we give an instance of a recursion. It is hoped that these techniques will be of further value in the study ...
International audienceLet G be a graph, and let χG be its chromatic polynomial. For any non-negative...
AbstractWe continue our study of the structure initiated in [T. Arponen, A matrix approach to polyno...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractMatrices M(n), one for each positive integer n, arise in the theory of Birkhoff-Lewis equati...
AbstractA matrix associated with the chromatic join of non-crossing partitions has been introduced b...
International audienceWe prove that the Framisation of the Temperley–Lieb algebra is isomorphic to a...
AbstractWe show that two determinants arising in different mathematical contexts, both exhibiting st...
AbstractThe chromatic polynomials of certain families of graphs can be expressed in terms of the eig...
International audienceIn this paper, we describe the irreducible representations and give a dimensio...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
This paper gives an introduction to Temperley-Lieb algebra that is easily accessible to undergraduat...
AbstractWe outline problems that Rodica Simion was investigating that concern factorizations of dete...
This paper introduces a conceptual framework, in the context of quantum topology and the algebras un...
AbstractP. Melvin and H. Morton [9] studied the expansion of the colored Jones polynomial of a knot ...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
International audienceLet G be a graph, and let χG be its chromatic polynomial. For any non-negative...
AbstractWe continue our study of the structure initiated in [T. Arponen, A matrix approach to polyno...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractMatrices M(n), one for each positive integer n, arise in the theory of Birkhoff-Lewis equati...
AbstractA matrix associated with the chromatic join of non-crossing partitions has been introduced b...
International audienceWe prove that the Framisation of the Temperley–Lieb algebra is isomorphic to a...
AbstractWe show that two determinants arising in different mathematical contexts, both exhibiting st...
AbstractThe chromatic polynomials of certain families of graphs can be expressed in terms of the eig...
International audienceIn this paper, we describe the irreducible representations and give a dimensio...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
This paper gives an introduction to Temperley-Lieb algebra that is easily accessible to undergraduat...
AbstractWe outline problems that Rodica Simion was investigating that concern factorizations of dete...
This paper introduces a conceptual framework, in the context of quantum topology and the algebras un...
AbstractP. Melvin and H. Morton [9] studied the expansion of the colored Jones polynomial of a knot ...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
International audienceLet G be a graph, and let χG be its chromatic polynomial. For any non-negative...
AbstractWe continue our study of the structure initiated in [T. Arponen, A matrix approach to polyno...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...