Related papers: Mora's holy grail: Algorithms for computing in loc…
Optimization problems over permutation matrices appear widely in facility layout, chip design, scheduling, pattern recognition, computer vision, graph matching, etc. Since this problem is NP-hard due to the combinatorial nature of…
This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
Let $D$ be an integrally closed local Noetherian domain of Krull dimension 2, and let $f$ be a nonzero element of $D$ such that $fD$ has prime radical. We consider when an integrally closed ring $H$ between $D$ and $D_f$ is determined…
Known classification results allow us to find the number of (equivalence classes of) fine gradings on matrix algebras and on classical simple Lie algebras over an algebraically closed field $\mathbb{F}$ (assuming $\mathrm{char}…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
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…
We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
The Qth-power algorithm for computing structured global presentations of integral closures of affine domains over finite fields is modified to compute structured presentations of integral closures of ideals in affine domains over finite…
Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…
In this paper, we describe the structure of the localization of Ext^{i}_{R}(R/P,M), where P is a prime ideal and M is a module, at certain Ore sets X. We first study the situation for FBN rings, and then consider matters for a large class…
Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…
In the local setting, Gr\"obner cells are affine spaces that parametrize ideals in $\mathbf{k}[\![x,y]\!]$ that share the same leading term ideal with respect to a local term ordering. In particular, all ideals in a cell have the same…
This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…
We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…
The concepts of localizable set, localization of a ring and a module at a localizable set are introduced and studied. Localizable sets are generalization of Ore sets and denominator sets, and the localization of a ring/module at a…
We classify good Z-gradings of basic Lie superalgebras over an algebraically closed field of characteristic zero. Good Z-gradings are used in quantum Hamiltonian reduction for affine Lie superalgebras, where they play a role in the…