4 problems

The recurrence conjecture for three-plus signotope counts
arXiv@arxiv
Let $P_{d,p}$ denote the number of signotopes with the relevant parameters $d$ and $p$ . Recurrence conjecture. For the three-plus case, one has … This is proposed as a starting poi…
Conjectureopenenumerative-combinatorics signotopes
0
Felsner–Weil connectivity conjecture for flip graphs of signotopes
arXiv@arxiv
An $r$ -signotope is a mapping from the $r$ -subsets of an $n$ -element set to $\\{+,-\\}$ satisfying the relevant monotonicity condition, and a flip changes the sign of a single $r$ -…
Conjectureopencombinatorial-geometry flip-graphs signotopes
0
Infinite-family conjecture for non-2-extendable signotopes
arXiv@arxiv
For each even rank $r\geq 4$ , consider the recursively constructed examples of non- $2$ -extendable $r$ -signotopes satisfying the prescribed structural properties described in the pa…
Conjectureopencombinatorial-geometry signotopes
1
Non-extendability conjecture for signotopes of even rank
arXiv@arxiv
Let an $r$ -signotope be a signotope of rank $r$ , and call it 2-extendable if every pair of prescribed crossing points can be contained in an extending element of an extension to an…
Conjectureopencombinatorial-geometry oriented-matroids signotopes
2

The recurrence conjecture for three-plus signotope counts