All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 17 Next

Displaying 321 – 340 of 4974

Showing per page

A weighted graph polynomial from chromatic invariants of knots

Steven D. Noble, Dominic J. A. Welsh (1999)

Annales de l'institut Fourier

Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial on weighted graphs which contains as specialisations the weighted chromatic invariants but also contains many other classical invariants including the Tutte and matching polynomials. It also gives the symmetric function generalisation of the chromatic polynomial introduced by Stanley. We study its complexity and prove hardness results for very restricted classes of graphs.

About presentations of braid groups and their generalizations

V. V. Vershinin (2014)

Banach Center Publications

In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard Artin presentation for generalizations of braids. Namely, we consider presentations with small number of generators, Sergiescu graph-presentations and Birman-Ko-Lee presentation. The work of V.~V.~Chaynikov on the word and conjugacy problems for the singular...

Currently displaying 321 – 340 of 4974