Related papers: Factoring Differential Operators in n Variables
We introduce a concept of a fractional-derivatives series and prove that any linear partial differential equation in two independent variables has a fractional-derivatives series solution with coefficients from a differentially closed field…
We introduce and study a new class of pseudo-differential operators associated with a fractional Hankel--Bessel transform. Motivated by the classical Hankel transform and the pseudo-differential operators associated with Bessel operators…
We develop an operator-theoretical method for the analysis on well posedness of partial differential equations that can be modeled in the form \begin{equation*} \left\{ \begin{array}{rll} \Delta^{\alpha} u(n) &= Au(n+2) + f(n,u(n)), \quad n…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
We prove that in the setting of operator spaces the result of Davis, Figiel, Johnson and Pelczynski on factoring weakly compact operators holds accordingly. Though not related directly to the main theorem we add a remark on the description…
In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can…
In this paper, we study weight representations over the Schr{\"o}dinger Lie algebra $\mathfrak{s}_n$ for any positive integer $n$. It turns out that the algebra $\mathfrak{s}_n$ can be realized by polynomial differential operators. Using…
An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…
In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…
We give a short direct proof of Agler's factorization theorem that uses the abstract characterization of operator algebras. the key ingredient of this proof is an operator algebra factorization theorem. Our proof provides some additional…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…
In one variable, there exists a satisfactory classification of commutative rings of differential operators. In several variables, even the simplest generalizations seem to be unknown and in this report we give examples and pose questions…
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…
In this paper we describe new noncommutative factorizations of functions related to $d$-th tensor powers of Carlitz's $\mathbb F_q[\theta]$-module for $d\geq 1$, called higher sine functions. In recent work by the second author,…
We systematically introduce the idea of applying differential operator method to find a particular solution of an ordinary nonhomogeneous linear differential equation with constant coefficients when the nonhomogeneous term is a polynomial…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…
We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…