相关论文: Computable Integrability. Chapter 5: Factorization…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…
We consider a discrete equation, defined on the two-dimensional square lattice, which is linearizable, namely, of the Burgers type and depends on a parameter $\alpha$. For any natural number $N$ we choose $\alpha$ so that the equation…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
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…
Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…
This monograph, written for educational purposes, serves as an introduction to the concept of integrability as it applies to systems of differential equations (both ordinary and partial) as well as to vector-valued fields. The general cases…
For a rational differential operator $L=AB^{-1}$, the Lenard-Magri scheme of integrability is a sequence of functions $F_n, n\geq 0$, such that (1) $B(F_{n+1})=A(F_n)$ for all $n \geq 0$ and (2) the functions $B(F_n)$ pairwise commute. We…
Large integer factorization is a prominent research challenge, particularly in the context of quantum computing. This holds significant importance, especially in information security that relies on public key cryptosystems. The classical…
When mathematical/computational problems reach infinity, extending analysis and/or numerical computation beyond it becomes a notorious challenge. We suggest that, upon suitable singular transformations (that can in principle be…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…
We find a criterion for correct solvability in L_p(R) of a linear differential equation of a first order with non-negative locally integrated coefficient and study the asymptotic properties of its solutions.
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…
In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…
Let T^{N,chi}_{p,k}(x) be the characteristic polynomial of the Hecke operator T_p acting on the space of cusp forms S_k(N,chi). We describe the factorization of T^{N,chi}_{p,k}(x) mod l as k varies, and we explicitly calculate those…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
The factorization of nonlinear second-order differential equations proposed by Rosu and Cornejo-Perez in 2005 is extended to equations containing quadratic and cubic forms in the first derivative. A few illustrative examples encountered in…