Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Positive Definite Coxeter Graphs

In course

MATH-335: Coxeter groups

Study groups generated by reflections ...

Description

This lecture covers the classification of positive definite connected Coxeter graphs, demonstrating properties and proofs using examples with detailed calculations. It explores the concept of positive definiteness in Coxeter graphs and how to determine it through specific calculations and graph analysis.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Anna Lachowska

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Coxeter group

In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 .

Coxeter–Dynkin diagram

In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes). It describes a kaleidoscopic construction: each graph "node" represents a mirror (domain facet) and the label attached to a branch encodes the dihedral angle order between two mirrors (on a domain ridge), that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees.

Mathematical proof

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation".

Coxeter graph

In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter. The Coxeter graph has chromatic number 3, chromatic index 3, radius 4, diameter 4 and girth 7. It is also a 3-vertex-connected graph and a 3-edge-connected graph. It has book thickness 3 and queue number 2. The Coxeter graph is hypohamiltonian: it does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian.

Coxeter element

In mathematics, the Coxeter number h is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there are multiple conjugacy classes of Coxeter elements, and they have infinite order. There are many different ways to define the Coxeter number h of an irreducible root system. A Coxeter element is a product of all simple reflections.

Related lectures (53)

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Automorphism groups: Trees and Graphs

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Fourier Series: Understanding Coefficients and Periodicity

Explores Fourier series coefficients, periodicity, and series relations.

Fundamental Groups

Explores fundamental groups, homotopy classes, and coverings in connected manifolds.

Proofs: Logic, Mathematics & Algorithms