Related papers: Algebraic And\^{o} Dilation

The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

This is an introduction to advanced linear algebra, with emphasis on geometric aspects, and with some applications included too. We first review basic linear algebra, notably with the spectral theorem in its general form, and with the…

We explain how results comparing the homology of spaces of algebraic and continuous maps to projective spaces can be leveraged to compare moduli stacks of families of algebraic and continuous maps.

We provide a natural smooth projective compactification of the space of algebraic maps from the projective line to the projective space of dimension n by adding a divisor with simple normal crossings.

The paper studies the harmonic maps on a direction between a Riemannian space and a generalized Lagrange space. Also, it is proved there that the solutions of C^2 class of certain ODEs or PDEs are harmonic maps, in the sense of this paper.

Let $L$ be a Lie algebra over a field of characteristic different from $2$. If $L$ is perfect and centerless, then every skew-symmetric biderivation $\delta:L\times L\to L$ is of the form $\delta(x,y)=\gamma([x,y])$ for all $x,y\in L$,…

For a finite dimensional vector space equipped with a $\mathbb C$-algebra structure, one can define rational maps using the algebraic structure. In this paper, we describe the growth of the degree sequences for this type of rational maps.

For mappings of finite distortion actively investigated last 15--20 years, problems of a so-called lower order are discussed. It is proved that, mappings with finite length distortion $f:D\rightarrow {\Bbb R}^n,$ $n\ge 2,$ which have…

With this note we bring again into attention a vector dual problem neglected by the contributions who have recently announced the successful healing of the trouble encountered by the classical duals to the classical linear vector…

Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…

We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…

We study the so-called K-positive linear maps from B(L) into B(H) for finite dimensional Hilbert spaces L and H and give characterizations of the dual cone of the cone of K-positive maps. Applications are given to decomposable maps and…

An introductory overview of vector spaces, algebras, and linear geometries over an arbitrary commutative field is given. Quotient spaces are emphasized and used in constructing the exterior and the symmetric algebras of a vector space.…

This paper presents a first continuous, linear, conic formulation for the Discrete Ordered Median Problem (DOMP). Starting from a binary, quadratic formulation in the original space of location and allocation variables that are common in…

Here we prove that for dilatation structures linearity (see arXiv:0705.1440v1) is equivalent to a statement about the inverse semigroup generated by the family of dilatations of the space. The result is new for Carnot groups and the proof…

The Weil pairing on elliptic curves has deep links with discrete logarithm problems. In practice, to better suit the functionalities of cryptosystems, one often needs to modify the original Weil pairing via what is called a distortion map.…

Dilation theory is a paradigm for studying operators by way of exhibiting an operator as a compression of another operator which is in some sense well behaved. For example, every contraction can be dilated to (i.e., is a compression of) a…

We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…

While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context of distributed graph algorithms. This work is…