Related papers: Newton Binomial Formulas in Schubert Calculus
We develop a randomized Newton's method for solving differential equations, based on a fully connected neural network discretization. In particular, the randomized Newton's method randomly chooses equations from the overdetermined nonlinear…
We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by…
We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.
We prove a formula for the structure constants of multiplication of equivariant Schubert classes in both equivariant cohomology and equivariant K-theory of Kac-Moody flag manifolds G/B. We introduce new operators whose coefficients compute…
This paper focuses on the biderivations of 4-dimensional nilpotent complex Leibniz algebras. Using the existing classification of these algebras, we develop algorithms to compute derivations, antiderivations, and biderivations as pairs of…
A natural Hasse-Schmidt derivation on the exterior algebra of a free module realizes the (small quantum) cohomology ring of the grassmannian $G_k(\CC^n)$ as a ring of operators on the exterior algebra of a free module of rank $n$. Classical…
A constructive version of Newton-Puiseux theorem for computing the Puiseux expansions of algebraic curves is presented. The proof is based on a classical proof by Abhyankar. Algebraic numbers are evaluated dynamically; hence the base field…
Combinatorial $B_n$-analogues of Schubert polynomials and corresponding symmetric functions are constructed from an exponential solution of the $B_n$-Yang-Baxter equation that involves the nilCoxeter algebra of the hyperoctahedral group.
The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…
By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.
Hurwitz numbers enumerate ramified coverings of the Riemann sphere with fixed ramification data. Certain kinds of ramification data are of particular interest, such as double Hurwitz numbers, which count covers with fixed arbitrary…
Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…
We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…
A recursion formula for derivatives of Chebyshev polynomials is replaced by an explicit formula.
An algorithm to compute a good basis of the Brieskorn lattice of a cohomologically tame polynomial is described. This algorithm is based on the results of C. Sabbah and generalizes the algorithm by A. Douai for convenient Newton…
An effective method of computing division polynomials in terms of Mumford coordinates is presented. As an example, division polynomials for $3$- and $4$-torsion divisors on a genus two curve are obtained explicitly in terms of Mumford…
For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…
Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…
We describe a three precision variant of Newton's method for nonlinear equations. We evaluate the nonlinear residual in double precision, store the Jacobian matrix in single precision, and solve the equation for the Newton step with…
As the title suggests, we give a formula for the $n^{th}$ derivative of a quotient of two functions, analogous to Leibniz's formula for the product. This particular note has remained unpublished since 2007 (available only my website),…