Related papers: The Horizontal Tensor Complementarity Problem
In this paper, we first introduce R0-W and SSM-W properties for the set of matrices which is a generalization of R0 and the strictly semimonotone matrix. We then prove some existence results for the extended horizontal linear…
We provide explicit counterexamples to the so-called Complement Problem in every dimension $n\geq3$, i.e. pairs of non-isomorphic irreducible hypersurfaces $H_1, H_2\subset\mathbb{C}^{n}$ whose complements $\mathbb{C}^{n}\setminus H_1$ and…
Single-reference methods such as Hartree-Fock-based coupled cluster theory are well known for their accuracy and efficiency for weakly correlated systems. For strongly correlated systems, more sophisticated methods are needed. Recent…
High-dimensional partial-differential equations (PDEs) arise in a number of fields of science and engineering, where they are used to describe the evolution of joint probability functions. Their examples include the Boltzmann and…
The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality…
The characteristic anti-linear (parity/time reversal, PT) symmetry of non-Hermitian Hamiltonians with real energies is presented as a source of two new forms of solvability of Schr\"{o}dinger's bound-state problems. In detail we describe…
We study the homotopy types of complements of arrangements of n transverse planes in R^4, obtaining a complete classification for n <= 6, and lower bounds for the number of homotopy types in general. Furthermore, we show that the homotopy…
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…
We study the complexity of horizontality in the twistor space $\hat{E}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over a torus. If the horizontality has finite complexity of degree $d>2$ for…
Let $\mathcal{A} $ be a complexified-real arrangement of lines in $\mathbb{C}^2.$ Let $H$ be any line in $ \mathcal{A} $. Then, form a new complexified-real arrangement $ \mathcal{B}_H = \mathcal{A} \cup \mathcal{C} $ where $ \mathcal{C}…
For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…
The tensor complementarity problem $(\q, \mathcal{A})$ is to $$\mbox{ find } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q + \mathcal{A}\x^{m-1} \geq \0, \mbox{ and }\x^\top (\q + \mathcal{A}\x^{m-1}) = 0.$$ We prove that a real…
The semi-tensor product (STP) of matrices is extended to the STP of hypermatrices. Some basic properties of the STP of matrices are extended to the STP of hypermatrices. The hyperdeterminant of hypersquares is introduced. Some algebraic and…
Large-scale strongly nonlinear and nonconvex mixed-integer nonlinear programming (MINLP) models frequently appear in optimisation-based process synthesis, integration, intensification, and process control. However, they are usually…
Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…
This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible…
Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…
Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this…
We consider the problem of tensor estimation from noisy observations with possibly missing entries. A nonparametric approach to tensor completion is developed based on a new model which we coin as sign representable tensors. The model…
The canonical polyadic (CP) tensor decomposition decomposes a multidimensional data array into a sum of outer products of finite-dimensional vectors. Instead, we can replace some or all of the vectors with continuous functions…