Related papers: Algorithms for Bernstein-Sato polynomials and mult…
In a previous paper, the authors defined an equivariant version of the so-called Saito duality between the monodromy zeta functions as a sort of Fourier transform between the Burnside rings of an abelian group and of its group of…
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
We explore the combination of deterministic and Monte Carlo methods to facilitate efficient automatic numerical computation of multidimensional integrals with singular integrands. Two adaptive algorithms are presented that employ recursion…
In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when…
Recently, Bruinier and Ono found an algebraic formula for the partition function in terms of traces of singular moduli of a certain non-holomorphic modular function. In this paper we prove that the rational polynomial having these singuar…
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…
Empirical evidence reveals existence of partial D-operators for the generalized IBP (BT) reduction algorithms that are, counterintuitively, much simpler and much easier to find than the complete D-operators from the foundational Bernstein…
By using sheaf-theoretical methods such as constructible sheaves, we generalize the formula of Libgober-Sperber concerning the zeta functions of monodromy at infinity of polynomial maps into various directions. In particular, some formulas…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…
Recently, a universal formula for a non-holomorphic modular completion of the generating functions of refined BPS indices in various theories with $N=2$ supersymmetry has been suggested. It expresses the completion through the holomorphic…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
We develop a theory of Valuation Hilbert Modules and prove a version of Beurling's theorem for these. Then we apply our version of Beurling's theorem to obtain complete descriptions of the closed invariant subspaces of a number of Hilbert…