English
Related papers

Related papers: Permanents of random matrices over finite fields

200 papers

The problem of computing the permanent of a matrix has attracted interest since the work of Ryser(1963) and Valiant(1979). On the other hand, trellises were extensively studied in coding theory since the 1960s. In this work, we establish a…

Information Theory · Computer Science 2021-07-16 Han Mao Kiah , Alexander Vardy , Hanwen Yao

We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…

Probability · Mathematics 2012-04-22 Elahe Zohoorian Azad

Denote $\Sigma_n$ and $Q_n$ the set of all $n \times n$ symmetric and skew-symmetric matrices over a field $\mathbb{F}$, respectively, where $char(\mathbb{F})\neq 2$ and $\lvert \mathbb{F} \rvert \geq n^2+1$. A characterization of…

Rings and Algebras · Mathematics 2021-03-23 Ratsiri Sanguanwong , Kijti Rodtes

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

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

We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

Algebraic Geometry · Mathematics 2015-12-31 Julia Pieltant , Hugues Randriam

The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…

Combinatorics · Mathematics 2010-10-21 Fabien Durand

Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…

Information Theory · Computer Science 2026-05-01 Rathinakumar Appuswamy , Marco Bazzani , Spencer Congero , Joseph Connelly , Matthew Ekaireb , Kenneth Zeger

The Hermite Normal Form (HNF) is a canonical representation of matrices over any principal ideal domain. Over the integers, the distribution of the HNFs of randomly looking matrices is far from uniform. The aim of this article is to present…

Number Theory · Mathematics 2011-08-05 Gerard Maze

We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).…

Probability · Mathematics 2016-08-16 J. Ben Hough , Manjunath Krishnapur , Yuval Peres , Bálint Virág

Random correlation matrices are studied for both theoretical interestingness and importance for applications. The author of [6] is interested in their interpretation as covariance matrices of purely random signals, the authors of [16]…

Probability · Mathematics 2016-07-28 A. M. Hanea , G. F Nane

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…

Probability · Mathematics 2016-11-22 Philippe Sosoe , Uzy Smilansky

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Symbolic Computation · Computer Science 2014-09-22 Wei Zhou , George Labahn

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Probability · Mathematics 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $\mathbb{F}_q$ be a finite field of order $q$. In this paper, we study the distribution of rectangles in a given set in $\mathbb{F}_q^2$. More precisely, for any $0<\delta\le 1$, we prove that there exists an integer $q_0=q_0(\delta)$…

Combinatorics · Mathematics 2021-09-28 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen

The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A(q) is closely connected with the…

Algebraic Geometry · Mathematics 2007-07-16 J. I. Farran

For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo…

Number Theory · Mathematics 2015-07-15 Gary L. Mullen , Amela Muratović-Ribić , Qiang Wang

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

Dynamical Systems · Mathematics 2025-01-10 Hanfeng Li , Klaus Schmidt

For general non-Hermitian random matrices $X$ and deterministic deformation matrices $A$, we prove that the local eigenvalue statistics of $A+X$ close to the typical edge points of its spectrum are universal. Furthermore, we show that under…

Probability · Mathematics 2025-07-14 Andrew Campbell , Giorgio Cipolloni , László Erdős , Hong Chang Ji

Let $p$ be prime and $X$ be a Haar-random $n \times n$ matrix over $\mathbb{Z}_{p}$, the ring of $p$-adic integers. Let $P_{1}(t), \dots, P_{l}(t) \in \mathbb{Z}_{p}[t]$ be monic polynomials of degree at most $2$ whose images modulo $p$ are…

Number Theory · Mathematics 2022-01-24 Gilyoung Cheong , Nathan Kaplan
‹ Prev 1 3 4 5 6 7 10 Next ›