Related papers: Non-Commutative Gebauer-Moeller Criteria
Let $R$ be a commutative Noetherian ring of dimension $d$. First, we define the "geometric subring" $A$ of a polynomial ring $R[T]$ of dimension $d+1$ (the definition of geometric subring is more general, see (1.2)). Then we prove that…
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not well-understood yet. In…
Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…
Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…
We prove some algebraic results on the ring of matrix differential operators over a differential field in the generality of non-commutative principal ideal rings. These results are used in the theory of non-local Poisson structures.
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…
The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
Let $K$ be a field and $D$ be a finite-dimensional central division algebra over $K$. We prove a variant of the Nullstellensatz for $2$-sided ideals in the ring of polynomial maps $D^n \to D$. In the case where $D = K$ is commutative, our…
Motivated by problems in data clustering, we establish general conditions under which families of nonparametric mixture models are identifiable, by introducing a novel framework involving clustering overfitted \emph{parametric} (i.e.…
The goal of this paper is to study the boundedness and compactness of the Bergman projection commutators in two weighted settings via the weighted BMO and VMO spaces, respectively. The novelty of our work lies in the distinct treatment of…
We investigate properties of commutative subrings and ideals in non-commutative algebraic crossed products for actions by arbitrary groups. A description of the commutant of the base coefficient subring in the crossed product ring is given.…
Some new characterizations of nonnegative Hamiltonian operator matrices are given. Several necessary and sufficient conditions for an unbounded nonnegative Hamiltonian operators to be invertible are obtained; so that the main results in the…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…
An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…
We generalize entanglement detection with covariance matrices for an arbitrary set of observables. A generalized uncertainty relation is constructed using the covariance and commutation matrices, then a criterion is established by…