By using constant term manipulations, we present the first polynomial-time algorithm for lattice-point counting in fixed dimension that does not rely on Barvinok's unimodular decomposition. Our method starts from partial fraction decompositions and root-of-unity formulas for the lattice-point generating function of a rational simplicial cone. By means of a residue-lattice argument based on Minkowski's theorem, we construct a short multiplier that enables an exact recursive reduction. Smith normal form is then used to normalize the resulting child terms and restore the recursive structure. These transformations are justified by algebraic identities involving roots of binomial equations, while the algorithm itself works with integer exponent data and requires no explicit root computations. More precisely, for a rational simplicial cone \(\mathcal K\) in fixed dimension \(d\), with dual cone \(\mathcal K^*\), the algorithm achieves recursion depth \(O_d(1+\log\log(2+\ind(\mathcal K^*)))\) and produces a signed sum of at most \((1+\log\ind(\mathcal K^*))^{O_d(1)}\) unimodular cone generating functions. The framework uniformly handles numerators that are Laurent polynomials, not merely monomials, thereby giving a polynomial-time algorithm for MacMahon's partition analysis when the dimension is fixed.
We study rational points of bounded maximum-coordinate height on the split four-nodal Cayley cubic surface over \(\mathbb Q\), with its nine lines removed. Writing \(U\) for this open subset and \(N_U(B)\) for its counting function, we establish \[ N_U(B)\sim c_{\mathrm{Peyre}}B(\log B)^6. \] The argument starts from t...
For a Bruhat interval $[x,y]$ in an arbitrary Coxeter group which is a lattice, we give a type-uniform construction of a convex polytope whose complete face lattice realizes $[x,y]$. This gives a polytopal realization of the coincidence between classical Kazhdan--Lusztig polynomials for lattice Bruhat intervals and Sta...
Let $A$ and $B$ be polynomials with integer coefficients. We study nonzero integer solutions of $$y\mid A(x),\qquad x\mid B(y),$$ using quotient transformations that may change the polynomial pair. We call this process \emph{congruence jumping}. We establish a general reciprocal-polynomial rule governing such jumps, wi...
We study the dimension-indexed marked-root polynomial maps introduced by Harish. For every $n\geq 4$, their lower coefficient block extends to a polynomial coordinate system, giving three-dimensional Keller maps of geometric degree $n(n-2)$ for every choice of the fixed coefficients. We determine the generic monodromy...
We give a deterministic polynomial-time primality test whose main verification is the congruence $(1+X)^n=1+X^n$ in $C_n[X]/(X^r-b(Y))$, where $C_n=(\mathbb{Z}/n\mathbb{Z})[Y]/(\Phi_r(Y))$. Two identities in the coefficient ring normalize $b$ and ensure compatibility with the main congruence. A finite-field root count...
We give a self-contained constructive proof that the matrix multiplication exponent satisfies $\omega\le9/4$. In a recent breakthrough, OpenAI~\cite{original} established this bound in the model of exact scalar arithmetic over the complex numbers, using non-constructive arguments in Strassen's asymptotic spectral frame...
Rafael Pass· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.