|
Near-field (mathematics)
In mathematics, a near-field is an algebraic structure similar to a division ring, except that it has only one of the two distributive laws. Alternatively, a near-field is a near-ring in which there is a multiplicative identity and every non-zero element has a multiplicative inverse. Definition A near-field is a set Q together with two binary operations, + (addition) and \cdot (multiplication), satisfying the following axioms for all a, b, c in Q . :A1: (Q, +) is an abelian group. :A2: (a \cdot b) \cdot c = a \cdot (b \cdot c) (The associative law for multiplication). :A3: (a + b) \cdot c = a \cdot c + b \cdot c (The right distributive law). :A4: Q contains a non-zero element 1 such that 1 \cdot a = a \cdot 1 = a (Multiplicative identity). :A5: For every non-zero element d in Q there exists an element d^ such that d \cdot d^ = 1 = d^ \cdot d (Multiplicative inverse). Notes on the definition # The above is, strictly speaking, a definition of a ''right'' near-field. By rep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hans Zassenhaus
Hans Julius Zassenhaus (28 May 1912 – 21 November 1991) was a German mathematician, known for work in many parts of abstract algebra, and as a pioneer of computer algebra. Biography He was born in Koblenz in 1912. His father was a historian and advocate for Reverence for Life as expressed by Albert Schweitzer. Hans had two brothers, Guenther and Wilfred, and sister Hiltgunt, who wrote an autobiography in 1974. According to her, their father lost his position as school principal due to his philosophy. She wrote: Hiltgunt Zassenhaus (1974) ''Walls: Resisting the Third Reich'', Beacon Press :Hans, my eldest brother, studied mathematics. My brothers Guenther and Wilfred were in medical school. ... only students who participated in Nazi activities would get scholarships. That left us out. Together we made an all-out effort. ... soon our house became a beehive. Day in and day out for the next four years a small army of children of all ages would arrive to be tutored. At the Universi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Ternary Ring
In mathematics, an algebraic structure (R,T) consisting of a non-empty set R and a ternary mapping T \colon R^3 \to R \, may be called a ternary system. A planar ternary ring (PTR) or ternary field is special type of ternary system used by Marshall Hall (mathematician), Marshall Hall to construct projective planes by means of coordinates. A planar ternary ring is not a Ring (mathematics), ring in the traditional sense, but any Field (mathematics), field gives a planar ternary ring where the operation T is defined by T(a,b,c) = ab + c. Thus, we can think of a planar ternary ring as a generalization of a field where the ternary operation takes the place of both addition and multiplication. There is wide variation in the terminology. Planar ternary rings or ternary fields as defined here have been called by other names in the literature, and the term "planar ternary ring" can mean a variant of the system defined here. The term "ternary ring" often means a planar ternary ring, but i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nearring
In mathematics, a near-ring (also near ring or nearring) is an algebraic structure similar to a ring but satisfying fewer axioms. Near-rings arise naturally from functions on groups. Definition A set ''N'' together with two binary operations + (called ''addition'') and ⋅ (called ''multiplication'') is called a (right) ''near-ring'' if: * ''N'' is a group (not necessarily abelian) under addition; * multiplication is associative (so ''N'' is a semigroup under multiplication); and * multiplication ''on the right'' distributes over addition: for any ''x'', ''y'', ''z'' in ''N'', it holds that (''x'' + ''y'')⋅''z'' = (''x''⋅''z'') + (''y''⋅''z'').G. Pilz, (1982), "Near-Rings: What They Are and What They Are Good For" in ''Contemp. Math.'', 9, pp. 97–119. Amer. Math. Soc., Providence, R.I., 1981. Similarly, it is possible to define a ''left near-ring'' by replacing the right distributive law by the corresponding left distributive law. Both right and left near-rings occur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Platonic Solid
In geometry, a Platonic solid is a Convex polytope, convex, regular polyhedron in three-dimensional space, three-dimensional Euclidean space. Being a regular polyhedron means that the face (geometry), faces are congruence (geometry), congruent (identical in shape and size) regular polygons (all angles congruent and all edge (geometry), edges congruent), and the same number of faces meet at each Vertex (geometry), vertex. There are only five such polyhedra: Geometers have studied the Platonic solids for thousands of years. They are named for the ancient Greek philosopher Plato, who hypothesized in one of his dialogues, the ''Timaeus (dialogue), Timaeus'', that the classical elements were made of these regular solids. History The Platonic solids have been known since antiquity. It has been suggested that certain carved stone balls created by the late Neolithic people of Scotland represent these shapes; however, these balls have rounded knobs rather than being polyhedral, the num ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Icosahedral Group
In mathematics, the binary icosahedral group 2''I'' or Coxeter&Moser: Generators and Relations for discrete groups: : Rl = Sm = Tn = RST is a certain nonabelian group of order 120. It is an extension of the icosahedral group ''I'' or (2,3,5) of order 60 by the cyclic group of order 2, and is the preimage of the icosahedral group under the 2:1 covering homomorphism :\operatorname(3) \to \operatorname(3)\, of the special orthogonal group by the spin group. It follows that the binary icosahedral group is a discrete subgroup of Spin(3) of order 120. It should not be confused with the full icosahedral group, which is a different group of order 120, and is rather a subgroup of the orthogonal group O(3). In the algebra of quaternions, the binary icosahedral group is concretely realized as a discrete subgroup of the versors, which are the quaternions of norm one. For more information see Quaternions and spatial rotations. Elements Explicitly, the binary icosahedral group is giv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Octahedral Group
In mathematics, the binary octahedral group, name as 2O or Coxeter&Moser: Generators and Relations for discrete groups: : Rl = Sm = Tn = RST is a certain nonabelian group of order 48. It is an extension of the chiral octahedral group ''O'' or (2,3,4) of order 24 by a cyclic group of order 2, and is the preimage of the octahedral group under the 2:1 covering homomorphism \operatorname(3) \to \operatorname(3) of the special orthogonal group by the spin group. It follows that the binary octahedral group is a discrete subgroup of Spin(3) of order 48. The binary octahedral group is most easily described concretely as a discrete subgroup of the unit quaternions, under the isomorphism \operatorname(3) \cong \operatorname(1) where Sp(1) is the multiplicative group of unit quaternions. (For a description of this homomorphism see the article on quaternions and spatial rotations.) Elements Explicitly, the binary octahedral group is given as the union of the 24 Hurwitz units :\ with all ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Tetrahedral Group
In mathematics, the binary tetrahedral group, denoted 2T or ,Coxeter&Moser: Generators and Relations for discrete groups: : Rl = Sm = Tn = RST is a certain nonabelian group of order (group theory), order 24. It is an group extension, extension of the tetrahedral group T or (2,3,3) of order 12 by a cyclic group of order 2, and is the preimage of the tetrahedral group under the 2:1 covering homomorphism Spin(3) → SO(3) of the special orthogonal group by the spin group. It follows that the binary tetrahedral group is a discrete subgroup of Spin(3) of order 24. The complex reflection group named 3(24)3 by Geoffrey Colin Shephard, G.C. Shephard or 3[3]3 and by Coxeter, is isomorphic to the binary tetrahedral group. The binary tetrahedral group is most easily described concretely as a discrete subgroup of the unit quaternions, under the isomorphism , where Sp(1) is the multiplicative group of unit quaternions. (For a description of this homomorphism see the ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are the integers mod n, integers mod p when p is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number p and every positive integer k there are fields of order p^k. All finite fields of a given order are isomorphism, isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set that is a fiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frobenius Group
In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius. Structure Suppose ''G'' is a Frobenius group consisting of permutations of a set ''X''. A subgroup ''H'' of ''G'' fixing a point of ''X'' is called a Frobenius complement. The identity element together with all elements not in any conjugate of ''H'' form a normal subgroup called the Frobenius kernel ''K''. (This is a theorem due to ; there is still no proof of this theorem that does not use character theory, although see .) The Frobenius group ''G'' is the semidirect product of ''K'' and ''H'': :G=K\rtimes H. Both the Frobenius kernel and the Frobenius complement have very restricted structures. proved that the Frobenius kernel ''K'' is a nilpotent group. If ''H'' has even order then ''K'' is abelian. The Frobenius complement ''H'' has the property th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hill Cipher
In classical cryptography, the Hill cipher is a polygraphic substitution cipher based on linear algebra. Invented by Lester S. Hill in 1929, it was the first polygraphic cipher in which it was practical (though barely) to operate on more than three symbols at once. The following discussion assumes an elementary knowledge of matrices. Encryption Each letter is represented by a number modulo 26. Though this is not an essential feature of the cipher, this simple scheme is often used: To encrypt a message, each block of ''n'' letters (considered as an ''n''-component vector) is multiplied by an invertible ''n'' × ''n'' matrix, against modulus 26. To decrypt the message, each block is multiplied by the inverse of the matrix used for encryption. The matrix used for encryption is the cipher key, and it should be chosen randomly from the set of invertible ''n'' × ''n'' matrices (modulo 26). The cipher can, of course, be adapted to an alphabet with any number of lette ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cambridge University Press
Cambridge University Press was the university press of the University of Cambridge. Granted a letters patent by King Henry VIII in 1534, it was the oldest university press in the world. Cambridge University Press merged with Cambridge Assessment to form Cambridge University Press and Assessment under Queen Elizabeth II's approval in August 2021. With a global sales presence, publishing hubs, and offices in more than 40 countries, it published over 50,000 titles by authors from over 100 countries. Its publications include more than 420 academic journals, monographs, reference works, school and university textbooks, and English language teaching and learning publications. It also published Bibles, runs a bookshop in Cambridge, sells through Amazon, and has a conference venues business in Cambridge at the Pitt Building and the Sir Geoffrey Cass Sports and Social Centre. It also served as the King's Printer. Cambridge University Press, as part of the University of Cambridge, was a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
