cameroncounts.wordpress.com
Work | Peter Cameron's Blog
https://cameroncounts.wordpress.com/quotes/work
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. I wanted to represent these [Fuchsian] functions by the quotient of two series; the idea was perfectly conscious and deliberate; the analogy with elliptic functions guided me. I asked myself what properties these series must have if they existed, and succeeded without difficulty in forming the series I have called thetafuchsian. William Byers, How Mathematicians Think.
cameroncounts.wordpress.com
Quotes | Peter Cameron's Blog
https://cameroncounts.wordpress.com/quotes
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. It is a good thing for an uneducated man to read books of quotations. Abbot Hor said to his disciple: Take care that you never bring into this cell the words of another. The Wisdom of the Desert. Logic and set theory. This collection is a miscellany in Littlewood’s sense (see his definition under Miscellany. Anything you would like to send me will be gratefully received:.
cameroncounts.wordpress.com
Equivalence relations | Peter Cameron's Blog
https://cameroncounts.wordpress.com/2010/03/31/equivalence-relations
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. Mathematical typography: help wanted. In an earlier post. I described the equivalence relation theorem as the pons asinorum. Of modern mathematics. It is a real obstacle for beginning mathematics students, but one which it is essential to master. The theorem states that two kinds of object are essentially the same thing:. On a set X. An invariant is a function which can be...
cameroncounts.wordpress.com
Contents | Peter Cameron's Blog
https://cameroncounts.wordpress.com/contents
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. I have organised this contents table by category. Within each category, the most recent is first, except in the case of a sequence, where the logical order is used. This contents of contents might help you find your way around. Around the random graph. Latin squares and Youden designs. Coherent configurations and association schemes. Events, talks and conferences. Equivale...
cameroncounts.wordpress.com
GAP code for PLRs | Peter Cameron's Blog
https://cameroncounts.wordpress.com/lecture-notes/gap-code-for-plrs-2
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. GAP code for PLRs. This file defines a number of GAP functions for computing with PLRs. # # Please refer to "Primitive Lambda-Roots" for definitions. # # Note one small difference - invariant factors and elementary divisors # # are ordered differently here! Leave a Reply Cancel reply. Enter your comment here. Fill in your details below or click an icon to log in:. Enter yo...
cameroncounts.wordpress.com
Peter Cameron | Peter Cameron's Blog
https://cameroncounts.wordpress.com/author/cameroncounts
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. Author Archives: Peter Cameron. I count all the things that need to be counted. Combinatorics at the EMS. Photography in St Andrews, art in Pittenweem. The Young Researchers in Mathematics conference took place this week in St Andrews. Since I was a plenary speaker, I was signed up as a proper participant, so I felt entitled to go to as many talks as I wanted … ...Last wee...
cameroncounts.wordpress.com
Lecture notes | Peter Cameron's Blog
https://cameroncounts.wordpress.com/lecture-notes
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. I am moving my collection of lecture notes here. At present there is the following. St Andrews Notes on Advanced Combinatorics. The art of counting. Structure, symmetry and polynomials. Finite geometry and strongly regular graphs. QM lectures, 2000). Polynomial aspects of codes, matroids and permutation groups. Lectures at UPC, 2002). LTCC notes, 2011). In Chapters 1-8 of.
cameroncounts.wordpress.com
Peter Cameron's Blog | always busy counting, doubting every figured guess . . . | Page 2
https://cameroncounts.wordpress.com/page/2
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. Newer posts →. There is no McLaughlin geometry. Congratulations to Patric Östergård and Leonard Soicher, who have just completed a big computation whose conclusion is “There is no McLaughlin geometry”. The run-time of the computation was about 250 core-years. So what did they compute, and why does it matter? Lambda;, μ if it has n. Vertices, every vertex has k. Of a partia...
cameroncounts.wordpress.com
BCC in Strathclyde | Peter Cameron's Blog
https://cameroncounts.wordpress.com/2015/05/18/bcc-in-strathclyde
Peter Cameron's Blog. Always busy counting, doubting every figured guess . . . GAP code for PLRs. Laplace eigenvalues and optimality. Equivalence relations, 2 →. 26th British Combinatorial Conference. 3–7 July 2017. Make a note of the dates! Further details will follow. In the meantime, bookmark the website:. Http:/ combinatorics.cis.strath.ac.uk/bcc2017/. I count all the things that need to be counted. View all posts by Peter Cameron →. This entry was posted in events. Equivalence relations, 2 →. My St ...