Related papers: The linear system for Sudoku and a fractional comp…
We derive semiclassical contributions of periodic orbits from a boundary integral equation for three-dimensional billiard systems. We use an iterative method that keeps track of the composition of the stability matrix and the Maslov index…
We propose a method by which to examine all possible partial difference Lax pairs that consist of 'two by two' discrete linear problems, where the matrices contain one separable term in each entry. We thereby derive new, higher-order…
In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…
We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for…
Linear systems are the bedrock of virtually all numerical computation. Machine learning poses specific challenges for the solution of such systems due to their scale, characteristic structure, stochasticity and the central role of…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
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…
Generalized symmetry integrability test for discrete equations on the square lattice is studied. Integrability conditions are discussed. A method for searching higher symmetries (including non-autonomous ones) for quad graph equations is…
Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems. It shows how to use this matrix representation to get the full set of valid satisfying…
Despite their proficiency in various language tasks, Large Language Models (LLMs) struggle with combinatorial problems like Satisfiability, Traveling Salesman Problem, or even basic arithmetic. We address this gap through a novel trial &…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
In this article we study linear complementarity problem with hidden $Z$-matrix. We extend the results of Fiedler and Pt{\'a}k for the linear system in complementarity problem using game theoretic approach. We establish a result related to…
A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a…
We study the existence of solutions for the following fractional Hamiltonian systems $$ \left\{ \begin{array}{ll} - _tD^{\alpha}_{\infty}(_{-\infty}D^{\alpha}_{t}u(t))-\lambda L(t)u(t)+\nabla W(t,u(t))=0,\\[0.1cm] u\in…
Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…
In this paper we propose a perturbative method for the reconstruction of the covariance matrix of a multinormal distribution, under the assumption that the only available information amounts to the covariance matrix of a spherically…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…