Related papers: On Column sufficiency and Extended Horizontal Line…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support an infinite tridiagonal matrix representation of the wave operator. The class of solutions obtained as such…
A waveguide coincides with a three-dimensional domain G having finitely many cylindrical outlets to infinity; the boundary of G is smooth. In G, we consider the stationary Maxwell system with real spectral parameter k and identity matrices…
We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…
In order to nd a non-negative solution to a system of inequalities, the corresponding dual problem is composed, which has a suitable unity basic matrix. In such a formulation, the objective function is replaced by set of constraints based…
In this paper we give a sufficient condition of the existence of ${\rm \mathbb{W}}^{t}$-approximation presentations. We also introduce property (W$^{k}$). As an application of the existence of ${\rm \mathbb{W}}^{t}$-approximation…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
We study the problem of recovering an incomplete $m\times n$ matrix of rank $r$ with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer…
This chapter investigates the cone of copositive matrices, with a focus on the design and analysis of conic inner approximations for it. These approximations are based on various sufficient conditions for matrix copositivity, relying on…
New form of sufficient optimality condition is obtained in comparison with the Mangasarian sufficiency theorem. Both finite and infinite values of objective functional are allowed since concepts of overtaking and weakly overtaking…
We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by…
This is the fourth article in a series where we succeed in enlarging the class of exactly solvable quantum systems. We do that by working in a complete set of square integrable basis that carries a tridiagonal matrix representation for the…
In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
We provide quantitative inner and outer bounds for the symmetric quasiconvex hull $Q^e(\mathcal{U})$ on linear strains generated by three-well sets $\mathcal{U}$ in $\mathbb{R}^{2\times 2}_{sym}$. In our study, we consider all possible…
We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…
We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…
Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more…
Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…
In this paper, we introduce a new concept of generalized convexity for E-differentiable vector optimization problems. Namely, the notion of exponentially E-invexity is defined. Further, some properties and results of exponentially E-invex…
We consider the problem of solving a linear system of equations which involves complex variables and their conjugates. We characterize when it reduces to a complex linear system, that is, a system involving only complex variables (and not…