Almost triangular matrices over Dedekind domains.
In this paper we establish some conditions for an almost -domain to be a -domain. Next -lattices satisfying the union condition on primes are characterized. Using these results, some new characterizations are given for -rings.
Let R be a unital commutative ring and A a unital R-algebra. We introduce the category of E(A,R)-modules which is a natural extension of the category of E-modules. The properties of E(A,R)-modules are studied; in particular we consider the subclass of E(R)-algebras. This subclass is of special interest since it coincides with the class of E-rings in the case R = ℤ. Assuming diamond ⋄, almost-free E(R)-algebras of cardinality κ are constructed for any regular non-weakly compact cardinal κ > ℵ...
Let R be a subring of the rational numbers ℚ. We recall from [3] that an R-module G is a splitter if . In this note we correct the statement of Main Theorem 1.5 in [3] and discuss the existence of non-free splitters of cardinality ℵ₁ under the negation of the special continuum hypothesis CH.
Let be a germ of a complete intersection variety in , , having an isolated singularity at and be the germ of a holomorphic vector field having an isolated zero at and tangent to . We show that in this case the homological index and the GSV-index coincide. In the case when the zero of is also isolated in the ambient space we give a formula for the homological index in terms of local linear algebra.
A closed loop parametrical identification procedure for continuous-time constant linear systems is introduced. This approach which exhibits good robustness properties with respect to a large variety of additive perturbations is based on the following mathematical tools: (1) module theory; (2) differential algebra; (3) operational calculus. Several concrete case-studies with computer simulations demonstrate the efficiency of our on-line identification scheme.
A closed loop parametrical identification procedure for continuous-time constant linear systems is introduced. This approach which exhibits good robustness properties with respect to a large variety of additive perturbations is based on the following mathematical tools: (1) module theory; (2) differential algebra; (3) operational calculus. Several concrete case-studies with computer simulations demonstrate the efficiency of our on-line identification scheme.
This paper gives an algorithm for computing the kernel of a locally finite higher derivation on the polynomial ring k[x₁,..., xₙ] up to a given bound.
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.
An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.
It is known that the identifiability of multivariate mixtures reduces to a question in algebraic geometry. We solve the question by studying certain generators in the ring of polynomials in vector variables, invariant under the action of the symmetric group.