相关论文: On the computation of the Omega invariant of a num…
In this paper, we present an improved methodology to compute $\omega$-invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the…
This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series…
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
In this paper, we present an exact algorithm for optimizing two linear fractional over the efficient set of a multi-objective integer quadratic problem. This type of problems arises when two decision-makers, such as firms, each have a…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
Let $\Omega$ be an operator semigroup with generator $A$ in a sequentially complete locally convex topological vector space $E$. For a semigroup with generator $A+D$, where $D$ is a bounded linear operator on $E$, two integral equations are…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…
Let $\Gamma=\langle \alpha, \beta \rangle$ be a numerical semigroup. In this article we consider the dual $\Delta^*$ of a $\Gamma$-semimodule $\Delta$; in particular we deduce a formula that expresses the minimal set of generators of…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
In this article, first we give two formulae for the delta invariant of a complex curve singularity that can be embedded as a ${\mathbb Q}$-Cartier divisor in a normal surface singularity with rational homology sphere link. Next, we consider…
We examine a multidimensional optimisation problem in the tropical mathematics setting. The problem involves the minimisation of a nonlinear function defined on a finite-dimensional semimodule over an idempotent semifield subject to linear…