Related papers: Continuous Selections of the Inverse Numerical Ran…

We study the local geometry of the pullback of a variety via a finite holomorphic map. In particular, we are looking for properties of $V = F^{-1}(W)$ such that if $V$ has the property $A$, then $W$ must have the property $A$. We show that…

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…

One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…

A. Ya. Zaslavskii's results on the existence of a linear (affine) selection for a linear (affine) or superlinear (convex) map $\Phi : K \to 2^Y$ defined on a convex cone (convex set) $K$ having the interpolation property are extended. We…

In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

A class of piecewise affine hyperbolic maps on a bounded subset of the plane is considered. It is shown that if a map from this class is sufficiently area-expanding then almost surely this map has an absolutely continuous invariant measure.

We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…

For a given $n$-by-$n$ matrix $A$, its {\em normalized numerical range} $F_N(A)$ is defined as the range of the function $f_{N,A}\colon x\mapsto (x^*Ax)/(\norm{Ax}\cdot\norm{x})$ on the complement of $\ker A$. We provide an explicit…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

A dynamical system is a triple $(A,G,\alpha)$, consisting of a unital locally convex algebra $A$, a topological group $G$ and a group homomorphism $\alpha:G\rightarrow\Aut(A)$, which induces a continuous action of $G$ on $A$. Further, a…

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…

Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

We prove that if $F$ is a Lipschitz map from the set of all complex $n\times n$ matrices into itself with $F(0)=0$ such that given any $x$ and $y$ we have that $% F\left( x\right) -F\left( y\right) $ and $x-y$ have at least one common…

Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…