Related papers: Computation of Jeffrey-Kirwan residue using Gr\"ob…
In this paper we obtain an expression for the residue as it occurs in the non-Abelian localization formula due to Jeffrey and Kirwan. This expression can be used in cohomology computations for symplectic quotients.
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
The Gelfond-Khovanskii residue formula computes the sum of the values of any Laurent polynomial over solutions of a system of Laurent polynomial equations whose Newton polytopes have sufficiently general relative position. We discuss two…
In quiver quantum mechanics with 4 supercharges, supersymmetric ground states are known to be in one-to-one correspondence with Dolbeault cohomology classes on the moduli space of stable quiver representations. Using supersymmetric…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
In the case of Dynkin quivers we establish a formula for the Grothendieck class of a quiver cycle as the iterated residue of a certain rational function, for which we provide an explicit combinatorial construction. Moreover, we utilize a…
In this paper we prove a residue formula for intersection pairings of reduced spaces of certain quasi-Hamiltonian G-spaces, by constructing the corresponding Hamiltonian G-space. Our argument closely follows the methods of a 1998 paper of…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
We study the intersection of two particular Fermat hypersurfaces in $\mathbb{P}^3$ over a finite field. Using the Kani-Rosen decomposition we study arithmetic properties of this curve in terms of its quotients. Explicit computation of the…
In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the…
In this expository style of writing I will give an introduction of Gr\"{o}bner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.