Related papers: Compatible rewriting of noncommutative polynomials…
We consider an integral operator $\mathcal{I}$, special instances of which was studied in various contexts. Using an appropriate transformation we write this operator in terms of weighted composition operators. Then, we provide a…
We study a nonlinear analogue of additive commutators, known as \textit{polynomial commutators}, defined by $p(ab) - p(ba)$ for a polynomial $p \in F[x]$ and elements $a, b$ in an algebra $R$ over a field $F$. Originally introduced by…
We present a new formula of Cauchy type for the nonsymmetric Macdonald polynomials which are joint eigenfunctions of q-Dunkl operators. This gives the explicit formula for a reproducing kernel on the polynomial ring of n variables.
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…
This thesis concentrates on the development and application of rewriting and Groebner basis methods to a range of combinatorial problems. Chapter Two contains the most important result, which is the application of Knuth-Bendix procedures to…
We construct bounded Poincar\'e operators for twisted complexes and BGG complexes with a wide class of function classes (e.g., Sobolev spaces) on bounded Lipschitz domains. These operators are derived from the de Rham versions using BGG…
Let $ \Omega \subset \mathbb{C}^m $ be an open, connected and bounded set and $\mathcal{A}(\Omega)$ be a function algebra of holomorphic functions on $\Omega$. Suppose that $\mathcal{M}_q$ is the quotient Hilbert module obtained from a…
The primary purpose of this paper is to investigate the question of invertibility of the sum of operators. The setting is bounded and unbounded linear operators. Some interesting examples and consequences are given. As an illustrative…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or Boolean relations among integer arithmetic expressions. First we use a numerical abstract domain to infer numerical properties among program…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
The purpose of this paper is to provide tools for analyzing the compactness of sequences in Sobolev spaces, in particular if the sequence gets mapped onto a compact set by some nonlinear operator. Here, our focus lies on a very general…
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…
Bremner and Elgendy developed a classification of operated polynomial identities for linear operators on associative algebras, encompassing both classical and newly discovered cases. Within the framework of Rota's Program, each of these new…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
We prove a Positivstellensatz for operator-valued noncommutative polynomials that are positive on matrix convex sets. Specifically, let $p$ be an operator-valued polynomial in $B(H)\otimes C<x>$ of degree at most $2d+1$, where $H$ is…
We introduce the $q$-analogue of the type $A$ Dunkl operators, which are a set of degree--lowering operators on the space of polynomials in $n$ variables. This allows the construction of raising/lowering operators with a simple action on…
We consider a nonlinear eigenvalue problem under Robin boundary conditions in a domain with (possibly noncompact) smooth boundary. The problem involves a weighted p-Laplacian operator and subcritical nonlinearities satisfying…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
In this paper, we study the averaging operator by assigning a rewriting system to it. We obtain some basic results on the kind of rewriting system we used. In particular, we obtain a sufficient and necessary condition for the confluence. We…