Related papers: Computing $A$-resultants via direct images
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…
Sheaves and sheaf cohomology are powerful tools in computational topology, greatly generalizing persistent homology. We develop an algorithm for simplifying the computation of cellular sheaf cohomology via (discrete) Morse-theoretic…
In this paper we find monomial bases for the integer cohomology rings of compact wonderful models of toric arrangements. In the description of the monomials various combinatorial objects come into play: building sets, nested sets, and the…
The genus 0, fixed-domain log Gromov-Witten invariants of a smooth, projective toric variety X enumerate maps from a general pointed rational curve to a smooth, projective toric variety passing through the maximal number of general points…
This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
An efficient numerical method to compute solitary wave solutions to the free surface Euler equations is reported. It is based on the conformal mapping technique combined with an efficient Fourier pseudo-spectral method. The resulting…
A technique is presented for producing synthetic images from numerical simulations whereby the image resolution is adapted around prominent features. In so doing, adaptive image ray-tracing (AIR) improves the efficiency of a calculation by…
Quantitative formulations of Fefferman's counterexample for the ball multiplier are naturally linked to square function and vector-valued estimates for directional singular integrals. The latter are usually referred to as Meyer-type lemmas…
Let $X$ be a fs logarithmic scheme that is generically logarithmically smooth, and that admits a strict closed embedding into a logarithmically smooth scheme $Y$ over a field $\kk$ of characteristic zero. We construct a simple and fast…
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
The main objective of the present paper is to set up the theoretical basis and the language needed to deal with the problem of direct images of hermitian vector bundles for projective non-necessarily smooth morphisms. To this end, we first…
We present an algorithm to compute the automorphism group of a Mori dream space. As an example calculation, we determine the automorphism groups of singular cubic surfaces with general parameters. The strategy is to study graded…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
The G-Wishart distribution is the conjugate prior for precision matrices that encode the conditional independencies of a Gaussian graphical model. While the distribution has received considerable attention, posterior inference has proven…
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze…
The group scheme of ternary automorphisms of a perfect finite dimensional evolution algebra A is computed. The main advantage of using group schemes is that it allows to apply the Lie functor to determine the Lie algebra of ternary…