Related papers: Computation of Jeffrey-Kirwan residue using Gr\"ob…
A new numerical method is developed for solution of the Gel'fand - Levitan - Marchenko inverse scattering integral equations. The method is based on the fast inversion procedure of a Toeplitz Hermitian matrix and special bordering…
We compute the elliptic genera of general two-dimensional N=(2,2) and N=(0,2) gauge theories. We find that the elliptic genus is given by the sum of Jeffrey-Kirwan residues of a meromorphic form, representing the one-loop determinant of…
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…
We show here how residue calculus (residue currents, Grothendieck residues, duality theorem) can be used to obtain an algebraic characterization of the Abel-transform of a meromorphic form on germs of analytic sets. We prove by this way a…
A bivariate distribution with continuous margins can be uniquely decomposed via a copula and its marginal distributions. We consider the problem of estimating the copula function and adopt a Bayesian approach. On the space of copula…
In the present paper, we introduce the concepts of Jacobi polynomials and intersection enumerators of codes over $\mathbb{F}_q$ and $\mathbb{Z}_{k}$ for arbitrary genus $g$. We also discuss the interrelation among them. Finally, we give the…
Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…
A generalization of the Gr\"{u}nwald difference approximation for fractional derivatives in terms of a real sequence and its generating function is presented. Properties of the generating function are derived for consistency and order of…
We propose a new more efficient method for the computation of two-sided Gr\"obner bases of ideals and bimodules shifting the problem to the enveloping algebra. Arising from the ideas this method involves, we introduce the notion of…
This paper is concerned with the numerical computation of scattering resonances of the Laplacian for Dirichlet obstacles with rough boundary. We prove that under mild geometric assumptions on the obstacle there exists an algorithm whose…
The goal of this paper is to give an efficient computation of the 3-point Gromov-Witten invariants of Fano hypersurfaces, starting from the Picard-Fuchs equation. This simplifies and to some extent explains the original computations of…
While Jeffreys priors usually are well-defined for the parameters of mixtures of distributions, they are not available in closed form. Furthermore, they often are improper priors. Hence, they have never been used to draw inference on the…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
A general jackknife estimator for the asymptotic covariance of moment estimators is considered in the case when the sample is taken from a mixture with varying concentrations of components. Consistency of the estimator is demonstrated. A…
We give a combinatorial rule for computing intersection numbers on a flag manifold which come from products of Schubert classes pulled back from Grassmannian projections. This rule generalizes the known rule for Grassmannians.
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…
Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…