English
Related papers

Related papers: Some counting questions for matrix products

200 papers

An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…

Number Theory · Mathematics 2022-12-14 Melvyn B. Nathanson

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

Group Theory · Mathematics 2018-11-14 Avraham Aizenbud , Nir Avni

Given a nonempty finite multiset $S$ of positive integers, we wish to find a partially ordered set $P$ of minimal cardinality such that the multiset of cardinalities of all maximal chains in $P$ equals $S$. This paper establishes upper and…

Combinatorics · Mathematics 2023-05-30 Todd Bichoupan

For an (indefinite) scalar product $[x,y]_B = x^HBy$ for $B= \pm B^H \in Gl_n(\mathbb{C})$ on $\mathbb{C}^n \times \mathbb{C}^n$ we show that the set of diagonalizable matrices is dense in the set of all $B$-selfadjoint, $B$-skewadjoint,…

Rings and Algebras · Mathematics 2020-07-02 Ralph John de la Cruz , Philip Saltenberger

We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and give concrete examples from diverse…

Optimization and Control · Mathematics 2022-08-09 Andreas M. Tillmann , Daniel Bienstock , Andrea Lodi , Alexandra Schwartz

Finite quandles with n elements can be represented as n-by-n matrices. We show how to use these matrices to distinguish all isomorphism classes of finite quandles for a given cardinality n, as well as how to compute the automorphism group…

Geometric Topology · Mathematics 2007-05-23 Benita Ho , Sam Nelson

We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…

Algebraic Geometry · Mathematics 2025-05-28 Gemma De les Coves , Joshua Graf , Andreas Klingler , Tim Netzer

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…

Number Theory · Mathematics 2011-11-07 Qi Cheng , Joshua E. Hill , Daqing Wan

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

Data Structures and Algorithms · Computer Science 2017-04-10 Zeyuan Allen-Zhu , Yuanzhi Li , Rafael Oliveira , Avi Wigderson

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

Computational Complexity · Computer Science 2022-04-01 V. Arvind , Pushkar S. Joglekar

Define the weight of a matrix to be the number of non-zero entries. One would like to count $m$ by $n$ matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while…

Rings and Algebras · Mathematics 2007-06-12 Theresa Migler , Kent E. Morrison , Mitchell Ogle

We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…

Computational Complexity · Computer Science 2021-09-01 Sankeerth Rao Karingula , Shachar Lovett

The theory of generalized matric Massey products has been applied for some time to $A$-modules $M$, $A$ a $k$-algebra. The main application is to compute the local formal moduli $\hat{H}_M$, isomorphic to the local ring of the moduli of…

Algebraic Geometry · Mathematics 2007-05-23 Arvid Siqveland

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

Combinatorics · Mathematics 2026-04-17 David Gonzalez

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

Number Theory · Mathematics 2023-10-20 Ali Mohammadi , Alina Ostafe , Igor Shparlinski

For an $n$-dimensional real-valued centered Gaussian random vector $(X_1,\ldots,X_n)$ with any covariance matrix, the following moment product conjecture is proved in this paper \[ \mathbb{E}\prod_{j=1}^nX_j^{2m_j}\geq…

Probability · Mathematics 2016-10-03 Xiangfeng Yang

We determine the order of magnitude of H^{(k+1)}(x,\vec{y},2\vec{y}), the number of integers up to x that are divisible by a product d_1...d_k with y_i<d_i\le 2y_i, when the numbers \log y_1,...,\log y_k have the same order of magnitude and…

Number Theory · Mathematics 2013-05-29 Dimitris Koukoulopoulos

We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

Logic · Mathematics 2021-10-27 Jouko Väänänen , Philip Welch

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Computational Complexity · Computer Science 2014-04-08 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

We define geometric matrix midranges for positive definite Hermitian matrices and study the midrange problem from a number of perspectives. Special attention is given to the midrange of two positive definite matrices before considering the…

Optimization and Control · Mathematics 2020-05-29 Cyrus Mostajeran , Christian Grussler , Rodolphe Sepulchre