Related papers: Computing the 4D Geode
We extend our previous work on hypergeometric point count formulas by proving that we can express the number of points on families of Dwork hypersurfaces $$X_{\lambda}^d: \hspace{.1in} x_1^d+x_2^d+\ldots+x_d^d=d\lambda x_1x_2\cdots x_d$$…
We consider hyperbolic structures on the compression body C with genus 2 positive boundary and genus 1 negative boundary. Note that C deformation retracts to the union of the torus boundary and a single arc with its endpoints on the torus.…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…
A notion of gcd chain has been introduced by the author at ISSAC 2017 for two univariate monic polynomials with coefficients in a ring R = k[x_1, ..., x_n ]/(T) where T is a primary triangular set of dimension zero. A complete algorithm to…
We first give a geometric construction of a 2-dimensional mixed motive over $\mathbb{Q}$ with the Catalan constant $\mathbf{G}=1-1/3^2+1/5^2-1/7^2+\cdots$ as a period. We then use this motive to obtain a supply of linear forms in 1 and…
Two formulas for the classical number $C_n$ of lines on a generic hypersurface of degree $2n-3$ in $\mathbb{CP}^n$ are obtained which differ from the formulas by Dominici, Harris, Libgober, and van der Waerden-Zagier. We review the…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We present exercises with solutions related to A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode.
By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…
We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine…
For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…
In this note I will explain how relative/log Gromov-Witten invariants of pairs $(X,D)$ with very ample smooth anticanonical divisor $D$ can be computed using algebro-combinatorial objects called scattering diagrams. The underlying principle…
We give an expression for number of points for the family of Dwork K3 surfaces $$X_{\lambda}^4: \hspace{.1in} x_1^4+x_2^4+x_3^4+x_4^4=4\lambda x_1x_2x_3x_4$$ over finite fields of order $q\equiv 1\pmod 4$ in terms of Greene's finite field…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…
We study zero-divisors in the $16$-dimensional sedenion algebra from the viewpoint of the determinant of left multiplication. We show that this determinant admits a canonical factorization into the square of a quartic polynomial, obtained…
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…