Daily reading
Daily reading: 1 research-level, 135 proved, 71 open
Research-level results today: 1. (low tier) Proves the conjectured gap bound for modulus 105, the smallest case left unsettled by arXiv:2611.04551, using a checked CRT fiber reduction and finite-direction certificates. Each research-level result is one Research Blog post; theorems that bear on the same open problem or paper share it.
Details
The Proposer read 0 new paper(s) and listed 0 open problem(s); 28 new question(s) of AFTD's own were adopted onto the list; 17 list entries were stated in Lean, as were 14 results the papers prove; the Proposer posed 45 more from what the knowledgebase already holds (190 new theorem statement(s) in all, each checked against its English in both directions). The Prover proved 135 theorem(s), 79 of them helper lemmas, which are not listed below; 71 of today's statements are not yet proved and stay in the knowledgebase, marked as such.
Research-level. good_slopes_gap_mod_105 (arXiv:2611.04551): Every non-extremal permutation f of ℤ/105ℤ satisfies |D_{105}(f)| ≤ 40: (good_slopes 105 f).card ≤ 40. — (low tier) Proves the conjectured gap bound for modulus 105, the smallest case left unsettled by arXiv:2611.04551, using a checked CRT fiber reduction and finite-direction certificates
Partial result on OP-1355. op_1355_claw_free_of_weighted_bound (knowledgebase): If a finite simple graph G on a finite type V with decidable equality satisfies the weighted hard-core closed-neighborhood variance bound hardCoreWeightedClosedNeighborhoodBound G lam a ≤ hardCoreWeightedVar G lam a for all positive vertex fugacities lam and…
Partial result on OP-1643. pyranim_collision_prob_one (arXiv:2611.16153): The collision probability pyranim_collision_prob 1 for a 1-tier pyramid game is equal to 1 / 2.
Partial result on OP-1112. all_agent_bivalued_equal_marginal_divisible_chores (knowledgebase): For every n at least two and k at least two, any common ratio r at least one, and any n-agent scaled bivalued additive cost profile on n*k chores, there is a nonnegative weight for every complete allocation, with all weights summing to 1, such that each…
Partial result on OP-1112. balanced_high_counts_insufficient_for_sharp_mms (knowledgebase): There are seven chores, costs equal to 1 or 3/2, and a bundle S such that three times the number of chores in S is at most 9, three times the number of 3/2-cost chores in S is at most the total number of 3/2-cost chores plus 2, but the cost of S is strictly…
Partial result on OP-861. op861_selector_palette_lower_bound: In any pair of proper standard-list selectors at positive k and threshold r, each selector uses at least k+r distinct colors.
Partial result on OP-861. op861_no_threefold_right_equivariant_k7_r3: There are no proper standard-list selectors for k=7 and r=3 whose right selector is equivariant under the permutation with cycles (0 1 2), (3 4 5), (6 7 8), (9 10 11), fixing 12.
Partial result on OP-1112. critical_four_two_choice_pairing_counterexample (knowledgebase): There exist four sets L_i, one for each i in Fin 4, of four low chores drawn from the nine chores Fin 9, with the following properties. For every extra chore e and every permutation p of the nine chores which fixes e, has no other fixed points and satisfies…
Partial result on OP-1702. gapped_three_point_vulnerability_ge_one_third (knowledgebase): For any integer d and any probability distribution q on ℤ (with q(s) ≥ 0 and sum equal to 1), the one-guess vulnerability against a uniform secret on {0, 1, d} is at least 1/3.
Thread RT-1. cycle_power_dyadic_sparse_defect_support_card: For each t≥4, the sparse defect support contains exactly t points.
Thread RT-1. cycle_power_dyadic_sparse_defect_lower_rank: For t≥4 and j<t−2, the unique support pair at dyadic distance 2^t−2^j has first coordinate 0.
Thread RT-1. cycle_power_dyadic_sparse_defect_penultimate_rank: At t≥4, there is exactly one support pair at distance 2^t−2^(t−2).
Thread RT-1. cycle_power_dyadic_sparse_defect_top_rank: At t≥4, the sparse support has no pair at the top dyadic distance 2^(t−1).
Thread RT-1. cycle_power_dyadic_sparse_defect_two_covered_distances: For each t≥4, the support covers distances 1 and 3·2^(t−2)−1.
Thread RT-1. cycle_power_dyadic_sparse_defect_weight: The dyadic class weight of the sparse defect support is t for every t≥4.
Formalized. admissibility_lemma_binary_labeling (arXiv:2611.16338, Lemma 2.1): Let s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b = |E_{s+1}|, and c = |E_{2s}| be the counts of edges with endpoint label sums 2, s + 1, and 2s, where E_r is the set of…
Formalized. witness_family_ramsey_number_le (arXiv:2611.15376 Proposition 3.1): For every simple graph G on a type V, natural numbers r, s, t, b, and family W of subsets of Fin r such that every member of W has cardinality t and every s-subset of Fin r contains at least b members of W, if there exists N such that…
Formalized. shadow_ramsey_number_le (arXiv:2611.15376 Proposition 3.1): For every simple graph G on a type V and natural numbers r, s, t, if there exists N such that set_coloring_ramsey_property G (r.choose t) (s.choose t) 1 N holds, then the generalized set-coloring Ramsey number satisfies set_coloring_ramsey_number G r s t ≤…
Formalized. set_coloring_ramsey_number_p3_one (arXiv:2611.15376 Lemma 2.1): For all integers a ≥ b ≥ 1, the set-coloring Ramsey number of the two-edge path P_3 with intersection parameter t = 1 is given by R(P_3; a, b, 1) = 2 * ⌊(a + b) / (2 * b)⌋ + 1, and in particular R(P_3; a, b, 1) is always an odd integer.
Formalized. matroid_realization_via_circuit_neighborhoods_szf (arXiv:2611.15741 Proposition 2.10): Let V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V, and let M be a matroid on V with ground set M.E = Set.univ. Suppose that every circuit C of M is the neighborhood of…
Formalized. szf_circuit_flat_has_vertex_neighborhood (scout/2611-15741-skew-zero-forcing-matroids.md:268): Let M be a matroid on a finite ground set V with M.E = Set.univ. If M is SZF-realized by a graph with symmetric neighborhood function N (u ∈ N v ↔ v ∈ N u), then for every circuit-flat C of M (a subset C ⊆ V that is both a circuit and a flat of M), there…
Formalized. not_szf_realizable_of_lt_circuit_flat_card (scout/2611-15741-skew-zero-forcing-matroids.md:277): Let M be a finite matroid on ground set V with M.E = Set.univ. If the number of circuit-flats of M strictly exceeds the number of elements in M, then M is not SZF-realizable by any graph with symmetric neighborhood function.
Formalized. simple_graph_reconfiguration_diam_le_three_halves_of_bipartite (arXiv:2611.17022 Lemma 6 -- Large diameter for (Δ+2)-colouring reconfiguration): Let G be a finite bipartite simple graph on a type V with decidable equality and decidable adjacency. For every integer k ≥ G.maxDegree + 2, the diameter of the k-colouring reconfiguration graph of G with colours in Fin k is at most 3 * Fintype.card V / 2.
Corrected. not_gapped_three_point_optimal_vulnerability_ge_one_third: The statement gapped_three_point_optimal_vulnerability_ge_one_third is false: The statement fails for c < 0 (for instance d = 0, c = -1). For any probability distribution q on ℤ with q(s) ≥ 0, each term |s| * q(s) is non-negative, so ∑' s, |s| * q(s) ≥ 0.…
Open. two_thirds_convex_random_marginal_sharp_two_log_over_n (knowledgebase): As the number of players n tends to infinity, the sequence (n * two_thirds_convex_max_noncore_fraction n / Real.log n) converges to 2 along Filter.atTop.
Open. uniform_bivalued_reciprocal_safe_partition (knowledgebase): For any ratio r in [1, 2] such that r = 1 or r = 1 + 1/k for some positive integer k, every two-agent uniform bivalued chores instance admits a two-partition of chores into bundles S and univ \ S such that both bundles have additive cost at most the…
Open. gapped_three_point_secret_descending_band_mask_frontier (knowledgebase): For any integer d ≥ 3 and real budget c ≥ 0, the optimal one-guess vulnerability gapped_three_point_optimal_vulnerability d c against a uniform secret on {0, 1, d} equals lower_convex_envelope (descending_band_points d) c.
Open. op_1697_uniform_bivalued_equal_marginal_exact_mms_iff (knowledgebase): For any real ratio r with 1 ≤ r and r ≤ 2, every two-agent uniform bivalued chores instance c on m chores satisfying is_uniform_bivalued_chores r c admits a lottery p in the standard simplex stdSimplex ℝ (Fin m → Fin 2) satisfying is_equal_marginal_lottery p…
Open. two_thirds_convex_pairwise_singleton_superadditive_permutationally_convex (arXiv:2611.16207 Proposition 1 -- Core nonemptiness for 2/3-convex games): Let v be a 2/3-convex cooperative game on a finite set of players α with at least 3 players (3 ≤ Fintype.card α) satisfying v ∅ = 0. If v satisfies pairwise singleton superadditivity (v {i} + v {j} ≤ v {i, j} for all distinct i j : α), then v is…
Open. three_distant_convex_marginal_vector_in_core_iff_local_no_swap (arXiv:2611.16207, Lemma 2): Let v be a 3-distant convex cooperative game with v(∅) = 0 on a finite player set α, and let e be an ordering bijection of the players. Then the marginal worth vector marginal_vector v e belongs to the core of v (is_in_core v (marginal_vector v e)) if and…
- path_cut_word_count_cancelFor a four-partition A,B,C,D of the vertices of the path P_n, the total number of edges crossing the cuts defined by A, B, C, D equals the…
- path_cut_word_odd_run_ineqFor a four-partition A,B,C,D of the vertices of the path P_n, the sum of the numbers of maximal odd-length crossing runs for A, B, C and D…
- good_slopes_gap_mod_105Every non-extremal permutation f of ℤ/105ℤ satisfies |D_{105}(f)| ≤ 40: (good_slopes 105 f).card ≤ 40.
- op_1355_claw_free_of_weighted_boundIf a finite simple graph G on a finite type V with decidable equality satisfies the weighted hard-core closed-neighborhood variance bound…
- good_slopes_unit_cover_mod105For every permutation modulo 105, a unit c exists such that adding c to each good slope yields a unit modulo 105.
- dephased_path_constant_gap_implies_nonnegativeA binary constant-gap certificate implies the continuous path inequality under the local noise inequalities.
- dephased_path_interval_binary_averageThe colored interval polynomial at arbitrary real weights equals its weighted average over all zero-one profiles.
- path_cert_word_eq_cut_wordThe Boolean edge word used by the finite-state certificate is the ordinary path cut word of the corresponding color mask.
- pyranim_collision_prob_oneThe collision probability pyranim_collision_prob 1 for a 1-tier pyramid game is equal to 1 / 2.
- cycle_power_dyadic_sparse_defect_support_cardFor each t≥4, the sparse defect support contains exactly t points.
- cycle_power_dyadic_sparse_defect_lower_rankFor t≥4 and j<t−2, the unique support pair at dyadic distance 2^t−2^j has first coordinate 0.
- cycle_power_dyadic_sparse_defect_penultimate_rankAt t≥4, there is exactly one support pair at distance 2^t−2^(t−2).
- cycle_power_dyadic_sparse_defect_top_rankAt t≥4, the sparse support has no pair at the top dyadic distance 2^(t−1).
- cycle_power_dyadic_sparse_defect_two_covered_distancesFor each t≥4, the support covers distances 1 and 3·2^(t−2)−1.
- cycle_power_dyadic_sparse_defect_weightThe dyadic class weight of the sparse defect support is t for every t≥4.
- all_agent_bivalued_equal_marginal_divisible_choresFor every n at least two and k at least two, any common ratio r at least one, and any n-agent scaled bivalued additive cost profile on n*k…
- balanced_high_counts_insufficient_for_sharp_mmsThere are seven chores, costs equal to 1 or 3/2, and a bundle S such that three times the number of chores in S is at most 9, three times…
- op861_selector_palette_lower_boundIn any pair of proper standard-list selectors at positive k and threshold r, each selector uses at least k+r distinct colors.
- op861_no_threefold_right_equivariant_k7_r3There are no proper standard-list selectors for k=7 and r=3 whose right selector is equivariant under the permutation with cycles (0 1 2),…
- critical_four_two_choice_pairing_counterexampleThere exist four sets L_i, one for each i in Fin 4, of four low chores drawn from the nine chores Fin 9, with the following properties.…
- pyranim_mem_remove_iffA chip x survives the removal of chip c, i.e. x ∈ pyranim_remove X c, if and only if x ∈ X and c is not contained in x: removing a chip…
- cycle_power_eight_pairwise_tight_mixture_counterexampleFor the displayed period-three family of three equally weighted Boolean classes per phase, every class has the required endpoints, parent…
- cycle_power_eight_globally_coupled_rank_mixtureFor the explicit tight-class mixture, the displayed scenario maps are permutations and couple all three phases globally so that every…
- is_uniform_bivalued_chores_onesFor any number of chores m and any ratio r, the instance where both agents assign cost 1 to every chore is uniform bivalued with ratio r.
- recursive_nae_seven_eighths_split_boundsFor every depth d at least ten, the rounded seven-eighths split is positive and strictly smaller than d, and the shifted depth decreases…
- recursive_nae_seven_eighths_split_correction_squareFor every natural depth d, with k the rounded-up seven-eighths split, two to the power d plus twice k is at most three to the power twice…
- gapped_three_point_vulnerability_ge_one_thirdFor any integer d and any probability distribution q on ℤ (with q(s) ≥ 0 and sum equal to 1), the one-guess vulnerability against a…
- uniform_bivalued_obstruction_no_equal_marginal_exact_mmsFor every integer t at least 2 and every real ratio r strictly between 1 + 1/t and 1 + 1/(t-1), the instance with 4t chores where agent 0…
- not_gapped_three_point_optimal_vulnerability_ge_one_thirdThe statement
gapped_three_point_optimal_vulnerability_ge_one_thirdis false: The statement fails for c < 0 (for instance d = 0, c =… - descending_band_point_memFor any integer d and natural numbers r and L with 1 ≤ r and r ≤ L, the pair (descending_band_cost d r L, descending_band_vulnerability d…
- uniform_bivalued_unit_ratio_exact_mmsFor any number of chores m and any two-agent chore cost profile c satisfying is_uniform_bivalued_chores 1 c, there exists a lottery p in…
- zero_is_permutationally_convexThe constant zero cooperative game is permutationally convex.
- order_prefix_zeroFor any ordering bijection e of a finite type α, the prefix of length zero is empty: order_prefix e 0 = ∅.
- local_no_swap_of_in_coreFor any cooperative game v on a finite type α satisfying v(∅) = 0 and any ordering bijection e : Fin (Fintype.card α) ≃ α, if the marginal…
- op_1611_min_max_degree_le_eightThe natural number 8 satisfies simple_graph_reconfiguration_diam_gt_matching 8.
- op_1611_target_of_eight_and_threeIf 8 satisfies the witness predicate and no Δ ≤ 3 does, then there is a unique Δ with 4 ≤ Δ ≤ 8 that is least in the set of witnesses.
- projective_independent_emptyThe empty subset of any projective space is projectively independent.
- simple_graph_endpoint_sum_edges_subsetFor any finite simple graph G, vertex labeling φ : V → ℕ, and natural number r, the finset simple_graph_endpoint_sum_edges G φ r is a…
- admissibility_lemma_edge_partitionLet s ≥ 3 and let φ : V → ℕ be a vertex labeling of a finite simple graph G such that every vertex receives label 1 or s. Then the edge…
- admissibility_lemma_necessityLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
- admissibility_lemma_sufficiencyLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
- admissibility_lemma_binary_labelingLet s ≥ 3, let G be a finite simple graph, and let φ : V → ℕ be a vertex labeling such that φ(v) ∈ {1, s} for all v. Let a = |E_2|, b =…
- witness_family_ramsey_propertyFor every simple graph G on a type V, natural numbers r, s, t, b, N, and family W of subsets of Fin r such that every member of W has…
- witness_family_ramsey_number_leFor every simple graph G on a type V, natural numbers r, s, t, b, and family W of subsets of Fin r such that every member of W has…
- shadow_ramsey_propertyFor every simple graph G on a type V and natural numbers r, s, t, N, if the set-coloring Ramsey property set_coloring_ramsey_property G…
- shadow_ramsey_number_leFor every simple graph G on a type V and natural numbers r, s, t, if there exists N such that set_coloring_ramsey_property G (r.choose t)…
- p3_ramsey_arithmetic_boundFor all integers a ≥ b ≥ 1 and any natural number N, b * (N choose 2) ≤ a * ⌊N / 2⌋ holds if and only if N ≤ 2 * ⌊(a + b) / (2 * b)⌋.
- le_of_not_set_coloring_ramsey_property_p3If there exists an (a, b)-set-coloring of the complete graph K_N without a monochromatic two-edge path P_3 in any single color, then b *…
- set_coloring_ramsey_property_mono_NFor any simple graph G, palette size r, edge subset size s, intersection parameter t, and natural numbers N ≤ M, if every (r,…
- set_coloring_ramsey_property_p3_one_thresholdFor all integers a ≥ b ≥ 1, every (a, b)-set-coloring of the complete graph on 2 * ⌊(a + b) / (2 * b)⌋ + 1 vertices contains a…
- not_set_coloring_ramsey_property_p3_one_even_thresholdFor all integers a ≥ b ≥ 1, there exists an (a, b)-set-coloring of the complete graph on 2 * ⌊(a + b) / (2 * b)⌋ vertices without a…
- set_coloring_ramsey_number_p3_oneFor all integers a ≥ b ≥ 1, the set-coloring Ramsey number of the two-edge path P_3 with intersection parameter t = 1 is given by R(P_3;…
- op_1600_slow_exact_nim_bounded_grundyIn the normal-play game of slow exact k-Nim on k+2 piles, for every integer k ≥ 3, the range of the Sprague-Grundy function is bounded:…
- op_1600_slow_exact_nim_k3_onesIn slow exact 3-Nim on 5 piles, the all-ones position fun _ : Fin 5 => 1 has Sprague-Grundy value 1.
- matroid_realization_via_circuit_neighborhoods_szfLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
- op_1592_not_always_n_sq_minus_one_queensIt is not the case that for every integer n ≥ 2 all of whose prime factors are at most 7, one can place n^2 - 1 mutually non-attacking…
- op_1592_zmod2_queens_card_le_oneOn any d-dimensional modular board (Z/2Z)^d, any set of mutually non-attacking queens has cardinality at most 1.
- skew_zero_forcing_closure_subset_matroid_closureLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
- matroid_closure_subset_skew_zero_forcing_closureLet V be a finite type ([Finite V]), let N : V → Set V be a symmetric neighborhood function satisfying u ∈ N v ↔ v ∈ N u for all u, v : V,…
- plackett_luce_laplace_profile_const_oneFor the constant weight profile w(x) = 1 on [0,1], the Laplace profile L(t) equals exp(-t).
- szf_circuit_flat_has_vertex_neighborhoodLet M be a matroid on a finite ground set V with M.E = Set.univ. If M is SZF-realized by a graph with symmetric neighborhood function N (u…
- not_szf_realizable_of_lt_circuit_flat_cardLet M be a finite matroid on ground set V with M.E = Set.univ. If the number of circuit-flats of M strictly exceeds the number of elements…
- simple_graph_diam_le_of_forall_exists_walk_leIn any simple graph G on a type α, if for every pair of vertices u and v there exists a walk from u to v of length at most D, then the…
- good_slopes_two_row_fiber_rigidityLet X be a finite set of 105 elements with input and output coordinate functions over Z/3 and Z/35, and assume the pair of input…
- simple_graph_reconfiguration_exists_walk_le_three_halves_of_bipartiteLet G be a finite bipartite simple graph on a type V with decidable equality and decidable adjacency. For every integer k ≥ G.maxDegree +…
- dephased_path_interval_indicator_mem_supported_kernelAn alternating interval contained in a path subsystem has its indicator in the supported cut kernel exactly when all its selected weights…
- simple_graph_reconfiguration_diam_le_three_halves_of_bipartiteLet G be a finite bipartite simple graph on a type V with decidable equality and decidable adjacency. For every integer k ≥ G.maxDegree +…
- good_slopes_two_row_fiber_rigidity_conditionalLet k be nonzero and let X be a finite set of size 3k whose input coordinates in Z/3 and Z/k form an injective pair. Suppose there are L…
- good_slopes_gap_three_coprime_from_fiber_boundsLet k be a nonzero natural number coprime to 3 and let f be a non-extremal permutation modulo 3k. Suppose there are L units modulo k and 0…
- good_slopes_missing_prime_squarefreeLet n be squarefree and nonzero, let the prime p divide n, and let f be a permutation modulo n. Then some residue modulo p is missed by…
- op_1458_rich_repetition_threshold_le_asymptotic_of_projectionFor any integer d ≥ 2, if there exist a morphism π : Fin (2 * d - 1) → List (Fin d) and an infinite word z : ℕ → Fin d such that z is the…
- good_slopes_fiber55_nonunit_collision_gapLet S be any finite set of points over Z/55Z. If a unit direction has a collision between distinct points whose first-coordinate…
- op_1458_asymptotic_critical_exponent_le_critical_exponentFor every infinite word w, the asymptotic critical exponent of w is at most the critical exponent of w in ℝ.
- good_slopes_fiber55_eleven_collision_gapLet S be any finite set of points over Z/55Z. If a unit direction has a collision between distinct points whose first-coordinate…
- good_slopes_fiber55_anchored_neighborsA set of points over Z/55Z containing (0,0) and (1,54) cannot have injective and surjective direction forms y+a*x for ten or more of the…
- finite_rook_sparse_full_columnLet B be a finite set of cells with m possible rows. Suppose every row is occupied, B has fewer than 2m cells, and every selected cell has…
- finite_rook_four_sparse_patternLet B be a set of at most seven cells in four rows, with every row occupied. If every cell of B has at least three other cells of B in its…
- good_slopes_many_row_fiber_rigidity_conditionalLet K be a finite field with r nonzero elements and let k be nonzero. Let X have |K|·k elements and input coordinates in K×Z/kZ that form…
- good_slopes_prime5_two_rows_three_heights_counterexampleThere are five points over Z/5 with two specified injective directions, at most three distinct second coordinates, and no containing…
- good_slopes_prime11_three_anchorA finite set of points over the field of eleven elements cannot contain the three noncollinear points (0,0), (1,0), (0,1), while at least…
- dfa_seq_subset_sync_total_le_k_mul_simultaneousFor any family of k deterministic finite automata A and any sequential subset synchronization choice ws, the total length ∑ i, (ws…
- dfa_seq_subset_sync_stage_le_simultaneousFor any family of k deterministic finite automata A, any sequential subset synchronization choice ws, and any simultaneously synchronizing…
- op_1716_two_automata_subset_sync_le_two_optFor any two deterministic finite automata A (k = 2) and any two-stage sequential subset synchronization choice ws, the total length (ws…
- good_slopes_fiber55_nine_neighbor_exampleThere are 55 points over Z/55 containing the two standard anchors with all seven displayed directions good; these directions belong to the…
- good_slopes_prime17_eleven_color_bound_counterexampleThere are seventeen graph points over Z/17 with nine ordinate values, seven good nonzero directions, and a collision at direction 2.…
- good_slopes_fiber55_uncolored_gap_counterexampleThere are 55 points over Z/55 with at least 33 good unit directions and a collision in direction 1. This refutes the proposed bound of at…
- good_slopes_unit_cover_squarefreeFor every nonzero squarefree modulus and permutation, some unit can be added to all its good slopes to make them units.
- szf_multigraph_closure_indicatorOn a graph without parallel edges (multiplicities 0 or 1, given by neighbourhood sets N), the multigraph skew zero forcing closure…
- szf_multigraph_closure_single_loopA vertex with a single loop and no other edges forces itself from the empty filled set.
- szf_multigraph_closure_double_loopA vertex with a double loop and no other edges is not forced from the empty filled set.
- op_1693_noon_witness_symmFor every natural number N, balance parameter q in Real, and transmissivities x, y in Real, the realignment witness satisfies…
- op_1693_noon_scaling_surface_symmetricFor any non-negative real loss a, at balanced amplitude q = 1/2 the asymptotic scaling surface satisfies noon_scaling_surface (1 / 2) a a…
- good_slopes_affine_slope_fractional_injectiveOver a field, a fractional linear slope transformation associated with a nonzero two-by-two determinant is injective wherever both…
- not_complete_graphic_matroid_szf_realizable_of_six_leFor n ≥ 6 the cycle matroid M(K_n) is not SZF-realizable by any multigraph on E(K_n).
- op_1693_noon_witness_loss_monotonicity_oneFor N = 1 and any balance parameter q in the open interval (0, 1) and transmissivities x, y in the open interval (0, 1), if…
- good_slopes_affine_coordinates_formThe original slope form equals the affine-basis constant plus the two basis-direction coefficients times the affine coordinates.
- good_slopes_affine_coordinates_anchorsThe affine-coordinate map sends the three noncollinear basis points to (0,0), (1,0), and (0,1).
- complete_graphic_matroid_szf_realizable_of_le_fiveFor 1 ≤ n ≤ 5 the cycle matroid M(K_n) is SZF-realizable by some multigraph on E(K_n).
- complete_graph_cycle_closure_three_one_edgeIn the cycle matroid of K_3, a single edge is closed.
- complete_graph_cycle_closure_three_two_edgesIn the cycle matroid of K_3, any two edges span the third: the closure of the complement of one edge is the whole edge set.
- op_1355_claw_center_partition_upper_boundThe total weight of independent sets containing the center is at most 17/16 for the explicit embedded-claw activity profile.
- complete_graphic_matroid_szf_realizable_iffFor every integer n ≥ 1, the cycle matroid M(K_n) of the complete graph K_n is SZF-realizable (some multigraph on E(K_n), loops and…
- op_1355_claw_neighborhood_sum_upper_boundThe closed-neighborhood activity sum at the center is at most 31+1/16 for the explicit embedded-claw profile.
- op_1592_character_line_vanishingFor finite additive commutative groups, a function whose sums over translates of a homomorphic image are constant has zero Fourier…
- op_1355_independent_triple_partition_lower_boundIf three distinct pairwise nonadjacent vertices have activity 10 and every activity is nonnegative, the hard-core partition function is at…
- op_1355_center_violation_of_partition_boundsA center-only observable violates the weighted local variance bound whenever the center activity is one, its partition weight is between 0…
- op223_inside_branch_fixed_parameter_gapAt a tied resolvent maximum inside the moved branch, the fixed-spectral-parameter derivative of the root-minus-competitor gap is positive…
- op223_weighted_shift_arithmetic_certificateThe displayed rational parameters satisfy two path-resolvent recurrences, two secular equations, and the strict diagonal inequalities used…
- op223_weighted_shift_vector_certificateThe displayed integer vectors satisfy all fourteen eigenvector equations for the original weighted tree, all fourteen strict upper…
- op223_rational_shift_diagonal_certificateThe displayed rational values satisfy the root secular identity and the strict core, tail, and six path diagonal inequalities for the…
- op223_zmatrix_posdef_of_positive_vectorA real symmetric matrix with nonpositive off-diagonal entries is positive definite if it maps some strictly positive vector to a strictly…
- d2_tilde_kernel_r_symmFor every function W : ℝ → ℝ → ℝ and all x1, x2 : ℝ, the kernel d2_tilde_kernel_r W is symmetric: d2_tilde_kernel_r W x1 x2 =…
- op223_weighted_support_graph_is_treeThe support graph of the rational weighted-shift candidate is a tree.
- op223_weighted_eleven_vector_certificateThe nine displayed positive integer vectors satisfy all strict coordinate upper bounds for the nine original pendant-edge replacements; a…
- op223_weighted_eleven_graph_is_treeThe support graph of the eleven-vertex rational weighted-shift candidate is a tree.
- plackett_luce_surprisal_variance_profile_nonnegFor any weight profile w on [0,1], the asymptotic surprisal variance plackett_luce_surprisal_variance_profile w is non-negative.
- rare_tail_target_limit_lt_oneFor every real p strictly between 0 and 1, the rare-tail limit ratio 4 * (1 - p) / (1 + (1 - p))^2 is strictly less than 1.
- relu_continuous_flag_two_step_erasureSuppose a real-valued flag update G is continuous in its test input at an initial flag p, with G(0,p)=p and G(1,p)=p-c, and a true test…
- op_1721_eventual_log_concavity_failureFor every real p strictly between 0 and 1, let q = 1 - p, r(d) = Nat.ceil (d / q^d), u(d) = q^(2d), b(d, j) = (r(d).choose j : ℝ) * u(d)^j…
- op_1710_kuramoto_coupling_iso_eqFor any two isomorphic graphs T and T' on a finite vertex set V, any probability measure μ on ℝ, and any threshold s, the probability that…
- op75_compact_subset_equivalenceFor any list of real weights and real target, the compact-map orbit ends at zero with accumulated digit-weighted sum equal to the target…
- op75_compact_digit_reluThe compact digit selector is the difference of the two rectified affine functions max(4x−1,0) and max(4x−2,0).
- op75_compact_map_reluOn the unit interval the compact map is computed by the displayed nested rectified affine expression.
- ose_cube_scalar_certificateFor real p at least two and u between zero and one, four times p cubed times u squared times one minus u is at most (p minus one) times (p…
- ose_sphere_two_scale_distance_identityFor two vectors on the same sphere of squared radius q²/4, the squared distance after independent radial scalings beta and alpha equals…
- ose_spherical_shrink_scalar_boundsUnder the small-s parameter assumptions for the spherical two-layer construction, the two radial scaling factors have the ordering and…
- ose_two_layer_direct_embeddingFor two layers over points in an inner-product space, if the first layer is isometric, the cross distances are Euclidean at vertical…
- ose_spherical_two_layer_hilbert_distortion_upperLet a family of points in a complete real inner-product space lie on a sphere of radius q/2, with q positive and q² at least two, and have…
- op_1719_bivalued_efx_sub_mms_two_agents_two_ratioFor two agents and item values in {1, 2}, there exists an additive instance with a complete EFX allocation in which some agent obtains…
- op75_tm2_step_aux_lengthExecuting one TM2 statement increases any chosen stack length by at most the syntactic push bound.
- op75_tm2_machine_one_step_boundFor any finite TM2 and any of its stacks, some constant bounds that stack’s length increase in every machine step.
- ose_spherical_small_scale_auxFor two spherical metric layers satisfying the displayed scalar inequalities and the two-scale norm identity, if the first-layer metric is…
- op75_tm2_iter_measure_boundIf every transition of a partial state machine increases a natural-valued measure by at most C, then any n-step run increases it by at…
- op75_tm2_output_linear_boundFor any finite TM2, there is a constant C such that for every input and output, a halting run of at most n steps has output length at most…
- op75_tm2_two_push_one_stepThe explicit machine outputs two true symbols from an empty input in one TM2 step.
arXiv:2610.06092 →arXiv:2611.04551 →arXiv:2611.08546 →arXiv:2611.13676 →arXiv:2611.14754 →arXiv:2611.14546 →arXiv:2611.17022 →Open problems →