|
Costas Array
In mathematics, a Costas array can be regarded geometrically as a set of ''n'' points, each at the center of a square in an ''n''×''n'' square tiling such that each row or column contains only one point, and all of the ''n''(''n'' − 1)/2 displacement vectors between each pair of dots are distinct. This results in an ideal "thumbtack" auto- ambiguity function, making the arrays useful in applications such as sonar and radar. Costas arrays can be regarded as two-dimensional cousins of the one-dimensional Golomb ruler construction, and, as well as being of mathematical interest, have similar applications in experimental design and phased array radar engineering. Costas arrays are named after John P. Costas, who first wrote about them in a 1965 technical report. Independently, Edgar Gilbert also wrote about them in the same year, publishing what is now known as the logarithmic Welch method of constructing Costas arrays. Numerical representation A Costas array ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a '' geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
Primitive Root Modulo N
In modular arithmetic, a number is a primitive root modulo if every number coprime to is congruent to a power of modulo . That is, is a ''primitive root modulo'' if for every integer coprime to , there is some integer for which ≡ (mod ). Such a value is called the index or discrete logarithm of to the base modulo . So is a ''primitive root modulo'' if and only if is a generator of the multiplicative group of integers modulo . Gauss defined primitive roots in Article 57 of the '' Disquisitiones Arithmeticae'' (1801), where he credited Euler with coining the term. In Article 56 he stated that Lambert and Euler knew of them, but he was the first to rigorously demonstrate that primitive roots exist for a prime . In fact, the ''Disquisitiones'' contains two proofs: The one in Article 54 is a nonconstructive existence proof, while the proof in Article 55 is constructive. Elementary example The number 3 is a primitive root modulo 7 beca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
A008404
A, or a, is the first letter and the first vowel of the Latin alphabet, used in the modern English alphabet, the alphabets of other western European languages and others worldwide. Its name in English is ''a'' (pronounced ), plural ''aes''. It is similar in shape to the Ancient Greek letter alpha, from which it derives. The uppercase version consists of the two slanting sides of a triangle, crossed in the middle by a horizontal bar. The lowercase version can be written in two forms: the double-storey a and single-storey ɑ. The latter is commonly used in handwriting and fonts based on it, especially fonts intended to be read by children, and is also found in italic type. In English grammar, " a", and its variant " an", are indefinite articles. History The earliest certain ancestor of "A" is aleph (also written 'aleph), the first letter of the Phoenician alphabet, which consisted entirely of consonants (for that reason, it is also called an abjad to distinguish it fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
On-Line Encyclopedia Of Integer Sequences
The On-Line Encyclopedia of Integer Sequences (OEIS) is an online database of integer sequences. It was created and maintained by Neil Sloane while researching at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009. Sloane is chairman of the OEIS Foundation. OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. , it contains over 350,000 sequences, making it the largest database of its kind. Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword, by subsequence, or by any of 16 fields. History Neil Sloane started collecting integer sequences as a graduate student in 1965 to support his work in combinatorics. The database was at first stored on punche ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
MacTech
''MacTech'' is the journal of Apple technology, a monthly magazine for consultants, IT Pros, system administrators, software developers, and other technical users of the Apple Macintosh line of computers. The magazine was called "MacTech" for its first two issues, starting in 1984, after which its name was changed to MacTutor. At the time the magazine defined itself as "a technical publication devoted to advancing programming knowledge of the Macintosh for both hacker and professional alike". In the spring of 1989 a new and separate magazine called ''MacTech'' was launched by TechAlliance, a global Apple users group headquartered in Renton, WA that hosted the Apple Programmers and Developers Association (APDA). The founding editor of ''MacTech'' was Andrew Himes, and Himes described the magazine as "The journal designed by people who program and develop for the Apple Macintosh. You hold in your hands what is designed to be a legendary publication for a legendary computer. In ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Springer Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
 |
Combinatorial Design
Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of ''balance'' and/or ''symmetry''. These concepts are not made precise so that a wide range of objects can be thought of as being under the same umbrella. At times this might involve the numerical sizes of set intersections as in block designs, while at other times it could involve the spatial arrangement of entries in an array as in sudoku grids. Combinatorial design theory can be applied to the area of design of experiments. Some of the basic theory of combinatorial designs originated in the statistician Ronald Fisher's work on the design of biological experiments. Modern applications are also found in a wide gamut of areas including finite geometry, tournament scheduling, lotteries, mathematical chemistry, mathematical biology, algorithm design and analysis, networking, g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Dihedral Group
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. Usually, we take n \ge 3 here. The associated rotations and reflections make up the dihedral group \mathrm_n. If n is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides and n/2 axes of symmetry connecting ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set , namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). These are all the possible orderings of this three-element set. Anagrams of words whose letters are different are also permutations: the letters are already ordered in the original word, and the anagram is a reordering of the letters. The study of permutations of finite sets is an important topic in the fields of combinatorics and group theory. Permutations are used in almost every branch of mathematics, and in many other fields of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
 |
Hexagonal Lattice
The hexagonal lattice or triangular lattice is one of the five two-dimensional Bravais lattice types. The symmetry category of the lattice is wallpaper group p6m. The primitive translation vectors of the hexagonal lattice form an angle of 120° and are of equal lengths, : , \mathbf a_1, = , \mathbf a_2, = a. The reciprocal lattice of the hexagonal lattice is a hexagonal lattice in reciprocal space with orientation changed by 90° and primitive lattice vectors of length : g=\frac. Honeycomb point set The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset triangular lattices. In nature, carbon atoms of the two-dimensional material graphene are arranged in a honeycomb point set. Crystal classes The ''hexagonal lattice'' class names, Schönflies notation, Hermann-Mauguin notation, orbifold nota ... [...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 that contains a finite number of elements. As with any field, a finite field is a 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 given by the integers mod when 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 and every positive integer there are fields of order p^k, all of which are 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 which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
|
|
Primitive Element (finite Field)
In field theory, a primitive element of a finite field is a generator of the multiplicative group of the field. In other words, is called a primitive element if it is a primitive th root of unity in ; this means that each non-zero element of can be written as for some integer . If is a prime number, the elements of can be identified with the integers modulo . In this case, a primitive element is also called a primitive root modulo . For example, 2 is a primitive element of the field and , but not of since it generates the cyclic subgroup of order 3; however, 3 is a primitive element of . The minimal polynomial of a primitive element is a primitive polynomial. Properties Number of primitive elements The number of primitive elements in a finite field is , where is Euler's totient function In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |