English
Related papers

Related papers: Determinant and Permanent of Hessenberg Matrix and…

200 papers

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

We initiate a study of determinantal representations with symmetry. We show that Grenet's determinantal representation for the permanent is optimal among determinantal representations respecting left multiplication by permutation and…

Algebraic Geometry · Mathematics 2015-08-26 Joseph M. Landsberg , Nicolas Ressayre

One deals with degenerations by coordinate sections of the square generic Hankel matrix over a field $k$ of characteristic zero, along with its main related structures, such as the determinant of the matrix, the ideal generated by its…

Commutative Algebra · Mathematics 2020-05-07 Rainelly Cunha , Maral Mostafazadehfard , Zaqueu Ramos , Aron simis

One studies certain degenerations of the generic square matrix over a field $k$ along with its main related structures, such as the determinant of the matrix, the ideal generated by its partial derivatives, the polar map defined by these…

Commutative Algebra · Mathematics 2017-10-19 Rainelly Cunha , Zaqueu Ramos , Aron Simis

We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…

Computational Complexity · Computer Science 2016-05-10 Peter Bürgisser

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Probability · Mathematics 2022-05-23 Patryk Pagacz , Michał Wojtylak

A linear map between two vector spaces has a very important characteristic: a determinant. In modern theory two generalizations of linear maps are intensively used: to linear complexes (the nilpotent chains of linear maps) and to non-linear…

Mathematical Physics · Physics 2015-05-13 A. Anokhina , A. Morozov , Sh. Shakirov

In this paper we give an explicit formula of the determinant of a Heisenberg representation $\rho$ of a finite group $G$. Heisenberg representations are induced by 1-dimensional characters in multiple ways, but our formula will be…

Group Theory · Mathematics 2017-07-07 Sazzad Ali Biswas

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…

Combinatorics · Mathematics 2007-05-23 Jean-Gabriel Luque

We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).…

Probability · Mathematics 2016-08-16 J. Ben Hough , Manjunath Krishnapur , Yuval Peres , Bálint Virág

We investigate the simplest class of hyperdeterminants defined by Cayley in the case of Hankel hypermatrices (tensors of the form $A_{i_1i_2... i_k}=f(i_1+i_2+...+i_k)$). It is found that many classical properties of Hankel determinants can…

Mathematical Physics · Physics 2009-11-07 J. -G. Luque , J. -Y. Thibon

We prove evaluations of Hankel determinants of linear combinations of moments of orthogonal polynomials (or, equivalently, of generating functions for Motzkin paths), thus generalising known results for Catalan numbers.

Combinatorics · Mathematics 2021-04-13 Johann Cigler , Christian Krattenthaler

Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…

Algebraic Geometry · Mathematics 2015-04-24 Daniel Plaumann , Rainer Sinn , David E. Speyer , Cynthia Vinzant

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

Algebraic Geometry · Mathematics 2026-02-19 A. El Mazouni , D. S. Nagaraj , Supravat Sarkar

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

Combinatorics · Mathematics 2016-11-21 Nima Amini

In this paper, we present k sequences of Generalized Van der Laan Polynomials and Generalized Perrin Polynomials using Genaralized Fibonacci and Lucas Polynomials. We give some properties of these polynomials. We also obtain generalized…

Number Theory · Mathematics 2011-11-18 Kenan Kaygisiz , Adem Sahin

We evaluate the Hankel determinants of various sequences related to Bernoulli and Euler numbers and special values of the corresponding polynomials. Some of these results arise as special cases of Hankel determinants of certain sums and…

Number Theory · Mathematics 2020-07-21 Karl Dilcher , Lin Jiu

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

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