We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free graphic arrangements by chordal graphs. This generalization gives us a complete classification of the free multiplicities defined above. As an application, we prove one direction of a conjecture of Athanasiadis on the characterization of the freeness of the deformation of the braid arrangement in terms of directed graphs
This bachelor thesis is concerned with arrangements of hyperplanes, that is, finite collections of ...
Dans cette thèse nous étudions différents problèmes de graphes et multigraphes arêtes-coloriés tels ...
grantor: University of TorontoThe two main approaches to knot theory, via local moves (Re...
We define specific multiplicities on the braid arrangement by us-ing edge-bicolored graphs. To consi...
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consi...
AbstractWe classify the hyperplane arrangements between the cones of the braid arrangement and the S...
Any two reduced expressions for the same Coxeter group element are related by a sequence of commutat...
In this thesis, we study different problems in edge-colored graphs and edge-colored multigraphs, suc...
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. Th...
29 p. : il.The class of unichord-free graphs was recently investigated in the context of vertex-colo...
galacInternational audienceWe show new bijective proofs of previously known formulas for the number ...
Free braided pivotal categories are equivalent to free strict monoidal categories on a graph with re...
• General principle (Brieskorn, Alexander): Colour the arcs of a braid or a link diagram extract in...
Graphs model the connectivity of networks, and many researchers study how to colour the nodes of a g...
AbstractGraph groups admit a (finite) presentation in which each relation is of the form xy = yx for...
This bachelor thesis is concerned with arrangements of hyperplanes, that is, finite collections of ...
Dans cette thèse nous étudions différents problèmes de graphes et multigraphes arêtes-coloriés tels ...
grantor: University of TorontoThe two main approaches to knot theory, via local moves (Re...
We define specific multiplicities on the braid arrangement by us-ing edge-bicolored graphs. To consi...
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consi...
AbstractWe classify the hyperplane arrangements between the cones of the braid arrangement and the S...
Any two reduced expressions for the same Coxeter group element are related by a sequence of commutat...
In this thesis, we study different problems in edge-colored graphs and edge-colored multigraphs, suc...
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. Th...
29 p. : il.The class of unichord-free graphs was recently investigated in the context of vertex-colo...
galacInternational audienceWe show new bijective proofs of previously known formulas for the number ...
Free braided pivotal categories are equivalent to free strict monoidal categories on a graph with re...
• General principle (Brieskorn, Alexander): Colour the arcs of a braid or a link diagram extract in...
Graphs model the connectivity of networks, and many researchers study how to colour the nodes of a g...
AbstractGraph groups admit a (finite) presentation in which each relation is of the form xy = yx for...
This bachelor thesis is concerned with arrangements of hyperplanes, that is, finite collections of ...
Dans cette thèse nous étudions différents problèmes de graphes et multigraphes arêtes-coloriés tels ...
grantor: University of TorontoThe two main approaches to knot theory, via local moves (Re...