Related papers: Computing the Boolean product of two n\times n Boo…

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of…

The {\it matrix-chain multiplication} problem is a classic problem that is widely taught to illustrate dynamic programming. The textbook solution runs in $\theta(n^3)$ time. However, there is a complex $O(n \log n)$-time method \cite{HU82},…

It is shown by the author in 2017 that for the union of N orthants in the n-dimensional space there exists an efficient and systematic way to find the exact value, using a suitable partial order relation construction. In this paper our…

We propose an $O(n^2)$-time algorithm to determine whether a given matching is efficient in the roommates problem.

A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…

In a recent paper, the author defined an operation of tensor product for a large class of $2$-representations of $\mathcal{U}^{+}$, the positive half of the $2$-category associated to $\mathfrak{sl}_{2}$. In this paper, we prove that the…

An algorithm has been devised to compute the inner and outer product between two arbitrary multi-dimensional arrays A and B in a single piece of code. It was derived using A Mathematics of Arrays (MoA) and the $\psi$-calculus. Extensive…

In this paper, we derive a family of fast and stable algorithms for multiplying and inverting $n \times n$ Pascal matrices that run in $O(n log^2 n)$ time and are closely related to De Casteljau's algorithm for B\'ezier curve evaluation.…

Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.

We report on the first analytic NNLL calculation for the matrix elements of the operators O_1 and O_2 for the inlusive process b --> X_s l^+l^- in the kinematical region q^2>4m_c^2, where q^2 is the invariant mass squared of the…

We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.

We present new algorithms for computing the low $n$ bits or the high $n$ bits of the product of two $n$-bit integers. We show that these problems may be solved in asymptotically 75% of the time required to compute the full $2n$-bit product,…

This paper studies the exponential of the sum of two non-commuting operators as an infinite product of exponential operators involving repeated commutators of increasing order. It will be shown how to determine two coefficients in front of…

We consider the Online Boolean Matrix-Vector Multiplication (OMV) problem studied by Henzinger et al. [STOC'15]: given an $n \times n$ Boolean matrix $M$, we receive $n$ Boolean vectors $v_1,\ldots,v_n$ one at a time, and are required to…

We construct an explicit abelian model for the operation of tensor $2$-product of $2$-representations of $\mathfrak{sl}_{2}^{+}$, specifically the product of a simple $2$-representation $\mathcal{L}(1)$ with a given abelian…

This is an exposition, for pedagogical purposes, of the formal power series proof of Bostan, Christol and Dumas [3] of the result stated in the title (a corollary of the Christol theorem).

Matrix multiplication is a fundamental classical computing operation whose efficiency becomes a major challenge at scale, especially for machine learning applications. Quantum computing, with its inherent parallelism and exponential storage…

We discuss approaches to computing eigenfunctions of the Ornstein--Uhlenbeck (OU) operator in more than two dimensions. While the spectrum of the OU operator and theoretical properties of its eigenfunctions have been well characterized in…