Related papers: Obstacles to the Factorization of Linear Partial D…
A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced…
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…
We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…
In this paper we study the obstacle problems for the fractional Lapalcian of order $s\in(0,1)$ in a bounded domain $\Omega\subset\mathbb R^n$, under mild assumptions on the data.
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
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…
We develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a destriction functor and apply it to some well-known biset functors. The obstruction groups for this theory are reduced cohomology…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
Form factor axioms are derived in two dimensional integrable defect theories for matrix elements of operators localized both in the bulk and on the defect. The form factors of bulk operators are expressed in terms of the bulk form factors…
The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions. As a consequence, the standard first-order conditions guarantee that diverse iterative algorithms…
The law forbids discrimination. But the ambiguity of human decision-making often makes it extraordinarily hard for the legal system to know whether anyone has actually discriminated. To understand how algorithms affect discrimination, we…
We prove that a maintenance problem on frequency-constrained maintenance jobs with a hierarchical structure is integer-factorization hard. This result holds even on simple systems with just two components to maintain. As a corollary, we…
This article presents a mathematical study of the problem of identifying a time-dependent source term in transport processes described by a timefractional parabolic equation, based on noisy time-dependent measurements taken at an arbitrary…
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number…
We present a general framework of localized operators, i.e., operators whose matrix coefficients with respect to the Gabor frame are concentrated on the diagonal. We show that localized operators are bounded between modulation spaces, and…
We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
From the classic work of Gohberg and Krein (1958), it is well known that the set of partial indices of a non-singular matrix function may change depending on the properties of the original matrix. More precisely, it was shown that if the…
This is a first stab at a mathematical framework in which one can study quantum field theories on spacetimes with quite general geometries. We will study these theories via their factorization algebras. The aim is to identify a minimalist…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…