3 papers
math.CO2026
Minimum blockers for nonnested perfect matchings
Pedro M. M. de Castro
A perfect matching in an ordered graph is nonnested if no edge lies strictly inside another. We classify the smallest edge sets meeting every nonnested perfect matching on ord…
cs.CG2026
Optimal exponential memory for sequential Euclidean connections: edge-power costs and phase transitions
Pedro M. M. de Castro
We study the edge-power cost of the labelled tree generated by the -strategy, a constant-gain rule for sequential Euclidean connections. Starting with , each input poin…
cs.CG2026
Sequential Euclidean connections with exponential memory: distributional performance and adversarial robustness
Pedro M. M. de Castro
Points in the unit ball of are processed sequentially. Each new point is connected to a state that summarizes earlier observations, after which $x_i=γ…