English
Related papers

Related papers: Some counting questions for matrix products

200 papers

This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…

Metric Geometry · Mathematics 2015-08-05 Joel A. Tropp

Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…

Logic · Mathematics 2021-02-09 Randall Dougherty

Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…

Quantum Physics · Physics 2013-09-25 Joohan Na

We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…

Combinatorics · Mathematics 2025-12-25 Darij Grinberg , Peter Mao

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

Combinatorics · Mathematics 2009-06-17 Alain Goupil

We investigate the product of $n$ complex non-Hermitian, independent random matrices, each of size $N\times N$ in the class of elliptic matrices, with independent identically distributed entries. The joint probability distribution of the…

Probability · Mathematics 2016-01-28 Mohamed Bouali

In this paper we study the problem of finding explicit expressions for inner products on the space of complex square matrices $\Mn$. We show that, given an inner product $\lip \cdot, \cdot \rip$ on $\Mn$, with some conditions, there exist…

Rings and Algebras · Mathematics 2019-06-24 Rubén A. Martínez-Avendaño , Josué I. Rios-Cangas

Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…

Logic · Mathematics 2009-09-25 Andreas Blass

It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…

Logic · Mathematics 2013-11-06 Shohei Izawa

We consider products of $n$ random Hermitian matrices which generalize the one-matrix model and show its relation to Hurwitz numbers which count ramified coverings of certain type. Namely, these Hurwitz numbers count $2k$-fold ramified…

Mathematical Physics · Physics 2026-01-01 Ch. Li , A. Yu. Orlov

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.…

Logic in Computer Science · Computer Science 2010-06-03 Wesley Calvert , Ken Kramer , Russell Miller

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

Computational Complexity · Computer Science 2023-10-05 Cornelius Brand , Viktoriia Korchemna , Michael Skotnica , Kirill Simonov

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

Computational Complexity · Computer Science 2019-04-03 Mrinal Kumar , Ben Lee Volk

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

Symbolic Computation · Computer Science 2014-12-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…

Category Theory · Mathematics 2026-05-01 Roy Ferguson , Zurab Janelidze

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

Rings and Algebras · Mathematics 2018-03-30 Daniel P. Bossaller , Sergio R. López-Permouth

The multi-class prediction had gained popularity over recent years. Thus measuring fit goodness becomes a cardinal question that researchers often have to deal with. Several metrics are commonly used for this task. However, when one has to…

Machine Learning · Computer Science 2022-08-12 Uri Itai , Natan Katz

Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably…

Optimization and Control · Mathematics 2026-01-12 Mahmoud Abdelgalil , Tryphon T. Georgiou
‹ Prev 1 3 4 5 6 7 10 Next ›