Related papers: Solving the Mostar index inverse problem

The inverse problem method is tested for a class of monomer-dimer statistical mechanics models that contain also an attractive potential and display a mean-field critical point at a boundary of a coexistence line. The inversion is obtained…

We implement the numerical inverse scattering transform (NIST) for the sine-Gordon equation in laboratory coordinates on the real line using the method developed by Trogdon, Olver and Deconinck. The NIST allows one to compute the solution…

We construct the moduli spaces of stable maps, \bar M_g,n(P^r,d), via geometric invariant theory (GIT). This construction is only valid over Spec C, but a special case is a GIT presentation of the moduli space of stable curves of genus g…

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…

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

Over the last decade, a series of applied mathematics papers have explored a type of inverse problem--called by a variety of names including "inverse sensitivity", "pushforward based inference", "consistent Bayesian inference", or…

Let $D$ be an oriented graph. The inversion of a set $X$ of vertices in $D$ consists in reversing the direction of all arcs with both ends in $X$. The inversion number of $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions…

Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We show this via random self-reductions and the design of…

In this paper we introduce a variation of the well-known Zagreb indices by considering a proper vertex colouring of a graph $G$. The chromatic Zagreb indices are defined in terms of the parameter $c(v), v \in V(G)$ instead of the invariant…

Topological relations between three degree-based invariants of a connected graph G are investigated. We present novel inequalities including M1(G), M2(G) and F(G), and show that in all cases equality holds if G is a regular or a semiregular…

An $n$-vertex graph whose degree set consists of exactly $n-1$ elements is called antiregular graph. Such type of graphs are usually considered opposite to the regular graphs. An irregularity measure ($IM$) of a connected graph $G$ is a…

We derive an efficient stochastic algorithm for inverse problems that present an unknown linear forcing term and a set of nonlinear parameters to be recovered. It is assumed that the data is noisy and that the linear part of the problem is…

A graph $G = (V,E)$ is $\textit{monopolar}$ if its vertex set admits a partition $V = (C \uplus{} I)$ where $G[C]$ is a $\textit{cluster graph}$ and $I$ is an $\textit{independent set}$ in $G$; this is a \textit{monopolar partition} of $G$.…

Let $\left( X,\left\Vert \cdot\right\Vert_{X}\right) $ and $\left( Y,\left\Vert \cdot\right\Vert_{Y}\right) $ be Banach spaces over $\mathbb{R},$ with $X$ uniformly convex and compactly embedded into $Y.$ The inverse iteration method is…

In this work, the real nonnegative inverse eigenvalue problem is solved for a particular class of permutative matrix. The necessary and sufficient condition there is also shown to be sufficient for the symmetric nonnegative inverse…

Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…

A wide range of graph learning tasks, such as structure discovery, temporal graph analysis, and combinatorial optimization, focus on inferring graph structures from data, rather than making predictions on given graphs. However, the…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Suppose that the inverse image of the zero vector by a continuous map $f:{\mathbb R}^n\to{\mathbb R}^q$ has an isolated point $P$. There is a local obstruction to removing this isolated zero by a small perturbation, generalizing the notion…

The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.