December 2010
Mathematical Intelligencer;Dec2010, Vol. 32 Issue 4, p1
Academic Journal
A correction to the article is presented in which an array that appeared on the cover page of the journal made mistake related to geometric- combinatoric pattern.


Related Articles

  • Paired permutation testing in 2[supk] unreplicated factorials. Dalla Valle, Francesco; Pesarin, Fortunato; Salmaso, Luigi // Statistical Methods & Applications;2002, Vol. 11 Issue 3, p265 

    Develops exact permutation testing of effects in unreplicated two-level multifactorial designs based on the notion of realigning observations and on paired permutations. Advantages and limitations of exact permutation procedures for unreplicated factorials; Simulation study on paired...

  • Parameter controlled instance generation for lot sizing problems. Kimms, Alf // Central European Journal of Operations Research;1999, Vol. 7 Issue 3, p203 

    Examines the parameter controlled instance generation for lot sizing problems. Provision of methods for generating systematically varied parameter level combinations automatically; Use in evaluating lot sizing methods; Impact of the parameter on the performance of solution procedures.

  • Special issue in honour of Jeno Egerv�ry. Csendes, T.; Gal�ntai, A.; Szeidl, L. // Central European Journal of Operations Research;Mar2010, Vol. 18 Issue 1, p1 

    The article discusses various reports published within the issue, including one on some combinatorial results that are related to the famous Konig-Egervary theorem, one on the ABS methods for solving linear algebraic equations and their applications to optimization, and one on rank reduction...

  • THE COMPLEXITY OF FLOWSHOP AND JOBSHOP SCHEDULING. Garey, M. R.; Johnson, D.S.; Sethi, Ravi // Mathematics of Operations Research;May76, Vol. 1 Issue 2, p117 

    NP-complete problems form an extensive equivalence class of combinatorial problems for which no nonenumerative algorithms are known. Our first results shows that determining a shortest length schedule ill an m-machine flowshop is NP-complete for m = 3 (For m = 2, there is an efficient algorithm...

  • A generalization of the Dual Ellentuck Theorem. Halbeisen, Lorenz; Matet, Pierre // Archive for Mathematical Logic;Feb2003, Vol. 42 Issue 2, p103 

    We prove versions of the Dual Ramsey Theorem and the Dual Ellentuck Theorem for families of partitions which are defined in terms of games.

  • Prosperity properties of TU-games. van Gellekom, J. R. G.; Potters, J. A. M.; Reijnierse, J. H. // International Journal of Game Theory;1999, Vol. 28 Issue 2, p211 

    Abstract. An important open problem in the theory of TU-games is to determine whether a game has a stable core (Von Neumann-Morgenstern solution (1944)). This seems to be a rather difficult combinatorial problem. There are many sufficient conditions for core-stability. Convexity is probably the...

  • Acyclic sets of linear orders: A progress report. Fishburn, Peter C. // Social Choice & Welfare;Apr2002, Vol. 19 Issue 2, p431 

    Let f(n) be the maximum cardinality of an acyclic set of linear orders on {1, 2, � , n}. It is known that f(3)=4, f(4)=9, f(5)=20, and that all maximum-cardinality acyclic sets for n= 5 are constructed by an �alternating scheme�. We outline a proof that this scheme is optimal for...

  • How Joe Gillis discovered combinatorial special function theory. Zeilberger, Doron // Mathematical Intelligencer;Spring95, Vol. 17 Issue 2, p65 

    Pays tribute to mathematician Joe Gillis, who died on November 18, 1993. Educational background; How Gillis discovered combinatorial special function theory.

  • Patchworking algebraic curves disproves the Ragsdale conjecture. Itenberg, Ilia; Viro, Oleg // Mathematical Intelligencer;Fall96, Vol. 18 Issue 4, p19 

    Shows how to build algebraic curves in a combinatorial fashion. Initial data; Construction of a piecewise linear curve; Real plane algebraic curves; T-curves; Ragsdale conjecture; Patchworking Harnack curves; Counterexamples to Ragsdale conjecture.


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics