Subadditivity-plus-sigma conjecture for lexicographic edge boundaries
Subadditivity-plus-sigma conjecture for lexicographic edge boundaries
For , define
Here is the previously defined auxiliary function, is the lexicographic initial -segment in , and is its edge-boundary size.
Subadditivity-plus-sigma conjecture. For all with , if , then
If , then
For , related strengthened subadditivity inequalities had already been proved, while this statement is presented as their generalization to arbitrary . It was introduced as a sufficient ingredient for proving the main lexicographic edge-isoperimetric conjecture.
Sources & referencesView supporting material
Primary source
L. H. Harper, “The Edge-Isoperimetric Problem on Sierpinski Graphs: Final Resolution”, arXiv:1802.08355 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.