|
Permutation Polynomial
In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map x \mapsto g(x) is a bijection. In case the ring is a finite field, the Dickson polynomials, which are closely related to the Chebyshev polynomials, provide examples. Over a finite field, every function, so in particular every permutation of the elements of that field, can be written as a polynomial function. In the case of finite rings Z/''n''Z, such polynomials have also been studied and applied in the interleaver component of error detection and correction algorithms. Single variable permutation polynomials over finite fields Let be the finite field of characteristic , that is, the field having elements where for some prime . A polynomial with coefficients in (symbolically written as ) is a ''permutation polynomial'' of if the function from to itself defined by c \mapsto f(c) is a permutation of . Due to the finiteness ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coprime Integers
In mathematics, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also '' is prime to '' or '' is coprime with ''. The numbers 8 and 9 are coprime, despite the fact that neither considered individually is a prime number, since 1 is their only common divisor. On the other hand, 6 and 9 are not coprime, because they are both divisible by 3. The numerator and denominator of a reduced fraction are coprime, by definition. Notation and testing Standard notations for relatively prime integers and are: and . In their 1989 textbook ''Concrete Mathematics'', Ronald Graham, Donald Knuth, and Oren Patashnik proposed that the notation a\perp b be used to indicate that and are relatively prime and that the term "prime" be used instead of coprime (a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Ring
In mathematics, more specifically abstract algebra, a finite ring is a ring that has a finite number of elements. Every finite field is an example of a finite ring, and the additive part of every finite ring is an example of an abelian finite group, but the concept of finite rings in their own right has a more recent history. Although rings have more structure than groups, the theory of finite rings is simpler than that of finite groups. For instance, the classification of finite simple groups was one of the major breakthroughs of 20th century mathematics, its proof spanning thousands of journal pages. On the other hand, it has been known since 1907 that any finite simple ring is isomorphic to the ring M_n(\mathbb_q) of ''n''-by-''n'' matrices over a finite field of order ''q'' (as a consequence of Wedderburn's theorems, described below). The number of rings with ''m'' elements, for ''m'' a natural number, is listed under in the On-Line Encyclopedia of Integer Sequences. Finit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Time
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally express ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
O-polynomial
In projective geometry an oval is a point set in a plane that is defined by incidence properties. The standard examples are the nondegenerate conics. However, a conic is only defined in a pappian plane, whereas an oval may exist in any type of projective plane. In the literature, there are many criteria which imply that an oval is a conic, but there are many examples, both infinite and finite, of ovals in pappian planes which are not conics. As mentioned, in projective geometry an oval is defined by incidence properties, but in other areas, ovals may be defined to satisfy other criteria, for instance, in differential geometry by differentiability conditions in the real plane. The higher dimensional analog of an oval is an ovoid in a projective space. A generalization of the oval concept is an abstract oval, which is a structure that is not necessarily embedded in a projective plane. Indeed, there exist abstract ovals which can not lie in any projective plane. Definition o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Plane
In mathematics, a projective plane is a geometric structure that extends the concept of a plane. In the ordinary Euclidean plane, two lines typically intersect in a single point, but there are some pairs of lines (namely, parallel lines) that do not intersect. A projective plane can be thought of as an ordinary plane equipped with additional "points at infinity" where parallel lines intersect. Thus ''any'' two distinct lines in a projective plane intersect at exactly one point. Renaissance artists, in developing the techniques of drawing in perspective, laid the groundwork for this mathematical topic. The archetypical example is the real projective plane, also known as the extended Euclidean plane. This example, in slightly different guises, is important in algebraic geometry, topology and projective geometry where it may be denoted variously by , RP2, or P2(R), among other notations. There are many other projective planes, both infinite, such as the complex projective plan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oval (projective Plane)
In projective geometry an oval is a point set in a plane that is defined by incidence properties. The standard examples are the nondegenerate conics. However, a conic is only defined in a pappian plane, whereas an oval may exist in any type of projective plane. In the literature, there are many criteria which imply that an oval is a conic, but there are many examples, both infinite and finite, of ovals in pappian planes which are not conics. As mentioned, in projective geometry an oval is defined by incidence properties, but in other areas, ovals may be defined to satisfy other criteria, for instance, in differential geometry by differentiability conditions in the real plane. The higher dimensional analog of an oval is an ovoid in a projective space. A generalization of the oval concept is an abstract oval, which is a structure that is not necessarily embedded in a projective plane. Indeed, there exist abstract ovals which can not lie in any projective plane. Definition of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Geometry
Finite is the opposite of infinite. It may refer to: * Finite number (other) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb, a verb form that has a subject, usually being inflected or marked for person and/or tense or aspect * "Finite", a song by Sara Groves from the album ''Invisible Empires'' See also * * Nonfinite (other) Nonfinite is the opposite of finite * a nonfinite verb is a verb that is not capable of serving as the main verb in an independent clause * a non-finite clause In linguistics, a non-finite clause is a dependent or embedded clause that represen ... {{disambiguation fr:Fini it:Finito ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
General Linear Group
In mathematics, the general linear group of degree ''n'' is the set of invertible matrices, together with the operation of ordinary matrix multiplication. This forms a group, because the product of two invertible matrices is again invertible, and the inverse of an invertible matrix is invertible, with identity matrix as the identity element of the group. The group is so named because the columns (and also the rows) of an invertible matrix are linearly independent, hence the vectors/points they define are in general linear position, and matrices in the general linear group take points in general linear position to points in general linear position. To be more precise, it is necessary to specify what kind of objects may appear in the entries of the matrix. For example, the general linear group over R (the set of real numbers) is the group of invertible matrices of real numbers, and is denoted by GL''n''(R) or . More generally, the general linear group of degree ''n'' over an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group (mathematics)
In mathematics, a group is a set and an operation that combines any two elements of the set to produce a third element of the set, in such a way that the operation is associative, an identity element exists and every element has an inverse. These three axioms hold for number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry groups arise naturally in the study of symmetries and geometric transformations: The symmetries of an object form a group, called the symmetry group of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Operator
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a Map (mathematics), mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of module (mathematics), modules over a ring (mathematics), ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a (linear) ''endomorphism''. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are Real number, real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Some ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linearised Polynomial
In mathematics, a linearised polynomial (or ''q''-polynomial) is a polynomial for which the exponents of all the constituent monomials are powers of ''q'' and the coefficients come from some extension field of the finite field of order ''q''. We write a typical example as L(x) = \sum_^n a_i x^, where each a_i is in F_ (= \operatorname(q^m)) for some fixed positive integer m. This special class of polynomials is important from both a theoretical and an applications viewpoint. The highly structured nature of their roots makes these roots easy to determine. Properties * The map is a linear map over any field containing F''q''. * The set of roots of ''L'' is an F''q''-vector space and is closed under the ''q''-Frobenius map. * Conversely, if ''U'' is any F''q''- linear subspace of some finite field containing F''q'', then the polynomial that vanishes exactly on ''U'' is a linearised polynomial. * The set of linearised polynomials over a given field is closed under addition and co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> General Linear Group")
