Related papers: Mora's holy grail: Algorithms for computing in loc…
Let $A$ be a finite dimensional real algebra with a division grading by a finite abelian group $G$. In this paper we provide finite basis for the $T_G$-ideal of graded identities and for the $T_G$-space of graded central polynomials for…
Hilbert order is widely applied in many areas. However, most of the algorithms are confined to low dimensional cases. In this paper, algorithms for encoding and decoding arbitrary dimensional Hilbert order are presented. Eight algorithms…
The Metropolis-adjusted Langevin (MALA) algorithm is a sampling algorithm that incorporates the gradient of the logarithm of the target density in its proposal distribution. In an earlier joint work \citet{pill:stu:12}, the author had…
We present a new algorithm for solving optimization problems with objective functions that are the sum of a smooth function and a (potentially) nonsmooth regularization function, and nonlinear equality constraints. The algorithm may be…
Localization is a critical aspect of mobile robotics, enabling robots to navigate their environment efficiently and avoid obstacles. Current probabilistic localization methods, such as the Adaptive-Monte Carlo localization (AMCL) algorithm,…
Binary classification is widely used in ML production systems. Monitoring classifiers in a constrained event space is well known. However, real world production systems often lack the ground truth these methods require. Privacy concerns may…
We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…
Hilbert specialization is an important tool in Field Arithmetic and Arithmetic Geometry, which has usually been intended for polynomials, hence hypersurfaces, and at scalar values. In this article, first, we extend this tool to prime…
The aim of this article is to establish the specialization method on characteristic ideals for finitely generated torsion modules over a complete local normal domain R that is module-finite over $O[[x_1, ..., x_d]]$, where $O$ is the ring…
This paper contains a survey of some ring-theoretic aspects of quantized coordinate rings, with primary focus on the prime and primitive spectra. For these algebras, the overall structure of the prime spectrum is governed by a partition…
Representing images by compact codes has proven beneficial for many visual recognition tasks. Most existing techniques, however, perform this coding step directly in image feature space, where the distributions of the different classes are…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
This article focuses on approximately prime rings and approximately prime ideals in proximal relator spaces, especially in descriptive proximity spaces. In particular, we define some binary operations, including the product of two…
It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
The low-rank matrix optimization with affine set (rank-MOA) is to minimize a continuously differentiable function over a low-rank set intersecting with an affine set. Under some suitable assumptions, the intersection rule of the Fr\'{e}chet…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
We study a logarithmic version of the classical result of Artin-Furw{\"a}ngler on principalization of ideal classes in the Hilbert class-field by applying the group theoretic description of the transfert map to logarithmic class-groups of…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
Using group actions and orbit-stabilizer methods, we study the geometry of isomorphism classes of finite-dimensional $\omega$-Lie algebras over a field $\mathbb{K}$ of characteristic $\neq 2$ and establish a one-to-one correspondence…