Consequences of the packing problem

被引：0
|
作者：
Hrishikesh Bodas
Benjamin Drabkin
Caleb Fong
Su Jin
Justin Kim
Wenxuan Li
Alexandra Seceleanu
Tingting Tang
Brendan Williams
机构：
[1] Carnegie Mellon University,
[2] University of Nebraska–Lincoln,undefined
[3] University of St Andrews,undefined
[4] University of Illinois,undefined
[5] Urbana-Champaign,undefined
[6] Vanderbilt University,undefined
[7] University of California,undefined
[8] Santa Barbara,undefined
[9] San Diego State University,undefined
[10] University of Michigan–Dearborn,undefined
来源：
Journal of Algebraic Combinatorics | 2021年 / 54卷
关键词：
Monomial ideals; Symbolic powers; Linear programming; Packing problem; Newton polyhedron; Symbolic polyhedron; Primary 13C70; 13F55; 05E40; Secondary 05C65; 05C15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study several consequences of the packing problem, a conjecture from combinatorial optimization, using algebraic invariants of square-free monomial ideals. While the packing problem is currently unresolved, we successfully settle the validity of its consequences. Our work prompts additional questions and conjectures, which are presented together with their motivation.
引用
收藏
页码：1095 / 1117
页数：22
相关论文
共 50 条
  • [41] The Kr-Packing Problem
    Venkatesan Guruswami
    C. Pandu Rangan
    M. S. Chang
    G. J. Chang
    C. K. Wong
    Computing, 2001, 66 : 79 - 89
  • [42] The mixed vertex packing problem
    Atamtürk A.
    Nemhauser G.L.
    Savelsbergh M.W.P.
    Mathematical Programming, 2000, 89 (1) : 35 - 53
  • [43] On the fractionality of the path packing problem
    Vanetik, Natalia
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 526 - 539
  • [44] A PACKING PROBLEM FOR HOLOMORPHIC CURVES
    Tsukamoto, Masaki
    NAGOYA MATHEMATICAL JOURNAL, 2009, 194 : 33 - 68
  • [45] USEFUL BOUNDS IN PACKING PROBLEM
    JOHNSON, BM
    KOEHN, U
    GULATI, BR
    ANNALS OF MATHEMATICAL STATISTICS, 1969, 40 (06): : 2217 - &
  • [46] On the online bin packing problem
    Seiden, SS
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 237 - 248
  • [47] PACKING PROBLEM FOR TRIANGULAR MATRICES
    KLOTZ, W
    LUCHT, L
    AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (04): : 378 - &
  • [48] ALGORITHM FOR VERTEX PACKING PROBLEM
    HOUCK, DJ
    RAO, RV
    OPERATIONS RESEARCH, 1977, 25 (05) : 773 - 787
  • [49] USEFUL BOUNDS IN PACKING PROBLEM
    GULATI, BR
    KOUNIAS, EG
    ANNALS OF MATHEMATICAL STATISTICS, 1969, 40 (02): : 720 - &
  • [50] Bin packing problem with scenarios
    Attila Bódis
    János Balogh
    Central European Journal of Operations Research, 2019, 27 : 377 - 395
12345