Related papers: Factorization of piecewise constant matrix functio…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
We establish $L^p$ estimates for multilinear multipliers acting on $(n-1)$-tuples of functions on $\mathbb{R}^d$. We assume that the multiplier satisfies symbol estimates outside a linear subspace of dimension $m$. The difficulty of proving…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
We analyze integral representation and $\Gamma$-convergence properties of functionals defined on \emph{piecewise rigid functions}, i.e., functions which are piecewise affine on a Caccioppoli partition where the derivative in each component…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
The notion of fractional minimal rank of a partial matrix is introduced, a quantity that lies between the triangular minimal rank and the minimal rank of a partial matrix. The fractional minimal rank of partial matrices whose bipartite…
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
In this paper, we introduce the new construction of fractional derivatives and integrals with respect to a function, based on a matrix approach. We believe that this is a powerful tool in both analytical and numerical calculations. We begin…
The Cauchy problem for fractional derivatives linear systems of ordinary differential equations with constant coefficients is considered, where at first the analytic expressions are given through the matrix exponent of its corresponding…
Fractional calculus has been used to describe physical systems with complexity. Here, we show that a fractional calculus approach can restore or include complexity in any physical systems that can be described by partial differential…
Fractional integral operators connected with real-valued scalar functions of matrix argument are applied in problems of mathematics, statistics and natural sciences. In this article we start considering the case of a Gauss hypergeometric…
Differential systems with a Fuchsian linear part are studied in regions including all the singularities in the complex plane of these equations. Such systems are not necessarily analytically equivalent to their linear part (they are not…
This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…
We study the matrix factorization problem associated with an SO(2) spinning top by using the algebro-geometric approach. We derive the explicit expressions in terms of Riemann theta functions and discus some related problems including a…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
Let $G_1,..., G_n \in \Fp[X_1,...,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\Fp$ of $p$ elements. A result of {\'E}. Fouvry and N. M. Katz shows that under some natural condition, for any fixed $\varepsilon$ and…
The problems of matrix spectral factorization and J-spectral factorization appear to be important for practical use in many MIMO control systems. We propose a numerical algorithm for J-spectral factorization which extends Janashia-Lagvilava…