相关论文: On the Deligne-Simpson problem and its weak versio…

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…

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…

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…

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.

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…

We consider a number of boundary value problems involving the $p$-Laplacian. The model case is $-\Delta_p u=V|u|^{p-2}u$ for $u\in W_0^{1,2}(D)$ with $D$ a bounded domain in ${\bf R}^n$. We derive necessary conditions for the existence of…

Singular equations with rank-deficient Jacobians arise frequently in algebraic computing applications. As shown in case studies in this paper, direct and intuitive modeling of algebraic problems often results in nonisolated singular…

We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…

In this paper we aim to show continuous differentiability of weak solutions to a one-Laplace system perturbed by $p$-Laplacian with $1<p<\infty$. The main difficulty on this equation is that uniform ellipticity breaks near a facet, the…

The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

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…

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…

This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of $n$ elements using the fewest possible tests. Non-adaptive…

The Deligne--Simpson problem is an existence problem for connections with specified local behavior. Almost all previous work on this problem has restricted attention to connections with regular or unramified singularities. Recently, the…

The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…

It is shown that a Riemann-type problem with discontinuous data of sign-type for the thin film equation, which degenerates at +1 and -1, admits a self-similar solution. Both FBP and the Cauchy problem (oscillatory solutions near interfaces)…

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…

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

In this paper we present two Fenchel-type dual problems for a DC (difference of convex functions) optimization primal one. They have been built by means of the c-conjugation scheme, a pattern of conjugation which has been shown to be…