Related papers: The linear system for Sudoku and a fractional comp…
I present here a pedagogical introduction to the works by Rashel Tublin and Yan V. Fyodorov on random linear systems with quadratic constraints, using tools from Random Matrix Theory and replicas. These notes illustrate and complement the…
We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
We solve the fuzzy linear systems in a fuzzy number space $\mathcal{X}$, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and…
The time-harmonic Maxwell equations are used to study the effect of electric and magnetic fields on each other. Although the linear systems resulting from solving this system using FEMs are sparse, direct solvers cannot reach the linear…
In this paper we try to answer the question "What constitutes Sudoku difficulty rating across different Sudoku websites?" Using two distinct methods that can both solve every Sudoku puzzle, I propose two new metrics to characterize Sudoku…
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…
We study the problem of solvability of linear differential systems with small coefficients in the Liouvillian sense (or, by generalized quadratures). For a general system, this problem is equivalent to that of solvability of the Lie algebra…
In this paper, we consider the eigenproblems for Latin squares in a bipartite min-max-plus system. The focus is upon developing a new algorithm to compute the eigenvalue and eigenvectors (trivial and non-trivial) for Latin squares in a…
The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
We consider linear systems $Ax = b$ where $A \in \mathbb{R}^{m \times n}$ consists of normalized rows, $\|a_i\|_{\ell^2} = 1$, and where up to $\beta m$ entries of $b$ have been corrupted (possibly by arbitrarily large numbers). Haddock,…
Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particular, the…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
In this paper, we introduce and analyze a new $LU$-factorization technique for square matrices over idempotent semifields. In particular, more emphasis is put on "max-plus" algebra here, but the work is extended to other idempotent…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
We elaborate the idea that the matrix models equipped with the gauge symmetry provide a natural framework to describe identical particles. After demonstrating the general prescription, we study an exactly solvable harmonic oscillator type…