-
61
-
62
-
63
-
64
The combinatorics of generalised cumulative arrays
Published 2007-01-01Subjects: “…combinatorics,…”
Get full text
Article -
65
-
66
-
67
Dual combinatorics of zonal polynomials
Published 2011-01-01Subjects: “…[math.math-co] mathematics [math]/combinatorics [math.co]…”
Get full text
Article -
68
Language Combinatorics: Aspects of Studying
Published 2017-05-01Subjects: “…language combinatorics…”
Get full text
Article -
69
Coxeter-biCatalan combinatorics
Published 2015-01-01“…We consider several counting problems related to Coxeter-Catalan combinatorics and conjecture that the problems all have the same answer, which we call the $W$ -biCatalan number. …”
Get full text
Article -
70
-
71
Analytic Combinatorics of the Mabinogion Urn
Published 2008-01-01Subjects: “…analytic combinatorics…”
Get full text
Article -
72
Unexpected Applications of Polynomials in Combinatorics
Published 2018“…In the last 6 years, several combinatorics problems have been solved in an unexpected way using high degree polynomials. …”
Get full text
Get full text
Article -
73
-
74
Random and exact structures in combinatorics
Published 2024“…In this thesis I aim to show several developments related to notions of randomness and structure in combinatorics and probability. One central notion, the pseudorandomness-structure dichotomy, has played a key role in additive combinatorics and extremal graph theory. …”
Get full text
Thesis -
75
-
76
-
77
Applications of combinatorics in coding theory
Published 2023“…Combinatorics is the branch of mathematics studying the enumeration of sets of elements. …”
Get full text
Thesis-Doctor of Philosophy -
78
-
79
Three problems in additive combinatorics
Published 2021“…<p>The problems considered in this thesis involve several fundamental objects in additive combinatorics. In this project, we mainly focus on the structure of subsets of integers. …”
Thesis -
80
Problems in extremal and probabilistic combinatorics
Published 2017“…<p>In this thesis we consider some problems in extremal and probabilistic combinatorics.</p> <p>In Chapter 2 we determine the maximum number of induced cycles that can be contained in a graph on <em>n</em> ≥ <em>n</em><sub>0</sub> vertices, and show that there is a unique graph that achieves this maximum. …”
Thesis