Related papers: Minimal Gr\"obner bases and the predictable leadin…

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

In this paper we give versions of Hilbert's syzygy theorem for finitely generated modules over polynomial rings over direct product of principal ideal rings.

Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…

We consider the problem of computing a grevlex Gr\"obner basis for the set $F_r(M)$ of minors of size $r$ of an $n\times n$ matrix $M$ of generic linear forms over a field of characteristic zero or large enough. Such sets are not regular…

Gr\"obner bases have been generalized by replacing monomial orders with constructions such as valuations and filtrations. We consider suitable valuations on a rational valuation field $K(x,y)$ and analyze their behavior when restricting to…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

Let $R=k[x_1,..., x_n]$ be a polynomial ring over a field $k$ of characteristic $p>0,$ and let $I=(f_1,...,f_s)$ be an ideal of $R.$ We prove that every associated prime $P$ of $H^i_I(R)$ satisfies $\text{dim}R/P\geqslant…

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

In this paper, we extend the theory of minimal limit key polynomials of valuations on the polynomial ring $\kx$. We use the theory of cuts on ordered abelian groups to show that the previous results on bounded sets of key polynomials of…

In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…

We give a necessary condition for the existence of a path of n irreducible morphisms between indecomposable modules whose composition lies in the (n + 1)-power of the radical. In order to do that, we consider the general criterion given by…

Multi-objective reinforcement learning (MORL) is a structured approach for optimizing tasks with multiple objectives. However, it often relies on pre-defined reward functions, which can be hard to design for balancing conflicting goals and…

We introduce the notion of a favourable module for a complex unipotent algebraic group, whose properties are governed by the combinatorics of an associated polytope. We describe two filtrations of the module, one given by the total degree…

This article investigates the splitting problem for finitely generated projective modules $P$ over affine algebras over algebraically closed fields and their polynomial extensions. We then address an open question due to M. Roitman on monic…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

Let $K$ be a field of characteristic $p>0$, $A=K[[Y]]$ be a power series ring in one variable and $Q(A)$ be the field of fraction of $A$. Suppose that $R=A[X_1,\ldots,X_n]$ is a standard $\mathbb{N}^n$-graded polynomial ring over $A$, i.e.,…

We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The new algorithm is based on the idea of treating the…

The advent of data science has spurred interest in estimating properties of distributions over large alphabets. Fundamental symmetric properties such as support size, support coverage, entropy, and proximity to uniformity, received most…

We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…

Let A be a commutative Noetherian ring of dimension d and let P be a projective R=A[X_1,\ldots,X_l,Y_1,\ldots,Y_m,\frac {1}{f_1\ldots f_m}]-module of rank r\geq max {2,dim A+1, where f_i\in A[Y_i]. Then (i) \EL^1(R\op P) acts transitively…