Search results
Jump to navigation
Jump to search
Page title matches
- {{Distinguish|Analytic Combinatorics (book)|Symbolic method (combinatorics)}} ...es techniques from [[complex analysis]] to solve problems in [[enumerative combinatorics]], specifically to find [[Asymptotic_analysis|asymptotic estimates]] for th ...8 KB (1,184 words) - 11:27, 22 February 2025
- ...[algebraic topology|algebro-topological]] methods to solving problems in [[combinatorics]]. ...graph|Kneser conjecture]], thus beginning the new field of '''topological combinatorics'''. Lovász's proof used the [[Borsuk–Ulam theorem]] and this theorem retain ...5 KB (604 words) - 11:58, 19 August 2024
- ...]] combinatorics''' is a field in the intersection of [[number theory]], [[combinatorics]], [[ergodic theory]] and [[harmonic analysis]]. ...rations (addition, subtraction, multiplication, and division). [[Additive combinatorics]] is the special case when only the operations of addition and subtraction ...9 KB (1,260 words) - 15:37, 1 February 2025
- {{short description|Area of combinatorics in mathematics}} ...a of [[combinatorics]] in mathematics. One major area of study in additive combinatorics are ''inverse problems'': given the size of the [[sumset]] {{Math|''A'' + ' ...5 KB (808 words) - 12:00, 18 February 2025
- '''Polyhedral combinatorics''' is a branch of [[mathematics]], within [[combinatorics]] and [[discrete geometry]], that studies the problems of counting and desc ...vertex). Additionally, many computer scientists use the phrase “polyhedral combinatorics” to describe research into precise descriptions of the faces of certain spe ...19 KB (2,604 words) - 20:59, 1 August 2024
- ...SN|0937-5511}}) is a [[book series]] in mathematics, and particularly in [[combinatorics]] and the design and analysis of [[algorithm]]s. It is published by [[Sprin *''Combinatorics and Complexity of Partition Functions'' ([[Alexander Barvinok]], 2016, vol. ...4 KB (569 words) - 19:18, 5 July 2024
- The mathematical field of [[combinatorics]] was studied to varying degrees in numerous ancient [[Society|societies]]. ...milarities to Fibonacci's problem of counting the number of [[composition (combinatorics)|compositions]] of 1s and 2s that [[Summation|sum]] to a given total.<ref n ...21 KB (2,915 words) - 13:43, 8 November 2024
- ...bserved patterns within words and tried to explain them. As time went on, combinatorics on words became useful in the study of [[algorithm]]s and [[Computer progra ...torics studies how to count these objects using various representations. Combinatorics on words is a recent development in this field that focuses on the study of ...20 KB (2,945 words) - 13:32, 13 February 2025
- ...journal|last1=Alon|first1=Noga|title=Combinatorial Nullstellensatz|journal=Combinatorics, Probability and Computing|volume=8|issue=1–2|year=1999|pages=7–29|issn=096 [[Category:Combinatorics]] ...9 KB (1,433 words) - 06:20, 22 January 2024
- ...Algorithmic Combinatorics on Partial Words''''' is a book in the area of [[combinatorics on words]], and more specifically on [[partial word]]s. It was written by F ...ergraduates. However, Bóna criticizes the book as being too focused on the combinatorics on words as an end in itself, with no discussion of how to translate mathem ...5 KB (759 words) - 01:56, 22 September 2024
- In the branch of mathematics known as [[additive combinatorics]], '''Kneser's theorem''' can refer to one of several related theorems rega ...Tao | author1-link=Terence Tao | first2=Van H. | last2=Vu | title=Additive Combinatorics | year=2010 | publisher=[[Cambridge University Press]] | place=[[Cambridge] ...7 KB (1,085 words) - 19:23, 9 April 2021
Page text matches
- ...ematician who specializes in [[algebraic combinatorics]] and [[enumerative combinatorics]],<ref>[https://www2.math.upenn.edu/~jhaglund James Haglund's Home Page]</r ...talan Numbers and the Space of Diagonal Harmonics: With an Appendix on the Combinatorics of Macdonald Polynomials''], University Lecture Series, vol. 41, American M ...3 KB (456 words) - 09:10, 20 November 2024
- {{short description|Area of combinatorics in mathematics}} ...a of [[combinatorics]] in mathematics. One major area of study in additive combinatorics are ''inverse problems'': given the size of the [[sumset]] {{Math|''A'' + ' ...5 KB (808 words) - 12:00, 18 February 2025
- ...ent research has been devoted to extending known results from [[polyhedral combinatorics]], such as various restrictions on ''f''-vectors of convex [[simplicial pol ...the [[h-vector|''h''-vector]] of a simplicial polytope.<ref>''Enumerative Combinatorics'', Vol. 1, 3.14, p. 138; formerly called the ''generalized h''-vector.</ref ...3 KB (422 words) - 00:45, 6 December 2024
- ...//dx.doi.org/10.1016/0195-6698%2895%2990035-7 |journal=European Journal of Combinatorics |language=en |volume=16 |issue=6 |pages=537–544 |doi=10.1016/0195-6698(95)9 [[Category:Algebraic combinatorics]] ...2 KB (232 words) - 09:18, 18 November 2024
- ...[algebraic topology|algebro-topological]] methods to solving problems in [[combinatorics]]. ...graph|Kneser conjecture]], thus beginning the new field of '''topological combinatorics'''. Lovász's proof used the [[Borsuk–Ulam theorem]] and this theorem retain ...5 KB (604 words) - 11:58, 19 August 2024
- ...= Using the Borsuk–Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry | subject = [[Topological combinatorics]] ...5 KB (711 words) - 14:49, 16 February 2025
- ..., squares in arithmetic progressions and sumsets of squares|title=Additive combinatorics|year=2007|series=CRM Proceedings & Lecture Notes, vol. 43|publisher=America [[Category:Combinatorics]] ...2 KB (298 words) - 14:04, 8 November 2024
- ...Algorithmic Combinatorics on Partial Words''''' is a book in the area of [[combinatorics on words]], and more specifically on [[partial word]]s. It was written by F ...ergraduates. However, Bóna criticizes the book as being too focused on the combinatorics on words as an end in itself, with no discussion of how to translate mathem ...5 KB (759 words) - 01:56, 22 September 2024
- {{Short description|Mathematical measure of a permutation, in combinatorics}} In [[mathematics]] (and particularly in [[combinatorics]]), the '''major index''' of a [[permutation]] is the sum of the positions ...2 KB (327 words) - 18:06, 28 May 2023
- ...[[symmetric group]] <math>S_n</math> are special subgroups that arise in [[combinatorics]] and [[representation theory]]. When <math>S_n</math> is viewed as the [[ ...<math>(1 \ 2), (2 \ 3), \ldots, (n - 1 \ n)</math>.<ref>{{citation |title=Combinatorics of Coxeter groups |last1=Björner |first1=Anders |author1-link=Anders Björne ...4 KB (531 words) - 05:39, 27 October 2024
- In [[additive combinatorics]], the '''Erdős sumset conjecture''' is a conjecture which states that if a [[Category:Combinatorics]] ...2 KB (241 words) - 23:23, 5 March 2024
- '''Chunwei Song''' is a Chinese mathematician who specializes in [[combinatorics]], [[graph theory]], and [[intellectual history]]. He is a professor of mat ...erspective|journal=Taylor & Francis|doi=10.1201/9781003509912/lattice-path-combinatorics-special-counting-sequences-chunwei-song}}</ref> ...6 KB (835 words) - 10:31, 12 February 2025
- In [[algebraic combinatorics]], a '''Bender–Knuth involution''' is an [[involution (mathematics)|involut ..._9/PDF/v9i1n5.pdf | mr=1912814 | year=2002 | journal=Electronic Journal of Combinatorics | issn=1077-8926 | volume=9 | issue=1 | pages=Note 5, 4 pp. (electronic)| d ...3 KB (411 words) - 18:29, 30 January 2025
- {{Distinguish|Analytic Combinatorics (book)|Symbolic method (combinatorics)}} ...es techniques from [[complex analysis]] to solve problems in [[enumerative combinatorics]], specifically to find [[Asymptotic_analysis|asymptotic estimates]] for th ...8 KB (1,184 words) - 11:27, 22 February 2025
- | journal = Journal of Combinatorics | journal = Combinatorics, Probability and Computing ...2 KB (238 words) - 03:21, 14 February 2025
- In [[combinatorics|combinatorial]] mathematics, '''Toida's conjecture''', due to [[Shunichi To | journal = Electronic Journal of Combinatorics ...3 KB (419 words) - 09:02, 18 November 2024
- {{Short description|Disproved statement in combinatorics}} ...lso known as the '''fish-bone conjecture''', was a proposed statement in [[combinatorics]] and [[graph theory]] concerning [[Matching (graph theory)|matchings]] in ...3 KB (460 words) - 15:41, 20 February 2025
- ...url=https://doi.org/10.1007/s10801-016-0722-6|journal=Journal of Algebraic Combinatorics|language=en|volume=45|issue=3|pages=701–743|doi=10.1007/s10801-016-0722-6|i ...| first1=Gérard | last2=Krob | first2=Daniel | title=Words, languages and combinatorics, II (Kyoto, 1992) | publisher=World Sci. Publ., River Edge, NJ | mr=1351284 ...3 KB (351 words) - 20:38, 7 June 2023
- | thesis_title = Topics in arithmetic combinatorics | known_for = [[Arithmetic combinatorics]] ...7 KB (962 words) - 04:29, 29 September 2024
- ...e''', or '''Dittert–Hajek conjecture''', is a mathematical hypothesis in [[combinatorics]] concerning the maximum achieved by a particular function <math>\phi</math [[Category:Combinatorics]] ...2 KB (307 words) - 14:07, 8 November 2024