Related papers: Factoring Differential Operators in n Variables
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…
We study holonomic modules for the rings of invariant differential operators on affine commutative domains with finite Krull dimension with respect to arbitrary actions of finite groups. We prove the Bernstein inequality for these rings.…
We consider algebras of quantum differential operators, for appropriate bicharacters on a polynomial algebra in one indeterminate and for the coordinate algebra of quantum $n$-space for $n\geq 3$. In the former case a set of generators for…
The paper provides a coherent presentation of an operator scheme, which is used in an approach to inverse problems of mathematical physics (the boundary control method). The scheme is based on the triangular factorization of operators. It…
This article presents an investigation of global properties of a class of differential operators on $\mathbb{T}^1\times\mathbb{R}$. Our approach involves the utilization of a mixed Fourier transform, incorporating both partial Fourier…
This paper grew out of the author's work on arXiv:2504.18460. Differential operators in the sense of Grothendieck acting between modules over a commutative ring can be interpreted as torsion elements in the bimodule of all operators with…
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
We obtain a general expression for a Wigner transform (Wigner function) on symmetric spaces of non-compact type and study the Weyl calculus of pseudodifferential operators on them.
In this paper we explore the theory of fractional powers of non-negative (and not necessarily self-adjoint) operators and its amazing relationship with the Chebyshev polynomials of the second kind to obtain results of existence, regularity…
We study solutions of the Yang-Baxter equation on a tensor product of an arbitrary finite-dimensional and an arbitrary infinite-dimensional representations of the rank one symmetry algebra. We consider the cases of the Lie algebra sl_2, the…
In this work we present a theoretical model for differentiable programming. We construct an algebraic language that encapsulates formal semantics of differentiable programs by way of Operational Calculus. The algebraic nature of Operational…
The non-first-order-factorizable contributions (The terms 'first-order-factorizable contributions' and 'non-first-order-factorizable contributions' have been introduced and discussed in Refs. \cite{Behring:2023rlq,Ablinger:2023ahe}. They…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
We show how a rescaling of fractional operators with bounded kernels may help circumvent their documented deficiencies, for example, the inconsistency at zero or the lack of inverse integral operator. On the other hand, we build a novel…
An algorithm for matrix factorization of polynomials was proposed in \cite{fomatati2022tensor} and it was shown that this algorithm produces better results than the standard method for factoring polynomials on the class of summand-reducible…
We obtain new lower bounds for the number of Fourier coefficients of a weakly holomorphic modular form of half-integral weight not divisible by some prime $\ell$. Among the applications of this we show that there are $\gg \sqrt{X}/\log \log…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…