Related papers: The higher rank numerical range of matrix polynomi…

It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss…

For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…

In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…

This note gives an example of closed smooth manifolds $M$ and $N$ for which the rank of $M\times N$ is strictly greater than $rank M + rank N$.

We define eventually symmetric functions to be those power series of bounded degree in infinitely many variables that are invariant under interchanging all the variables with large enough indices. We show how this ring $\tilde{\Lambda}$ is…

We derive computable formulas for the structured backward errors of a complex number $\lambda$ when considered as an approximate eigenvalue of rational matrix polynomials that carry a symmetry structure. We consider symmetric,…

In [19], Taslaman, Tisseur, and Zaballa show that any regular matrix polynomial $P(\lambda)$ over an algebraically closed field is spectrally equivalent to a triangular matrix polynomial of the same degree. When $P(\lambda)$ is real and…

In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…

We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…

The numerical radius of a matrix is a scalar quantity that has many applications in the study of matrix analysis. Due to the difficulty in computing the numerical radius, inequalities bounding it have received a considerable attention in…

Let K be a field of characteristic 0 and let n be a natural number. Let Gamma be a subgroup of the multiplicative group $(K^\ast)^n$ of finite rank r. Given $A_2,...,a_n\in K^\ast$ write $A(a_1,...,a_n,\Gamma)$ for the number of solutions…

For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A…

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

Given any postsingularly finite exponential function $p_\lambda(z) = \lambda \exp(z)$ where $\lambda \in \C^*$, we construct a sequence of postcritically finite unicritical polynomials $p_{d,\lambda_d}(z) = \lambda_d(1+\frac{z}{d})^d$ that…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…

Lorentzian polynomials are a fascinating class of real polynomials with many applications. Their definition is specific to the nonnegative orthant. Following recent work, we examine Lorentzian polynomials on proper convex cones. For a…

In this work, we study the relation between the roots of the Bernstein polynomial $\widetilde{b}$ and the value set of differentials $\Lambda$ for plane branches. For plane branches defined by semiquasihomogeneous polynomial we describe the…

We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…

A matrix is said to have factor width at most $k$ if it can be written as a sum of positive semidefinite matrices that are non-zero only in a single $k \times k$ principal submatrix. We explore the ``factor-width-$k$ rank'' of a matrix,…