Related papers: The weighted horizontal linear complementarity pro…
Given an undirected weighted graph $G$ and an integer $k$, Exact-Weight Perfect Matching (EWPM) is the problem of finding a perfect matching of weight exactly $k$ in $G$. In this paper, we study EWPM and its variants. The EWPM problem is…
In this paper, we study the stochastic linear complementarity problems on extended second order cones (stochastic ESOCLCP). We first convert the problem to a stochastic mixed complementarity problem on the nonegative orthant (SMixCP).…
The paper introduces a special case of the Euclidean distance matrix completion problem (edmcp) of interest in statistical data analysis where only the minimal spanning tree distances are given and the matrix completion must preserve the…
Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…
In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we given an affirmative result showing that…
In a Euclidean Jordan algebra V of rank n which carries the trace inner product, to each element x we associate the eigenvalue vector whose components are the eigenvalues of x written in the decreasing order. For any number p between (and…
We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p parts such that each part induces a connected sub-graph of G…
This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…
We consider the conjecture that all artinian height 4 complete intersections of forms of the same degree $d$ have the Weak Lefschetz Property (WLP). We translate this problem to one of studying the general hyperplane section of a certain…
In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…
We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let $G=(V,E)$ be a connected graph with a weight (supply/demand) function $p:V\rightarrow \{-1,+1\}$ satisfying $p(V)=\sum_{j\in V} p(j)=0$. The…
We show that a bounded, linear map between C*-algebras is a weighted $\ast$-homomorphism (the central compression of a $\ast$-homomorphism) if and only if it preserves zero-products, range-orthogonality, and domain-orthogonality. It follows…
We prove functional inequalities on vector fields on the Euclidean space when it is equipped with a bounded measure that satisfies a Poincar\'e inequality, and study associated self-adjoint operators. The weighted Korn inequality compares…
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We…
Let $A$ and $B$ be unital rings. An additive map $T:A\to B$ is called a weighted Jordan homomorphism if $c=T(1)$ is an invertible central element and $cT(x^2) = T(x)^2$ for all $x\in A$. We provide assumptions, which are in particular…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
Hybrid inverse problems are mathematical descriptions of coupled-physics (also called multi-waves) imaging modalities that aim to combine high resolution with high contrast. The solution of a high-resolution inverse problem, a first step…
We characterize the geometry and topology of the set of all weight vectors for which a linear neural network computes the same linear transformation $W$. This set of weight vectors is called the fiber of $W$ (under the matrix multiplication…
The strict complementary slackness condition (SCSC) is an important concept in the duality theory of linear programming (LP). The current study aims at extending this concept to the framework of linear fractional programming (LFP). First,…
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…