In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic
Set theoretic estimation for problems in subtractive color
β Scribed by Gaurav Sharma
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 308 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0361-2317
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper examines and refutes a conjecture to the effect that the solution set for a general (real) static errors-in-variables problem is a finite union of sets that are described by a finite number of linear inequalities. The conjecture is disproved by detailed examination of particular errors-in
## Nature of physical problem Computations of Feynman diagrams in non-Abelian gauge field theories involves the group-theoretic weight computation. The present program implements the Cvitanovic algorithm [2] of computation of the group-theoretic weight for SU( n) and SO(n). ## Restriction on the