Related papers: An Algorithm for Computing the Ratliff-Rush Closur…

Finding the number of meaningful clusters in an unlabeled dataset is important in many applications. Regularized k-means algorithm is a possible approach frequently used to find the correct number of distinct clusters in datasets. The most…

In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…

We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…

For an ideal $I_{m,n}$ generated by all square-free monomials of degree $m$ in a polynomial ring $R$ with $n$ variables, we obtain a specific embedding of a canonical module of $R/I_{m,n}$ to $R/I_{m,n}$ itself. The construction of this…

Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…

We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.

We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…

We use the Kempf-Lascoux-Weyman geometric technique in order to determine the minimal free resolutions of some orbit closures of quivers. As a consequence, we obtain that for Dynkin quivers orbit closures of 1-step representations are…

We describe some basic facts about the weak subintegral closure of ideals in both the algebraic and complex-analytic settings. We focus on the analogy between results on the integral closure of ideals and modules and the weak subintegral…

This article discusses a way for uniquely setting up the valuations for the minimal generators of the maximal ideal of a one dimensional complete reduced and irreducible local algebra over an algebraically closed field, when treated as a…

In this paper we propose a model for computing a minimal free resolution for ideals of the form $I_{1}(X_{n}Y_{n})$, where $X_{n}$ is an $n\times n$ skew-symmetric matrix with indeterminate entries $x_{ij}$ and $Y_{n}$ is a generic column…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this…

Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{m}= (x_1, \ldots, x_n)$ be the irredundant maximal ideal of $S$. For an ideal $I \subset S$, let $\mathrm{sat}(I)$ be the minimum number $k$…

We develop a duality for operations on nested pairs of modules that generalizes the duality between absolute interior operations and residual closure operations from [ER21], extending our previous results to the expanded context. We apply…

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…

We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large…

Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…

We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly…