English
Related papers

Related papers: Solvability of Matrix-Exponential Equations

200 papers

We study a rather general class of optimal "ballistic" transport problems for matrix-valued measures. These problems naturally arise, in the spirit of \emph{Y. Brenier. Comm. Math. Phys. (2018) 364(2) 579-605}, from a certain dual…

Functional Analysis · Mathematics 2021-11-30 Dmitry Vorotnikov

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

Computational Complexity · Computer Science 2013-07-02 Christopher Hillar , Lek-Heng Lim

Let $K/k$ be an abelian extension of number fields with a distinguished place of $k$ that splits totally in $K$. In that situation, the abelian rank one Stark conjecture predicts the existence of a unit in $K$, called the Stark unit,…

Number Theory · Mathematics 2011-12-14 Xavier-François Roblot

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…

Logic · Mathematics 2019-05-10 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.

Classical Analysis and ODEs · Mathematics 2013-07-16 Eugene Bravyi

We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…

Rings and Algebras · Mathematics 2019-04-15 Arthur Kennedy Cochran Patrick , Sergei Sergeev , Štefan Berežný

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…

Logic in Computer Science · Computer Science 2023-06-12 Gilles Dowek

We investigate the boundedness of solutions of the first order linear difference equation of the form $x_{n+1} = Ax_{n} + y_{n}, \; n \geq 1$ where $A$ is a square matrix with complex entries, sequence $\{y_{n}\}_{n\geq 1}$ and initial…

Dynamical Systems · Mathematics 2025-09-23 Andrii Chaikovskyi , Oleksandr Liubimov

We consider matrix Riccati inequality arising in the theory of absolute stability, $H_\infty$ control problem, $LQ$ problem, and optimal estimation problem. In the case of sign definite frequency domain function, the solvability of Riccati…

Optimization and Control · Mathematics 2015-05-20 Kevin Kissi

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

Group Theory · Mathematics 2024-03-25 Emmanuel Breuillard , Georgi Kocharyan

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

Representation Theory · Mathematics 2016-11-02 Juan Tirao , Ignacio Zurrián

Let $v_1$,..., $v_n$ be $n$ vectors in an inner product space. Can we find a natural number $d$ and positive (semidefinite) complex matrices $A_1$,..., $A_n$ of size $d \times d$ such that ${\rm Tr}(A_kA_l)= <v_k, v_l>$ for all $k,l=1,...,…

Operator Algebras · Mathematics 2014-08-08 Péter E. Frenkel , Mihály Weiner

This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…

Numerical Analysis · Mathematics 2025-04-28 Malihe Nobakht Kooshkghazi , Salman Ahmadi-Asl , Hamidreza Afshin

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

We investigate the existence of positive solutions for a class of Minkowski-curvature equations with indefinite weight and nonlinear term having superlinear growth at zero and super-exponential growth at infinity. As an example, for the…

Classical Analysis and ODEs · Mathematics 2020-07-02 Alberto Boscaggin , Guglielmo Feltrin , Fabio Zanolin

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

Combinatorics · Mathematics 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…

Numerical Analysis · Mathematics 2022-09-05 Margherita Porcelli , Valeria Simoncini

We consider integrable category $\mathcal{O}$ representations of Borcherds--Kac--Moody algebras whose Cartan matrix is finite dimensional, and determine the necessary and sufficient conditions for which the tensor product of irreducible…

Representation Theory · Mathematics 2018-09-25 Shifra Reif , R. Venkatesh

Theoretical and computational properties of a vector equation $Ax-\|x\|_1x=b$ are investigated, where $A$ is an invertible $M$-matrix and $b$ is a nonnegative vector. Existence and uniqueness of a nonnegative solution is proved. Fixed-point…

Numerical Analysis · Mathematics 2026-04-14 Yuezhi Wang , Gwi Soo Kim , Jie Meng