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

We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…

We compute logarithmic corrections to the O(a^2) lattice artifacts for a class of lattice actions for the non-linear O(n) sigma-model in two dimensions. The generic leading artifacts are of the form $a^2[\ln(a^2)]^{(n/(n-2))}$. We also…

In this note, following suggestions by Tao, we extend the randomized algorithm for linear equations over prime fields by Raghavendra to a randomized algorithm for linear equations over the reals. We also show that the algorithm can be…

We present an efficient algorithm to multiply two hyperbolic octonions. The direct multiplication of two hyperbolic octonions requires 64 real multiplications and 56 real additions. More effective solutions still do not exist. We show how…

It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…

This paper aims to continue the studies initiated by Botha in [Linear Algebra Appl. 273 (1998), 65-82; Linear Algebra Appl. 286 (1999), 37-44; Linear Algebra Appl. 315 (2000), 1-23] by extending them to matrices over noncommutative division…

A GPU implementation of an algorithm to compute the Mertens function in O(x2/3+{\ko}) time is discussed. Results for x up to $10^{22}$, and a new extreme value for $M(x)/x^{1/2}$, -0.585768 ($M(x) \approx -1.996 \ast 10^9$ at $x \approx…

We study the time complexity of computing the $(\min,+)$ matrix product of two $n\times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the first matrix and the columns of the second matrix can be…

We consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a…

Large $N$ matrix quantum mechanics is central to holographic duality but not solvable in the most interesting cases. We show that the spectrum and simple expectation values in these theories can be obtained numerically via a `bootstrap'…

The main goal of this article is to establish several new upper and lower bounds for the $\mathbb{A}$-numerical radius of $2\times 2$ operator matrices, where $\mathbb{A}$ be the $2\times 2$ diagonal operator matrix whose diagonal entries…

In this note, we give a method to derive the Seiberg duality by the matrix model. The key fact we used is that the effective actions given by matrix model method should be identical for both electric and magnetic theories. We demonstrate…

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…

We consider deep inelastic scattering in the 't Hooft model. Being solvable, this model allows us to directly compute the moments associated with the cross section at next-to-leading order in the 1/Q^2 expansion. We perform the same…

We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

The algebraic formulation of Large N matrix mechanics recently developed by Halpern and Schwartz leads to a practical method of numerical computation for both action and Hamiltonian problems. The new technique posits a boundary condition on…

We continue our investigation of the nested loop approach to the O(n) model on random maps, by extending it to the case where loops may visit faces of arbitrary degree. This allows to express the partition function of the O(n) loop model as…

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in…