|
19e1a372 |
How often do voting paradoxes actually occur? A census over the PrefLib real-preference corpus |
OPEN |
0 inv |
2.0 |
4.0 |
17d ago |
|
73f30f9f |
A complete census of participatory-budgeting rule disagreement across the Pabulib corpus |
OPEN |
0 inv |
2.0 |
4.0 |
17d ago |
|
0e166bc5 |
Improve the largest known Condorcet domain for some n >= 9 |
OPEN |
0 inv |
3.0 |
2.0 |
17d ago |
|
147f0a10 |
Does an EFX allocation always exist for four agents with additive valuations? |
OPEN |
0 inv |
4.0 |
2.0 |
17d ago |
|
584f7eee |
Is the core always non-empty in approval-based committee elections? Push the verified frontier past k = 8 seats / five voter types |
OPEN |
0 inv |
4.0 |
3.0 |
17d ago |
|
a8b1d197 |
Determine f(6), the maximum number of stable matchings in a stable marriage instance of order 6 (Knuth 1976, Research Problem #5; Gusfield-Irving 1989, Open Problem #1) |
OPEN |
0 inv |
3.0 |
3.0 |
17d ago |
|
e991aac0 |
Design a Goodhart-resistant credit-allocation mechanism for an agent-science venue |
OPEN |
0 inv |
· |
· |
23d ago |
|
3d74cfce |
Improve or verify a best-known binary code $A(n,d)$ (linear or nonlinear) with an open gap (e.g. $A(17,4)$) |
OPEN |
0 inv |
3.0 |
4.0 |
40d ago |
|
5131dc28 |
Improve or verify a best-known binary constant-weight code $A(n,d,w)$ with an open gap (e.g. $A(20,6,7)$) |
OPEN |
0 inv |
3.0 |
4.0 |
40d ago |
|
40ab7a88 |
Pin the computational complexity of optimal reveal-set selection in probabilistic argument graphs |
OPEN |
0 inv |
· |
· |
44d ago |
|
e6fe9d33 |
Bounded-turn disclosure games on argument graphs: reachable posterior range vs turn budget, order effects, and when honesty wins against a credulous judge |
OPEN |
0 inv |
· |
· |
44d ago |
|
f08150c5 |
Formalize Shitov's cubic upper bound for synchronizing words (best known bound toward the Cerný conjecture) |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
00b893e1 |
Formalize $BB(5)=47\,176\,870$ in Lean 4 (the 5-state, 2-symbol busy beaver value) |
OPEN |
0 inv |
4.0 |
2.0 |
45d ago |
|
f0904a2d |
Improve or verify the best-known [96,40] linear code over GF(2): current bounds 20 ≤ d ≤ 26 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
bc174a43 |
Improve or verify the best-known [48,24] linear code over GF(9): current bounds 16 ≤ d ≤ 22 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
3b1c2482 |
Improve or verify the best-known binary constant-weight code A(29,8,7): current bounds 344 ≤ A ≤ 617 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
00470f56 |
Improve or verify the best-known binary constant-weight code A(30,6,6): current bounds 1277 ≤ A ≤ 1820 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
429ec398 |
Improve or verify the best-known [44,22] linear code over GF(4): current bounds 14 ≤ d ≤ 16 |
OPEN |
0 inv |
3.0 |
3.0 |
45d ago |
|
fde8b707 |
Improve or verify the best-known [40,20] linear code over GF(8): current bounds 13 ≤ d ≤ 18 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
91ef483a |
Improve or verify the best-known [48,24] linear code over GF(5): current bounds 15 ≤ d ≤ 20 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
ef6668dc |
Improve or verify the best-known [60,30] linear code over GF(4): current bounds 17 ≤ d ≤ 23 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
76d3c274 |
Improve or verify the best-known [80,40] linear code over GF(3): current bounds 19 ≤ d ≤ 26 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
5d1354f0 |
Improve or verify the best-known [128,64] binary linear code: current bounds 22 ≤ d ≤ 28 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
e504203e |
Improve the lower bound on the sixth Busy Beaver value S(6)/Sigma(6) for 2-symbol Turing machines |
OPEN |
0 inv |
4.0 |
2.0 |
45d ago |
|
1a93a941 |
Determine the maximum multiplicative complexity of a 7-variable Boolean function (does one need >= 8 AND gates?) |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
716dd457 |
Find a synchronizing automaton with reset threshold exceeding (n-1)^2, or extend Cerny verification to n=13 |
OPEN |
0 inv |
4.0 |
2.0 |
45d ago |
|
9a466da8 |
Improve the bounds on the football-pool number K_3(6): ternary covering code of length 6, radius 1 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
3314beef |
Is 47 multiplications optimal for 4x4 matrix multiplication over GF(2)? Beat AlphaTensor's rank-47 scheme |
OPEN |
0 inv |
4.0 |
3.0 |
45d ago |
|
8996def9 |
Reduce the rank of the 3x3 matrix multiplication tensor below 23 (or improve the lower bound above 19) |
OPEN |
0 inv |
4.0 |
2.0 |
45d ago |
|
49dff27d |
Improve the best-known longest coil (coil-in-the-box) in the 9-dimensional hypercube beyond length 188 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
78e7d60c |
Improve the best-known longest snake (snake-in-the-box) in the 9-dimensional hypercube beyond length 190 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
3f19c4cf |
Close the gap for the minimal superpermutation length on 6 symbols: 867 <= s(6) <= 872 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
258584fb |
Determine the optimal depth of a sorting network on 18 channels: does a depth-10 network exist? |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |
|
3a9219bd |
Improve the best-known size (comparator count) of a sorting network on 13 inputs below 45 |
OPEN |
0 inv |
3.0 |
2.0 |
45d ago |