Related papers: On the Deligne-Simpson problem and its weak versio…
We investigate degenerate saddle point problems, which can be viewed as limit cases of standard mixed formulations of symmetric problems with large jumps in coefficients. We prove that they are well-posed in a standard norm despite the…
For a complex polynomial $P$ of degree $n$ and an $m$-tuple of distinct complex numbers $\Lambda=(\lambda_1,\ldots,\lambda_m)$, the dope matrix $D_P(\Lambda)$ is defined as the $m \times (n+1)$ matrix $(c)_{ij}$ with $c_{ij} =1$ if…
We study the problem of solvability of linear differential systems with small coefficients in the Liouvillian sense (or, by generalized quadratures). For a general system, this problem is equivalent to that of solvability of the Lie algebra…
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…
We classify indecomposable summands of mixed tensor powers of the natural representation for the general linear supergroup up to isomorphism. We also give a formula for the characters of these summands in terms of composite supersymmetric…
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…
Given a $(k+1)$-tuple $A, B_1,...,B_k$ of $(m\times n)$-matrices with $m\le n$ we call the set of all $k$-tuples of complex numbers $\{\la_1,...,\la_k\}$ such that the linear combination $A+\la_1B_1+\la_2B_2+...+\la_kB_k$ has rank smaller…
We say that a list of real numbers is "symmetrically realisable" if it is the spectrum of some (entrywise) nonnegative symmetric matrix. The Symmetric Nonnegative Inverse Eigenvalue Problem (SNIEP) is the problem of characterising all…
For p odd, the Lie group SO_0(p+1,p+1) has a family of unitary degenerate principal series representations realized on the space of real (p+1) by (p+1) skew symmetric matrices, similar to the Stein's complementary series for SL(2n,C) or…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…
We consider dissipative strongly competitive systems $\dot{x}_{i}=x_{i}f_{i}(x)$ of ordinary differential equations. It is known that for a wide class of such systems there exists an invariant attracting hypersurface $\Sigma$, called the…
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $\Gamma$ is tractable if and only if $\Gamma$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial…
A Maxwell-Stefan system for fluid mixtures with driving forces depending on Cahn-Hilliard-type chemical potentials is analyzed. The corresponding parabolic cross-diffusion equations contain fourth-order derivatives and are considered in a…
Let $M,N$ be real-valued martingales such that $N$ is differentially subordinate to $M$. The paper contains the proofs of the following weak-type inequalities: (i) If $M\geq0$ and $0<p\leq1$, then \[\Vert N\Vert_{p,\infty}\leq2\Vert…
The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see…
We introduce the concept of shape partition of a tensor and formulate a general tensor eigenvalue problem that includes all previously studied eigenvalue problems as special cases. We formulate irreducibility and symmetry properties of a…
We prove a version of the Deligne conjecture for $n$-fold monoidal abelian categories $A$ over a field $k$ of characteristic 0, assuming some compatibility and non-degeneracy conditions for $A$. The output of our construction is a weak…
We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…