HOME
*



picture info

Dyson Conjecture
In mathematics, the Dyson conjecture is a conjecture about the constant term of certain Laurent polynomials, proved independently in 1962 by Kenneth G. Wilson, Wilson and Gunson. George Andrews (mathematician), Andrews generalized it to the q-Dyson conjecture, proved by Doron Zeilberger, Zeilberger and David Bressoud, Bressoud and sometimes called the Zeilberger–Bressoud theorem. Ian G. Macdonald, Macdonald generalized it further to more general root systems with the Macdonald constant term conjecture, proved by Ivan Cherednik, Cherednik. Dyson conjecture The Dyson conjecture states that the Laurent polynomial :\prod _(1-t_i/t_j)^ has constant term :\frac. The conjecture was first proved independently by and . later found a short proof, by observing that the Laurent polynomials, and therefore their constant terms, satisfy the recursion relations :F(a_1,\dots,a_n) = \sum_^nF(a_1,\dots,a_i-1,\dots,a_n). The case ''n'' = 3 of Dyson's conjecture follows from the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Freeman Dyson
Freeman John Dyson (15 December 1923 – 28 February 2020) was an English-American theoretical physicist and mathematician known for his works in quantum field theory, astrophysics, random matrices, mathematical formulation of quantum mechanics, condensed matter physics, nuclear physics, and engineering. He was Professor Emeritus in the Institute for Advanced Study in Princeton and a member of the Board of Sponsors of the Bulletin of the Atomic Scientists. Dyson originated several concepts that bear his name, such as Dyson's transform, a fundamental technique in additive number theory, which he developed as part of his proof of Mann's theorem; the Dyson tree, a hypothetical genetically engineered plant capable of growing in a comet; the Dyson series, a perturbative series where each term is represented by Feynman diagrams; the Dyson sphere, a thought experiment that attempts to explain how a spacefaring, space-faring civilization would meet its energy requirements with ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Q-Pochhammer Symbol
In mathematical area of combinatorics, the ''q''-Pochhammer symbol, also called the ''q''-shifted factorial, is the product (a;q)_n = \prod_^ (1-aq^k)=(1-a)(1-aq)(1-aq^2)\cdots(1-aq^), with (a;q)_0 = 1. It is a ''q''-analog of the Pochhammer symbol (x)_n = x(x+1)\dots(x+n-1), in the sense that \lim_ \frac = (x)_n. The ''q''-Pochhammer symbol is a major building block in the construction of ''q''-analogs; for instance, in the theory of basic hypergeometric series, it plays the role that the ordinary Pochhammer symbol plays in the theory of generalized hypergeometric series. Unlike the ordinary Pochhammer symbol, the ''q''-Pochhammer symbol can be extended to an infinite product: (a;q)_\infty = \prod_^ (1-aq^k). This is an analytic function of ''q'' in the interior of the unit disk, and can also be considered as a formal power series in ''q''. The special case \phi(q) = (q;q)_\infty=\prod_^\infty (1-q^k) is known as Euler's function, and is important in combinatorics, number theory ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Factorial And Binomial Topics
In mathematics, the factorial of a non-negative denoted is the product of all positive integers less than or equal The factorial also equals the product of n with the next smaller factorial: \begin n! &= n \times (n-1) \times (n-2) \times (n-3) \times \cdots \times 3 \times 2 \times 1 \\ &= n\times(n-1)!\\ \end For example, 5! = 5\times 4! = 5 \times 4 \times 3 \times 2 \times 1 = 120. The value of 0! is 1, according to the convention for an empty product. Factorials have been discovered in several ancient cultures, notably in Indian mathematics in the canonical works of Jain literature, and by Jewish mystics in the Talmudic book '' Sefer Yetzirah''. The factorial operation is encountered in many areas of mathematics, notably in combinatorics, where its most basic use counts the possible distinct sequences – the permutations – of n distinct objects: there In mathematical analysis, factorials are used in power series for the exponential function ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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. History The term "algebraic combinatorics" was introduced in the late 1970s. Through the early or mid-1990s, typical combinatorial objects of interest in algebraic combinatorics either admitted a lot of symmetries (association schemes, strongly regular graphs, posets with a group action) or possessed a rich algebraic structure, frequently of representation theoretic origin (symmetric functions, Young tableaux). This period is reflected in the area 05E, ''Algebraic combinatorics'', of the AMS Mathematics Subject Classification, introduced in 1991. Scope Algebraic combinatorics has come to be seen more expansively as an area of mathematics where the interaction of combinatorial and algebraic methods is particularly strong and significa ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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 ''S''''i'' indexed by the natural numbers, enumerative combinatorics seeks to describe a ''counting function'' which counts the number of objects in ''S''''n'' 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 twelvefold way provides a unified framework for counting permutations, combinations and partitions. The simplest such functions are ''closed formulas'', which can be expressed as a composition of elementary functions such as factorials, powers, and so on. For instance, as shown below, the number of different possible orderings of a deck of '' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Discrete Mathematics (journal)
''Discrete Mathematics'' is a biweekly peer-reviewed scientific journal in the broad area of discrete mathematics, combinatorics, graph theory, and their applications. It was established in 1971 and is published by North-Holland Publishing Company. It publishes both short notes, full length contributions, as well as survey articles. In addition, the journal publishes a number of special issues each year dedicated to a particular topic. Although originally it published articles in French and German, it now allows only English language articles. The editor-in-chief is Douglas West ( University of Illinois, Urbana). History The journal was established in 1971. The very first article it published was written by Paul Erdős, who went on to publish a total of 84 papers in the journal. Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the journal has a 2020 impact factor of 0.87. Notable publications * The 1972 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Journal Of Mathematical Physics
The ''Journal of Mathematical Physics'' is a peer-reviewed journal published monthly by the American Institute of Physics devoted to the publication of papers in mathematical physics. The journal was first published bimonthly beginning in January 1960; it became a monthly publication in 1963. The current editor is Jan Philip Solovej from University of Copenhagen The University of Copenhagen ( da, Københavns Universitet, KU) is a prestigious public university, public research university in Copenhagen, Copenhagen, Denmark. Founded in 1479, the University of Copenhagen is the second-oldest university in .... Its 2018 Impact Factor is 1.355 Abstracting and indexing This journal is indexed by the following services:Wellesley College Library
2013.


References


External links



[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Academic Press
Academic Press (AP) is an academic book publisher founded in 1941. It was acquired by Harcourt, Brace & World in 1969. Reed Elsevier bought Harcourt in 2000, and Academic Press is now an imprint of Elsevier. Academic Press publishes reference books, serials and online products in the subject areas of: * Communications engineering * Economics * Environmental science * Finance * Food science and nutrition * Geophysics * Life sciences * Mathematics and statistics * Neuroscience * Physical sciences * Psychology Well-known products include the ''Methods in Enzymology'' series and encyclopedias such as ''The International Encyclopedia of Public Health'' and the ''Encyclopedia of Neuroscience''. See also * Akademische Verlagsgesellschaft (AVG) — the German predecessor, founded in 1906 by Leo Jolowicz (1868–1940), the father of Walter Jolowicz Walter may refer to: People * Walter (name), both a surname and a given name * Little Walter, American blues harmonica player Marion Wa ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Macdonald Polynomial
In mathematics, Macdonald polynomials ''P''λ(''x''; ''t'',''q'') are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable ''t'', but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable ''t'' can be replaced by several different variables ''t''=(''t''1,...,''t''''k''), one for each of the ''k'' orbits of roots in the affine root system. The Macdonald polynomials are polynomials in ''n'' variables ''x''=(''x''1,...,''x''''n''), where ''n'' is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-va ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dominique Foata
Dominique Foata (born October 12, 1934) is a mathematician who works in enumerative combinatorics. With Pierre Cartier and Marcel-Paul Schützenberger he pioneered the modern approach to classical combinatorics, that lead, in part, to the current blossoming of algebraic combinatorics. His pioneering work on permutation statistics, and his combinatorial approach to special functions, are especially notable. Foata gave an invited talk at the International Congress of Mathematicians in Warsaw (1983). Among his honors are the Scientific Prize of the Union des Assurances de Paris (September 1985). With Adalbert Kerber and Volker Strehl he founded the mathematics journal '' Séminaire Lotharingien de Combinatoire''. He is also one of the contributors of the pseudonymous collective M. Lothaire. In 1985, Foata received the Prix Paul Doistau–Émile Blutet. He was born in Damascus while it was under French mandate. Selected publications Books * with Pierre Cartier : ''Problèmes ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ira Gessel
Ira Martin Gessel (born 9 April 1951 in Philadelphia, Pennsylvania) is an American mathematician, known for his work in combinatorics. He is a long-time faculty member at Brandeis University and resides in Arlington, Massachusetts. Education and career Gessel studied at Harvard University graduating ''magna cum laude'' in 1973. There, he became a Putnam Fellow in 1972, alongside Arthur Rubin and David Vogan. He received his Ph.D. at MIT and was the first student of Richard P. Stanley. He was then a postdoctoral fellow at the Thomas J. Watson Research Center, IBM Watson Research Center and MIT. He then joined Brandeis University faculty in 1984. He was promoted to Professor of Mathematics and Computer Science in 1990, became a chair in 1996–98, and Professor Emeritus in 2015. Gessel is a prolific contributor to enumerative combinatorics, enumerative and algebraic combinatorics. He is credited with the invention of quasisymmetric functions in 1984 and foundational work on th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Q-analog
In mathematics, a ''q''-analog of a theorem, identity or expression is a generalization involving a new parameter ''q'' that returns the original theorem, identity or expression in the limit as . Typically, mathematicians are interested in ''q''-analogs that arise naturally, rather than in arbitrarily contriving ''q''-analogs of known results. The earliest ''q''-analog studied in detail is the basic hypergeometric series, which was introduced in the 19th century.Exton, H. (1983), ''q-Hypergeometric Functions and Applications'', New York: Halstead Press, Chichester: Ellis Horwood, 1983, , , ''q''-analogues are most frequently studied in the mathematical fields of combinatorics and special functions. In these settings, the limit is often formal, as is often discrete-valued (for example, it may represent a prime power). ''q''-analogs find applications in a number of areas, including the study of fractals and multi-fractal measures, and expressions for the entropy of chaotic ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]