Log24

Thursday, January 19, 2023

Two Approaches to Local-Global Symmetry

Filed under: General — Tags: , — m759 @ 2:34 am

Last revised: January 20, 2023 @ 11:39:05

The First Approach — Via Substructure Isomorphisms —

From "Symmetry in Mathematics and Mathematics of Symmetry"
by Peter J. Cameron, a Jan. 16, 2007, talk at the International
Symmetry Conference, Edinburgh, Jan. 14-17, 2007

Local or global?

"Among other (mostly more vague) definitions of symmetry, the dictionary will typically list two, something like this:

• exact correspondence of parts;
• remaining unchanged by transformation.

Mathematicians typically consider the second, global, notion, but what about the first, local, notion, and what is the relationship between them?  A structure M  is homogeneous * if every isomorphism between finite substructures of M  can be extended to an automorphism of ; in other words, 'any local symmetry is global.' "

A related discussion of the same approach — 

"The aim of this thesis is to classify certain structures
which are, from a certain point of view,
as homogeneous as possible, that is
which have as many symmetries as possible.
the basic idea is the following: a structure S  is
said to be homogeneous  if, whenever two (finite)
substructures Sand S2 of S  are isomorphic,
there is an automorphism of S  mapping S1 onto S2.”

— Alice Devillers,
Classification of Some Homogeneous
and Ultrahomogeneous Structures
,”
Ph.D. thesis, Université Libre de Bruxelles,
academic year 2001-2002

The Wikipedia article Homogeneous graph discusses the local-global approach
used by Cameron and by Devillers.

For some historical background on this approach
via substructure isomorphisms, see a former student of Cameron:

Dugald Macpherson, "A survey of homogeneous structures,"
Discrete Mathematics , Volume 311, Issue 15, 2011,
Pages 1599-1634.

Related material:

Cherlin, G. (2000). "Sporadic Homogeneous Structures."
In: Gelfand, I.M., Retakh, V.S. (eds)
The Gelfand Mathematical Seminars, 1996–1999.
Gelfand Mathematical Seminars. Birkhäuser, Boston, MA.
https://doi.org/10.1007/978-1-4612-1340-6_2

and, more recently, 

Gill et al., "Cherlin's conjecture on finite primitive binary
permutation groups," https://arxiv.org/abs/2106.05154v2
(Submitted on 9 Jun 2021, last revised 9 Jul 2021)

This approach seems to be a rather deep rabbit hole.

The Second Approach — Via Induced Group Actions —

My own interest in local-global symmetry is of a quite different sort.

See properties of the two patterns illustrated in a note of 24 December 1981 —

Pattern A above actually has as few  symmetries as possible
(under the actions described in the diamond theorem ), but it
does  enjoy, as does patttern B, the local-global property that
a group acting in the same way locally on each part  induces
a global group action on the whole .

* For some historical background on the term "homogeneous,"
    see the Wikipedia article Homogeneous space.

Monday, August 24, 2015

Quality Report:

Filed under: General,Geometry — m759 @ 12:00 pm

The Wrench and the Nut

From Schicksalstag  2012

The Quality
with No Name

And what is good, Phaedrus,
and what is not good —
Need we ask anyone
to tell us these things?

— Epigraph to
Zen and the Art of
Motorcyle Maintenance

Related material from Wikipedia today:

See as well a search in this journal for  “Permutation Group” + Wikipedia .

Tuesday, August 18, 2015

A Wrinkle in Terms

Filed under: General,Geometry — m759 @ 8:23 am

The phrase “the permutation group Sn” refers to a
particular  group of permutations that act on an
-element set N— namely, all  of them. For a given n ,
there are, in general, many  permutation groups that
act on N.  All but one are smaller than S.

In other words, the phrase “the permutation group Sn
does not  imply that “Sn ” is a symbol for a structure
associated with n  called “the  permutation group.”
It is instead a symbol for “the symmetric  group,” the largest
of (in general) many permutation groups that act on N.

This point seems to have escaped John Baez.

For two misuses by Baez of the phrase “permutation group” at the
n-Category Café, see “A Wrinkle in the Mathematical Universe”
and “Re: A Wrinkle…” —

“There is  such a thing as a permutation group.”
— Adapted from A Wrinkle in Time , by Madeleine L’Engle

Tuesday, October 3, 2006

Tuesday October 3, 2006

Filed under: General,Geometry — Tags: , , , — m759 @ 9:26 am

Serious

"I don't think the 'diamond theorem' is anything serious, so I started with blitzing that."

Charles Matthews at Wikipedia, Oct. 2, 2006

"The 'seriousness' of a mathematical theorem lies, not in its practical consequences, which are usually negligible, but in the significance of the mathematical ideas which it connects. We may say, roughly, that a mathematical idea is 'significant' if it can be connected, in a natural and illuminating way, with a large complex of other mathematical ideas."

— G. H. Hardy, A Mathematician's Apology

Matthews yesterday deleted references to the diamond theorem and related material in the following Wikipedia articles:

Affine group‎
Reflection group‎
Symmetry in mathematics‎
Incidence structure‎
Invariant (mathematics)‎
Symmetry‎
Finite geometry‎
Group action‎
History of geometry‎

This would appear to be a fairly large complex of mathematical ideas.

See also the following "large complex" cited, following the above words of Hardy, in Diamond Theory:

Affine geometry, affine planes, affine spaces, automorphisms, binary codes, block designs, classical groups, codes, coding theory, collineations, combinatorial, combinatorics, conjugacy classes, the Conwell correspondence, correlations, design theory, duads, duality, error correcting codes, exceptional groups, finite fields, finite geometry, finite groups, finite rings, Galois fields, generalized quadrangles, generators, geometry, GF(2), GF(4), the (24,12) Golay code, group actions, group theory, Hadamard matrices, hypercube, hyperplanes, hyperspace, incidence structures, invariance, Karnaugh maps, Kirkman's schoolgirl problem, Latin squares, Leech lattice, linear groups, linear spaces, linear transformations, Mathieu groups, matrix theory, Meno, Miracle Octad Generator, MOG, multiply transitive groups, octads, the octahedral group, orthogonal arrays, outer automorphisms, parallelisms, partial geometries, permutation groups, PG(3,2), polarities, Polya-Burnside theorem, projective geometry, projective planes, projective spaces, projectivities, Reed-Muller codes, the relativity problem, Singer cycle, skew lines,  sporadic simple groups, Steiner systems, symmetric, symmetry, symplectic, synthemes, synthematic, tesseract, transvections, Walsh functions, Witt designs.

Powered by WordPress