|
by Google Gemini AI Monday, March 4, 2024
Absolutely! Here's an academic paper about the Cullinane diamond theorem. Please note that while I provide citations, in a fully formatted paper you'd need to adhere to your chosen academic style guide for proper formatting:
The Cullinane Diamond Theorem: Abstract This paper examines the Cullinane diamond theorem, a principle in finite projective geometry that offers unexpected insights into the symmetries found in graphic designs. The theorem, initially formulated by Steven H. Cullinane, reveals that patterns built from simple geometric components, like diamonds or chevrons, possess inherent symmetry properties under specific transformation groups. We will discuss the mathematical foundations of the theorem, its relation to the Miracle Octad Generator, and its applications in design and the study of finite fields. Introduction Symmetry plays a vital role in art and design, contributing to a sense of balance, harmony, and aesthetic appeal. While often associated with classical forms, symmetry also manifests in surprising ways within seemingly simple graphic patterns. The Cullinane diamond theorem provides a mathematical framework to understand and predict these hidden symmetries. Mathematical Background Finite Projective Geometries: The Cullinane diamond theorem has its roots in finite projective geometry. A finite projective geometry PG(n, q) consists of a finite set of points and lines, where each line contains q + 1 points, and any two distinct points lie on a unique line ([1]). Diamond Figure: Cullinane focuses on a specific pattern called the four-diamond figure (D). This figure is composed of 16 tiles arranged in a 4×4 array, where each tile is divided diagonally into two colors ([2]). Transformation Group: The group G of transformations is formed by all possible permutations of rows, columns, and 2×2 quadrants of the diamond figure, along with color interchanges. The size of this group is 322,560 ([2]). The Cullinane Diamond Theorem
Theorem:
Proof: Connections to the Miracle Octad Generator The Cullinane diamond theorem shares a relationship with R.T. Curtis's Miracle Octad Generator (MOG). The MOG is a combinatorial structure within the study of sporadic simple groups with symmetry properties similar to those described by the theorem ([3]). Applications Graphic Design: The theorem informs artistic compositions employing diamond and chevron-like shapes. Designers can leverage the inherent symmetries to generate visually pleasing and intricate patterns. Quilt Patterns: Many traditional quilt designs incorporate the geometries described by the theorem, leading to the emergence of symmetrical patterns, even when randomness might be involved in the selection of colors or tiles. Finite Fields: The Cullinane diamond theorem establishes an isomorphism between specific "diamond" rings and rings of matrices over GF(4), offering insights into the structure of finite fields ([2]). Conclusion The Cullinane diamond theorem elegantly connects abstract mathematics with the world of graphic design. It unveils latent symmetries embedded within basic geometric shapes, providing a tool for understanding and creating visually balanced patterns. The theorem's connections to finite fields and combinatorial structures highlight its significance in broader mathematical research. Citations [1] Weisstein, E. W. “Finite Projective Geometry.” From MathWorld–A Wolfram Web Resource. [invalid URL removed] [2] Cullinane, S. H. "Cullinane Diamond Theorem." Encyclopedia of Mathematics. https://encyclopediaofmath.org/wiki/Cullinane_diamond_theorem [3] Curtis, R. T. (1976). A New Combinatorial Approach to M₂₄. Mathematical Proceedings of the Cambridge Philosophical Society, 79(1), 25–42. doi:10.1017/S0305004100052075 Let me know if you'd like me to expand on any particular aspect or provide additional citations!
1. www.hellenicaworld.com/Science/Mathematics/en/MathieuGroup.html
|
Monday, March 4, 2024
Report on the Diamond Theorem
by Google Gemini (Advanced)
by Google Gemini (Advanced)
Sunday, December 17, 2023
Speak, Memory
"Unsocratic Dialogue" with Google DeepMind's Gemini AI continues . . .
|
Do you remember a previous conversation about the question "What is the Cullinane diamond theorem?" If so, how would you answer the question now?
|
Thursday, December 14, 2023
Unsocratic Dialogue (with Gemini AI in Bard Today)
|
What is the Cullinane diamond theorem?
|
Thursday, February 3, 2022
Through the Asian Looking Glass
The Miracle Octad Generator (MOG) —
The Conway-Sloane version of 1988:
See also the 1976 R. T. Curtis version, of which the Conway-Sloane version
is a mirror reflection —
“There is a correspondence between the two systems
of 35 groups, which is illustrated in Fig. 4 (the MOG or
Miracle Octad Generator).”
—R.T. Curtis, “A New Combinatorial Approach to M24,”
Mathematical Proceedings of the Cambridge Philosophical
Society (1976), 79: 25-42
Curtis’s 1976 Fig. 4. (The MOG.)
The Guy Embedding (named for M.J.T., not Richard K., Guy) states that
the MOG is naturally embedded in the codewords of the extended binary
Golay code, if those codewords are generated in lexicographic order.
The above reading order for the MOG 4×6 array —
down the columns, from left to right — yields the Conway-Sloane MOG.
Since that is a mirror image of the original Curtis MOG, the reading order
yielding that MOG is down the columns, from right to left.
"Traditionally, Chinese, Japanese, Vietnamese and Korean are written vertically
in columns going from top to bottom and ordered from right to left, with each
new column starting to the left of the preceding one." — Wikipedia
The Asian reading order has certain artistic advantages:
Tuesday, May 28, 2013
Codes
The hypercube model of the 4-space over the 2-element Galois field GF(2):
The phrase Galois tesseract may be used to denote a different model
of the above 4-space: the 4×4 square.
MacWilliams and Sloane discussed the Miracle Octad Generator
(MOG) of R. T. Curtis further on in their book (see below), but did not
seem to realize in 1977 that the 4×4 structures within the MOG are
based on the Galois-tesseract model of the 4-space over GF(2).
The thirty-five 4×4 structures within the MOG:
Curtis himself first described these 35 square MOG patterns
combinatorially, (as his title indicated) rather than
algebraically or geometrically:
A later book co-authored by Sloane, first published in 1988,
did recognize the 4×4 MOG patterns as based on the 4×4
Galois-tesseract model.
Between the 1977 and 1988 Sloane books came the diamond theorem.
Update of May 29, 2013:
The Galois tesseract appeared in an early form in the journal
Computer Graphics and Art , Vol. 2, No. 1, February 1977
(the year the above MacWilliams-Sloane book was first published):
Saturday, April 6, 2013
Pascal via Curtis
Click image for some background.
Shown above is a rearranged version of the
Miracle Octad Generator (MOG) of R. T. Curtis
("A new combinatorial approach to M24,"
Math. Proc. Camb. Phil. Soc., 79 (1976), 25-42.)
The 8-subcell rectangles in the left part of the figure may be
viewed as illustrating (if the top left subcell is disregarded)
the thirty-five 3-subsets of a 7-set.
Such a view relates, as the remarks below show, the
MOG's underlying Galois geometry, that of PG(3,2), to
the hexagrammum mysticum of Pascal.
On Danzer's 354 Configuration:
"Combinatorially, Danzer’s configuration can be interpreted
as defined by all 3-sets and all 4-sets that can be formed
by the elements of a 7-element set; each 'point' is represented
by one of the 3-sets, and it is incident with those lines
(represented by 4-sets) that contain the 3-set."
— Branko Grünbaum, "Musings on an Example of Danzer's,"
European Journal of Combinatorics , 29 (2008),
pp. 1910–1918 (online March 11, 2008)
"Danzer's configuration is deeply rooted in
Pascal's Hexagrammum Mysticum ."
— Marko Boben, Gábor Gévay, and Tomaž Pisanski,
"Danzer's Configuration Revisited," arXiv.org, Jan. 6, 2013
For an approach to such configurations that differs from
those of Grünbaum, Boben, Gévay, and Pisanski, see
Classical Geometry in Light of Galois Geometry.
Grünbaum has written little about Galois geometry.
Pisanski has recently touched on the subject;
see Configurations in this journal (Feb. 19, 2013).
Monday, October 3, 2011
Mathieu Symmetry
The following may help show why R.T. Curtis calls his approach
to sporadic groups symmetric generation—
Related material— Yesterday's Symmetric Generation Illustrated.
Sunday, October 2, 2011
Symmetric Generation Illustrated
R.T. Curtis in a 1990 paper* discussed his method of "symmetric generation" of groups as applied to the Mathieu groups
See Finite Relativity and the Log24 posts Relativity Problem Revisited (Sept. 20) and Symmetric Generation (Sept. 21).
Here is some exposition of how this works with
* "Geometric Interpretations of the ‘Natural’ Generators of the Mathieu groups," Mathematical Proceedings of the Cambridge Philosophical Society (1990), Vol. 107, Issue 01, pp. 19-26.
Wednesday, September 21, 2011
Symmetric Generation
Suggested by yesterday's Relativity Problem Revisited and by Cassirer on Objectivity—
From Symmetric Generation of Groups , by R.T. Curtis (Cambridge U. Press, 2007)—
"… we are saying much more than that
some set of seven involutions, which would be a very weak
requirement. We are asserting that M 24 is generated by a set
of seven involutions which possesses all the symmetries of
acting on the points of the 7-point projective plane…."
— Symmetric Generation , p. 41
"It turns out that this approach is particularly revealing and that
many simple groups, both sporadic and classical, have surprisingly
simple definitions of this type."
— Symmetric Generation , p. 42
See also (click to enlarge)—
Cassirer's remarks connect the concept of objectivity with that of object .
The above quotations perhaps indicate how the Mathieu group
"This is the moment which I call epiphany. First we recognise that the object is one integral thing, then we recognise that it is an organised composite structure, a thing in fact: finally, when the relation of the parts is exquisite, when the parts are adjusted to the special point, we recognise that it is that thing which it is. Its soul, its whatness, leaps to us from the vestment of its appearance. The soul of the commonest object, the structure of which is so adjusted, seems to us radiant. The object achieves its epiphany."
— James Joyce, Stephen Hero
For a simpler object "which possesses all the symmetries of
For symmetric generation of
Tuesday, September 20, 2011
Relativity Problem Revisited
A footnote was added to Finite Relativity—
Background:
Weyl on what he calls the relativity problem—
“The relativity problem is one of central significance throughout geometry and algebra and has been recognized as such by the mathematicians at an early time.”
– Hermann Weyl, 1949, “Relativity Theory as a Stimulus in Mathematical Research“
“This is the relativity problem: to fix objectively a class of equivalent coordinatizations and to ascertain the group of transformations S mediating between them.”
– Hermann Weyl, 1946, The Classical Groups , Princeton University Press, p. 16
…. A note of Feb. 20, 1986, supplied an example of such coordinatizations in finite geometry. In that note, the group of mediating transformations acted directly on coordinates within a 4×4 array. When the 4×4 array is embedded in a 4×6 array, a larger and more interesting group, M 24 (containing the original group), acts on the larger array. There is no obvious solution to Weyl’s relativity problem for M 24. That is, there is no obvious way* to apply exactly 24 distinct transformable coordinate-sets (or symbol-strings ) to the 24 array elements in such a way that the natural group of mediating transformations of the 24 symbol-strings is M 24. ….
Footnote of Sept. 20, 2011:
* R.T. Curtis has, it seems, a non-obvious way that involves strings of seven symbols. His abstract for a 1990 paper says that in his construction “The generators of M 24 are defined… as permutations of twenty-four 7-cycles in the action of PSL2(7) on seven letters….”
See “Geometric Interpretations of the ‘Natural’ Generators of the Mathieu groups,” by R.T. Curtis, Mathematical Proceedings of the Cambridge Philosophical Society (1990), Vol. 107, Issue 01, pp. 19-26. (Rec. Jan. 3, 1989, revised Feb. 3, 1989.) This paper was published online on Oct. 24, 2008.
Some related articles by Curtis:
R.T. Curtis, “Natural Constructions of the Mathieu groups,” Math. Proc. Cambridge Philos. Soc. (1989), Vol. 106, pp. 423-429
R.T. Curtis. “Symmetric Presentations I: Introduction, with Particular Reference to the Mathieu groups M 12 and M 24” In Proceedings of 1990 LMS Durham Conference ‘Groups, Combinatorics and Geometry’ (eds. M. W. Liebeck and J. Saxl), London Math. Soc. Lecture Note Series 165, Cambridge University Press, 1992, pp. 380–396
R.T. Curtis, “A Survey of Symmetric Generation of Sporadic Simple Groups,” in The Atlas of Finite Groups: Ten Years On , (eds. R.T. Curtis and R.A. Wilson), London Math. Soc. Lecture Note Series 249, Cambridge University Press, 1998, pp. 39–57
Saturday, August 6, 2011
Correspondences
Comme de longs échos qui de loin se confondent
Dans une ténébreuse et profonde unité….
— Baudelaire, “Correspondances ”
From “A Four-Color Theorem”—
Figure 1
Note that this illustrates a natural correspondence
between
(A) the seven highly symmetrical four-colorings
of the 4×2 array at the left of Fig. 1, and
(B) the seven points of the smallest
projective plane at the right of Fig. 1.
To see the correspondence, add, in binary
fashion, the pairs of projective points from the
“points” section that correspond to like-colored
squares in a four-coloring from the left of Fig. 1.
(The correspondence can, of course, be described
in terms of cosets rather than of colorings.)
A different correspondence between these 7 four-coloring
structures and these 7 projective-line structures appears in
a structural analysis of the Miracle Octad Generator
(MOG) of R.T. Curtis—
Figure 2
| Here the correspondence between the 7 four-coloring structures (left section) and the 7 projective-line structures (center section) is less obvious, but more fruitful. It yields, as shown, all of the 35 partitions of an 8-element set (an 8-set ) into two 4-sets. The 7 four-colorings in Fig. 2 also appear in the 35 4×4 parts of the MOG that correspond, in a way indicated by Fig. 2, to the 35 8-set paritions. This larger correspondence— of 35 4×2 arrays with 35 4×4 arrays— is the MOG, at least as it was originally defined. See The MOG, Generating the Octad Generator, and Eightfold Geometry.
For some applications of the Curtis MOG, see |
Wednesday, July 6, 2011
Nordstrom-Robinson Automorphisms
A 2008 statement on the order of the automorphism group of the Nordstrom-Robinson code—
"The Nordstrom-Robinson code has an unusually large group of automorphisms (of order 8! = 40,320) and is optimal in many respects. It can be found inside the binary Golay code."
— Jürgen Bierbrauer and Jessica Fridrich, preprint of "Constructing Good Covering Codes for Applications in Steganography," Transactions on Data Hiding and Multimedia Security III, Springer Lecture Notes in Computer Science, 2008, Volume 4920/2008, 1-22
A statement by Bierbrauer from 2004 has an error that doubles the above figure—
The automorphism group of the binary Golay code G is the simple Mathieu group M24 of order
— Jürgen Bierbrauer, "Nordstrom-Robinson Code and A7-Geometry," preprint dated April 14, 2004, published in Finite Fields and Their Applications , Volume 13, Issue 1, January 2007, Pages 158-170
The error is corrected (though not detected) later in the same 2004 paper—
In fact the symmetry group of the octacode is a semidirect product of an elementary abelian group of order 16 and the simple group GL(3, 2) of order 168. This constitutes a large automorphism group (of order 2688), but the automorphism group of NR is larger yet as we saw earlier (order 40,320).
For some background, see a well-known construction of the code from the Miracle Octad Generator of R.T. Curtis—
For some context, see the group of order 322,560 in Geometry of the 4×4 Square.
Sunday, June 19, 2011
Abracadabra (continued)
Yesterday's post Ad Meld featured Harry Potter (succeeding in business),
a 4×6 array from a video of the song "Abracadabra," and a link to a post
with some background on the 4×6 Miracle Octad Generator of R.T. Curtis.
A search tonight for related material on the Web yielded…
Weblog post by Steve Richards titled "The Search for Invariants:
The Diamond Theory of Truth, the Miracle Octad Generator
and Metalibrarianship." The artwork is by Steven H. Cullinane.
Richards has omitted Cullinane's name and retitled the artwork.
The author of the post is an artist who seems to be interested in the occult.
His post continues with photos of pages, some from my own work (as above), some not.
My own work does not deal with the occult, but some enthusiasts of "sacred geometry" may imagine otherwise.
The artist's post concludes with the following (note also the beginning of the preceding post)—
"The Struggle of the Magicians" is a 1914 ballet by Gurdjieff. Perhaps it would interest Harry.
Sunday, June 5, 2011
Edifice Complex
"Total grandeur of a total edifice,
Chosen by an inquisitor of structures
For himself. He stops upon this threshold,
As if the design of all his words takes form
And frame from thinking and is realized."
— Wallace Stevens, "To an Old Philosopher in Rome"
The following edifice may be lacking in grandeur,
and its properties as a configuration were known long
before I stumbled across a description of it… still…
"What we do may be small, but it has
a certain character of permanence…."
— G.H. Hardy, A Mathematician's Apology
The Kummer 166 Configuration
as seen by Kantor in 1969— (pdf, 2.5 MB)
For some background, see Configurations and Squares.
For some quite different geometry of the 4×4 square that is
original with me, see a page with that title. (The geometry's
importance depends in part on its connection with the
Miracle Octad Generator (MOG) of R.T. Curtis. I of course
had nothing to do with the MOG's discovery, but I do claim credit
for discovering some geometric properties of the 4×4 square
that constitutes two-thirds of the MOG as originally defined .)
Related material— The Schwartz Notes of June 1.
Tuesday, May 24, 2011
Noncontinuous (or Non-Continuous) Groups
The web page has been updated.
An example, the action of the Mathieu group M24
on the Miracle Octad Generator of R.T. Curtis,
was added, with an illustration from a book cover—
Saturday, July 24, 2010
Sunday, July 4, 2010
Brightness at Noon (continued)
Today's sermon mentioned the phrase "Omega number."
Other sorts of Omega numbers— 24 and 759— occur
in connection with the set named Ω by R. T. Curtis in 1976—
— R. T. Curtis, "A New Combinatorial Approach to M24,"
Math. Proc. Camb. Phil. Soc. (1976), 79, 25-42
Friday, May 14, 2010
Competing MOG Definitions
A recently created Wikipedia article says that “The Miracle Octad Generator [MOG] is an array of coordinates, arranged in four rows and six columns, capable of describing any point in 24-dimensional space….” (Clearly any array with 24 parts is so capable.) The article ignores the fact that the MOG, as defined by R.T. Curtis in 1976, is not an array of coordinates, but rather a picture of a correspondence between two sets, each containing 35 structures. (As a later commentator has remarked, this correspondence is a well-known one that preserves a certain incidence property. See Eightfold Geometry.)
From the 1976 paper defining the MOG—
“There is a correspondence between the two systems of 35 groups, which is illustrated in Fig. 4 (the MOG or Miracle Octad Generator).” —R.T. Curtis, “A New Combinatorial Approach to M24,” Mathematical Proceedings of the Cambridge Philosophical Society (1976), 79: 25-42
Curtis’s 1976 Fig. 4. (The MOG.)
The Wikipedia article, like a similar article at PlanetMath, is based on a different definition, from a book first published in 1988—
I have not seen the 1973 Curtis paper, so I do not know whether it uses the 35-sets correspondence definition or the 6×4 array definition. The remarks of Conway and Sloane on page 312 of the 1998 edition of their book about “Curtis’s original way of finding octads in the MOG [Cur2]” indicate that the correspondence definition was the one Curtis used in 1973—
Here the picture of “the 35 standard sextets of the MOG”
is very like (modulo a reflection) Curtis’s 1976 picture
of the MOG as a correspondence between two 35-sets.
A later paper by Curtis does use the array definition. See “Further Elementary Techniques Using the Miracle Octad Generator,” Proceedings of the Edinburgh Mathematical Society (1989) 32, 345-353.
The array definition is better suited to Conway’s use of his hexacode to describe octads, but it obscures the close connection of the MOG with finite geometry. That connection, apparent in the phrases “vector space structure in the standard square” and “parallel 2-spaces” (Conway and Sloane, third ed., p. 312, illustrated above), was not discussed in the 1976 Curtis paper. See my own page on the MOG at finitegeometry.org.
Wednesday, April 28, 2010
Eightfold Geometry
Related web pages:
Miracle Octad Generator,
Generating the Octad Generator,
Geometry of the 4×4 Square
Related folklore:
"It is commonly known that there is a bijection between the 35 unordered triples of a 7-set [i.e., the 35 partitions of an 8-set into two 4-sets] and the 35 lines of PG(3,2) such that lines intersect if and only if the corresponding triples have exactly one element in common." –"Generalized Polygons and Semipartial Geometries," by F. De Clerck, J. A. Thas, and H. Van Maldeghem, April 1996 minicourse, example 5 on page 6
The Miracle Octad Generator may be regarded as illustrating the folklore.
Update of August 20, 2010–
For facts rather than folklore about the above bijection, see The Moore Correspondence.
Wednesday, October 14, 2009
Wednesday October 14, 2009
Singer 7-Cycles
Click on images for details.
The 1985 Cullinane version gives some algebraic background for the 1987 Curtis version.
The Singer referred to above is James Singer. See his "A Theorem in Finite Projective Geometry and Some Applications to Number Theory," Transactions of the American Mathematical Society 43 (1938), 377-385.For other singers, see Art Wars and today's obituaries.
Some background: the Log24 entry of this date seven years ago, and the entries preceding it on Las Vegas and painted ponies.
Wednesday, May 20, 2009
Wednesday May 20, 2009
Mathieu Group M24
The connection:
- "A Geometric Construction of the Steiner System S(4,7,23)," by Alphonse Baartmans, Walter Wallis, and Joseph Yucas, Discrete Mathematics 102 (1992) 177-186.
Abstract: "The Steiner system S(4,7,23) is constructed from the geometry of PG(3,2)."
- "A Geometric Construction of the Steiner System S(5,8,24)," by R. Mandrell and J. Yucas, Journal of Statistical Planning and Inference 56 (1996), 223-228.
Abstract: "The Steiner system S(5,8,24) is constructed from the geometry of PG(3,2)."
Tuesday, May 19, 2009
Tuesday May 19, 2009
"By far the most important structure in design theory is the Steiner system
— "Block Designs," 1995, by Andries E. Brouwer
"The Steiner system S(5, 8, 24) is a set S of 759 eight-element subsets ('octads') of a twenty-four-element set T such that any five-element subset of T is contained in exactly one of the 759 octads. Its automorphism group is the large Mathieu group M24."
— The Miracle Octad Generator (MOG) of R.T. Curtis (webpage)
"… in 1861 Mathieu… discovered five multiply transitive permutation groups…. In a little-known 1931 paper of Carmichael… they were first observed to be automorphism groups of exquisite finite geometries."
The 1931 paper of Carmichael is now available online from the publisher for $10.
Saturday, April 4, 2009
Saturday April 4, 2009
The Eight
Other knight figures:
Click on the SpringerLink
knight for a free copy
(pdf, 1.2 mb) of
the following paper
dealing with the geometry
underlying the R.T. Curtis
knight figures above:
Context:
Literature and Chess and
Sporadic Group References
Details:
| Adapted (for HTML) from the opening paragraphs of the above paper, W. Jonsson's 1970 "On the Mathieu Groups M22, M23, M24…"–
"[A]… uniqueness proof is offered here based upon a detailed knowledge of the geometric aspects of the elementary abelian group of order 16 together with a knowledge of the geometries associated with certain subgroups of its automorphism group. This construction was motivated by a question posed by D.R. Hughes and by the discussion Edge [5] (see also Conwell [4]) gives of certain isomorphisms between classical groups, namely
where A8 is the alternating group on eight symbols, S6 the symmetric group on six symbols, Sp(4,2) and PSp(4,2) the symplectic and projective symplectic groups in four variables over the field GF(2) of two elements, [and] PGL, PSL and SL are the projective linear, projective special linear and special linear groups (see for example [7], Kapitel II). The symplectic group PSp(4,2) is the group of collineations of the three dimensional projective space PG(3,2) over GF(2) which commute with a fixed null polarity tau…." References 4. Conwell, George M.: The three space PG(3,2) and its group. Ann. of Math. (2) 11, 60-76 (1910). 5. Edge, W.L.: The geometry of the linear fractional group LF(4,2). Proc. London Math. Soc. (3) 4, 317-342 (1954). 7. Huppert, B.: Endliche Gruppen I. Berlin-Heidelberg-New York: Springer 1967. |
Sunday, August 13, 2006
Sunday August 13, 2006
(continued from
New Year's Day, 2006)
See David P. Roberts (1998)
on Twin Sextic Algebras
for a discussion of
sextic twinning as an
analogue of duality
in vector spaces:
Related material:
R.T. Curtis, 2001:
"A Fresh Approach
to the Exceptional Automorphism
and Covers of the Symmetric Groups"
in
The Arabian Journal
for Science and Engineering.