English
Related papers

Related papers: Kr\"auter conjecture on permanents is true

200 papers

We establish a superpolynomial lower bound on the range of the permanent function on the set of $n\times n$ matrices with $\pm1$ entries.

Combinatorics · Mathematics 2025-07-15 DeVon Ingram , Alexander Razborov

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

Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…

Probability · Mathematics 2021-04-23 Ariel Neufeld , Julian Sester

We show that the permanent of a matrix can be written as the expectation value of a function of random variables each with zero mean and unit variance. This result is used to show that Glynn's theorem and a simplified MacMahon theorem…

Combinatorics · Mathematics 2021-06-23 Mobolaji Williams

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

Number Theory · Mathematics 2025-10-14 Nihar Gargava , Vlad Serban , Maryna Viazovska , Ilaria Viglino

We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…

Combinatorics · Mathematics 2021-01-13 Richard A. Brualdi , Geir Dahl

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

Let $R$ be a commutative additively idempotent semiring. In this paper, some properties and characterizations for permanents of matrices over $R$ are established, and several inequalities for permanents are given. Also, the adjiont matrices…

Rings and Algebras · Mathematics 2019-08-19 Yan Huang , Haifeng Lian

In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…

Rings and Algebras · Mathematics 2012-04-18 Petter Brändén

Let $\Lambda_n^k$ denote the class of $(0,1)$ square matrices containing in each row and in each column exactly $k$ 1's. The minimal value of $k,$ for which the behavior of the permanent in $\Lambda_n^k$ is not quite studied, is $k=3.$ We…

Combinatorics · Mathematics 2011-08-16 Vladimir Shevelev

One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…

Quantum Physics · Physics 2015-05-30 Scott Aaronson

Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…

Discrete Mathematics · Computer Science 2025-09-11 Aditi Laddha , Madhusudhan Reddy Pittu

In the present paper we shall investigate the Waring's problem for upper triangular matrix algebras. The main result is the following: Let $n\geq 2$ and $m\geq 1$ be integers. Let $p(x_1,\ldots,x_m)$ be a noncommutative polynomial with zero…

Rings and Algebras · Mathematics 2023-06-30 Qian Chen

We study the time and space complexity of matrix permanents over rings and semirings.

Data Structures and Algorithms · Computer Science 2009-04-22 Andreas Björklund , Thore Husfeldt , Petteri Kaski , Mikko Koivisto

Let $R=\mathcal{O}_{\Q(\sqrt{d})}$ for $d<0$, squarefree, $d\neq -1,-3$. We prove Lehmer's conjecture for associated reciprocal polynomials of $R$-matrices; that is, any noncyclotomic $R$-matrix has Mahler measure at least…

Number Theory · Mathematics 2011-03-24 G. Taylor

We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n^{O(ln n -ln…

Combinatorics · Mathematics 2014-06-25 Alexander Barvinok

In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…

Combinatorics · Mathematics 2015-09-08 Gyula Karolyi , Alain Lascoux , S. Ole Warnaar

Let A,B be matrices in SL(2,R) having trace greater than or equal to 2. Assume the pair A,B is coherently oriented, that is, can be conjugated to a pair having nonnegative entries. Assume also that either A,B^(-1) is coherently oriented as…

Dynamical Systems · Mathematics 2021-08-11 Giovanni Panti , Davide Sclosa

We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…

Quantum Physics · Physics 2014-05-01 Stefan Scheel

In the paper we resolve positively the conjecture on a characterization of matrix Kummer and Wishart laws through independence property, which was posed in [Koudou, Statist. Probab. Lett. 82 (2012), 1903--1907] . Apart from the…

Probability · Mathematics 2018-02-16 Bartosz Kołodziejek