Related papers: Computation of Jeffrey-Kirwan residue using Gr\"ob…
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master…
It is well-known that the intersection multiplicities of Schubert classes in the Grassmanian are Littlewood-Richardson coefficients. We generalize this statement in the context of quiver representations. Here the intersection multiplicity…
The determination of Jacobi sums, their congruences and cyclotomic numbers have been the object of attention for many years and there are large number of interesting results related to these in the literature. This survey aims at reviewing…
The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…
The Grothendieck and Artin-Mumford exact sequences for the Brauer group of a function field in 1 or 2 variables are applied to derive reciprocity laws for $q$th power residues.
We present an implementation of the Atiyah-Bott residue formula for $\overline{M}_{0,m}(\mathbb{P}^{n},d)$. We use this implementation to compute a large number of Gromov-Witten invariants of genus $0$, including intersection numbers of…
In this paper, we compute the Gr\"obner-Shirshov bases for certain regular double extension algebras by means of an algorithm implemented in Matlab, which facilitates the underlying algebraic computations. Moreover, we establish that these…
The Coulomb Branch Formula conjecturally expresses the refined Witten index for $N=4$ Quiver Quantum Mechanics as a sum over multi-centered collinear black hole solutions, weighted by so-called `single-centered' or `pure-Higgs' indices, and…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
Fast, accurate, and stable computation of the Clebsch-Gordan (C-G) coefficients is always desirable, for example, in light scattering simulations, the translation of the multipole fields, quantum physics and chemistry. Current recursive…
Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
The direct method used for calculating smooth radial basis function (RBF) interpolants in the flat limit becomes numerically unstable. The RBF-QR algorithm bypasses this ill-conditioning using a clever change of basis technique. We extend…
Computation of the spherical harmonic rotation coefficients or elements of Wigner's d-matrix is important in a number of quantum mechanics and mathematical physics applications. Particularly, this is important for the Fast Multipole Methods…
Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We derive a formula for the evaluation of weighted generalized Fibonacci sums of the type $S_k^n (w,r) = \sum_{j = 0}^k {w^j j^r G_j{}^n }$. Several explicit evaluations are presented as examples.
We show how to efficiently compute functions on jacobian varieties and their quotients. We deduce a quasi-optimal algorithm to compute $(l,l)$ isogenies between jacobians of genus two curves.
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…
Let $f_1,\ldots,f_m$ be elements in a quotient $R^n / N$ which has finite dimension as a $K$-vector space, where $R = K[X_1,\ldots,X_r]$ and $N$ is an $R$-submodule of $R^n$. We address the problem of computing a Gr\"obner basis of the…