Related papers: Uniqueness Problem for Meromorphic Mappings with T…
The Learnable Tree Filter presents a remarkable approach to model structure-preserving relations for semantic segmentation. Nevertheless, the intrinsic geometric constraint forces it to focus on the regions with close spatial distance,…
The fixed-point theory and its applications to various areas of science are well known. In this paper we present some existence and uniqueness theorems for fixed circles of self-mappings on metric spaces with geometric interpretation. We…
The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…
In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric…
Let $A$ be a separable, unital and exact $C^*$-algebra satisfying the universal coefficient theorem. We prove uniqueness theorems up to unitary conjugacy for unital, full and nuclear maps from $A$ into ultraproducts of finite von Neumann…
The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…
The $c$-packedness property, proposed in 2010, is a geometric property that captures the spatial distribution of a set of edges. Despite the recent interest in $c$-packedness, its utility has so far been limited to Fr\'echet distance…
The \textsc{Co-Path Packing} (resp., \textsc{Co-Path Set}) problem asks whether a given graph can be edited to a collection of induced paths by deleting at most $k$ vertices (resp., $k$ edges). Both are fundamental problems with significant…
Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair…
Over the past decade, we witness an increasing amount of interest in the design of exact exponential-time and parameterized algorithms for problems in Graph Drawing. Unfortunately, we still lack knowledge of general methods to develop such…
The present paper aims at representing an improvement of the result in [2], where a strong unique continuation property and a description of the local behaviour around the edge of a crack for solutions to an elliptic problem are…
The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restricted space algorithms for these problems proving the…
Multigraph matching is a recent variant of the graph matching problem. In this framework, the optimization procedure considers several graphs and enforces the consistency of the matches along the graphs. This constraint can be formalized as…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…
In this paper, we prove some fundamental theorems for holomorphic curves on angular domain intersecting a hypersurface, finite set of fixed hyperplanes in general position and finite set of fixed hypersurfaces in general position on complex…
Finding the distance to singularity for a matrix is a ubiquitous problem in numerical linear algebra, and is elegantly solved by the Eckart-Young-Mirsky theorem. Its structured variant naturally emerges when one considers structured…
In the work, we focus on a conjecture due to Z.X. Chen and H.X. Yi[1] which is concerning the uniqueness problem of meromorphic functions share three distinct values with their difference operators. We prove that the conjecture is right for…
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…