Related papers: Complexity of Linear Operators
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity needs to be small. Many sub-cubic algorithms have large leading…
We consider composition orderings for linear functions of one variable. Given $n$ linear functions $f_1,\dots,f_n$ and a constant $c$, the objective is to find a permutation $\sigma$ that minimizes/maximizes $f_{\sigma(n)}\circ\dots\circ…
The logarithmic running of marginal double-trace operators is a general feature of 4-d field theories containing scalar fields in the adjoint or bifundamental representation. Such operators provide leading contributions in the large N…
What is the time complexity of matrix multiplication of sparse integer matrices with $m_{in}$ nonzeros in the input and $m_{out}$ nonzeros in the output? This paper provides improved upper bounds for this question for almost any choice of…
This paper shows how to solve linear programs of the form $\min_{Ax=b,x\geq0} c^\top x$ with $n$ variables in time $$O^*((n^{\omega}+n^{2.5-\alpha/2}+n^{2+1/6}) \log(n/\delta))$$ where $\omega$ is the exponent of matrix multiplication,…
Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…
A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…
A well known numerical task is the inversion of large symmetric tridiagonal Toeplitz matrices, i.e., matrices whose entries equal $a$ on the diagonal and $b$ on the extra diagonals ($a, b\in \mathbb R$). The inverses of such matrices are…
We are used to thinking of an operator acting once, twice, and so on. However, an operator acting integer times can be consistently analytic continued to an operator acting complex times. Applications: (s,r) diagrams and an extension of…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
We construct six multi-parameter families of Hermitian quasi-exactly solvable matrix Schroedinger operators in one variable. The method for finding these operators relies heavily upon a special representation of the Lie algebra o(2,2) whose…
We evaluate zeta-functions $\zeta(s)$ at $s=0$ for invariant non-minimal 2nd-order vector and tensor operators defined on maximally symmetric even dimensional spaces. We decompose the operators into their irreducible parts and obtain their…
We study finite semigroups of $n \times n$ matrices with rational entries. Such semigroups provide a rich generalization of transition monoids of unambiguous (and, in particular, deterministic) finite automata. In this paper we determine…
A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…
Three loop ladder and $V$-topology diagrams contributing to the massive operator matrix element $A_{Qg}$ are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable…
The Invariant Subset Problem on the Hilbert space is to know whether there exists a bounded linear operator $T$ on a separable infinite-dimensional Hilbert space $H$ such that the orbit $\{T^{n}x;\ n\ge 0\}$ of every non-zero vector $x\in…
Let {\alpha} be the maximal value such that the product of an n x n^{\alpha} matrix by an n^{\alpha} x n matrix can be computed with n^{2+o(1)} arithmetic operations. In this paper we show that \alpha>0.30298, which improves the previous…
Clique tree conversion solves large-scale semidefinite programs by splitting an $n\times n$ matrix variable into up to $n$ smaller matrix variables, each representing a principal submatrix of up to $\omega\times\omega$. Its fundamental…
We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size…
We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$ for some given integer $m$. A series of recent works has provided near-optimal algorithms for this problem under the Strong Exponential Time Hypothesis. Koiliaris…