Top Posts
Recent comments
 Josh Frisch on Hall’s Marriage Theorem
 jbritnell2013 on Hall’s Marriage Theorem
 Peter Cameron on Hall’s Marriage Theorem
 Josh Frisch on Hall’s Marriage Theorem
 Peter Cameron on Hall’s Marriage Theorem
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
 Comfortably numbered
 Computational semigroup theory
 DC's Improbable Science
 Diamond Geezer
 Exploring East London
 From hill to sea
 Gödel's lost letter and P=NP
 Gil Kalai
 Haris Aziz
 Intersections
 Jane's London
 Jon Awbrey
 Kourovka Notebook
 LMS blogs page
 Log24
 London Algebra Colloquium
 London Reconnections
 Marie Cameron's blog
 MathBlogging
 Micromath
 Neill Cameron
 neverendingbooks
 Noncommutative geometry
 numericana hall of fame
 Paul Goldberg
 Ratio bound
 Robert A. Wilson's blog
 Sheila's blog
 Since it is not …
 Spitalfields life
 St Albans midweek lunch
 Stubborn mule
 Sylvy's mathsy blog
 SymOmega
 Tangential thoughts
 Terry Tao
 The Aperiodical
 The De Morgan Journal
 The ICA
 The London column
 The Lumber Room
 The matroid union
 Theorem of the day
 Tim Gowers
 Vynmath
 XKCD
Find me on the web
Cameron Counts: RSS feeds
Meta
Tag Archives: expanders
Asymptotic group theory, 3
A Ramanujan graph is a connected finite graph of valency k whose eigenvalues (apart from k and −k) all have modulus at most 2√(k−1). This interval is the spectrum of the infinite kvalent tree T (regarded as an operator on … Continue reading →
Computational algebra in Lisbon
This week I was at a very nice workshop on Computational Algebra in Lisbon. Rarely do I learn so many new things at a conference, although it was only three days in duration. Here are some of the highlights, roughly … Continue reading →
Posted in events

Tagged automated deduction, automorphic loops, constraint satisfaction, expanders, LDPCs, matroids, synchronization

Leave a comment