Top Posts
Recent comments
- Josh Paik on Scottish Combinatorics Conference
- Peter Cameron on Scottish Combinatorics Conference
- Josh Paik on Scottish Combinatorics Conference
- Peter Cameron on Scottish Combinatorics Conference
- Josh Paik on Scottish Combinatorics Conference
Blogroll
- Astronomy Picture of the Day
- Azimuth
- British Combinatorial Committee
- Comfortably numbered
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Ratio bound
- Robert A. Wilson's blog
- Since it is not …
- Spitalfields life
- Sylvy's mathsy blog
- SymOmega
- 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
- XKCD
Find me on the web
-
Join 666 other subscribers
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
Peter Cameron's Blog 