Related papers: Diagonal elements in the Nonnegative Inverse Eigen…

We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…

We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…

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…

By a result of Horv\'ath the equation solvability problem over finite nilpotent groups and rings is in P. We generalize his result, showing that the equation solvability over every finite supernilpotent Mal'cev algebra is in P. We also give…

SLEPc is a parallel library for the solution of various types of large-scale eigenvalue problems. In the last years we have been developing a module within SLEPc, called NEP, that is intended for solving nonlinear eigenvalue problems. These…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

For partially ordered sets $X$ we consider the square matrices $M^{X}$ with rows and columns indexed by linear extensions of the partial order on $X$. Each entry $\left( M^{X}\right)_{PQ}$ is a formal variable defined by a pedestal of the…

Given a diagonalizable $N\times N$ matrix $H$, whose non-degenerate spectrum consists of $p$ pairs of complex conjugate eigenvalues and additional $N-2p$ real eigenvalues, we determine all metrics $M$, of all possible signatures, with…

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

Let $\mathcal{A}$ and $\mathcal{B}$ be two factor von Neumann algebras and $\eta$ be a non-zero complex number. A nonlinear bijective map $\phi:\mathcal A\rightarrow\mathcal B$ has been demonstrated to satisfy…

An equivalent condition for an element of a Lie algebra acting nilpotently in all its representations is obtained. Namely, it should belong to the derived algebra and go via factoring over the radical to a nilpotent element of the…

We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\NP$-hard for any fixed…

In this article we consider the problem of finding the visibility set from a given point when the obstacles are represented as the level set of a given function. Although the visibility set can be computed efficiently by ray tracing, there…

A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…

In this paper, we consider the problem of reconstructing an $n \times n$ cell matrix $D(\vec{x})$ constructed from a vector $\vec{x} = (x_{1}, x_{2},\dots, x_{n})$ of positive real numbers, from a given set of spectral data. In addition, we…

The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling…

List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…