相关论文: Explicit constructions of connections on the proje…
The classical additive Deligne-Simpson problem is the existence problem for Fuchsian connections with residues at the singular points in specified adjoint orbits. Crawley-Boevey found the solution in 2003 by reinterpreting the problem in…
We give an algebraic and a geometric criterion for the existence of $G$-connections on $\mathbb{P}^{1}$ with prescribed irregular type with equal slope at $\infty$ (isoclinic) and with regular singularity of prescribed residue at $0$. The…
We solve the isoclinic Deligne--Simpson problem for exceptional groups, completing a program initiated by Sage et al. and Jakob--Yun. As a by-product, we obtain new examples of physically rigid irregular connections on the projective line.…
The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…
Our interest in this paper is a generalization of the additive Deligne-Simpson problem which is originally defined for Fuchsian differential equations on the Riemann sphere. We shall extend this problem to differential equations having an…
Unfolding singular points in linear differential equations is a classical technique for studying the properties of irregular singularities by relating them to regular singularities. In this paper, we propose a general framework for…
The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…
The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset SL(n,{\bf C})$ or $c_j\subset sl(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples of…
We consider the problem of robust matrix completion, which aims to recover a low rank matrix $L_*$ and a sparse matrix $S_*$ from incomplete observations of their sum $M=L_*+S_*\in\mathbb{R}^{m\times n}$. Algorithmically, the robust matrix…
Given k similarity classes of invertible matrices, the Deligne-Simpson problem asks to determine whether or not one can find matrices in these classes whose product is the identity and with no common invariant subspace. The first author…
The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…
A meromorphic connection on the complex projective line induces formal connections at each singular point, and these formal connections constitute the local behavior at the singularities. In this primarily expository paper, we discuss the…
Dempster's covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
We introduce a novel technique for proving global strong discrete maximum principles for finite element discretizations of linear and semilinear elliptic equations for cases when the common, matrix-based sufficient conditions are not…
Deligne's celebrated "Riemann--Hilbert correspondence" relates representations of the fundamental group of a smooth complex algebraic variety and regular-singular integrable connections. In this work, we show how to arrive at a similar…
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…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
Although a unique solution is guaranteed in the Linear complementarity problem (LCP) when the matrix $\mathbf{M}$ is positive definite, practical applications often involve cases where $\mathbf{M}$ is only positive semi-definite, leading to…
We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…