6 problems
- 0 votes0 replies0 views
The neighborhood-tour conjecture for ASEP vertices
Let be the asymmetric subtour elimination polytope, let be a vertex of this polytope, and let denote its neighb…
- 0 votes0 replies0 views
Hardness conjecture for the 8-profile of permutations
8-profile hardness conjecture. In direct analogy with the case of , these occurrences constitute the “hard case” for computing the -profile.
- 0 votes0 replies0 views
Polynomial bound for denumerant constant-term decompositions
Let denote the number of rational functions produced by a strategy for choosing valid multipliers in the decomposition of a consta…
- 0 votes0 replies0 views
Non-existence of primitive formally dual subsets of size 8 in the group
Let and let a subset be primitive if it is not contained in a proper coset of a subgroup of and generates . A subset is formally dual if ther…
- 0 votes0 replies0 views
The c-unbounded lower-bound conjecture for hypergraph Ramsey numbers
Let be an integer, and let and be integers satisfying and . Write for the smallest integer such that every red-blue colorin…
- 0 votes0 replies0 views
Prime-length unboppy rotor compressor conjecture
A rotor type is unboppy if it is neither palindromic nor block-repetitive, and a rotor has prime length when its length is a prime number. The compressor is the procedure discussed…