English
Related papers

Related papers: Chollet's permanent conjecture for $4\times 4$ mat…

200 papers

We show that under the assumption of a 24-term version of Fermat's Last Theorem, there exists an absolute constant c > 0 such that if S is a set of n > n_0 positive integers satisfying |S.S| < n^(1+c), then the sumset S.S satisfies |S+S| >>…

Combinatorics · Mathematics 2009-04-14 Ernie Croot , Derrick Hart

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

Representation Theory · Mathematics 2007-10-04 Genrich R. Belitskii , Vladimir V. Sergeichuk

Let $H$ be a positive semi-definite matrix partitioned in $\beta\times \beta$ Hermitian blocks, $H=[A_{s,t}]$, $1\le s,t,\le \beta$. Then, for all symmetric norms, {equation*} \| H \| \le \| \sum_{s=1}^{\beta} A_{s,s} \|. {equation*} The…

Functional Analysis · Mathematics 2012-09-11 Jean-Christophe Bourin , Eun-Young Lee , Minghua Lin

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

Probability · Mathematics 2014-12-12 Robin Pemantle , Yuval Peres , Igor Rivin

This note studies parity vectors and paradoxical sequences in the accelerated Collatz iteration $T(n) = (3n+1)/2$ for $n$ odd, $T(n) = n/2$ for $n$ even. Building on Rozier and Terracol (arXiv:2502.00948, 2025), Terras (1976), Lagarias…

Number Theory · Mathematics 2026-05-22 Tong Niu

Computing the permanent of a $(0,1)$-matrix is a well-known $\#P$-complete problem. In this paper, we present an expression for the permanent of a bipartite graph in terms of the determinant of the graph and its subgraphs, obtained by…

Discrete Mathematics · Computer Science 2025-05-19 Surabhi Chakrabartty , Ranveer Singh

Since techniques used to address the Nivat's conjecture usually relies on Morse-Hedlund Theorem, an improved version of this classical result may mean a new step towards a proof for the conjecture. In this paper, considering an alphabetical…

Dynamical Systems · Mathematics 2020-06-24 Cleber F. Colle , Eduardo Garibaldi

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36…

Combinatorics · Mathematics 2010-04-27 Dragomir Z. Djokovic

In 1956, Je$\acute{s}$manowicz conjectured that, for positive integers $m$ and $n$ with $m>n, \, \gcd(m,\, n)=1$ and $m\not\equiv n\pmod{2}$, the exponential Diophantine equation $(m^2-n^2)^x+(2mn)^y=(m^2+n^2)^z$ has only the positive…

Number Theory · Mathematics 2019-03-04 Qing Han , Pingzhi Yuan

We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…

Combinatorics · Mathematics 2007-05-23 Christian Krattenthaler

Celebrated work of Jerrum, Sinclair, and Vigoda has established that the permanent of a {0,1} matrix can be approximated in randomized polynomial time by using a rapidly mixing Markov chain. A separate strand of the literature has pursued…

Computational Complexity · Computer Science 2009-06-10 Cristopher Moore , Alexander Russell

Turyn prove that if a circulant Hadamard matrix of order $n$ exists then $n$ must be of the form $n=4m^{2}$ for some odd integer $m$. In this paper we use the structure constant of Schur ring of $\Z_{2}^{4m^{2}}$ to prove that there is no…

Combinatorics · Mathematics 2018-05-15 Ronald Orozco López

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

Number Theory · Mathematics 2026-05-29 Yutong Zhang , Yaoran Yang

Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…

Number Theory · Mathematics 2021-06-16 Michael R. Schwob , Peter Shiue , Rama Venkat

A strong version of the quantization conjecture of Guillemin and Sternberg is proved. For a reductive group action on a smooth, compact, polarized variety (X,L), the cohomologies of L over the GIT quotient X // G equal the invariant part of…

Algebraic Geometry · Mathematics 2007-05-23 Constantin Teleman

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

Combinatorics · Mathematics 2016-06-27 Ross Berkowitz , Pat Devlin

Put $a(n)=\sum\limits_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$, and $b(n)=v_{3}(a(n))$, for all integers $n\geqslant 0$, where $v_{3}$ is the $3$-adic valuation. In this work, we shall confirm a formula about $b(n)$, conjectured by J. Shallit…

Number Theory · Mathematics 2022-01-04 Zhao Shen

Let $M_n(R)$ be the algebra of all $n\times n$ matrices over a unital commutative ring $R$ with 6 invertible. We say that $A\in M_n(R)$ is a Jordan product determined point if for every $R$-module $X$ and every symmetric $R$-bilinear map…

Operator Algebras · Mathematics 2011-11-18 Yang Wenlei , Zhu Jun

The Strong Goldbach conjecture dates back to 1742. It states that every even integer greater than four can be written as the sum of two prime numbers. Since then, no one has been able to prove the conjecture. The only best known result so…

General Mathematics · Mathematics 2013-09-06 Redha Bournas

The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…

Quantum Algebra · Mathematics 2012-03-01 Martin Loebl , Iain Moffatt