Related papers: Obstacles to the Factorization of Linear Partial D…

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…

We give some new characterizations of almost weak Dunford-Pettis operators and we investigate their relationship with weak Dunford-Pettis operators.

This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…

A factorization theory is proposed for Wiener-Hopf plus Hankel operators with almost periodic Fourier symbols. We introduce a factorization concept for the almost periodic Fourier symbols such that the properties of the factors will allow…

Using a new definition of generalized divisors we prove that the lattice of such divisors for a given linear partial differential operator is modular and obtain analogues of the well-known theorems of the Loewy-Ore theory of factorization…

This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such…

The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…

In their work on differential operators in positive characteristic, Smith and Van den Bergh define and study the derived functors of differential operators; they arise naturally as obstructions to differential operators reducing to positive…

People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…

We consider second order uniformly elliptic operators of divergence form in $\R^{d+1}$ whose coefficients are independent of one variable. For such a class of operators we establish a factorization into a product of first order operators…

We give an algorithm for the class of second order unification problems in which second order variables have at most one occurrence.

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

Matrix completion is one of the key problems in signal processing and machine learning. In recent years, deep-learning-based models have achieved state-of-the-art results in matrix completion. Nevertheless, they suffer from two drawbacks:…

Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

We present a new formula for umbral operators that yields three main insights. First, it makes explicit a connection between umbral calculus and iteration theory. Second, it leads naturally to a definition of fractional exponents of umbral…