Related papers: The Deligne-Simpson problem -- a survey

Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…

Processes of the form $pp\to anything \to X_i X_j \to x\bar{x} + y\bar{y} (+ \slashchar{E})$ are studied via a technique that may be viewed as an adaptation of time-honoured Dalitz plot analyses. $X_i$ and $X_j$ are new heavy states (with…

In this article, we consider a class of degenerate singular problems. The degeneracy is captured by the presence of a class of $p$-admissible weights, which may vanish or blow up near the origin. Further, the singularity is allowed to vary…

Let $d(N )$ (resp. $p(N )$) be the number of summands in the determinant (resp. permanent) of an $N\times N$ circulant matrix $A = (a_{ij} )$ given by $a_{ij} = X_{i+j}$ where $i + j$ should be considered $\mod N$ . This short note is…

We consider a degenerate/singular wave equation in one dimension, with drift and in presence of a leading operator which is not in divergence form. We impose a homogeneous Dirichlet boundary condition where the degeneracy occurs and a…

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.

The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…

This paper is concerned with the stochastic Hamilton-Jacobi-Bellman equation with controlled leading coefficients, which is a type of fully nonlinear backward stochastic partial differential equation (BSPDE for short). In order to formulate…

Let $M_n$ denote the algebra of complex $n\times n $ matrices and write $M$ for the direct sum of the $M_n$. So a typical element of $M$ has the form \[x = x_1\oplus x_2 \... \oplus x_n \oplus \...,\] where $x_n \in M_n$ and $\|x\| =…

The Schlesinger equations $S_{(n,m)}$ describe monodromy preserving deformations of order $m$ Fuchsian systems with $n+1$ poles. They can be considered as a family of commuting time-dependent Hamiltonian systems on the direct product of $n$…

In this paper we construct three infinite series and two extra triples of complex matrices B, C, and A=B+C of special spectral types associated to C. Simpson's classification in his paper ``Products of Matrices'' and a classification of…

Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…

We solve the recognition problem (RP) for the class of Demidenko matrices. Our result closes a remarkable gap in the recognition of specially structured matrices. Indeed, the recognition of permuted Demidenko matrices is a longstanding open…

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

We consider the Dirichlet problem for positively homogeneous, degenerate elliptic, concave (or convex) Hessian equations. Under natural and necessary conditions on the geometry of the domain, with the $C^{1,1}$ boundary data, we establish…

The Cauchy dual subnormality problem (for short, CDSP) asks whether the Cauchy dual of a $2$-isometry is subnormal. In this paper, we address this problem for cyclic $2$-isometries. In view of some recent developments in operator theory on…

We generalize the notion of expanded degenerations and pairs for a simple degeneration or smooth pair to the case of smooth Deligne-Mumford stacks. We then define stable quotients on the classifying stacks of expanded degenerations and…

The fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a class of problems that…

The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…