Wiki
Wiki

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 H\mathcal H be a finite clutter of nonempty sets, on its support, with rank at most kk, property P7P_7, and transversal number t≥2t\ge2. Here P7P_7 concerns subfamilies of at most seven edges. For arbitrarily large n≡1(mod3)n\equiv1\pmod3, there is a clutter Q\mathcal Q with rank at most k+2k+2, property P7P_7, and transversal number tt such that:

  • its nontransversal complex and ordinary intersection nerve are contractible;
  • the free Z2\mathbb Z_2-coindices of the deleted product and deleted join of its nontransversal complex are at least ⌊n/2⌋−2\lfloor n/2\rfloor-2;
  • its monotone edge-containment function is conjunction-prime, and every ground vertex belongs to an edge.

If H\mathcal H is kk-uniform, then Q\mathcal Q is (k+2)(k+2)-uniform.

The path guard

Take n≥7n\ge7 with n≡1(mod3)n\equiv1\pmod3 and q=⌊n/2⌋≥tq=\lfloor n/2\rfloor\ge t. On a disjoint support, let G=Pn\mathcal G=P_n be the edge family of the path 1,…,n1,\ldots,n. Choose E0∈HE_0\in\mathcal H, put e={n−1,n}e=\{n-1,n\}, and define

Q=(H⊗G)∖{E0∪e},H⊗G={E∪F:E∈H,F∈G}.\mathcal Q=(\mathcal H\otimes\mathcal G)\setminus\{E_0\cup e\}, \qquad \mathcal H\otimes\mathcal G=\{E\cup F:E\in\mathcal H,F\in\mathcal G\}.

The one-deleted-product-edge lemma in Prime guard families proves conjunction-primality. Its hypotheses hold because τ(H)=t≥2\tau(\mathcal H)=t\ge2 and τ(G)=q≥2\tau(\mathcal G)=q\ge2.

For completeness, the transversal calculation is elementary. Either projection of a transversal of Q\mathcal Q covers its factor, or its projections leave exactly E0E_0 and ee uncovered. In the latter case its size is at least (t−1)+(q−1)≥t(t-1)+(q-1)\ge t. A minimum H\mathcal H-transversal covers Q\mathcal Q, so τ(Q)=t\tau(\mathcal Q)=t. Local covers in the H\mathcal H coordinates give P7P_7. Both factors have at least two edges, so the single deletion leaves every vertex supported.

Contractibility of the ordinary complexes

For a family F\mathcal F on VV, write

K(F)=⋃E∈F2V∖E,X(F)=⋃E∈F2E.K(\mathcal F)=\bigcup_{E\in\mathcal F}2^{V\setminus E}, \qquad X(\mathcal F)=\bigcup_{E\in\mathcal F}2^E.

The intersection nerve of F\mathcal F is homotopy equivalent to X(F)X(\mathcal F): 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 CC is homotopy equivalent to the suspension ΣC\Sigma C.

For n≥7n\ge7, direct decomposition at the last path edge gives

K(Pn)=(n∗K(Pn−1))∪Δ([n−2]).K(P_n)=\bigl(n*K(P_{n-1})\bigr)\cup\Delta([n-2]).

The intersection is

Cn=K(Pn−1)∣[n−2]=Δ([n−3])∪((n−2)∗K(Pn−3)).C_n=K(P_{n-1})\big|_{[n-2]} =\Delta([n-3])\cup\bigl((n-2)*K(P_{n-3})\bigr).

The two pieces defining CnC_n are contractible and intersect in K(Pn−3)K(P_{n-3}). Consequently

Cn≃ΣK(Pn−3),K(Pn)≃Σ2K(Pn−3).C_n\simeq\Sigma K(P_{n-3}), \qquad K(P_n)\simeq\Sigma^2K(P_{n-3}).

The facets of K(P4)K(P_4) are 34,14,1234,14,12, forming a path. Induction therefore proves that K(Pn)K(P_n) and CnC_n are contractible for the chosen nn.

Put H−=H∖{E0}\mathcal H^-=\mathcal H\setminus\{E_0\}. The deleted product row yields

K(Q)=(K(H)∗[n∗K(Pn−1)])∪(K(H−)∗Δ([n−2])).K(\mathcal Q)= \bigl(K(\mathcal H)*[n*K(P_{n-1})]\bigr) \cup\bigl(K(\mathcal H^-)*\Delta([n-2])\bigr).

Both pieces are contractible. Since K(H−)⊆K(H)K(\mathcal H^-)\subseteq K(\mathcal H), their intersection is K(H−)∗CnK(\mathcal H^-)*C_n, also contractible. Thus K(Q)K(\mathcal Q) is contractible.

Similarly, viewing paths now as their edge-generated simplicial complexes,

X(Q)=(X(H)∗Pn−1)∪(X(H−)∗Δ({n−1,n})).X(\mathcal Q)= \bigl(X(\mathcal H)*P_{n-1}\bigr) \cup\bigl(X(\mathcal H^-)*\Delta(\{n-1,n\})\bigr).

Both pieces and their intersection X(H−)∗{n−1}X(\mathcal H^-)*\{n-1\} are contractible. Hence X(Q)X(\mathcal Q), and therefore the intersection nerve, is contractible.

Explicit equivariant spheres

Despite this contractibility,

K(Q)[V(Pn)]=K(Pn).K(\mathcal Q)[V(P_n)]=K(P_n).

Indeed, every guard edge still occurs paired with an H\mathcal H-edge different from E0E_0. If TT is a minimum path transversal, then ∣T∣=q|T|=q and

K(Pn)[T]=∂Δq−1.K(P_n)[T]=\partial\Delta^{q-1}.

Every proper subset of TT is a nontransversal, whereas TT is a transversal.

The centrally symmetric polyhedral sphere

S={z∈RT: ∑vzv=0, ∑v∣zv∣=1}≅Sq−2S=\{z\in\mathbb R^T:\ \sum_vz_v=0,\ \sum_v|z_v|=1\} \cong S^{q-2}

embeds equivariantly in the deleted join of K(Q)K(\mathcal Q) by its positive and negative supports. Both supports are proper subsets of TT. It also embeds in the deleted product by

z⟼(2z+,2z−).z\longmapsto(2z^+,2z^-).

The two images are barycentric points with disjoint supports, and antipodality swaps them. Thus both coindices are at least q−2q-2, and hence so are the corresponding sphere-valued equivariant indices.

As nn grows, these indices are unbounded at unchanged rank k+2k+2 and transversal number tt. No rank-dependent upper bound for these standard indices follows from P7P_7, 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 n→∞n\to\infty. For a path vertex xx, choose a matching of m≥⌊n/2⌋−3m\ge\lfloor n/2\rfloor-3 edges disjoint from its closed neighborhood. At Bernoulli bias pp, pivotality of xx requires a selected neighbor and no completed matching edge. These events use disjoint coordinates, giving

IxPn(p)≤2p(1−p2)m,ϕx(Pn)≤∫012p(1−p2)m dp=1m+1.I_x^{P_n}(p)\le2p(1-p^2)^m, \qquad \phi_x(P_n)\le\int_0^1 2p(1-p^2)^m\,dp=\frac1{m+1}.

Product-coordinate Shapley values do not exceed the corresponding factor values, as shown in Prime guard families. Deleting E0∪eE_0\cup e can change the first pivotal coordinate only if this is the unique product edge at the first winning prefix. Then ee is the first completed path edge. A maximum matching containing ee has q=⌊n/2⌋q=\lfloor n/2\rfloor disjoint pairs with exchangeable completion times, so this event has probability at most 1/q1/q. Consequently

max⁡xϕx(Q)≤max⁡{max⁡xϕx(H),O(1/n)}+O(1/n).\max_x\phi_x(\mathcal Q) \le\max\{\max_x\phi_x(\mathcal H),O(1/n)\}+O(1/n).

The family is not transversal-critical. Choose E1≠E0E_1\ne E_0 and F1≠eF_1\ne e. Deleting E1∪F1E_1\cup F_1 also leaves transversal number tt: 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 (t−1)+(q−1)≥t(t-1)+(q-1)\ge t applies. Nor is the construction incidence-minimal: deleting all guard incidences recovers the core, preserving P7P_7 and tt. It supplies no obstruction to an argument using an appropriately normalized, facet-sensitive relative complex after simultaneous edge and incidence minimization.