|
Bruck–Ryser–Chowla Theorem
The Bruck– Ryser– Chowla theorem is a result on the combinatorics of symmetric block designs that implies nonexistence of certain kinds of design. It states that if a -design exists with (implying and ), then: * if is even, then is a square; * if is odd, then the following Diophantine equation has a nontrivial solution: *: . The theorem was proved in the case of projective planes by . It was extended to symmetric designs by . Projective planes In the special case of a symmetric design with λ = 1, that is, a projective plane, the theorem (which in this case is referred to as the Bruck–Ryser theorem) can be stated as follows: If a finite projective plane of order ''q'' exists and ''q'' is congruent to 1 or 2 (mod 4), then ''q'' must be the sum of two squares. Note that for a projective plane, the design parameters are ''v'' = ''b'' = ''q''2 + ''q'' + 1, ''r'' = ''k'' = ''q'' + 1, λ = 1. Thus, ''v'' is always odd in this case. The theorem, for example, rules out the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Bruck
Richard Hubert Bruck (December 26, 1914 – December 18, 1991) was an American mathematician best known for his work in the field of algebra, especially in its relation to projective geometry and combinatorics. Biography Bruck studied at the University of Toronto, where he received his doctorate in 1940 under the supervision of Richard Brauer. He spent most his career as a professor at University of Wisconsin–Madison, advising at least 31 doctoral students. He is best known for his 1949 paper coauthored with H. J. Ryser, the results of which became known as the Bruck–Ryser theorem (now known in a generalized form as the Bruck-Ryser-Chowla theorem), concerning the possible orders of finite projective planes. In 1946, he was awarded a Guggenheim Fellowship. In 1956, he was awarded the Chauvenet Prize for his articl''Recent Advances in the Foundations of Euclidean Plane Geometry'' In 1962, he was an invited speaker at the International Congress of Mathematicians in Stockholm ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sarvadaman Chowla
Sarvadaman D. S. Chowla (22 October 1907 – 10 December 1995) was an English-American mathematician, specializing in number theory. Early life He was born in London, since his father, Gopal Chowla, a professor of mathematics in Lahore, was then studying in Cambridge. His family returned to India, where he received his master's degree in 1928 from the Government College in Lahore. In 1931 he received his doctorate from the University of Cambridge, where he studied under J. E. Littlewood. He was born into a Punjabi Hindu Arora family. Career and awards Chowla then returned to India, where he taught at several universities, becoming head of mathematics at Government College, Lahore in 1936. During the difficulties arising from the partition of India in 1947, he left for the United States. There he visited the Institute for Advanced Study until the fall of 1949, then taught at the University of Kansas in Lawrence until moving to the University of Colorado in 1952. He moved to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Block Design
In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as ''blocks'', chosen such that number of occurrences of each element satisfies certain conditions making the collection of blocks exhibit symmetry (balance). Block designs have applications in many areas, including experimental design, finite geometry, physical chemistry, software testing, cryptography, and algebraic geometry. Without further specifications the term ''block design'' usually refers to a balanced incomplete block design (BIBD), specifically (and also synonymously) a 2-design, which has been the most intensely studied type historically due to its application in the design of experiments. Its generalization is known as a t-design. Overview A design is said to be ''balanced'' (up to ''t'') if all ''t''-subsets of the original set occur in equally many (i.e., ''λ'') blocks. When ''t'' is unspecified, it can usually be assumed to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Diophantine Equation
''Diophantine'' means pertaining to the ancient Greek mathematician Diophantus. A number of concepts bear this name: *Diophantine approximation In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria. The first problem was to know how well a real number can be approximated ... * Diophantine equation * Diophantine quintuple * Diophantine set {{disambig ... [...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 (geometry), plane. In the ordinary Euclidean plane, two lines typically intersect at 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 (graphical)#Renaissance, 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, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coding Theory
Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection and correction, data transmission and computer data storage, data storage. Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, linguistics, and computer science—for the purpose of designing efficient and reliable data transmission methods. This typically involves the removal of redundancy and the correction or detection of errors in the transmitted data. There are four types of coding: # Data compression (or ''source coding'') # Error detection and correction, Error control (or ''channel coding'') # Cryptography, Cryptographic coding # Line code, Line coding Data compression attempts to remove unwanted redundancy from the data from a source in order to transmit it more efficiently. For example, DEFLATE data compression makes files small ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Incidence Matrix
In mathematics, an incidence matrix is a logical matrix that shows the relationship between two classes of objects, usually called an incidence relation. If the first class is ''X'' and the second is ''Y'', the matrix has one row for each element of ''X'' and one column for each mapping from ''X'' to ''Y''. The entry in row ''x'' and column ''y'' is 1 if the vertex ''x'' is part of (called ''incident'' in this context) the mapping that corresponds to ''y'', and 0 if it is not. There are variations; see below. Graph theory Incidence matrix is a common graph representation in graph theory. It is different to an adjacency matrix, which encodes the relation of vertex-vertex pairs. Undirected and directed graphs In graph theory an undirected graph has two kinds of incidence matrices: unoriented and oriented. The ''unoriented incidence matrix'' (or simply ''incidence matrix'') of an undirected graph is a n\times m matrix ''B'', where ''n'' and ''m'' are the numbers of vertices and ed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hasse–Minkowski Theorem
The Hasse–Minkowski theorem is a fundamental result in number theory which states that two quadratic forms over a number field are equivalent if and only if they are equivalent ''locally at all places'', i.e. equivalent over every topological completion (ring theory), completion of the field (which may be real number, real, complex number, complex, or p-adic number, p-adic). A related result is that a quadratic space over a number field is isotropic quadratic form, isotropic if and only if it is isotropic locally everywhere, or equivalently, that a quadratic form over a number field nontrivially represents zero if and only if this holds for all completions of the field. The theorem was proved in the case of the field of rational numbers by Hermann Minkowski and generalized to number fields by Helmut Hasse. The same statement holds even more generally for all global fields. Importance The importance of the Hasse–Minkowski theorem lies in the novel paradigm it presented for ans ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Form
In mathematics, a quadratic form is a polynomial with terms all of degree two (" form" is another name for a homogeneous polynomial). For example, 4x^2 + 2xy - 3y^2 is a quadratic form in the variables and . The coefficients usually belong to a fixed field , such as the real or complex numbers, and one speaks of a quadratic form ''over'' . Over the reals, a quadratic form is said to be '' definite'' if it takes the value zero only when all its variables are simultaneously zero; otherwise it is '' isotropic''. Quadratic forms occupy a central place in various branches of mathematics, including number theory, linear algebra, group theory ( orthogonal groups), differential geometry (the Riemannian metric, the second fundamental form), differential topology ( intersection forms of manifolds, especially four-manifolds), Lie theory (the Killing form), and statistics (where the exponent of a zero-mean multivariate normal distribution has the quadratic form -\mathbf^\math ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Mathematical Monthly
''The American Mathematical Monthly'' is a peer-reviewed scientific journal of mathematics. It was established by Benjamin Finkel in 1894 and is published by Taylor & Francis on behalf of the Mathematical Association of America. It is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. The editor-in-chief An editor-in-chief (EIC), also known as lead editor or chief editor, is a publication's editorial leader who has final responsibility for its operations and policies. The editor-in-chief heads all departments of the organization and is held accoun ... is Vadim Ponomarenko ( San Diego State University). The journal gives the Lester R. Ford Award annually to "authors of articles of expository excellence" published in the journal. Editors-in-chief The following persons are or have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theorems In Combinatorics
In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In mainstream mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice (ZFC), or of a less powerful theory, such as Peano arithmetic. Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as ''theorems'' only the most important results, and use the terms ''lemma'', ''proposition'' and ''corollary'' for less important theorems. In mathematical logic, the concepts of theorems and proofs have been formalized in order to allow mathematical reas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
