Related papers: On the decomposable semigroups and applications
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
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…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
In this paper we introduce the notion of right waist and right comparizer ideals for semigroups. In particular, we study the ideal theory of semigroups containing right waists and right comparizer ideals. We also study those properties of…
In this paper, we view the collection of ideals of a commutative principal ideal ring from two perspectives: one as an ordered semigroup I(R) and the other as a category I_R . It is shown that I(R) is a regular ordered semigroup whereas I_R…
Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
A symbolic approach to decentralized set-valued state estimation and prediction for systems that admit a hybrid state machine representations is proposed. The decentralized computational scheme represents a conj unction of a finite number…
The paper begins by exploring the various definitions of norms on semigroups and then presents a new definition of a normed semigroup. The properties of normed semigroups in the new sense are investigated. The new definition of the norm is…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…
Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…
In this paper, we investigate some characteristic features of holomorphic semigroups. In particular, we investigate nice examples of holomorphic semigroups whose every left or right ideal includes minimal ideal. These examples are compact…
Let $G$ be a group hyperbolic relative to a finite collection of subgroups $\mathcal P$. Let $\mathcal F$ be the family of subgroups consisting of all the conjugates of subgroups in $\mathcal P$, all their subgroups, and all finite…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…