Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
What's wrong with taking $A$ and $B$ to be sets of nonzero multiples of some specific but rather general polynomials $f$ and $g$? These should be of size $|\mathbb F|-1$, and the restrictions to any line would be of the same size?
I suggest looking at how the tangent subspaces $Lie(G)x$ and $T(x,X^R)$ intersect as $x$ varies in $X^R$. I would want to look at examples where the dimension of the intersection jumps at some $x$
You can probably make $D$ with positive minors by having $D_{ij}$ grow extremely fast in the lexicographic order so that one of the terms in each Pfaffian dominates the rest of the terms.
If you have $A' = A + t D$, then Pfaffians of $A'$ will have as their leading terms as $t\to \infty$ the Pfaffians of $D$ times the appropriate power of $t$. So positivity for $A'$ follows from that of $D$.
So by scaling $D= A'-A$ by a large integer, the problem reduces to finding a skew-symmetric matrix with positive integer entries above the diagonal such that all Pfaffians are positive. In fact, one can ignore the integrality and allow for arbitrary nonnegative entries (which can then be approximated by rationals and zeroes replaced by small rationals).
@Alexey Ustinov I presume that this means that there are formulas for the eigenvectors that involve sums of $1/k$. The LCM in A025529 must be an artifact of trying to get integer values for the eigenvectors.
Thank you, I will take a look at it. I saw that reference in Luke's book. Was under the impression that the idea was to approximate $\Gamma(s)^N$ by $\Gamma(Ns-i)$, will look in more detail.