Related Research Articles
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.
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
In topology, the Jordan curve theorem, formulated by Camille Jordan in 1887, asserts that every Jordan curve divides the plane into an "interior" region bounded by the curve and an "exterior" region containing all of the nearby and far away exterior points. Every continuous path connecting a point of one region to a point of the other intersects with the curve somewhere. While the theorem seems intuitively obvious, it takes some ingenuity to prove it by elementary means. "Although the JCT is one of the best known topological theorems, there are many, even among professional mathematicians, who have never read a proof of it.". More transparent proofs rely on the mathematical machinery of algebraic topology, and these lead to generalizations to higher-dimensional spaces.
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
Herbert Saul Wilf was an American mathematician, specializing in combinatorics and graph theory. He was the Thomas A. Scott Professor of Mathematics in Combinatorial Analysis and Computing at the University of Pennsylvania. He wrote numerous books and research papers. Together with Neil Calkin he founded The Electronic Journal of Combinatorics in 1994 and was its editor-in-chief until 2001.
Mary Celine Fasenmyer, RSM was an American mathematician and Catholic religious sister. She is most noted for her work on hypergeometric functions and linear algebra.
Victor LaRue Klee, Jr. was a mathematician specialising in convex sets, functional analysis, analysis of algorithms, optimization, and combinatorics. He spent almost his entire career at the University of Washington in Seattle.
The Kempner series is a modification of the harmonic series, formed by omitting all terms whose denominator expressed in base 10 contains the digit 9. That is, it is the sum
In number theory, a Sidon sequence is a sequence of natural numbers in which all pairwise sums (for ) are different. Sidon sequences are also called Sidon sets; they are named after the Hungarian mathematician Simon Sidon, who introduced the concept in his investigations of Fourier series.
In number theory, the Calkin–Wilf tree is a tree in which the vertices correspond one-to-one to the positive rational numbers. The tree is rooted at the number 1, and any rational number expressed in simplest terms as the fraction a/b has as its two children the numbers a/a + b and a + b/b. Every positive rational number appears exactly once in the tree. It is named after Neil Calkin and Herbert Wilf, but appears in other works including Kepler's Harmonices Mundi.
In combinatorial mathematics and theoretical computer science, a (classical) permutation pattern is a sub-permutation of a longer permutation. Any permutation may be written in one-line notation as a sequence of entries representing the result of applying the permutation to the sequence 123...; for instance the sequence 213 represents the permutation on three elements that swaps elements 1 and 2. If π and σ are two permutations represented in this way, then π is said to contain σ as a pattern if some subsequence of the entries of π has the same relative order as all of the entries of σ.
George Barry Purdy was a mathematician and computer scientist who specialized in cryptography, combinatorial geometry, and number theory. Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, officially under the supervision of Paul T. Bateman, but his de facto adviser was Paul Erdős. He was on the faculty in the mathematics department at Texas A&M University for 11 years, and was appointed the Geier Professor of computer science at the University of Cincinnati in 1986.
Lawrence Allen Zalcman was a professor of Mathematics at Bar-Ilan University in Israel. His research primarily concerned Complex analysis, potential theory, and the relations of these ideas to approximation theory, harmonic analysis, integral geometry and partial differential equations. On top of his scientific achievements, Zalcman received numerous awards for mathematical exposition, including the Chauvenet Prize in 1976, the Lester R. Ford Award in 1975 and 1981, and the Paul R. Halmos – Lester R. Ford Award in 2017. In addition to Bar-Ilan University, Zalcman taught at the University of Maryland and Stanford University in the United States.
The David P. Robbins Prize for papers reporting novel research in algebra, combinatorics, or discrete mathematics is awarded both by the American Mathematical Society (AMS) and by the Mathematical Association of America (MAA). The AMS award recognizes papers with a significant experimental component on a topic which is broadly accessible which provide a simple statement of the problem and clear exposition of the work. Papers eligible for the MAA award are judged on quality of research, clarity of exposition, and accessibility to undergraduates. Both awards consist of $5000 and are awarded once every three years. They are named in the honor of David P. Robbins and were established in 2005 by the members of his family.
Herbert Ellsworth Slaught (1861–1937) was an American mathematician who was president of the Mathematical Association of America and editor of the journal American Mathematical Monthly.
In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of other two numbers.
Dan Margalit is an American mathematician at Vanderbilt University. His research fields include geometric group theory and low-dimensional topology, with a particular focus on mapping class groups of surfaces.
A Bohemian matrix family is a set of matrices whose entries are members of a fixed, finite, and discrete set, referred to as the "population". The term "Bohemian" was first used to refer to matrices with entries consisting of integers of bounded height, hence the name, derived from the acronym BOunded HEight Matrix of Integers (BOHEMI). The majority of published research on these matrix families studies populations of integers, although this is not strictly true of all possible Bohemian matrices. There is no single family of Bohemian matrices. Instead, a matrix can be said to be Bohemian with respect to a set from which its entries are drawn. Bohemian matrices may possess additional structure. For example, they may be Toeplitz matrices or upper Hessenberg matrices.
The Steinhaus chessboard theorem is the following theorem, due to Hugo Steinhaus:
Consider a chessboard on which some cells contain landmines. Then, either the king can cross the board from left to right without meeting a mined square, or the rook can cross the board from top to bottom moving only on mined squares.
References
- ↑ About the Journal The Electronic Journal of Combinatorics
- ↑ "Recounting the Rationals", by Neil Calkin and Herbert S. Wilf, The American Mathematical Monthly, Vol. 107, No. 4 (Apr. 2000), pp. 360-363
- ↑ Neil Calkin at the Mathematics Genealogy Project
- ↑ Calkin ResearchGate
- ↑ Mathematical and Statistical Sciences: Neil Calkin Clemson University
- ↑ Neil J. Calkin and Paul Erdős, "On a Class of Aperiodic Sum-free Sets", Mathematical Proceedings of the Cambridge Philosophical Society 120 (1996), 1-5.
- ↑ My Brain Is Open : The Mathematical Journeys of Paul Erdos (1998) by Bruce Schechter, p. 119
