Oxford Index Search Results

You are looking at 1-1 of 1 items for:

monoid x Combinatorics and Graph Theory x clear all

Refine by type

Refine by product



Overview page. Subjects: Computing.

A semigroup that possesses an identity element, e. If S is a semigroup on which there is defined a dyadic operation ∘, then xe = ex = xfor all elements x in S. Monoids play an...

See overview in Oxford Index

Coxeter Groups

Bernhard M¨uhlherr, Holger P. Petersson and Richard M. Weiss.

in Descent in Buildings (AM-190)

September 2015; p ublished online October 2017 .

Chapter. Subjects: Combinatorics and Graph Theory. 4887 words.

This chapter develops a theory of descent for buildings by assembling various results about Coxeter groups. It begins with the notation stating that W is an arbitrary group with a...

Go to Princeton University Press »  abstract