Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let d_n denote the discrepancy associated with the grid of size n. The discrepancy-2 conjecture. There are infinitely many n such that d_n=2. In particular, for all k∈N, d_2· 3^k-1=2. This parallels Sutner's result that there are…
Let T⊂X^D_K be a subset, and let O⊂T be an D-dimensional orthotope with 2^D elements. Write S(O) for the sum of the elements of O, and let Ψ be the constant associated with the ambient set. Orthotope sum conjecture. For every orthotope…
Let X^D_K be the set under consideration, let T⊂X^D_K be a subset, and write S(T) for the sum of its elements. Define Ψ^D_K=2^D(K+1)-1-2^D-1. Subset-sum conjecture. For any subset T⊂X^D_K with |T|=2^D× n elements, S(T)=Ψ^D_K× n. The claim…
Let X^D_S and X^D_B be the sets at levels S and B, let T⊂X^D_S be a valid subset, and let φ^D_(S,B) be the transformation between these levels. Write S(T) for the sum of the elements of a subset and let Ψ^D_B denote the corresponding…
A minimum universal set is a collection of 12 colored MacMahon cubes that can be used to build all 30 target cubes. The paper has exhibited at least 10 such sets, including Haraguchi's set and additional shifted or symmetric examples.…
Let D and K be parameters of the set X^D_K, and let n be such that K=n+1. A subset size is a cardinality attained by a subset of X^D_K. Monotonicity conjecture. For given values of D and K=n+1, the minimum number of subsets of different…
A threshold function is a map f:Σ^N→Σ, where Σ is the binary state space. A function is strongly neutralizable when it has the property that its associated Ising machine can be made neutralizable under the paper's definition. An…
A scout process consists of c scouts moving on Z^d according to a scout protocol P=⟨ c,S,x_0,q_0,Π⟩. The hitting time of x∈Z^d is infn≥ 0:∃ i such that X_n^i=x, and the protocol is effective when every grid point has finite mean hitting…
Let a dictionary represent a valid solution for one of the isomorphic graphs, and let SG be a subset generator with the same number of variables. Substitute the dictionary variables into SG, and interpret cumulative XOR across all paths or…
Let d_n denote the discrepancy associated with the grid of size n. Power-index conjecture. Let a be an odd natural number. If a is not divisible by 21, then for all k∈N, d_a^k-1=d_a-1. The authors state that they are unaware of a proof;…