|
Graham–Rothschild Theorem
In mathematics, the Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after Ronald Graham and Bruce Lee Rothschild, who published its proof in 1971. Through the work of Graham, Rothschild, and in 1972, it became part of the foundations of structural Ramsey theory. A special case of the Graham–Rothschild theorem motivates the definition of Graham's number, a number that was popularized by Martin Gardner in ''Scientific American'' and listed in the ''Guinness Book of World Records'' as the largest number ever appearing in a mathematical proof. Background The theorem involves sets of strings, all having the same length n, over a finite alphabet, together with a group acting on the alphabet. A combinatorial cube is a subset of strings determined by constraining some positions of the string to contain a fixed letter of the alphabet, and by constraining other pairs of positions to be equal to each othe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramsey Theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of the mathematical field of combinatorics that focuses on the appearance of order in a substructure given a structure of a known size. Problems in Ramsey theory typically ask a question of the form: "how big must some structure be to guarantee that a particular property holds?" Examples A typical result in Ramsey theory starts with some mathematical structure that is then cut into pieces. How big must the original structure be in order to ensure that at least one of the pieces has a given interesting property? This idea can be defined as partition regularity. For example, consider a complete graph of order ''n''; that is, there are ''n'' vertices and each vertex is connected to every other vertex by an edge. A complete graph of order 3 is called a triangle. Now colour each edge either red or blue. How large must ''n'' be in order to ensure that there is either a blue triangle or a re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartesian Coordinates
In geometry, a Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of real numbers called ''coordinates'', which are the signed distances to the point from two fixed perpendicular oriented lines, called '' coordinate lines'', ''coordinate axes'' or just ''axes'' (plural of ''axis'') of the system. The point where the axes meet is called the '' origin'' and has as coordinates. The axes directions represent an orthogonal basis. The combination of origin and basis forms a coordinate frame called the Cartesian frame. Similarly, the position of any point in three-dimensional space can be specified by three ''Cartesian coordinates'', which are the signed distances from the point to three mutually perpendicular planes. More generally, Cartesian coordinates specify the point in an -dimensional Euclidean space for any dimension . These coordinates are the signed distances from the point to mutually perpendicular fixed h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Synthese
''Synthese'' () is a monthly peer-reviewed academic journal covering the epistemology, methodology, and philosophy of science, and related issues. The name ''Synthese'' (from the Dutch for '' synthesis'') finds its origin in the intentions of its founding editors: making explicit the supposed internal coherence between the different, highly specialised scientific disciplines. Jaakko Hintikka was editor-in-chief from 1965 to 2002. The current editors-in-chief are Otávio Bueno (University of Miami), Wiebe van der Hoek (University of Liverpool), and Kristie Miller (University of Sydney). Editorial decision controversies In 2011, the journal became involved in a controversy over intelligent design. The printed version of the special issue ''Evolution and Its Rivals'', which appeared two years after the online version, was supplied with a disclaimer from the then editors of the journal that "appeared to undermine he authorsand the guest editors". The journal engendered controversy a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Advances In Mathematics
''Advances in Mathematics'' is a peer-reviewed scientific journal covering research on pure mathematics. It was established in 1961 by Gian-Carlo Rota. The journal publishes 18 issues each year, in three volumes. At the origin, the journal aimed at publishing articles addressed to a broader "mathematical community", and not only to mathematicians in the author's field. Herbert Busemann writes, in the preface of the first issue, "The need for expository articles addressing either all mathematicians or only those in somewhat related fields has long been felt, but little has been done outside of the USSR. The serial publication ''Advances in Mathematics'' was created in response to this demand." Abstracting and indexing The journal is abstracted and indexed in: * [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proceedings Of The National Academy Of Sciences Of The United States Of America
''Proceedings of the National Academy of Sciences of the United States of America'' (often abbreviated ''PNAS'' or ''PNAS USA'') is a peer-reviewed multidisciplinary scientific journal. It is the official journal of the National Academy of Sciences, published since 1915, and publishes original research, scientific reviews, commentaries, and letters. According to ''Journal Citation Reports'', the journal has a 2022 impact factor of 9.4. ''PNAS'' is the second most cited scientific journal, with more than 1.9 million cumulative citations from 2008 to 2018. In the past, ''PNAS'' has been described variously as "prestigious", "sedate", "renowned" and "high impact". ''PNAS'' is a delayed open-access journal, with an embargo period of six months that can be bypassed for an author fee ( hybrid open access). Since September 2017, open access articles are published under a Creative Commons license. Since January 2019, ''PNAS'' has been online-only, although print issues are available ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Games (column)
Over a period of 24 years (January 1957 – December 1980), Martin Gardner wrote 288 consecutive monthly "Mathematical Games" columns for ''Scientific American'' magazine. During the next years, until June 1986, Gardner wrote 9 more columns, bringing his total to 297. During this period other authors wrote most of the columns. In 1981, Gardner's column alternated with a new column by Douglas Hofstadter called "Metamagical_Themas#List_of_Hofstadter's_%22Metamagical_Themas%22_columns, Metamagical Themas" (an anagram of "Mathematical Games"). The table below lists Gardner's columns. Twelve of Gardner's columns provided the cover art for that month's magazine, indicated by "[cover]" in the table with a hyperlink to the cover. Other articles by Gardner Gardner wrote 5 other articles for ''Scientific American''. His flexagon article in December 1956 was in all but name the first article in the series of ''Mathematical Games'' columns and led directly to the series which began the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transactions Of The American Mathematical Society
The ''Transactions of the American Mathematical Society'' is a monthly peer-reviewed scientific journal of pure and applied mathematics published by the American Mathematical Society. It was established in 1900. As a requirement, all articles must be more than 15 printed pages. Its ISSN number is 0002-9947. See also * ''Bulletin of the American Mathematical Society'' * ''Journal of the American Mathematical Society'' * '' Memoirs of the American Mathematical Society'' * '' Notices of the American Mathematical Society'' * ''Proceedings of the American Mathematical Society'' References External links * ''Transactions of the American Mathematical Society''on JSTOR JSTOR ( ; short for ''Journal Storage'') is a digital library of academic journals, books, and primary sources founded in 1994. Originally containing digitized back issues of academic journals, it now encompasses books and other primary source ... American Mathematical Society academic journals Mathematics jo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Upper Bound
In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is every element of . Dually, a lower bound or minorant of is defined to be an element of that is less than or equal to every element of . A set with an upper (respectively, lower) bound is said to be bounded from above or majorized (respectively bounded from below or minorized) by that bound. The terms bounded above (bounded below) are also used in the mathematical literature for sets that have upper (respectively lower) bounds. Examples For example, is a lower bound for the set (as a subset of the integers or of the real numbers, etc.), and so is . On the other hand, is not a lower bound for since it is not smaller than every element in . and other numbers ''x'' such that would be an upper bound for ''S''. The set has as both an upper bound and a lower bound; all other numbers are either an upper bound or a lower bound for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Graph
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose. Properties The complete graph on vertices is denoted by . Some sources claim that the letter in this notation stands for the German word , but the German name for a complete graph, , does not contain the letter , and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory. has edg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercube
In geometry, a hypercube is an ''n''-dimensional analogue of a square ( ) and a cube ( ); the special case for is known as a ''tesseract''. It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in ''n'' dimensions is equal to \sqrt. An ''n''-dimensional hypercube is more commonly referred to as an ''n''-cube or sometimes as an ''n''-dimensional cube. The term measure polytope (originally from Elte, 1912) is also used, notably in the work of H. S. M. Coxeter who also labels the hypercubes the γn polytopes. The hypercube is the special case of a hyperrectangle (also called an ''n-orthotope''). A ''unit hypercube'' is a hypercube whose side has length one unit. Often, the hypercube whose corners (or ''vertices'') are the 2''n'' points in R''n'' with each coordinate equal to 0 or 1 i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hales–Jewett Theorem
In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory named after Alfred W. Hales and Robert I. Jewett, concerning the degree to which high-dimensional objects must necessarily exhibit some combinatorial structure. An informal geometric statement of the theorem is that for any positive integers ''n'' and ''c'' there is a number ''H'' such that if the cells of a ''H''-dimensional ''n''×''n''×''n''×...×''n'' cube are colored with ''c'' colors, there must be one row, column, or certain diagonal (more details below) of length ''n'' all of whose cells are the same color. In other words, assuming ''n'' and ''c'' are fixed, the higher-dimensional, multi-player, ''n''-in-a-row generalization of a game of tic-tac-toe with ''c'' players cannot end in a draw, no matter how large ''n'' is, no matter how many people ''c'' are playing, and no matter which player plays each turn, provided only that it is played on a board of sufficiently high dimens ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
