### Top Posts

### Recent comments

- Jon Awbrey on Mathematical diversity
- Peter Cameron on Mathematical diversity
- Peter Cameron on Finite geometry in Brighton
- jgilbey2014 on All kinds of mathematics, 1
- José Manuel Dos Santos Dos Santis on All kinds of mathematics, 1

### 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
- 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
- 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: greedy algorithm

## Matroids and polymatroids

Jack Edmonds’ LTCC intensive course is now over. It differed in several respects from what was advertised. First, he shared the presentation with Alex Fink on a roughly equal basis; second, bimatrix games were shelved in favour of some exciting … Continue reading

Posted in events, exposition
Tagged Alex Fink, greedy algorithm, Jack Edmonds, Lafforgue, matroid intersection, matroid subdivision, matroid sum, matroids, polymatroids
4 Comments

## A thrifty algorithm

Two important classical parameters of a permutation group G of degree n are the base size, the smallest size of a collection of points whose pointwise stabiliser is the identity; and the minimal degree, the smallest number of points moved … Continue reading

Posted in exposition, open problems
Tagged base size, greedy algorithm, Kenneth Blaha, minimal degree, permutation groups, primitive groups
4 Comments