相关论文: Numerical computation of H-bases

We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…

We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates integrand reduction and global residue computations in a way very similar to using a Gr\"obner basis, but…

We give an different proof of our result computing the stable homology of dihedral group Hurwitz spaces. This proof employs more elementary methods, instead of higher algebra.

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…

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

It's well know that Radial Basis Function approximants suffers of bad conditioning if the simple basis of translates is used. A recent work of M.Pazouki and R.Schaback gives a quite general way to build stable, orthonormal bases for the…

One standard approach to compute the Hilbert function of any graded module over a field is to come up with a free-resolution for the graded module and another is via a Hilbert power series which serves as a generating function. The proposed…

This paper presents a simple and effective new numerical scheme for the computation of electrostatic fields exterior to a collection of close-to-touching discs. The method is presented in detail for the two-cylinder case. The key idea is to…

The Hylleraas-B-splines basis set is introduced in this paper, which can be used to obtain the eigenvalues and eigenstates of helium-like system's Hamiltonian. Comparing with traditional B-splines basis, the rate of convergence of our…

We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation.

We study the space of smooth marked hypersurfaces in a given linear system. Specifically, we prove a homology h-principle to compare it with a space of sections of an appropriate jet bundle. Using rational models, we compute its rational…

Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees of…

For all spherical homogeneous spaces G/H, where G is a simply connected semisimple algebraic group and H a connected solvable subgroup of G, we compute the spectra of the representations of G on spaces of regular sections of homogeneous…

We describe a method to compute Hurwitz-Hodge integrals.

We prove that the rational cohomology $H^i(\mathcal{T}_g;\mathbf{Q})$ of the moduli space of trigonal curves of genus $g$ is independent of $g$ in degree $i<\lfloor g/4\rfloor.$ This makes possible to define the stable cohomology ring as…

Let $(X, H)$ be a polarized smooth projective algebraic surface and $E$ is globally generated, stable vector bundle on $X$. Then the Syzygy bundle $M_E$ associated to it is defined as the kernel bundle corresponding to the evaluation map.…

This article reports on the confluence of two streams of research, one emanating from the fields of numerical analysis and scientific computation, the other from topology and geometry. In it we consider the numerical discretization of…

In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…

We investigate the application of syzygies for efficiently computing (finite) Pommaret bases. For this purpose, we first describe a non-trivial variant of Gerdt's algorithm to construct an involutive basis for the input ideal as well as an…

Let L be an abelian number field of degree n with Galois group G. In this paper we study how to compute efficiently a normal integral basis for L, if there is at least one, assuming that the group G and an integral basis for L are known.