相关论文: The Deligne-Simpson problem -- a survey

In this paper we study solutions, possibly unbounded and sign-changing, of the following problem: -\D_{\lambda} u=|x|_{\lambda}^a |u|^{p-1}u, in R^n,\;n\geq 1,\; p>1, and a \geq 0, where \D_{\lambda} is a strongly degenerate elliptic…

We study a nonlinear system made up of an elliptic equation of blended singular/degenerate type and Poisson's equation with a lowly integrable source. We prove the existence of a weak solution in any space dimension and, chiefly, derive an…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

Constraint Satisfaction Problems (CSPs, for short) make up a class of problems with applications in many areas of computer science. The first classification of these problems was given by Schaeffer who showed that every CSP over the domain…

We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…

The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge…

In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper,…

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.…

In this paper we analyze computational properties of the Diophantine problem (and its search variant) for spherical equations $\prod_{i=1}^m z_i^{-1} c_i z_i = 1$ (and its variants) over the class of finite metabelian groups…

The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…

We describe a minimal extension of the standard model by three right-handed neutrinos, a scalar doublet, and a scalar singlet (the "$\nu$DFSZ") which serves as an existence proof that weakly coupled high-scale physics can naturally explain…

We study the martingale problem associated with the operator $L u = \partial_s u + 1/2 \sum_{i,j=1}^{d_0} a^{ij} \partial_{ij} u + \sum_{i,j=1}^d B^{ij} x^j \partial_i u$, where $d_0 \leq d$. We show that the martingale problem is…

We study Deligne's conjecture on the monodromy weight filtration on the nearby cycles in the mixed characteristic case, and reduce it to the nondegeneracy of certain pairings in the semistable case. We also prove a related conjecture of…

Formulating a relativistic equation for particles with arbitrary spin remains an open challenge in theoretical physics. In this study, the main algebraic approaches used to generalize the Dirac and Kemmer Duffin equations for particles of…

We present a new generic approach to the condensed-matter ground-state problem which is complementary to variational techniques and works directly in the thermodynamic limit. Relaxing the ground-state problem, we obtain semidefinite…

Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class which has low tree-depth decomposition (e.g. structure of…

In the recently emerging field of group-based cryptography, the Conjugacy Search Problem (CSP) has gained traction as a non-commutative replacement of the Discrete Log Problem (DLP). The problem of finding a secure class of nonabelian…

The work of the first author on the moment map for representations of quivers included a classification of the possible dimension vectors of simple modules for deformed preprojective algebras. That classification was later used to solve an…

Various versions of the Dynamical Systems Method (DSM) are proposed for solving linear ill-posed problems with bounded and unbounded operators. Convergence of the proposed methods is proved. Some new results concerning discrepancy principle…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…