Differences

This shows you the differences between two versions of the page.

--- defintion_of_subsets [2023/06/30 11:12] – mino
+++ defintion_of_subsets [2024/09/07 11:58] (current) – external edit 127.0.0.1
@@ Line 7: / Line 7: @@
     * Examples:
       * { 2, 9, 4 } is a magic series of order 3.
-      * { 10, 7, 14, 3 } is a magic seriest of order 4.
+      * { 10, 7, 14, 3 } is a magic series of order 4.
   * Any set of distinct positive integers { a<sub>1</sub>, a<sub>2</sub>, a<sub>3</sub> ...  } can be represented as an integer whose value is equal to 2<sup>a<sub>1</sub>-1</sup> + 2<sup>a<sub>2</sub>-1</sup> + 2<sup>a<sub>3</sub>-1</sup> + ... . We call it the binary representation of a distinct integer set.
     * Examples:
@@ Line 16: / Line 16: @@
     * We can define order on sets of distinct integers in accord with the order of their binary representation.
     * Example:
-      * A magic set { 5, 16, 2, 11 } is larger than { 12, 1, 15, 6 } because their binary representations are 1000 0100 0001 0010 ( = 0x8412 ) and 0100 1000 0010 0001 ( = 0x4821 ), respectively, and 0x8412 > 0x4821.
+      * A magic series { 5, 16, 2, 11 } is greater than { 12, 1, 15, 6 } because their binary representations are 1000 0100 0001 0010 ( = 0x8412 ) and 0100 1000 0010 0001 ( = 0x4821 ), respectively, and 0x8412 > 0x4821.
 ==== Complement of a magic series ====
-If you replace each element //x// of a magic series by // n<sup>2</sup> + 1 - x //, the result is also a magic series. We call the resulting set the **compliment** of the original magic series.
+If you replace each element //x// of a magic series by // n<sup>2</sup> + 1 - x //, the result is also a magic series. We call the resulting set the **complement** of the original magic series.
   * Examples in the case of order 4:
-    * { 12, 1, 15, 6 } is the compliment of { 5, 16, 2, 11 }.
+    * { 12, 1, 15, 6 } is the complement of { 5, 16, 2, 11 }.
-    * { 7, 10, 3, 14 } is the compliment of itself.
+    * { 7, 10, 3, 14 } is the complement of itself.
-In binary representations, the compliment of a magic series is obtained by the bit reverse manipulation.
+In binary representations, the complement of a magic series is obtained by the bit reverse manipulation.
   * Example in the case of order 4:
-    * The compliment of 1000 0100 0001 0010 is 0100 1000 0010 0001.
+    * The complement of 1000 0100 0001 0010 is 0100 1000 0010 0001.
 ==== The representative magic series of a magic square ====
-Every row and column of a magic square is always a magic series. We define the ** representative magic series ** of a magic square as **the largest magic series which forms a row, a column, the compliment of a row, or the compliment of a column**. Note that diagonal magic series are not considered a representative magic series.
+Every row and column of a magic square is always a magic series. We define the ** representative magic series ** of a magic square as **the largest magic series which forms a row, a column, the complement of a row, or the complement of a column**. Note that diagonal magic series are not considered a representative magic series.
 Example:
@@ Line 42: / Line 42: @@
   6 15 11
-is { 16, 13, 3, 2 } = 0x9006, which forms the compliment of the third column.
+is { 16, 13, 3, 2 } = 0x9006, which forms the complement of the third column.
-We classify magic squares by their representative magic series. This classification is invariant under rotations, reflections, M-transformations, and the compliment transformation.
+**We classify magic squares by their representative magic series. This classification is invariant under rotations, reflections, [[https://oeis.org/A266237|M-transformations]], and the complement transformation.
+**