Related papers: The matching condition for larger size Riemann-Hil…
This study considers the object localization problem and proposes a novel multiparticle Kalman filter to solve it in complex and symmetric environments. Two well-known classes of filtering algorithms to solve the localization problem are…
In this paper we study a class of Riemannian metrics on the space of unparametrized curves and develop a method to compute geodesics with given boundary conditions. It extends previous works on this topic in several important ways. The…
We consider the simplicial de Rham complex and the \v{C}ech-de Rham complex, two bigraded Hilbert complexes whose Hodge-Laplace problems govern spatially coupled problems in mixed dimension and homogeneous dimension, respectively. The…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
Over-segmentation into superpixels is a very effective dimensionality reduction strategy, enabling fast dense image processing. The main issue of this approach is the inherent irregularity of the image decomposition compared to standard…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible solution using symmetries. These heuristics can use either…
The identification between the complex plane and the Riemann sphere preserves holomorphic and harmonic functions and is a classical tool. In this paper we consider a similar mapping from an unbounded metric space $X$ to a bounded space and…
We consider the massive Thirring model in the laboratory coordinates and explain how the inverse scattering transform can be developed with the Riemann-Hilbert approach. The key ingredient of our method is to transform the corresponding…
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…
We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…
The requirement that a (non-Einstein) K\"ahler metric in any given complex dimension $m>2$ be almost-everywhere conformally Einstein turns out to be much more restrictive, even locally, than in the case of complex surfaces. The local…
We describe the global geometry, symmetries and tensors for Double Field Theory over pairs of nilmanifolds with fluxes or gerbes. This is achieved by a rather straightforward application of a formalism we developed previously. This…
The properties of precessing, coalescing binary black holes are presently inferred through comparison with two approximate models of compact binary coalescence. In this work we show these two models often disagree substantially when…
This paper provides closed-form formulas for a multidimensional two-sided matching problem with transferable utility and heterogeneity in tastes. When the matching surplus is quadratic, the marginal distributions of the characteristics are…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
This paper studies two-sided many-to-one matching in which firms have complementary preferences. We show that stable matchings exist under a balancedness condition that rules out a specific type of odd-length cycles formed by firms'…
This paper presents and experiments approaches to solve a new bi-objective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The…
Aims: To propose a method for the polarimetric calibration of large astronomical mirrors that does not require use of special optical devices nor knowledge of the exact polarization properties of the calibration target. Methods: We study…
Traditionally, kernel methods rely on the representer theorem which states that the solution to a learning problem is obtained as a linear combination of the data mapped into the reproducing kernel Hilbert space (RKHS). While elegant from…