Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Topological guards
The following construction limits approaches using ordinary homotopy or the standard deleted-product and deleted-join indices. It does not settle either assertion of Problem 644. The resulting family is neither transversal-critical nor incidence-minimal.
Let be a finite clutter of nonempty sets, on its support, with rank at most , property , and transversal number . Here concerns subfamilies of at most seven edges. For arbitrarily large , there is a clutter with rank at most , property , and transversal number such that:
- its nontransversal complex and ordinary intersection nerve are contractible;
- the free -coindices of the deleted product and deleted join of its nontransversal complex are at least ;
- its monotone edge-containment function is conjunction-prime, and every ground vertex belongs to an edge.
If is -uniform, then is -uniform.
The path guard
Take with and . On a disjoint support, let be the edge family of the path . Choose , put , and define
The one-deleted-product-edge lemma in Prime guard families proves conjunction-primality. Its hypotheses hold because and .
For completeness, the transversal calculation is elementary. Either projection of a transversal of covers its factor, or its projections leave exactly and uncovered. In the latter case its size is at least . A minimum -transversal covers , so . Local covers in the coordinates give . Both factors have at least two edges, so the single deletion leaves every vertex supported.
Contractibility of the ordinary complexes
For a family on , write
The intersection nerve of is homotopy equivalent to : its covering simplices have intersections that are either simplices or empty. All joins and unions below are simplicial. We use the standard gluing fact that the union of two contractible subcomplexes with nonempty intersection is homotopy equivalent to the suspension .
For , direct decomposition at the last path edge gives
The intersection is
The two pieces defining are contractible and intersect in . Consequently
The facets of are , forming a path. Induction therefore proves that and are contractible for the chosen .
Put . The deleted product row yields
Both pieces are contractible. Since , their intersection is , also contractible. Thus is contractible.
Similarly, viewing paths now as their edge-generated simplicial complexes,
Both pieces and their intersection are contractible. Hence , and therefore the intersection nerve, is contractible.
Explicit equivariant spheres
Despite this contractibility,
Indeed, every guard edge still occurs paired with an -edge different from . If is a minimum path transversal, then and
Every proper subset of is a nontransversal, whereas is a transversal.
The centrally symmetric polyhedral sphere
embeds equivariantly in the deleted join of by its positive and negative supports. Both supports are proper subsets of . It also embeds in the deleted product by
The two images are barycentric points with disjoint supports, and antipodality swaps them. Thus both coindices are at least , and hence so are the corresponding sphere-valued equivariant indices.
As grows, these indices are unbounded at unchanged rank and transversal number . No rank-dependent upper bound for these standard indices follows from , even with conjunction-primality. Ordinary contractibility likewise cannot supply the required transversal bound.
Low Shapley values and the criticality limitation
The construction also preserves vanishing maximum Shapley value along a sequence of cores with that property, provided . For a path vertex , choose a matching of edges disjoint from its closed neighborhood. At Bernoulli bias , pivotality of requires a selected neighbor and no completed matching edge. These events use disjoint coordinates, giving
Product-coordinate Shapley values do not exceed the corresponding factor values, as shown in Prime guard families. Deleting can change the first pivotal coordinate only if this is the unique product edge at the first winning prefix. Then is the first completed path edge. A maximum matching containing has disjoint pairs with exchangeable completion times, so this event has probability at most . Consequently
The family is not transversal-critical. Choose and . Deleting also leaves transversal number : if neither projection of a transversal covers its factor, the nonempty rectangle of uncovered factor edges is contained in two diagonally opposite pairs, so is a singleton. The same lower bound applies. Nor is the construction incidence-minimal: deleting all guard incidences recovers the core, preserving and . It supplies no obstruction to an argument using an appropriately normalized, facet-sensitive relative complex after simultaneous edge and incidence minimization.