We give short proofs of the partition theorems for parameter sets and finite vectorspaces
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
We show for a prime power number of parts m that the first differences of partitions into at most m ...
AbstractTo each k-dimensional subspace of an n-dimensional vector space ove GF(q) we assign a number...
We give short proofs of the partition theorems for parameter sets and finite vectorspaces
AbstractIn this paper a partition theorem of the ideal [K]<k for infinite K is proved
The cardinal characteristic inequality r <= hm3 is proved. Several partition relations for ordinals ...
ZusammenfassungWe will give a counterexample to a generalisation of Hindman's theorem and show an eq...
In this note we discuss some generalisations of the Hales-Jewett theorem. We shall show the impossib...
AbstractAn induced version of the partition theorem for parameter-sets of R. L. Graham and B. L. Rot...
AbstractThe induced restricted versions of the vector space Ramsey theorem and of the Graham-Rothsch...
In the field of Combinatorics we are interested in the existence and structure of certain configurat...
A linear representation of a modular lattice L is a homomorphism from L into the lattice Sub(V) of a...
AbstractThis paper contains a proof of a conjecture of S. Simpson which is an infinitary version of ...
Wir untersuchen die untere und obere Partitionsentropie bezüglich bestimmter Mengenfunktionen, die a...
AbstractA canonical (i.e., unrestricted) version of the partition theorem for k-parameter sets of Gr...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
We show for a prime power number of parts m that the first differences of partitions into at most m ...
AbstractTo each k-dimensional subspace of an n-dimensional vector space ove GF(q) we assign a number...
We give short proofs of the partition theorems for parameter sets and finite vectorspaces
AbstractIn this paper a partition theorem of the ideal [K]<k for infinite K is proved
The cardinal characteristic inequality r <= hm3 is proved. Several partition relations for ordinals ...
ZusammenfassungWe will give a counterexample to a generalisation of Hindman's theorem and show an eq...
In this note we discuss some generalisations of the Hales-Jewett theorem. We shall show the impossib...
AbstractAn induced version of the partition theorem for parameter-sets of R. L. Graham and B. L. Rot...
AbstractThe induced restricted versions of the vector space Ramsey theorem and of the Graham-Rothsch...
In the field of Combinatorics we are interested in the existence and structure of certain configurat...
A linear representation of a modular lattice L is a homomorphism from L into the lattice Sub(V) of a...
AbstractThis paper contains a proof of a conjecture of S. Simpson which is an infinitary version of ...
Wir untersuchen die untere und obere Partitionsentropie bezüglich bestimmter Mengenfunktionen, die a...
AbstractA canonical (i.e., unrestricted) version of the partition theorem for k-parameter sets of Gr...
This thesis studies the computational complexity of approximately evaluating partition functions. Fo...
We show for a prime power number of parts m that the first differences of partitions into at most m ...
AbstractTo each k-dimensional subspace of an n-dimensional vector space ove GF(q) we assign a number...
DOI
Add to ORKG