### Top Posts

### Recent comments

- Yemon Choi on Research integrity
- Robin Chapman on Silence
- Walter Sinclair on Silence
- Peter Cameron on LMS SGM, 2
- Dima on LMS SGM, 2

### Blogroll

- Alexander Konovalov
- Annoying precision
- Astronomy Picture of the Day
- Azimuth
- Bad science
- Bob Walters
- British Combinatorial Committee
- CIRCA tweets digest
- CoDiMa
- Coffee, love, and matrix algebra
- Computational semigroup theory
- DC's Improbable Science
- Diamond Geezer
- Exploring East London
- Gödel's lost letter and P=NP
- Gil Kalai
- Haris Aziz
- Intersections
- Jane's London
- Jon Awbrey
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- Machines like us
- Marie Cameron's blog
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Paul Goldberg
- Robert A. Wilson's blog
- Sheila's blog
- Since it is not …
- Spitalfields life
- St Albans midweek lunch
- Stubborn mule
- SymOmega
- Tangential thoughts
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: switching

## ACCMCC, Days 4 and 5

Penny Haxell opened proceedings on Thursday with her astonishing work with Ron Aharoni. They give a sufficient condition for a tripartite 3-uniform hypergraph (one whose vertex set is partitioned into three parts so that each hyperedge contains one vertex from … Continue reading

Posted in events
Tagged affine planes, Latin squares, Markov chains, switching, synchronization, transversals, Tutte polynomial
1 Comment

## Carries, shuffling, and cocycles

Last week we were treated to a lovely lecture by Persi Diaconis. As he so often does, he started with an elementary question: how many carries do you expect if you add n numbers in base b? From there he … Continue reading

Posted in exposition, open problems
Tagged arithmetic, minimal cocycles, riffle shuffles, Seidel, switching
Leave a comment

## The Graph Extension Theorem

I made some notes on the Graph Extension Theorem for a new research project. They may be of wider interest, so here is a summary. Shult’s Graph Extension Theorem is a simple device for showing that certain permutation groups have … Continue reading

Posted in exposition
Tagged Higman, Seidel, Shult, switching, transitive extension, two-graph
4 Comments