Related papers: New Bounds for Matrix Multiplication: from Alpha t…
Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…
New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than…
Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and…
In this paper we propose models of combinatorial algorithms for the Boolean Matrix Multiplication (BMM), and prove lower bounds on computing BMM in these models. First, we give a relatively relaxed combinatorial model which is an extension…
In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…
The study of the fundamental limits of information systems is a central theme in information theory. Both the traditional analytical approach and the recently proposed computational approach have significant limitations, where the former is…
We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find polyadic decompositions of the matrix multiplication tensor. We use this method to obtain new discrete decompositions and…
The maximum-entropy sampling problem (MESP) aims to select the most informative principal submatrix of a prespecified size from a given covariance matrix. This paper proposes an augmented factorization bound for MESP based on concave…
In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
Suppose that $S \subseteq [n]^2$ contains no three points of the form $(x,y), (x,y+\delta), (x+\delta,y')$, where $\delta \neq 0$. How big can $S$ be? Trivially, $n \le |S| \le n^2$. Slight improvements on these bounds are obtained from…
We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…
One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in not much more than quadratic time. The best known exponent is 2.376, due to Coppersmith and Winograd. Many attempts to solve this…
We present a new formulation for parallel matrix multiplication (MM) to out-perform the standard row-column code design. This algorithm is formulated in the MoA formalism (A Mathematics of Arrays) and combines an array view of hardware…
We consider fully nonlinear uniformly elliptic equations with quadratic growth in the gradient, such as $$ -F(x,u,Du,D^2u) =\lambda c(x)u+\langle M(x)D u, D u \rangle +h(x) $$ in a bounded domain with a Dirichlet boundary condition, here…
This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for…
This paper studies bilinear saddle point problems $\min_{\bf{x}} \max_{\bf{y}} g(\bf{x}) + \bf{x}^{\top} \bf{A} \bf{y} - h(\bf{y})$, where the functions $g, h$ are smooth and strongly-convex. When the gradient and proximal oracle related to…
We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…
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…