Add to ORKGThe cardinal characteristic inequality r <= hm3 is proved. Several partition relations for ordinals and one for countable scattered types are given. Moreover partition relations for lexicographically ordered sequences of zeros and ones are given in a no-choice context
International audienceWe study statistics on ordered set partitions whose generating functions are r...
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
The focus of this thesis lies on the application of enumerative combinatorics to the partition latti...
We give short proofs of the partition theorems for parameter sets and finite vectorspaces
This paper investigates the relations K+--t (a): and its variants for uncountable cardinals K. First...
This thesis is in the field of Descriptive Set Theory and examines some consequences of the Axiom of...
The partition function has long enchanted the minds of great mathematicians, dating from Euler\u27s ...
AbstractIn this paper a partition theorem of the ideal [K]<k for infinite K is proved
This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of re...
It is considered whether Fermat’s so called Last Theorem can be understood by substituting variables...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
summary:We study cardinal coefficients related to combinatorial properties of partitions of $\omega$...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...
The focus of this thesis lies on the application of enumerative combinatorics to the partition latti...
We give short proofs of the partition theorems for parameter sets and finite vectorspaces
This paper investigates the relations K+--t (a): and its variants for uncountable cardinals K. First...
This thesis is in the field of Descriptive Set Theory and examines some consequences of the Axiom of...
The partition function has long enchanted the minds of great mathematicians, dating from Euler\u27s ...
AbstractIn this paper a partition theorem of the ideal [K]<k for infinite K is proved
This is an overview of a formalisation project in the proof assistant Isabelle/HOL of a number of re...
It is considered whether Fermat’s so called Last Theorem can be understood by substituting variables...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
summary:We study cardinal coefficients related to combinatorial properties of partitions of $\omega$...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as...
The partition theoretic Rogers–Ramanujan identities assert that for a = 0, 1 and any n, the number o...