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: Dima FonDerFlaass
Bijective proofs
A fourth proof Last month I described three proofs of the formula for the number of ways to choose k objects from a set of n, if repetition is allowed and order is not significant; it is the same as … Continue reading
Posted in exposition, open problems
Tagged bijections, Catalan numbers, Catalan objects, Dima FonDerFlaass, permutations, sampling
Leave a comment
The definition of a matroid
This post continues my series about definitions. It has been obvious from the earliest days of the subject that matroids can be defined in very many different ways: in terms of their independent sets, their bases (maximal independent sets), their … Continue reading
Posted in exposition
Tagged 1skeleton, cryptomorphic, Dima FonDerFlaass, exchange axiom, IBIS family, optimization, polytope, Takeo Nakasawa
Leave a comment