Integer packing sets form a well-quasi-ordering
نویسندگان
چکیده
An integer packing set is a of non-negative vectors with the property that, if vector x in set, then every y y≤x as well. The main result this paper that sets, ordered by inclusion, form well-quasi-ordering. This allows us to answer recently posed question: k-aggregation closure any polyhedron again polyhedron.
منابع مشابه
Subgraphs and well-quasi-ordering
Let % be a class of graphs and let i be the subgraph or the induced subgraph relation. We call % an idea/ (with respect to I) if G I G' E % implies that G E %. In this paper, we study the ideals that are well-quasiordered by I. The following are our main results. If 5 is the subgraph relation, we characterize the well-quasi-ordered ideals in terms of excluding subgraphs. If I is the induced sub...
متن کاملInteger Complexity, Addition Chains, and Well-Ordering
In this dissertation we consider two notions of the “complexity” of a natural number, the first being addition chain length, and the second known simply as “integer complexity”. The integer complexity of n, denoted ‖n‖, is the smallest number of 1’s needed to write n using an arbitrary combination of addition and multiplication. It is known that ‖n‖ ≥ 3 log3 n for all n. We consider the differe...
متن کاملFrom Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets
We consider conditions which force a well-quasi-ordered poset (wqo) to be betterquasi-ordered (bqo). In particular we obtain that if a poset P is wqo and the set Sω(P ) of strictly increasing sequences of elements of P is bqo under domination, then P is bqo. As a consequence, we get the same conclusion if Sω(P ) is replaced by J (P ), the collection of non-principal ideals of P , or by AM(P ), ...
متن کاملInduced minors and well-quasi-ordering
A graph H is an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-induced minor-free. Robin Thomas showed that K4-induced minor-free graphs are well-quasi-ordered by induced minors [Graphs without K4 and well-quasi-ordering, Journal of Combinatorial Theory, Series B, 38(3):240 – 247, 1985]. We provide a dichotomy th...
متن کاملWell-Quasi-Ordering, Overview and its Applications
This talk shows theorems, techniques, and applications of well-quasi-ordering (WQO). First, we introduce what is WQO, and Kruskaltype theorems on various data structures [31, 15, 16, 23, 34, 33]. The basic proof technique, minimal bad sequence (MBS), will be introduced for the simplest case, Higman’s Lemma. Then, WQO will be extended to better-quasi-ordering (BQO) for infinite data structures [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2021
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2021.01.013