相关论文: The weighted horizontal linear complementarity pro…

The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…

We study the inverse problem of unique recovery of a complex-valued scalar function $V:\mathcal M \times \mathbb C\to \mathbb C$, defined over a smooth compact Riemannian manifold $(\mathcal M,g)$ with smooth boundary, given the Dirichlet…

We put forward a proposal for topological quantum critical points (tQCPs) separating non-invertible chiral topological orders in $(2+1)$ dimensions. We conjecture that these tQCPs can be captured by a family of scale-invariant field…

We address the problem of partitioning a vertex-weighted connected graph into $k$ connected subgraphs that have similar weights, for a fixed integer $k\geq 2$. This problem, known as the \emph{balanced connected $k$-partition problem}…

We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the…

An alternative interpretation of the conformal transformations of the metric is discussed according to which the latter can be viewed as a mapping among Riemannian and Weyl-integrable spaces. A novel aspect of the conformal transformation's…

Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…

We set up a new version of black hole information paradox in an eternal Narayan black hole, a generic two-dimensional dilaton gravity theory with non-trivial on-shell bulk action and a product of dimensional reduction from…

In this article, we study an elliptic problem of mixed order with both local and nonlocal aspects involving singular nonlinearity in combination with critical Hartree-type nonlinearity. Using variational methods together with the critical…

In this article we consider the anisotropic Calderon problem and related inverse problems. The approach is based on limiting Carleman weights, introduced in Kenig-Sjoestrand-Uhlmann (Ann. of Math. 2007) in the Euclidean case. We…

In this paper, we propose to study a new geometric optimization problem called "geometric prototype" in Euclidean space. Given a set of patterns, where each pattern is represented by a (weighted or unweighted) point set, the geometric…

A basic problem for any class of nonassociative algebras is to determine the polynomial identities satisfied by the symmetrization and the skew-symmetrization of the original product. We consider the symmetrization of the product in the…

We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…

We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…

Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…

This paper is dedicated to the study of weight complexes (defined on triangulated categories endowed with weight structures) and their applications. We introduce pure (co)homological functors that "ignore all non-zero weights"; these have a…

The joint replenishment problem (JRP) is a classical inventory management problem. We consider a natural generalization with outliers, where we are allowed to reject (that is, not service) a subset of demand points. In this paper, we are…

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Mixed integer quadratic programming (MIQP) is the problem of minimizing a convex quadratic function over mixed integer points in a rational polyhedron. This paper focuses on the augmented Lagrangian dual (ALD) for MIQP. ALD augments the…