Related papers: Degree Complexity of Matrix Inversion
For $q\geq 3$, we let $\mathcal{S}_q$ denote the projectivization of the set of symmetric $q\times q$ matrices with coefficients in $\mathbb{C}$. We let $I(x)=(x_{i,j})^{-1}$ denote the matrix inversion, and we let $J(x)=(x_{i,j}^{-1})$ be…
We consider two (densely defined) involutions on the space of $q\times q$ matrices; $I(x_{ij})$ is the matrix inverse of $(x_{ij})$, and $J(x_{ij})$ is the matrix whose $ij$th entry is the reciprocal $x_{ij}^{-1}$. Let $K=I\circ J$. The set…
Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines,…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…
Let A be an n*n matrix with entries a_ij in the field C. Consider the following two involutive operations on such matrices: the matrix inversion I: A -> A^-1 and the element-by-element (or Hadamard) inversion J: a_ij -> a_ij^-1. We study…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
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…
We determine explicit quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centers and block diagonal forms {of these algebras.} In the case where $q$ is {an arbitrary} root of unity, this further…
Using the notion of quantum integers associated with a complex number $q\neq 0$, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little $q$-Jacobi polynomials when $|q|<1$, and…
We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…
Let $f$ be a birational map of ${\bf C}^d$, and consider the degree complexity, or asymptotic degree growth rate $\delta(f)=\lim_{n\to\infty}({\rm deg}(f^n))^{1/n}$. We introduce a family of elementary maps, which have the form $f=L\circ…
Let $F$ be an algebraically closed field of characteristic zero, and $G$ be a finite abelian group. If $A=\oplus_{g\in G} A_g$ is a $G$-graded algebra, we study degree-inverting involutions on $A$, i.e., involutions $*$ on $A$ satisfying…
We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer…
We axiomatize and study the matrices of type $H\in M_N(A)$, having unitary entries, $H_{ij}\in U(A)$, and whose rows and columns are subject to orthogonality type conditions. Here $A$ can be any $C^*$-algebra, for instance $A=\mathbb C$,…
We compute the degree complexity of the family of birational maps considered in \cite{bedford-kim-tuyen-abarenkova-maillard} for all exceptional cases. Some interesting properties of the family are also given.
In this short note, we classify the degree-inverting involution on the full square and triangular matrices.
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…