中文
相关论文

相关论文: Brualdi-Goldwasser-Michael problem for maximum per…

200 篇论文

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

组合数学 · 数学 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

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…

组合数学 · 数学 2018-10-11 Mikhail V. Budrevich , Alexander E. Guterman

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…

组合数学 · 数学 2024-06-04 Mark Skandera , Daniel Soskin

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

组合数学 · 数学 2007-05-23 Alex Samorodnitsky

We report on a computational and experimental study of permanents. On the computational side, we use the GPU to greaatly accelerate the computation of permanents over $\mathbb{C},$ $\mathbb{R},$ $\mathbb{F}_p$ and $\mathbb{Q}.$ First, for…

量子物理 · 物理学 2026-02-17 Igor Rivin

The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Minc's conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some…

组合数学 · 数学 2015-03-31 A. A. Taranenko

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…

组合数学 · 数学 2011-08-16 Vladimir Shevelev

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.

组合数学 · 数学 2008-04-18 T. Tao , V. Vu

Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…

概率论 · 数学 2025-09-29 Zach Hunter , Matthew Kwan , Lisa Sauermann

Let A be an n by n doubly substochastic matrix and denote {\sigma}(A) the sum of all elements of A. In this paper we give the upper bound of the permanent of (I-A) with respect to n and {\sigma}(A).

组合数学 · 数学 2018-01-03 Zhi Chen , Lei Cao

In this paper we discuss minimal primes over permanental ideals of generic matrices. We give a complete list of the minimal primes over ideals of 3 x 3 permanents of a generic matrix, and show that there are monomials in the ideal of…

交换代数 · 数学 2007-05-23 George Kirkup

We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…

组合数学 · 数学 2013-09-18 Miriam Farber , Mitchell Faulk , Charles R. Johnson , Evan Marzion

Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…

量子物理 · 物理学 2021-04-15 Sepehr Nezami

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…

概率论 · 数学 2021-10-29 Matthew Kwan , Lisa Sauermann

We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…

组合数学 · 数学 2025-03-17 Guillermo Nuñez Ponasso

We present an optimization procedure for a seminal class of positive maps $\tau_{n,k}$ in the algebra of $n \times n$ complex matrices introduced and studied by Tanahasi and Tomiyama, Ando, Nakamura and Osaka. Recently, these maps were…

量子物理 · 物理学 2023-09-19 Anindita Bera , Gniewomir Sarbicki , Dariusz Chruściński

We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…

组合数学 · 数学 2018-09-13 Alexander Barvinok

We study the linearized stability of n-vortex solutions of the magnetic Ginzburg-Landau (or Abelian-Higgs) equations. We prove that the fundamental vortices (n=1,-1) are stable for all values of the coupling constant, k, and we prove that…

偏微分方程分析 · 数学 2007-05-23 S. Gustafson , I. M. Sigal

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…

概率论 · 数学 2021-04-23 Ariel Neufeld , Julian Sester

In this article we compute the number of invertible $2\times 2$ matrices with integer entries modulo $n$ whose permanents are congruent modulo $n$ to a given integer $x$.

综合数学 · 数学 2021-05-10 Ayush Bohra , A. Satyanarayana Reddy
‹ 上一页 1 2 3 10 下一页 ›