A Combinatorial Theorem

Abstract

Let n be an arbitrary but fixed positive integer. Let T n be the set of all monotone - increasing n-tuples of positive integers: 1 Define 2 In this note we prove that ϕ is a 1–1 mapping from T n onto {1, 2, 3,…}.

Related Papers

• → Maximal and minimal coverings of (k− 1)-tuples byk-tuples(1968)56 cited
• → On the Problem of Over-clustering in Tuple-based Coordination Systems(2007)5 cited
• → The LDV approach to polyinstantiation(2002)1 cited
• → A bi-threshold model for PP-attachment disambiguation through backing off to 2-tuples directly(2009)
• → Tuples in C++ and their Applications(2018)