Related papers: Matrix pencils with the numerical range equal to t…
Various results based on some convexity assumptions (involving the exponential map along with affine maps, geodesics and convex hulls) have been recently established on Hadamard manifolds. In this paper we prove that these conditions are…
It is well known that a purely inseparable field extension $L/F$ with some extra property and degree $[L:F]=4$ determines a Clifford parallelism on the set of lines of the three-dimensional projective space over $F$. By extending the ground…
Let X be a smooth curve of genus g. When pi>=3g and d>=pi-2g+1 we show the existence of a double covering gamma:C-->X where C a smooth curve of genus pi with a base-point-free pencil of degree d which is not the pull-back of a pencil on X.
Suppose that c is an operator on a Hilbert Space H such that the von Neumann algebra N generated by c is finite. Suppose that tau is a faithful normal tracial state on N. Let B denote the spectal scale of c with respect to tau. We show that…
In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…
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…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
For $\lambda\in(0,1/3]$ let $C_\lambda$ be the middle-$(1-2\lambda)$ Cantor set in $\mathbb R$. Given $t\in[-1,1]$, excluding the trivial case we show that \[ \Lambda(t):=\left\{\lambda\in(0,1/3]:…
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…
Given a monic linear pencil L in g variables let D_L be its positivity domain, i.e., the set of all g-tuples X of symmetric matrices of all sizes making L(X) positive semidefinite. Because L is a monic linear pencil, D_L is convex with…
A finite, normal cover $f: X\longrightarrow \bbP^2$ of degree $m\geq 3$ (the case $m=2$ is well known and we do not consider it in this paper) is called \emph{simple}, if there is a pencil $\mathcal P$ of rational curves of $\bbP^2$ such…
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial $P(\lambda)$, regular and singular, with good properties. As a consequence of this research, families such as the…
Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…
The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…