Related papers: Multiple Factorizations of Bivariate Linear Partia…
A non-linear functional $Q[u,v]$ is given that governs the loss, respectively gain, of (doubly degenerate) eigenvalues of fourth order differential operators $L = \partial^4 + \partial u \partial + v$ on the line. Apart from factorizing $L$…
We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for…
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…
Large language models (LLMs) are highly sensitive to prompts, but most automatic prompt optimization (APO) methods assume access to ground-truth references (e.g., labeled validation data) that are costly to obtain. We propose the Prompt…
For an $m \times n$ complex matrix $X$ of rank $r$ with Schur multiplier $S_X$ we show that there exist an $ r \times m $ complex matrix $L$ and an $ r\times n $ complex matrix $R$ such that $X = L^*R$ and $\|S_X\|\, =\, \|\mathrm{diag}…
The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
We give a simple necessary and sufficient condition for maximal operators associated with radial Fourier multipliers to be bounded on $L^p_{rad}$ and $L^p$ for certain $p$ greater than $2$. The range of exponents obtained for the…
The paper studies the solvability for square systems of pseudodifferential operators. We assume that the system is of principal type, i.e., the principal symbol vanishes of first order on the kernel. We shall also assume that the…
We prove that $b$ is in $Lip_{\bz}(\bz)$ if and only if the commutator $[b,L^{-\alpha/2}]$ of the multiplication operator by $b$ and the general fractional integral operator $L^{-\alpha/2}$ is bounded from the weighed Morrey space…
Markov Decision Problems (MDPs) provide a foundational framework for modelling sequential decision-making across diverse domains, guided by optimality criteria such as discounted and average rewards. However, these criteria have inherent…
Recently a spectral Favard theorem for bounded banded lower Hessenberg matrices that admit a positive bidiagonal factorization was presented. These type of matrices are oscillatory. In this paper the Lima-Loureiro hypergeometric multiple…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
We prove $L^p$ estimates for trilinear multiplier operators with singular symbols. These operators arise in the study of iterated trilinear Fourier integrals, which are trilinear variants of the bilinear Hilbert transform. Specifically, we…
The boundedness from $L^p \times L^q$ to $L^r$, $1<p,q \le \infty$, $0<1/p+1/q=1/r \le 1$, of bilinear pseudo-differential operators with symbols in the bilinear H\"ormander class $BS^m_{\rho,\rho}$, $0 \le \rho <1$, is proved for the…
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible for given rate and degree. There exists a well-known criterion to check whether a code is MDP using the generator or…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We consider quadratic stochastic operators, which are separable as a product of two linear operators. Depending on properties of these linear operators we classify the set of the separable quadratic stochastic operators: first class of…
We discuss two optimization problems related to the fractional $p$-Laplacian. First, we prove the existence of at least one minimizer for the principal eigenvalue of the fractional $p$-Laplacian with Dirichlet conditions, with a bounded…
Beyond leading-order, perturbative QCD requires a choice of factorisation scheme to define the parton distribution functions (PDFs) and hard-process cross-section. The modified minimal-subtraction ($\overline{\mathrm{MS}}$) scheme has long…