Top Posts
Recent comments
- dsp on The enhanced power graph is weakly perfect
- dsp on The enhanced power graph is weakly perfect
- What Lovelace Did: From Bombelli to Bernoulli to Babbage | on Polynomials taking integer values
- What Ada Did: From Bombelli to Bernoulli to Babbage | on Polynomials taking integer values
- Peter Cameron on The enhanced power graph is weakly perfect
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 659 other followers
Cameron Counts: RSS feeds
Meta
Tag Archives: Saul Freedman
Graphs defined on groups
Apologies; I have been so busy lately that very little has got written up. Let me try to remedy this with a quick tour through some recent mathematical developments. As some of my posts have hinted, one topic I have … Continue reading →
Groups and graphs
Two new preprints have appeared on the arXiv (2008.09291 and 2009.02884), about which I would like to say something. One is by Saul Freedman, the other by him and two co-authors (his PhD supervisors). The intersection graph of a group … Continue reading →
Posted in Uncategorized
|
Tagged Baby Monster, commuting graph, generating graph, intersection graph, power graph, Saul Freedman, unitary groups
|
1 Comment
Peter Cameron's Blog 