相关论文: The weighted horizontal linear complementarity pro…
We study embeddings between reproducing kernel Hilbert spaces $H(K)$ of functions of $d \in \mathbb{N} \cup \{\infty\}$ variables. The kernels $K$ are superpositions of weighted finite tensor products of a fixed univariate kernel. The basic…
We show ergodicity of (asymmetric) lemon billiards, billiard tables that are the intersection of two circles of which one contains the centers of both. These do not satisfy the Wojtkowski criteria for hyperbolicity, but we establish…
The balanced connected $k$-partition problem (\textsc{bcp}) is a classic problem, which consists in partitioning the set of vertices of a vertex-weighted connected graph into a collection of~$k$ classes such that each class induces a…
We construct a Jordan curve $\Gamma \subset \mathbb{C}$ so that for any rectifiable arc $\sigma$ with endpoints in distinct complementary components of $\Gamma$, $H^1(\sigma \cap \Gamma) > 0$.
The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of…
We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…
The linear complementarity problem is to find vector $z$ in $\mathrm{IR}^{n}$ satisfying $z^{T}(Mz+q)=0$, $Mz+q\geqslant0,$ $z\geqslant0$, where $M$ as a matrix and $q$ as a vector, are given data; this problem becomes in present the…
Parallel coordinate plots (PCPs) are a prevalent method to interpret the relationship between the control parameters and metrics. PCPs deliver such an interpretation by color gradation based on a single metric. However, it is challenging to…
We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set ${\cal T}$ of trajectories in the plane, and an integer $k\geq 2$, we seek to compute a set of $k$ points (``portals'') to…
Interior-point methods for linear programming problems require the repeated solution of a linear system of equations. Solving these linear systems is non-trivial due to the severe ill-conditioning of the matrices towards convergence. This…
We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…
We explore the possibility for using boundary data to identify sources in elliptic PDEs. Even though the associated forward operator has a large null space, it turns out that box constraints, combined with weighted sparsity regularization,…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized…
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that…
Using the variational approach and the critical point theory, we established several criteria for the existence of at least one nontrivial solution for a discrete elliptic boundary value problem with a weight $p(\cdot, \cdot)$ and depending…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
A combinatorial optimization problem (COP) has a finite groundset $E(\left|E\right|=N$), a weight vector $c=\left(c^e:e\in E\right)$ and a family $T\in E$ of feasible subsets with objective to find $t\in T$ with maximal weight:…
The purpose of the present paper is to investigate the necessary conditions for unitarity of the spectrum of non-compact gauged WZNW models to some depth. In particular, we would like to investigate the necessity of integer weights and…
A holographic correspondence between data on horizon and space-time physics is investigated. We find similarities with the AdS/CFT correspondence, based on the observation that the optical metric near the horizon describes a Euclidean…