Top Posts
Recent comments
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 703 other subscribers
Cameron Counts: RSS feeds
Meta
Category Archives: open problems
Digraphs on groups
I have spent a lot of time recently thinking about graphs on groups. To recall the rules: the vertex set must be the group (in general, but not here, I allow an automorphism-invariant subset or the quotient by an automorphism-invariant … Continue reading
A counting problem
As the tagline for this blog says, I like counting things. Reading my Iran diary reminded me of a counting problem I solved then, of which I am quite proud. But like all good problems, it leaves a loose end, … Continue reading
Posted in doing mathematics, open problems
Tagged Charles JOhnson, graphs, symmetric sign patterns
3 Comments
The rational world and the rational Urysohn space
The set Q of rational numbers is obviously an interesting topological space. In 1920, Waclaw Sierpiński gave a lovely characterisation of it. The simplest way to state it is to say that a countable, metrisable, space without isolated points is … Continue reading
Posted in exposition, open problems
Tagged Urysohn space, Sierpinski's theorem, cycle structure
Leave a comment
Why transformation monoids are harder than permutation groups
For permutation groups (or transformation monoids), we don’t need to assume the associative law, since composition of functions is always associative. So a permtation group is a set of mappings satisfying the identity, inverse and closure axioms. This implies that … Continue reading
Graphs defined on algebras
Next February, I will be speaking at AAA108 (Arbeitstagung Allgemeine Algebra) in Vienna. I thought this might be a chance to take some of the work about graphs defined on groups, and see whether it can be extended to arbitrary … Continue reading
A Catalan question
This week I am nominally at the Permutation Patterns conference. I find myself on the edge of the (very strong) community of Permutation Patterners; also, after a month away, I have lots of catching up to do; also, Bruce Sagan … Continue reading
Posted in doing mathematics, events, open problems
Tagged Catalan numbers, Fraisse classes, permutation patterns
Leave a comment
A class of interesting permutation groups
This is the class of primitive groups having an imprimitive subgroup of index 2. Let us make them almost simple as well. For a boring name, I will call this class (P). So I begin with two questions for specialists: … Continue reading
Posted in mathematics, open problems, Uncategorized
Tagged CFSG, imptimitive permutations, road closure property
4 Comments
A talk by Gareth Jones
Today I attended (remotely) a nice talk by Gareth Jones in the Ural Workshop on Group Theory and Combinatorics, about prime powers in permutation group theory and polynomials taking prime values in number theory. I will give just one example … Continue reading
Some challenges on Latin squares
Following the combinatorial design challenges, here are three questions on Latin squares. A Latin square is an n×n matrix with entries from an alphabet of size n (typically the integers from 1 to n) such that each letter appears once … Continue reading
Posted in open problems
Tagged Brualdi's conjecture, orthogonal mate, random Latin square, Ryser's conjecture, transversal
9 Comments
Challenges in combinatorial design theory
Since WordPress changed their editor and it is no longer possible to write posts in HTML, I have to find a new solution to posting mathematics. What I have done this time is to put it on my web page … Continue reading
Posted in open problems
Tagged Peter Keevash, projective planes, synchronization, t-designs
7 Comments