Related papers: Computing the Binomial Part of a Polynomial Ideal

We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…

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…

We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $I$ be a homogeneous ideal of $A$ with $I \ne A$ and $H_{A/I}$ the Hilbert function of the quotient algebra $A / I$. Given…

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

We present a semi-algorithm which for any irreducible $p\in\mathbb{K}[x,y]$ finds all elements of $\mathbb{K}(x) + \mathbb{K}(y)$ that are of the form $qp$ for some $q\in\mathbb{K}(x,y)$ whose denominator is not divisible by $p$.

Binary segmentation is the classic greedy algorithm which recursively splits a sequential data set by optimizing some loss or likelihood function. Binary segmentation is widely used for changepoint detection in data sets measured over space…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

We present `liesuperalg` a SageMath package for representation-theoretic calculations involving Lie superalgebras in Type A. Our package introduces functionality to calculate invariants of weights and produce the associated cup diagrams. We…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

We define a notion of ideal for objects in the category of abstract unitary Cuntz semigroups introduced in [3] and termed Cu$^\sim$. We show that the set of ideals of a Cu$^\sim$-semigroup has a complete lattice structure. In fact, we prove…

There is renewed interest in the coideal subalgebras used to form quantum symmetric pairs because of recent discoveries showing that they play a fundamental role in the representation theory of quantized enveloping algebras. However, there…

Given a square matrix $A$ with entries in a commutative ring $S$, the ideal of $S[X]$ consisting of polynomials $f$ with $f(A) =0$ is called the null ideal of $A$. Very little is known about null ideals of matrices over general commutative…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…