Related papers: The inverse problem for canonically bounded rank-o…
We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…
In the special case of S^1 invariant metrics on S^2, we find necessary and sufficient conditions for the existence of isometric embeddings into the canonical R^3, in other words: a Weyl type theorem with converse.
Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…
Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two k-colourings of a graph, can I transform the…
The integrability condition called shape invariance is shown to have an underlying algebraic structure and the associated Lie algebras are identified. These shape-invariance algebras transform the parameters of the potentials such as…
Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A : V \to V$ and $A^* : V \to V$ that satisfy (i) and (ii) below: (i) There exists a…
We find conditions that guarantee that a decomposition of a generic third-order tensor in a minimal number of rank-$1$ tensors (canonical polyadic decomposition (CPD)) is unique up to permutation of rank-$1$ tensors. Then we consider the…
This article surveys recent results aiming at obtaining refined mapping estimates for the X-ray transform on a Riemannian manifold with boundary, which leverage the condition that the boundary be strictly geodesically convex. These…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
An uniqueness theorem for the inverse problem in the case of a second-order equation defined on the interval [0,1] when the boundary forms contain combinations of the values of functions at the points 0 and 1 is proved. The auxiliary…
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem $Q$ takes as input two feasible solutions $S$ and $T$ and determines if there is a sequence…
We study the inverse problem of parameter identification in non-coercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map by using the first-order and…
This work deals with an inverse problem for the Sturm-Liouville operator with non-separated boundary conditions, one of which linearly depends on a spectral parameter. Uniqueness theorem is proved, solution algorithm is constructed and…
We use classical results from the theory of linear preserver problems to characterize operators that send the set of pure states with Schmidt rank no greater than k back into itself, extending known results characterizing operators that…
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and…
In this paper, we consider a problem for the first order Dirac differential equations system with spectral parameter dependent in boundary condition. The asymptotic behaviors of eigenvalues, eigenfunctions and normalizing numbers of this…
For each {\it well approximable} irrational $\theta$, we provide an explicit rank-one construction of the $e^{2\pi i\theta}$-rotation $R_\theta$ on the circle $\Bbb T$. This solves "almost surely" a problem by del Junco. For {\it every}…
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
In this manuscript, we introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter. We identify a "Rotation number hypothesis" on the non-homogeneous term, which…
We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at…