An extremal problem for Graham-Rothschild parameter words
From MaRDI portal
Publication:803178
Recommendations
Cites work
- A combinatorial interpretation of \((1/k!)\Delta ^ kt^ n\)
- A combinatorial problem; stability and order for models and theories in infinitary languages
- Abstract Theory of Inversion of Finite Series
- Coordinate density of sets of vectors
- Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces
- Linear dependencies among subsets of a finite set
- On functions of strength t
- On the Structure oft-Designs
- On the density of families of sets
- On the density of sets of vectors
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- On the number of sets in a null t-design
- On the trace of finite sets
- On the vector space of 0-configurations
- Ramsey's Theorem for n-Parameter Sets
- The module structure of integral designs
Cited in
(8)- Inclusion matrices for rainbow subsets
- The \(k\)-orbit reconstruction and the orbit algebra
- Kernels of modular inclusion maps
- Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron
- Combinatorial reconstruction problems
- On families in finite lattices
- Graham-Rothschild parameter words and measurable partitions
- PAC-learning from general examples
This page was built for publication: An extremal problem for Graham-Rothschild parameter words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803178)