English
Related papers

Related papers: An update on a few permanent conjectures

200 papers

In this note, while giving an overview of the state of art of the well known Hadamard conjecture, which is more than a century old and now it has been established by using the methods given in the two papers by Mohan et al [6,7].

Discrete Mathematics · Computer Science 2011-11-09 R. N. Mohan

The Shub-Smale Tau Conjecture is a hitherto unproven statement (on integer roots of polynomials) whose truth implies both a variant of $P\neq NP$ (for the BSS model over C) and the hardness of the permanent. We give alternative conjectures,…

Number Theory · Mathematics 2013-09-03 Pascal Koiran , Natacha Portier , J. Maurice Rojas

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…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky

In this paper, we study a general Syracuse problem. We give some necessary conditions concerning the existence of eventual non trivial cycles. Some properties based on linear logarithmic forms are established. New general conjectures are…

Number Theory · Mathematics 2021-09-01 Abderrahman Bouhamidi

Let $X=(x_{ij})$ and $Y=(y_{ij})$ be generic $n$ by $n$ matrices and $Z=XY-YX$. Let $S=k[x_{11},...,x_{nn},y_{11},...,y_{nn}]$, where $k$ is a field, let $I$ be the ideal generated by the entries of $Z$ and let $R=S/I$. We give a conjecture…

Commutative Algebra · Mathematics 2007-05-23 Freyja Hreinsdottir

We propose conjectural generalizations of the Fermat-Catalan conjecture, the Tijdeman-Zagier conjecture, and of the Fermat Last Theorem, in which powers are replaced by products of integers. We also formulate a new explicit version of the…

Number Theory · Mathematics 2024-10-30 Adam S. Sikora

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

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Logic in Computer Science · Computer Science 2026-05-15 Mishel Carelli

Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…

Combinatorics · Mathematics 2021-04-21 Lorenzo Vecchi

In this article, we study permanental varieties, i.e. varieties defined by the vanishing of permanents of fixed size of a generic matrix. Permanents and their varieties play an important, and sometimes poorly understood, role in…

Algebraic Geometry · Mathematics 2024-12-05 Ada Boralevi , Enrico Carlini , Mateusz Michałek , Emanuele Ventura

We refine a technique used in a paper by Schur on real-rooted polynomials. This amounts to an extension of a theorem of Wagner on Hadamard products of Toeplitz matrices. We also apply our results to polynomials for which the Neggers-Stanley…

Combinatorics · Mathematics 2012-04-18 Petter Brändén

We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…

Combinatorics · Mathematics 2015-02-25 Murad Banaji , Carrie Rutherford

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

We show Kantor's conjecture (1974) holds in rank 4. This proves both the sticky matroid conjecture of Poljak and Turzik (1982) and the whole Kantor's conjecture, due to an argument of Bachem, Kern, and Bonin, and an equivalence argument of…

Combinatorics · Mathematics 2021-08-11 Jaeho Shin

The aim of this note is to introduce a stable version of Terao conjecture, using the notion of infinitely stably extendability of vector bundles on $\mathbb P^n$, considered and characterized by I. Coanda in arXiv:0907.4040.

Algebraic Geometry · Mathematics 2016-09-16 Cristian Anghel

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…

Logic in Computer Science · Computer Science 2026-03-25 Valérie Berthé , Toghrul Karimov , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , James Worrell

This paper is devoted to introduce and investigate the notion of monotone sets in Hadamard spaces. First, flat Hadamard spaces are introduced and investigated. It is shown that an Hadamard space $X$ is flat if and only if $X\times…

Functional Analysis · Mathematics 2022-07-05 Ali Moslemipour , Mehdi Roohi

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 this paper we study some determinants and permanents. In particular, we investigate the new type determinants $$\det[(i^2+cij+dj^2)^{p-2}]_{1\le i,j\le p-1}\ \text{and} \ \det[(i^2+cij+dj^2)^{p-2}]_{0\le i,j\le p-1}$$ modulo an odd prime…

Number Theory · Mathematics 2024-02-28 Zhi-Wei Sun

This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix $q = p^m$ some power of an…

Computational Complexity · Computer Science 2025-12-05 Fatemeh Ghasemi , Gal Gross , Swastik Kopparty