相关论文: Primary Decomposition of Symmetric Ideals

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

Taking a ring-theoretic perspective as our motivation, the main aim of this series is to establish a comprehensive theory of ideals in commutative quantales with an identity element. This particular article focuses on an examination of…

In this paper, we present an algorithm for computing the minimal reductions of $\mathfrak{m}$-primary ideals of Cohen--Macaulay local rings. Using this algorithm, we are able to compute the Hilbert--Samuel multiplicities and solve the…

The main purpose of this paper is to investigate the formal deficiency indices ${\cal N}_{\pm}(I)$ of a symmetric first order system $$ Jf'+Bf=\lambda {\cal H} f $$ on an interval $I$, where $I=\mathbb{R}$ or $I=\mathbb{R}_\pm.$ Here…

Let $R = K[x_1, x_2, x_3, x_4]$ be the polynomial ring over a field of characteristic zero. For the ideal $(x_1^a, x_2^b, x_3^c, x_4^d) \subset R$, where at least one of $a$, $b$, $c$ and $d$ is equal to two, we prove that its generic…

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

Let $K$ be a field, and let $R = K[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $K$. Let ${\mathfrak S}_{X}$ be the symmetric group of $X$. The group ${\mathfrak S}_{X}$ acts naturally on $R$, and this in…

We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

We consider the general polynomial optimization problem $P: f^*=\min \{f(x)\,:\,x\in K\}$ where $K$ is a compact basic semi-algebraic set. We first show that the standard Lagrangian relaxation yields a lower bound as close as desired to the…

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

Let $G$ be an (oriented) graph on the vertex set $V = \{ 0, 1,\ldots,n\}$ with root $0$. Postnikov and Shapiro associated a monomial ideal $\mathcal{M}_G$ in the polynomial ring $ R = {\mathbb{K}}[x_1,\ldots,x_n]$ over a field $\mathbb{K}$.…

Let $A/K$ be an absolutely simple abelian surface defined over a number field $K$. We give unconditional upper bounds for the number of prime ideals $\mathfrak{p}$ of $K$ with norm up to $x$ such that $A$ has supersingular reduction at…

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…

Let $I\subset S=K[x_1,\dots,x_n]$ be a squarefree monomial ideal, $K$ a field. The $k$th squarefree power $I^{[k]}$ of $I$ is the monomial ideal of $S$ generated by all squarefree monomials belonging to $I^k$. The biggest integer $k$ such…

Let $G$ be a simple real Lie group with maximal parabolic subgroup $P$ whose nilradical is abelian. Then $X=G/P$ is called a symmetric $R$-space. We study the degenerate principal series representations of $G$ on $C^\infty(X)$ in the case…

A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge…