Maximum of a square-free quadratic form on a simplex. The following question was suggested by a problem of J. E. MacDonald Jr. (1): Given a graph G with vertices 1, 2, . . . , n. Let S be the simplex in E n given by x i ≥ 0, Σ x i = 1. What is
No takes yet. Share an insight, caveat, or question.
Motzkin et al. (1965) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: