Related papers: Degree Complexity of Matrix Inversion

Given a knot and an SL(n,C) representation of its group that is conjugate to its dual, the representation that replaces each matrix with its inverse-transpose, the associated twisted Reidemeister torsion is reciprocal. An example is given…

We study complexity in terms of degree growth of one-component lattice equations defined on a $3\times 3$ stencil. The equations include two in Hirota bilinear form and the Boussinesq equations of regular, modified and Schwarzian type.…

We associate to any endomorphism of the punctured affine space over some field an element in the Witt group of the base field that we call degree. We use this degree to give a counter-example to a question on unimodular rows

The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…

A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.

We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…

A matrix $H=[d_{ij}]$ is a generalized Hadamard matrix of order $u\lambda$ with entries from $U$ which is a finite group of order $u$ (for short $\mathrm{GH}(u,\,\lambda)$) such that whenever $i\neq \ell$ the set $\{d_{ij}d_{\ell…

In this paper, we construct quantum invariants for knotoid diagrams in $\mathbb{R}^2$. The diagrams are arranged with respect to a given direction in the plane ({\it Morse knotoids}). A Morse knotoid diagram can be decomposed into basic…

In this paper we derive a representation of an arbitrary real matrix M as the difference of a real matrix A and the transpose of its inverse. This expression may prove useful for progressing beyond known results for which the appearance of…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

This paper introduces and studies the higher-order group inverse in a ring. We extend known properties of the higher-order group inverse from complex matrices to elements of a ring and, in the process, derive new results. We further…

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

A connected graph is called a multi-block graph if each of its blocks is a complete multi-partite graph. Building on the work of \cite{Bp3,Hou3}, we compute the determinant and inverse of the distance matrix for a class of multi-block…

A $q$-analogue of combinatorics concerning the Cartan matrix for the Iwahori-Hecke algebra of type $A$ is investigated. We give several descriptions for the determinant of the graded Cartan matrix, which imply some combinatorial identities.…

We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…

Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

Let $k$ be a field and let $E$ be a finite quiver. We study the structure of the finitely presented modules of finite length over the Leavitt path algebra $L_k (E)$ and show its close relationship with the finite-dimensional representations…