Related papers: On Column sufficiency and Extended Horizontal Line…
The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…
The objective of this manuscript is to enquire for the solvability of a specific type of non-linear quadratic integral equations via the interesting notion of measure of non-compactness. Firstly, we inquire into couple of exciting fixed…
We develop algorithms for inner approximating the cone of positive semidefinite matrices via linear programming and second order cone programming. Starting with an initial linear algebraic approximation suggested recently by Ahmadi and…
We describe solutions of the matrix equation $\exp(z(A-I_n))=A$, where $z \in {\mathbb C}$. Applications in quantum computing are given. Both normal and nonnormal matrices are studied. For normal matrices, the Lambert W-function plays a…
A basic theory on the first order right and left linear quaternion differential systems (LQDS) is given systematic in this paper. To proceed the theory of LQDS we adopt the theory of column-row determinants recently introduced by the…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
The article continues the study of the 'regular' arrangement of a collection of sets near a point in their intersection. Such regular intersection or, in other words, transversality properties are crucial for the validity of qualification…
The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
We define w-invex set, w-preinvex, w-strictly preinvex, w-quasi preinvex, w-strictly quasi preinvex, w-semi-strictly quasi preinvex, and w-pre pseudo-invex functions in this context. And these form a class of real functions, which is the…
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…
In a recent paper [3], Bakalov and Milanov proved that the total descendant potential of a simple singularity satisfies the W-constraints, which come from the W-algebra of the lattice vertex algebra associated to the root lattice of this…
By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given…
We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Techniques of matrix completion aim to impute a large portion of missing entries in a data matrix through a small portion of observed ones. In practice including collaborative filtering, prior information and special structures are usually…
We prove a realization theorem for rational functions of several complex variables which extends the main theorem of M. Bessmertnyi, "On realizations of rational matrix functions of several complex variables," in Vol. 134 of Oper. Theory…
We extend the adaptive regression spline model by incorporating saturation, the natural requirement that a function extend as a constant outside a certain range. We fit saturating splines to data using a convex optimization problem over a…
Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…