Related papers: The matching condition for larger size Riemann-Hil…
Much is known about when a locally optimal solution depends in a single-valued Lipschitz continuous way on the problem's parameters, including tilt perturbations. Much less is known, however, about when that solution and a uniquely…
We investigate the general two Higgs doublet model imposing both the unitarity conditions and the bounded-from-below conditions. Both types of conditions restrict the ranges of the parameters of the scalar potential. We study the model in…
Comparisons on $L^{n\over 2}$-norms of scalar curvatures between Riemannian metrics and standard metrics are obtained. The metrics are restricted to conformal classes or under certain curvature conditions.
We have determined numerically the maximum quantum violation of over 100 tight bipartite Bell inequalities with two-outcome measurements by each party on systems of up to four dimensional Hilbert spaces. We have found several cases,…
Within the framework of Hilbert spaces, we solve nonlocal problems in bounded domains with prescribed conditions on the complement of the domain. Our main focus is on the inhomogeneous Neumann problem in a rather general setting. We also…
With no criteria of the index type, it is proved the existence of a solution for the Riemann-Hilbert problem in the fairly general setting of arbitrary Jordan domains, measurable coefficients and measurable boundary data. The theorem is…
We investigate a family of bilevel imaging learning problems where the lower-level instance corresponds to a convex variational model involving first- and second-order nonsmooth sparsity-based regularizers. By using geometric properties of…
In this article, we consider two proper double splittings satisfying certain conditions, of a semi-monotone rectangular matrix A and derive new comparison results for the spectral radii of the correspond ing iteration matrices. These…
Particle filters provide Monte Carlo approximations of intractable quantities such as point-wise evaluations of the likelihood in state space models. In many scenarios, the interest lies in the comparison of these quantities as some…
We reprove that all the matchings constructed during Edmonds' weighted perfect matching algorithm are optimal among those of the same cardinality (provided that certain mild restrictions are obeyed on the choices the algorithm makes). We…
Let $G \subsetneq \mathbb{R}^n$ be a domain and let $d_1$ and $d_2$ be two metrics on $G$. We compare the geometries defined by the two metrics to each other for several pairs of metrics. The metrics we study include the distance ratio…
We propose a novel framework for matching estimators for causal effect from observational data that is based on minimizing the dual norm of estimation error when expressed as an operator. We show that many popular matching estimators can be…
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails…
In this note, our purpose is to establish shortly the algebraicity of a holomorphic mapping between real algebraic CR manifolds under a double reflection condition which generalizes the classical single reflection. A complete study of…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…
In the present work, a theoretical framework focussing on local geometric deformations is introduced in order to cope with the problem of how to join spacetimes with different geometries and physical properties. Using this framework, it is…
Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been…
The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on…
We extend an implicit regularization scheme to be applicable in the $n$-dimensional space-time. Within this scheme divergences involving parity violating objects can be consistently treated without recoursing to dimensional continuation.…
The paper puts forward sufficient conditions for local controllability of a control dynamical system. The results obtained are meaningful in the case when the linear approximation to this system is not completely controllable. As a…