4 problems

Let $T$ be an irreducible hypertree, and identify it with its graph $G$, whose edges are the pairs occurring in the triples of $T$. Irreducible hypertree copiousness conjecture. Ev…

Let $[n]=\{1,2,\dots,n\}$, and call a graph on $[n]$ a minimal kinematics graph when its edge set is inclusion-maximal among the graphs realizing minimal kinematics. Minimal kinema…

Let $L_m$ be the relevant linear space arrangement, let $\mathbb{L}_s$ be the linear space determined by the kinematic data $s$, and let $I_r(W)$ be a type (ii) flat, with associat…

Component-count conjecture. The lifted scattering correspondence $\widetilde{\rm C}(3,n,1)$ decomposes into five irreducible components, with exactly one component whose map onto…