Cover Image

Permanents of random matrices over finite fields

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hunter, Zach, Kwan, Matthew, Sauermann, Lisa
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Computational Complexity Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exponential anticoncentration of the permanent
by: Hunter, Zach, et al.
Published: (2025)

On random matrices with large corank
by: Hunter, Zach, et al.
Published: (2025)

Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)

An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
by: Kush, Deepanshu
Published: (2026)

Optimal Union Probability Interval Is NP-Hard
by: Kaski, Petteri, et al.
Published: (2026)

On hardness of computing analytic Brouwer degree
by: Chakraborty, Somnath
Published: (2023)

Universality for roots of derivatives of entire functions via finite free probability
by: Campbell, Andrew, et al.
Published: (2024)

Algebraic aspects of the polynomial Littlewood-Offord problem
by: Jin, Zhihan, et al.
Published: (2025)

Permanental rank versus determinantal rank of random matrices over finite fields
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Sharp threshold for universality of cokernels of random matrices over finite fields
by: Lee, Jungin
Published: (2025)

Communication Complexity of Disjointness under Product Distributions
by: Hunter, Zach, et al.
Published: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
by: Kunisky, Dmitriy, et al.
Published: (2024)

Separating complexity classes of LCL problems on grids
by: Berlow, Katalin, et al.
Published: (2025)

Improving Behrend's construction: Sets without arithmetic progressions in integers and over finite fields
by: Elsholtz, Christian, et al.
Published: (2024)

Inference of rankings planted in random tournaments
by: Kunisky, Dmitriy, et al.
Published: (2024)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)

Polynomial-time sampling despite disorder chaos
by: Ma, Eric, et al.
Published: (2025)

Some easy optimization problems have the overlap-gap property
by: Li, Shuangping, et al.
Published: (2024)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
by: Li, Tiange, et al.
Published: (2026)

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

Infinite circle patterns in the Weil-Petersson class
by: Lam, Wai Yeung
Published: (2026)

Decay of correlations and zeros for the hard-core model
by: Peters, Han, et al.
Published: (2026)

Universality results for random matrices over finite local rings
by: Lvov, Nikita
Published: (2026)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

The stochastic block model has the overlap graph property for modularity
by: Bhamidi, Shankar, et al.
Published: (2026)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
by: Gamarnik, David, et al.
Published: (2026)

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2026)

Sharp Online Hardness for Large Balanced Independent Sets
by: Dhawan, Abhishek, et al.
Published: (2025)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2024)

Statistical inference of a ranked community in a directed graph
by: Kunisky, Dmitriy, et al.
Published: (2024)

Singularity of the k-core of a random graph
by: Ferber, Asaf, et al.
Published: (2021)

Inconsistency Probability of Sparse Equations over F2
by: Horak, P., et al.
Published: (2026)

A central limit theorem for the matching number of a sparse random graph
by: Glasgow, Margalit, et al.
Published: (2024)

Derangements in finite classical groups and characteristic polynomials of random matrices
by: Fulman, Jason, et al.
Published: (2025)

The random walk on upper triangular matrices over $\mathbb{Z}/m \mathbb{Z}$
by: Nestoridi, Evita, et al.
Published: (2020)

A phase transition for the cokernels of random band matrices over the p-adic integers
by: Mészáros, András
Published: (2024)

The number of solutions of a random system of polynomials over a finite field
by: Jain, Ritik
Published: (2024)

Representing Matroids over the Reals is $\exists \mathbb R$-complete
by: Kim, Eun Jung, et al.
Published: (2023)

On the scaling of random Tamari intervals and Schnyder woods of random triangulations (with an asymptotic D-finite trick)
by: Chapuy, Guillaume
Published: (2024)

Random infinite ideal angled graphs and ideal hyperbolic polyhedra
by: Ge, Huabin, et al.
Published: (2026)