相关论文: Smigoc's glue for universal realizability in the l…
A list $\Lambda =\{\lambda _{1},\lambda_{2},\ldots ,\lambda _{n}\}$ of complex numbers is said to be realizable if it is the spectrum of an entrywise nonnegative matrix. The list $\Lambda $ is said to be universally realizable…
A list $\Lambda =\{\lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers (repeats allowed) is said to be \textit{realizable} if it is the spectrum of an entrywise nonnegative matrix $A$. $\Lambda $ is \textit{diagonalizably realizable} if…
A multiset $\Lambda=\{\lambda_1,\ldots,\lambda_n\}$ of complex numbers is said to be realizable whenever there exists a nonnegative matrix of order $n$ with spectrum $\Lambda$. One of the broadest criterion that guarantees realizability is…
An $n$-list $\lambda:=\left(r; \lambda_2, \ldots, \lambda_n\right)$ of complex numbers with $r>0,$ is said to be realizable if $\lambda$ is the spectrum of $n\times n$ nonnegative matrix $A$ and in this case $A$ is said to be a nonnegative…
A list $\Lambda =\{\lambda _{1},\lambda _{2},\ldots ,\lambda _{n}\}$ of complex numbers is said to be realizable if it is the spectrum of an entrywise nonnegative matrix. In this paper we intent to characterize those lists of complex…
Given a list of complex numbers \sigma:=(\lambda_1,\lambda_2,...,\lambda_m), we say that {\sigma} is realisable if {\sigma} is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (or NIEP) is the…
In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…
A new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix is presented; this is a contribution to the classical spectral inverse problem for symmetric doubly stochastic matrices that is…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
We show that if a list of nonzero complex numbers $\sigma=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is the nonzero spectrum of a diagonalizable nonnegative matrix, then $\sigma$ is the nonzero spectrum of a diagonalizable nonnegative matrix…
In this paper, we investigate the conditions for the Mal'cev-Neumann series ring {\Lambda} = R((G;{\sigma};{\tau})) to be left fusible and an SA-ring. Also, we show that: if G is a quasitotally ordered group and U a {\Sigma}-compatible…
A subalgebra of a semisimple Lie algebra is wide if every simple module of the semisimple Lie algebra remains indecomposable when restricted to the subalgebra. From a finer viewpoint, a subalgebra is $\lambda$-wide if the simple module of a…
Let $\mathfrak{g}$ be a Lie algebra over an algebraically closed field $\Bbbk$ of characteristic zero. Define the universal grading group $\mathcal{C}(\mathfrak{g})$ as having one generator $g_{\rho}$ for each irreducible…
Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…
Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…
A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…
We approach a problem of realising algebraic objects in a certain universal equivariant stable homotopy theory; the global homotopy theory of Schwede. Specifically, for a global ring spectrum $R$, we consider which classes of ring…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…
For a restricted Lie algebra $L$, the conditions under which its restricted enveloping algebra $u(L)$ is semiperfect are investigated. Moreover, it is proved that $u(L)$ is left (or right) perfect if and only if $L$ is finite-dimensional.
In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite…