Cayley's theorem Representation of groups by permutations whose elements are the permutations of the underlying set of G. Explicitly, for each , the left-multiplication-by-g map sending each element x to gx is a permutation of G, andthe map sending each element g to is an injective homomorphism, so it defines an isomorphism from G onto a subgroup of . The homomorphism When G is finite, is finite too. . for some ; for instance, the order 6 group is not only isomorphic to a subgroup of , but also (trivially) isomorphic to a subgroup of .[3] The problem of finding the minimal-order symmetric group into which a given group G embeds is rather difficult.[4][5] Alperin and Bell note that "in general the fact that finite groups are imbedded in symmetric groups has not influenced the methods used to study finite groups".[6] When G is infinite, is infinite, but Cayley's theorem still applies. History[edit] Background[edit] .[13] In particular, taking A to be the underlying set of a group G produces a symmetric group denoted
Category:Integer sequences From Wikipedia, the free encyclopedia This category includes not only articles about certain types of integer sequences, but also articles about theorems and conjectures pertaining to, and properties of, integer sequences. Subcategories This category has the following 10 subcategories, out of 10 total. Pages in category "Integer sequences" The following 200 pages are in this category, out of approximately 219 total. (previous page) (next page)(previous page) (next page)
Algebraic combinatorics The Fano matroid, derived from the Fano plane. Matroids are one of many areas studied in algebraic combinatorics. Algebraic combinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra. However, within the last decade or so, algebraic combinatorics came to be seen more expansively as an area of mathematics where the interaction of combinatorial and algebraic methods is particularly strong and significant. See also[edit] References[edit] Bannai, Eiichi; Ito, Tatsuro (1984).
Measure-preserving dynamical system In mathematics, a measure-preserving dynamical system is an object of study in the abstract formulation of dynamical systems, and ergodic theory in particular. Definition[edit] A measure-preserving dynamical system is defined as a probability space and a measure-preserving transformation on it. with the following structure: is a set, is a σ-algebra over , is a probability measure, so that μ(X) = 1, and μ(∅) = 0, is a measurable transformation which preserves the measure , i.e., . , the identity function on X;, whenever all the terms are well-defined;, whenever all the terms are well-defined. The earlier, simpler case fits into this framework by definingTs = Ts for s ∈ N. The existence of invariant measures for certain maps and Markov processes is established by the Krylov–Bogolyubov theorem. Examples[edit] Examples include: Homomorphisms[edit] The concept of a homomorphism and an isomorphism may be defined. Consider two dynamical systems and . The system is then called a factor of is defined as T.
Statistical physics Branch of physics Statistical physics is a branch of physics that evolved from a foundation of statistical mechanics, which uses methods of probability theory and statistics, and particularly the mathematical tools for dealing with large populations and approximations, in solving physical problems. It can describe a wide variety of fields with an inherently stochastic nature. Scope[edit] Statistical mechanics[edit] Statistical mechanics provides a framework for relating the microscopic properties of individual atoms and molecules to the macroscopic or bulk properties of materials that can be observed in everyday life, therefore explaining thermodynamics as a natural result of statistics, classical mechanics, and quantum mechanics at the microscopic level. One of the most important equations in statistical mechanics (akin to , which is essentially a weighted sum of all possible states available to a system. where is the Boltzmann constant, is temperature and is energy of state . See also[edit]
Zero-sum problem From Wikipedia, the free encyclopedia Mathematical problem In number theory, zero-sum problems are certain kinds of combinatorial problems about the structure of a finite abelian group. Concretely, given a finite abelian group G and a positive integer n, one asks for the smallest value of k such that every sequence of elements of G of size k contains n terms that sum to 0. The classic result in this area is the 1961 theorem of Paul Erdős, Abraham Ginzburg, and Abraham Ziv.[1] They proved that for the group of integers modulo n, Explicitly this says that any multiset of 2n − 1 integers has a subset of size n the sum of whose elements is a multiple of n, but that the same is not true of multisets of size 2n − 2. More general results than this theorem exist, such as Olson's theorem, Kemnitz's conjecture (proved by Christian Reiher in 2003[3]), and the weighted EGZ theorem (proved by David J. See also[edit] References[edit] External links[edit] Further reading[edit]
Enumerative combinatorics Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets Si indexed by the natural numbers, enumerative combinatorics seeks to describe a counting function which counts the number of objects in Sn for each n. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description. The simplest such functions are closed formulas, which can be expressed as a composition of elementary functions such as factorials, powers, and so on. Finally, f(n) may be expressed by a formal power series, called its generating function, which is most commonly either the ordinary generating function or the exponential generating function is an asymptotic approximation to if as . .
Maximal ergodic theorem The maximal ergodic theorem is a theorem in ergodic theory, a discipline within mathematics. Suppose that is a probability space, that is a (possibly noninvertible) measure-preserving transformation, and that . Define by Then the maximal ergodic theorem states that for any λ ∈ R. This theorem is used to prove the point-wise ergodic theorem. Keane, Michael; Petersen, Karl (2006), "Easy and nearly simultaneous proofs of the Ergodic Theorem and Maximal Ergodic Theorem", Institute of Mathematical Statistics Lecture Notes - Monograph Series, Institute of Mathematical Statistics Lecture Notes - Monograph Series 48: 248–251, doi:10.1214/074921706000000266, ISBN 0-940600-64-1 .
Probability theory Branch of mathematics concerning probability Central subjects in probability theory include discrete and continuous random variables, probability distributions, and stochastic processes (which provide mathematical abstractions of non-deterministic or uncertain processes or measured quantities that may either be single occurrences or evolve over time in a random fashion). Although it is not possible to perfectly predict random events, much can be said about their behavior. Two major results in probability theory describing such behaviour are the law of large numbers and the central limit theorem. As a mathematical foundation for statistics, probability theory is essential to many human activities that involve quantitative analysis of data.[1] Methods of probability theory also apply to descriptions of complex systems given only partial knowledge of their state, as in statistical mechanics or sequential estimation. History of probability[edit] Treatment[edit] Motivation[edit] . . The function