Computing elements of certain form in ideals to prove properties of operators

10/25/2021
by   Clemens Hofstadler, et al.
0

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and discuss relevant algorithmic methods for finding such polynomials based on noncommutative Gröbner bases. In particular, we present algorithms for computing the intersection of a two-sided ideal with a one-sided ideal as well as for computing homogeneous polynomials in two-sided ideals and monomials in one-sided ideals. All methods presented in this work are implemented in the Mathematica package OperatorGB.

READ FULL TEXT
research
02/10/2020

Compatible rewriting of noncommutative polynomials for proving operator identities

The goal of this paper is to prove operator identities using equalities ...
research
05/16/2023

How to automatise proofs of operator statements: Moore-Penrose inverse – a case study

We describe a recently developed algebraic framework for proving first-o...
research
02/04/2020

Separating Variables in Bivariate Polynomial Ideals

We present an algorithm which for any given ideal I⊆𝕂 [x,y] finds all el...
research
02/06/2021

Algorithms for Linearly Recurrent Sequences of Truncated Polynomials

Linear recurrent sequences are those whose elements are defined as linea...
research
10/07/2021

Computing eigenfunctions of the multidimensional Ornstein-Uhlenbeck operator

We discuss approaches to computing eigenfunctions of the Ornstein–Uhlenb...
research
02/06/2023

Short proofs of ideal membership

A cofactor representation of an ideal element, that is, a representation...
research
06/14/2018

Analysis of the Effect of Unexpected Outliers in the Classification of Spectroscopy Data

Multi-class classification algorithms are very widely used, but we argue...

Please sign up or login with your details

Forgot password? Click here to reset