Related papers: On the bisymmetric nonnegative inverse eigenvalue …

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems. We apply to the bi-ATSP the…

In this note we classify the necessary and the sufficient conditions that an index of a superconformal theory in $3\leq d \leq 6$ must obey for the theory to have enhanced supersymmetry. We do that by noting that the index distinguishes a…

Necessary and sufficient conditions are presented for a measure to be the spectral measure of a finite range or exponentially decaying perturbation of a periodic Jacobi operator. As a corollary we can fully solve the inverse resonance…

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…

It is shown that the polynomial $\lambda(t) = {\rm Tr}[(A + tB)^p]$ has nonnegative coefficients when $p \leq 7$ and A and B are any two complex positive semidefinite $n \times n$ matrices with arbitrary $n$. This proofs a general…

It is already shown that a Boolean function for a NP-complete problem can be computed by a polynomial-sized circuit if its variables have enough number of automorphisms. Looking at this previous study from the different perspective gives us…

An $n$-list $\lambda:=\left(r; \lambda_2, \ldots, \lambda_n\right)$ of complex numbers with $r>0,$ is said to be realizable if $\lambda$ is the spectrum of $n\times n$ nonnegative matrix $A$ and in this case $A$ is said to be a nonnegative…

Let $A$ be an irreducible (entrywise) nonnegative $n\times n$ matrix with eigenvalues $$\rho, b+ic,b-ic, \lambda_4,\cdots,\lambda_n,$$ where $\rho$ is the Perron eigenvalue. It is shown that for any $t \in [0, \infty)$ there is a…

This paper studies sufficient conditions in a variational obstacle avoidance problem on complete Riemannian manifolds. That is, we minimize an action functional, among a set of admissible curves, which depends on an artificial potential…

We consider a class of generally non-self-adjoint eigenvalue problems which are nonlinear in the solution as well as in the eigenvalue parameter ("doubly" nonlinear). We prove a bifurcation result from simple isolated eigenvalues of the…

This paper deals with the inverse spectral problem for a non-self-adjoint Sturm-Liouville operator with discontinuous conditions inside the interval. We obtain that if the potential $q$ is known a priori on a subinterval $ \left[ b,\pi…

We study the inverse eigenvalue problem for finding doubly stochastic matrices with specified eigenvalues. By making use of a combination of Dykstra's algorithm and an alternating projection process onto a non-convex set, we derive hybrid…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

Deep neural networks have proven extremely efficient at solving a wide rangeof inverse problems, but most often the uncertainty on the solution they provideis hard to quantify. In this work, we propose a generic Bayesian framework…

The recently proposed exact quantum solution for two $\delta$-function-interacting particles with a mass-ratio $3\!:\!1$ in a hard-wall box [Y. Liu, F. Qi, Y. Zhang and S. Chen, iScience 22, 181 (2019)] violates the conventional necessary…

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…

In this paper we consider the estimation of unknown parameters in Bayesian inverse problems. In most cases of practical interest, there are several barriers to performing such estimation, This includes a numerical approximation of a…