English
Related papers

Related papers: Permanental rank versus determinantal rank of rand…

200 papers

Fix a finite field $\mathbb F_q$ and let $A\in \mathbb F_q^{n\times n}$ be a uniformly random $n\times n$ matrix over $\mathbb F_q$. The asymptotic distribution of the determinant $\det(A)$ is well-understood, but the asymptotic…

Combinatorics · Mathematics 2026-03-18 Zach Hunter , Matthew Kwan , Lisa Sauermann

Let ${\rm Mat}_n(\mathbb{F})$ denote the set of square $n\times n$ matrices over a field $\mathbb{F}$ of characteristic different from two. The permanental rank ${\rm prk}\,(A)$ of a matrix $A \in{\rm Mat}_{n}(\mathbb{F})$ is the size of…

Combinatorics · Mathematics 2023-10-30 Alexander Guterman , Igor Spiridonov

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…

Combinatorics · Mathematics 2023-07-27 Carlo Sanna

Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…

Combinatorics · Mathematics 2020-02-20 Colin Cooper , Alan Frieze , Wesley Pegden

We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf…

Combinatorics · Mathematics 2024-06-04 Mark Skandera , Daniel Soskin

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

Combinatorics · Mathematics 2025-12-25 Priyanshu Pant , Surabhi Chakrabartty , Ranveer Singh

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.

Combinatorics · Mathematics 2008-04-18 T. Tao , V. Vu

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

Combinatorics · Mathematics 2013-07-24 Kenneth Maples

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

Combinatorics · Mathematics 2018-10-11 Mikhail V. Budrevich , Alexander E. Guterman

Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal…

Rings and Algebras · Mathematics 2020-07-29 Somphong Jitman

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

Computational Complexity · Computer Science 2020-11-04 Anna Knezevic , Greg Cohen , Marina Domanskaya

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

Probability · Mathematics 2021-10-29 Matthew Kwan , Lisa Sauermann

We formulate the problem of finding the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

Information Theory · Computer Science 2016-08-17 Daniel Salmond , Alex Grant , Ian Grivell , Terence Chan

Let $\FF$ be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of $\FF$ is sufficiently large. We also give an example of non-bijective map when…

Combinatorics · Mathematics 2010-03-11 Gregor Dolinar , Alexander E. Guterman , Bojan Kuzma , Marko Orel

This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…

Combinatorics · Mathematics 2008-07-01 Terence Tao , Van Vu

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

Rings and Algebras · Mathematics 2023-11-01 Kijti Rodtes

For a prime power $q$, we study the distribution of determinent of matrices with restricted entries over a finite field $\mathbbm{F}_q$ of $q$ elements. More precisely, let $N_d (\mathcal{A}; t)$ be the number of $d \times d$ matrices with…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

We study the rank of the random $n\times m$ 0/1 matrix ${\bf A}_{n,m;k}$ where each column is chosen independently from the set $\Omega_{n,k}$ of 0/1 vectors with exactly $k$ 1's. Here 0/1 are the elements of the field $GF_2$. We obtain an…

Combinatorics · Mathematics 2018-11-16 C. Cooper , A. M. Frieze , W. Pegden
‹ Prev 1 2 3 10 Next ›