Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Spectral formulas for palette savings
This page preserves an earlier research route and its local standing. The completed threshold proof is in the solution note.
The algebraic results below give another sufficient spectral target for the color-savings problem. That target, and the original C7 assertion, remain unproved. All reweightings in this note retain the original support and its original conflict relations.
Fixed support, duals, and zero reweightings
Let be a finite symmetric zero-one matrix, with loops allowed. Use the active types and conflict graph of random blow-ups. Thus a supported type is active when at least one endpoint has a closed three-walk in . Distinct active types conflict when they admit an oriented two-plus-three connector pair in .
For any vector , not necessarily of total mass one, put
Only supported types are included. Define
The argument of consists of the active demands; inactive demands contribute to but require no palette cost. If some , their demands vanish, but their types are not deleted when computing walk relations. In particular, a zero-weight type may remain a witness for a conflict between positive-demand types. These conventions make the feasible dual polytope independent of .
Explicitly, let
Singleton constraints imply , so is a nonempty compact polytope. Extend on inactive supported types and set
with zero entries on unsupported pairs. Every is symmetric and entrywise nonnegative. Fractional-coloring LP duality gives
The half-weight convention on loops is essential to this identity. In particular, and for .
An exact residual spectral minimax identity
Fix positive probability weights , and write . Define
Then
All extrema are attained. The ellipsoid in (2) includes vectors with zero coordinates, interpreted by the fixed-support convention above.
For proof, put and let
The Rayleigh variational principle and finite-dimensional bilinear minimax on the compact convex sets give
For any , put . Positive semidefiniteness gives , and . Since every is entrywise nonnegative,
Thus a nonnegative rank-one matrix can replace each , improving all the inner objectives simultaneously. Nonnegative rank-one matrices therefore suffice in the last maximum in (3). Substitute and apply (1), proving (2).
Taking in (2) yields . Consequently the sufficient assertion
would prove the desired savings bound. By homogeneity, (2) says that is equivalent to the stronger family of inequalities
Neither (4) nor (5) under the super-Turan hypothesis is established here. In particular, the density of an ellipsoid test vector need not exceed one quarter of its squared total mass.
Concavity in squared vertex weights
The function
is concave and positively homogeneous of degree one. Indeed, by (1),
Each function inside this minimum is concave: off-diagonal terms are nonnegative multiples of the concave geometric mean, and diagonal terms are linear. The pointwise minimum of concave functions is concave. Explicitly, for , every function in the minimum is at least at ; taking the minimum preserves that inequality. Homogeneity is immediate.
Formula (2) can therefore also be written
This does not remove the normalization difficulty in the original weights: the probability constraint there is , rather than the displayed affine constraint. No counterexample-preserving vertex symmetrization is being inferred from this concavity.
Regular optimal residuals attain the spectral minimum
There is a direct connection with palette stationarity. Suppose an optimal dual, possibly an average of optimal duals, satisfies
Then
Indeed, . A nonnegative matrix having a strictly positive eigenvector has spectral radius equal to its corresponding eigenvalue, so . This gives one inequality in (7); the choice in (2) gives the other. Equivalently, under (6),
This is a conditional statement about a regular optimal residual. It does not establish such regularity at every possible counterexample, or bound its constant degree.
A universal degree-deficit spectral inequality
Let , with again positive of total mass one. Then
This holds for every support and requires no density hypothesis.
For ,
Every supported endpoint has positive degree. On the nonisolated types, let . The matrix in (8) is therefore entrywise at most
The normalized adjacency matrix in this display has eigenvector , with eigenvalue one. This vector is strictly positive, so its spectral radius is one. Entrywise monotonicity of the spectral radius for nonnegative matrices proves (8). Isolated types contribute zero rows and columns and may be restored afterward; an edgeless support is immediate.
A palette-size corollary
Suppose every supported type is active and every independent palette has size at most two. Then the dual
is feasible. Singleton constraints follow from . For a compatible pair , the compatible-pair degree inequality gives , proving the pair constraint. Its residual is the matrix in (8), so and .
The savings conclusion in this restricted case also follows from the singleton-deletion argument in singleton palettes. The spectral certificate is the additional conclusion here. Inactive types require dual value zero, and larger palettes need not satisfy the sum constraint for this proposed dual. Thus (8) alone does not prove (4).
A sparse-complement interpretation of clique localization
The rectangle calculation in two-star rectangles has the following savings interpretation. Let be any admissible three-walk clique of mass , put , , and write
Then
For completeness, average the physical rectangle over with probability . Writing , , and for triangle density inside , this feasible dual has value
Here , and the other inequalities are Cauchy--Schwarz. If , omit the cut term. Since , maximizing the resulting quadratic upper bound on proves (9).
Thus , in particular an independent complement, is sufficient for , with no requirement that . The stronger proposed assertion that an arbitrary admissible three-walk clique of mass at least one half suffices remains unresolved here. Formula (9) leaves complements of normalized density greater than untreated.