Related papers: Minimal Gr\"obner bases and the predictable leadin…
Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
Birkenmeier and Heider, in [2], say that a ring R is right cP-Baer if the right annihilator of a cyclic projective right R-module in R is generated by an idempotent. These rings are a generalization of the right p.q.-Baer and abelian rings.…
Using $\mathcal{P}$-canonical forms of matrices, we derive the minimal polynomial of the Kronecker product of a given family of matrices in terms of the minimal polynomials of these matrices. This, allows us to prove that the product…
Symmetric submodular function minimization admits purely combinatorial algorithms using special orderings of the ground set. Extending the minimum-cut algorithm of Nagamochi and Ibaraki (1992), Queyranne (1998) showed that the maximum…
The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…
We propose a parameter-minimal neural architecture for solving differential equations by restricting the hypothesis class to Horner-factorized polynomials, yielding an implicit, differentiable trial solution with only a small set of…
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
Let $I = ( f_1, \dots, f_n )$ be a homogeneous ideal in the polynomial ring $K[x_1, \dots,x_n]$ over a field $K$ generated by generic polynomials. Using an incremental approach based on a method by Gao, Guan and Volny, and properties of the…
Let g be a complex reductive Lie algebra and U(g) the universal enveloping algebra of g. Associated to a faithful irreducible finite dimensional representation of g, a square matrix F with entries in U(g) naturally arises and if we consider…
A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…
In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…
This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…
The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the…
We collect here elementary properties of differentiation matrices for univariate polynomials expressed in various bases, including orthogonal polynomial bases and non-degree-graded bases such as Bernstein bases and Lagrange \& Hermite…
This first part of the paper describes the support of top graded local cohomology modules. As a corrolary one obtains a simple criteria for the vanishing of these modules and also the fact that they have finitely many minimal primes. The…
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
Minimal free resolutions of graded modules over a noetherian polynomial ring have been attractive objects of interest for more than a hundred years. We introduce and study two natural extensions in the setting of graded modules over a…