Related papers: Multiple Factorizations of Bivariate Linear Partia…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…
In this paper, we study primeness and pseudo primeness of p-adic meromorphic functions. We also consider left (resp. right ) primeness of these functions. We give, in particular, sufficient conditions for a meromorphic function to satisfy…
Let $I_{\alpha}$ be the linear and $\mathcal{I}_{\alpha}$ be the bilinear fractional integral operators. In the linear setting, it is known that the two-weight inequality holds for the first order commutators of $I_{\alpha}$. But the method…
Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.
In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…
Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…
In a previous study, the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC) is shown to allow extensions of differential and Rota-Baxter operators on the one hand, and to give rise to categorical explanations using…
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a…
Our paper "Solving Third Order Linear Difference Equations in Terms of Second Order Equations" gave two algorithms for solving difference equations in terms of lower order equations: an algorithm for absolute factorization, and an algorithm…
We extend the recently much-studied Hardy factorization theorems to the weight case. The key point of this paper is to establish the factorization theorems without individual condition on the weight functions. As a direct application, we…
We perform conformal perturbation theory by marginal operators to first order. A suitable renormalization method is needed that makes the conformal invariance of the deformed correlation functions manifest. Combining the embedding space…
Let $L$ be a linear symmetric differential operators on $L^{2}\left( \mathbb{R}\right) $ whose domain is the Schwartz test function space, $\mathcal{S}.$ For the majority of this paper, it is assumed that the coefficient of $L$ are…
The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…
We consider the following first order systems of mathematical physics. 1.The Dirac equation with scalar potential. 2.The Dirac equation with electric potential. 3.The Dirac equation with pseudoscalar potential. 4.The system describing…
Given two linear relations $A$ and $B$ we characterize the existence of a linear relation (operator) $C$ such that $A\subseteq BC$, respectively $A\subseteq CB.$ These factorizations extend and improve well-known results by R.G. Douglas and…