Related papers: Mora's holy grail: Algorithms for computing in loc…
Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…
Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
Normalization is a fundamental ring-theoretic operation; geometrically it resolves singularities in codimension one. Existing algorithmic methods for computing the normalization rely on a common recipe: successively enlarge the given ring…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
Let $R=\bC[\bfx]$ be a polynomial ring with complex coefficients and $\Dx = \bC<bfx,\bfp>$ be the Weyl algebra. Describing the localization $R_f = R[f^{-1}]$ for nonzero $f\in R$ as a $\Dx$-module amounts to computing the annihilator $A =…
The principal ideal problem constitutes a fundamental problem in algebraic number theory and has attracted significant attention due to its applications in ideal lattice based cryptosystems. Efficient quantum algorithm has been found to…
Solutions of partial differential equations can often be written as surface integrals having a kernel related to a singular fundamental solution. Special methods are needed to evaluate the integral accurately at points on or near the…
In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…
Let $A$ be a differential graded algebra with cohomology ring $H^*A$. A graded module over $H^*A$ is called \emph{realisable} if it is (up to direct summands) of the form $H^*M$ for some differential graded $A$-module $M$. Benson, Krause…
We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…
This paper shows the existence of ideals whose localizations and completions at prime ideals are parameter test ideals of the localized and completed rings. We do this for Cohen-Macaulay localizations (resp., completions) of non-local…
We call the scheme parameterizing homogeneous ideals with fixed initial ideal the Gr\"obner scheme. We introduce a Bia{\l}ynicki-Birula decomposition of the Hilbert scheme $\mathrm{Hilb}^{P}_n$ for any Hilbert polynomial $P$ such that the…
In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…
We present new algorithms for computing adjoint ideals of curves and thus, in the planar case, adjoint curves. With regard to terminology, we follow Gorenstein who states the adjoint condition in terms of conductors. Our main algorithm…
In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…