Related papers: On the $\top$-Stein equation $X=AX^\top B+C$

At the heart of many scientific applications is the solution of algebraic systems, such as linear systems of equations, eigenvalue problems, and optimization problems, to name a few. TOPS, which stands for Towards Optimal Petascale…

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

We establish an explicit formula for the general solution of the Benjamin-Ono equation on the torus and on the line. Contents 1. Introduction 1 1.1. The Benjamin-Ono equation 1 1.2. The Lax pair 2 1.3. The explicit formula on the torus 3…

In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the…

A large amount of research activity in power systems areas has focused on developing computational methods to solve load flow equations where a key question is the maximum number of isolated solutions.Though several concrete upper bounds…

We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each…

We obtain the solution of the fourth order difference equation $$ x_{n+1}=\frac{ \alpha x_{n-3}}{A+B x_{n-1}x_{n-3}}$$ with the initial conditions; $x_{-3}=d,$ $x_{-2}=c,$ $x_{-1}=b,$ and $x_{0}=a$ are arbitrary nonzero real numbers,…

This present paper provides the absolutely necessary corrections to the previous work entitled {\it A polynomial Time Algorithm to Solve The Max-atom Problem} (arXiv:2106.08854v1). The max-atom-problem (MAP) deals with system of scalar…

The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…

In this article, we give a few classes of solutions for the Yang-Baxter type matrix equation, $AXA=XAX$. We provide all solutions for the cases when $A$ is equivalent to a Jordan block or has precisely two Jordan blocks. We also have given…

Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…

In this article, a system of Yang-Baxter-type matrix equations is studied, $XAX=BXB$, $XBX=AXA$, which "generalizes" the matrix Yang-Baxter equation and exhibits a broken symmetry. We investigate the solutions of this system from various…

A system of U(N)-matrix difference equations is solved by means of a nested version of a generalized Bethe Ansatz. The highest weight property of the solutions is proved and some examples of solutions are calculated explicitly. (Part II of…

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

This paper provides an overview of the necessary and sufficient conditions for guaranteeing the unique solvability of absolute value equations. In addition to discussing the basic form of these equations, we also address several…

The problem of finding the $k$ most critical nodes, referred to as the $top\text{-}k$ problem, is a very important one in several contexts such as information diffusion and preference aggregation in social networks, clustering of data…

Given stable rational matrix functions $G$ and $K$, a procedure is presented to compute a stable rational matrix solution $X$ to the Leech problem associated with $G$ and $K$, that is, $G(z)X(z)=K(z)$ and $\sup_{|z|\leq 1}\|X(z)\|\leq 1$.…

This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…

We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…

The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is defined in terms of a combination of the following two operations: addition, $a \oplus b := \max(a,b)$, and multiplication, $a \otimes b := a + b$. In this study, we propose a new method…