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

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…

Geodesic metric spaces support a variety of averaging constructions for given finite sets. Computing such averages has generated extensive interest in diverse disciplines. Here we consider the inverse problem of recognizing computationally…

Weight-space merging aims to combine multiple fine-tuned LLMs into a single model without retraining, yet most existing approaches remain fundamentally parameter-space heuristics. This creates three practical limitations. First, linear…

Recently, Carlip proposed a derivation of the entropy of the two-dimensional dilatonic black hole by investigating the Virasoro algebra associated with a newly introduced near-horizon conformal symmetry. We point out not only that the…

In this paper, we propose a class of matrix splitting-based fixed-point iteration (FPI) methods for solving the vertical nonlinear complementarity problem (VNCP). Under appropriate conditions, we present two convergence results obtained…

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

In this paper, the generalized eigenvalue complementarity problem for tensors (GEiCP-T) is addressed, which arises from the stability analysis of finite dimensional mechanical systems and find applications in differential dynamical systems.…

This paper reformulates complementarity-based time-stepping for frictionless nonsmooth contact between smooth rigid bodies as a recursively generated linear complementarity problem (ReLCP), involving a sequence of LCPs of increasing…

We find black hole solutions to Euclidean 2+1 gravity coupled to a relativistic particle which have a dynamical conical singularity at the horizon. These solutions mimic the tree level contribution to the partition function of gravity…

We apply the method of conical singularities to calculate the tree-level entropy and its one-loop quantum corrections for a charged Kerr black hole. The Euclidean geometry for the Kerr-Newman metric is considered. We show that for an…

Let V be a cofibrantly generated closed symmetric monoidal model category and M a model V-category. We say that a weighted colimit W*D of a diagram D weighted by W is a homotopy weighted colimit if the diagram D is pointwise cofibrant and…

A general discussion of the conformal Ward identities is presented in the context of logarithmic conformal field theory with conformal Jordan cells of rank two. The logarithmic fields are taken to be quasi-primary. No simplifying…

We consider a differential inclusion on a manifold, defined by a field of open half-spaces whose boundary in each tangent space is the kernel of a one-form. We make the assumption that the corank one distribution associated to the kernel is…

The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \subseteq V\times V$ disjoint from $E$ called…

We proposed in this paper a new method, which we named the W4 method, to solve nonlinear equation systems. It may be regarded as an extension of the Newton-Raphson~(NR) method to be used when the method fails. Indeed our method can be…

The linear complementarity problem, LCP(q,M), is defined as follows. For given M,q find z such that q+Mz>=0, z>=0, z(q + M z)=0,or certify that there is no such z. It is well known that the problem of finding a Nash equilibrium for a…

We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide…

In this paper, we investigate the anisotropic Calder{\'o}n problem on cylindrical Riemannian manifolds with boundary having two ends and equipped with singular metrics of (simple or double) warped product type, that is whose warping factors…

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…