Related papers: Macaulay bases of modules
We present a general approach to a modular frame theory in C*-algebras and Hilbert C*-modules. The investigations rely on the idea of geometric dilation to standard Hilbert C*-modules over unital C*-algebras that possess orthonormal Hilbert…
Let $R$ be a commutative ring with identity and $G$ a graph. Extending generalized splines are a further extension of generalized splines by allowing vertex labels of $G$ to lie in varying modules rather than in a fixed ring $R$.…
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…
We study the complexity of Gr\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree $d$…
We compute bilinear integrals involving Macdonald and Gegenbauer functions. These integrals are convergent only for a limited range of parameters. However, when one uses generalized integrals they can be computed essentially without…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
Let $R$ be a commutative ring with identity and $G$ a graph. An extending generalized spline on $G$ is a vertex labeling $f \in \prod_{v} M_v$, where for each edge $e=uv$ there exists an $R$-module $M_{uv}$ together with homomorphisms $…
We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
Necessary and sufficient conditions are given for a $G$-graded simple module over a unital associative algebra, graded by an abelian group $G$, to be isomorphic to a loop module of a simple module, as well as for two such loop modules to be…
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…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
Let R be a local ring and C a semidualizing module of R. We investigate the behavior of certain classes of generalized Cohen-Macaulay R-modules under the Foxby equivalence between the Auslander and Bass classes with respect to C. In…
In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
This paper shows that if $R$ is a homomorphic image of a Cohen-Macaulay local ring, then $R$-module $M$ is sequentially generalized Cohen-Macaulay if and only if the difference between Hilbert coefficients and arithmetic degrees for all…
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…