Related papers: The Deligne-Simpson problem -- a survey
This paper is devoted to the classification of integrable Davey-Stewartson type equations. A list of potentially deformable dispersionless systems is obtained through the requirement that such systems must be generated by a polynomial…
A standard way to solve linear algebraic systems $Au=f,\,\,(*)$ with ill-conditioned matrices $A$ is to use variational regularization. This leads to solving the equation $(A^*A+aI)u=A^*f_\d$, where $a$ is a regularization parameter, and…
We consider the Dirichlet problem for a class of elliptic and parabolic equations in the upper-half space $\mathbb{R}^d_+$, where the coefficients are the product of $x_d^\alpha, \alpha \in (-\infty, 1),$ and a bounded uniformly elliptic…
A boson of spin-j>1 can be described in one of the possibilities within the Bargmann-Wigner framework by means of one sole differential equation of order twice the spin, which however is known to be inconsistent as it allows for non-local,…
The global boundness, existence and uniqueness are presented for the kind of Rosseland equation with a small parameter. This problem comes from conduction-radiation coupled heat transfer in the composites; it's with coefficients of high…
The traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization. Several semidefinite programming relaxations have been proposed recently that exploit a variety of mathematical structures including, e.g.,…
The Degasperis-Procesi (DP) equation is an integrable Camassa-Holm-type model as an asymptotic approximation for the unidirectional propagation of shallow water waves. This work is to establish the $L^2\cap L^\infty$ orbital stability of a…
We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…
In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the…
For commuting linear operators $P_0,P_1,..., P_\ell$ we describe a range of conditions which are weaker than invertibility. When any of these conditions hold we may study the composition $P=P_0P_1... P_\ell$ in terms of the component…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…
One of the first theorems in perturbation theory claims that for an arbitrary self-adjoint operator A there exists a perturbation B of Hilbert-Schmidt class, which destroys completely the absolutely continuous spectrum of A (von Neumann).…
We develop a unified framework to characterize the power of higher-level algorithms for the constraint satisfaction problem (CSP), such as $k$-consistency, the Sherali-Adams LP hierarchy, and the affine IP hierarchy. As a result,…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…
For a polynomial $P$ of degree $n$ and an $m$-tuple $\Lambda=(\lambda_1,\dots,\lambda_m)$ of distinct complex numbers, the dope matrix of $P$ with respect to $\Lambda$ is $D_P(\Lambda)=(\delta_{ij})_{i\in [1,m],j\in[0,n]}$, where…
We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…
One of the first and therefore most important theorems in perturbation theory claims that for an arbitrary self-adjoint operator A there exists a perturbation B of Hilbert-Schmidt class with arbitrary small operator norm, which destroys…
The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…
In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…