Algèbre combinatoire et effective: des graphes aux algèbres de Kac, via l'exploration informatique

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

M\'emoire de Dipl\^ome d'habilitation \`a diriger des recherche de l'Universit\'e Paris Sud, soutenu le 10 D\'ecembre 2008. 80

Scientific paper

This manuscript synthesizes almost fifteen years of research in algebraic combinatorics, in order to highlight, theme by theme, its perspectives. In part one, building on my thesis work, I use tools from commutative algebra, and in particular from invariant theory, to study isomorphism problems in combinatorics. I first consider algebras of graph invariants in relation with Ulam's reconstruction conjecture, and then, more generally, the age algebras of relational structures. This raises in return structural and algorithmic problems in the invariant theory of permutation groups. In part two, the leitmotiv is the quest for simple yet rich combinatorial models to describe algebraic structures and their representations. This includes the Hecke group algebras of Coxeter groups which I introduced and which relate to the affine Hecke algebras, but also some finite dimensional Kac algebras in relation with inclusions of factors, and the rational Steenrod algebras. Beside being concrete and constructive, such combinatorial models shed light on certain algebraic phenomena and can lead to elegant and elementary proofs. My favorite tool is computer exploration, and the algorithmic and effective aspects play a major role in this manuscript. In particular, I describe the international open source project *-Combinat which I founded back in 2000, and whose mission is to provide an extensible toolbox for computer exploration in algebraic combinatorics and to foster code sharing among researchers in this area. I present specific challenges that the development of this project raised, and the original algorithmic, design, and development model solutions I was led to develop.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Algèbre combinatoire et effective: des graphes aux algèbres de Kac, via l'exploration informatique does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algèbre combinatoire et effective: des graphes aux algèbres de Kac, via l'exploration informatique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algèbre combinatoire et effective: des graphes aux algèbres de Kac, via l'exploration informatique will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-624320

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.