Permanental Ideals

نویسندگان

  • Reinhard C. Laubenbacher
  • Irena Swanson
چکیده

We show that the (2 × 2)-subpermanents of a generic matrix generate an ideal whose height, unmixedness, primary decomposition, the number and structure of the minimal components, resolutions, radical, integral closure and Gröbner bases all depend on the characteristic of the underlying subfield: if the characteristic of the subfield is two, this ideal is the determinantal ideal for which all of these properties are already well-known. We show that as long as the characteristic of the subfield is not two, the results are in marked contrast with those for the determinantal ideals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permanental Mates: Perturbations and Hwang's conjecture

Let Ωn denote the set of all n × n doubly stochastic matrices. Two unequal matrices A and B in Ωn are called permanental mates if the permanent function is constant on the line segment t A + (1 − t)B, 0 ≤ t ≤ 1, connecting A and B. We study the perturbation matrix A + E of a symmetric matrix A in Ωn as a permanental mate of A. Also we show an example to disprove Hwang’s conjecture, which states...

متن کامل

A note on the permanental roots of bipartite graphs

It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin. We are interested in finding whether the permanental roots of a bipartite graph G have symmetric property as the spectrum of G. In this note, we show that the permanental roots of bipartite graphs are symmetric with respect to the real and imagin...

متن کامل

Computing the Permanental Polynomial of C 60 in Parallel ∗

The permanental polynomial of buckminsterfullerene C60 is computed in parallel in this paper. The basic idea of the method is simply divide-and-conquer to achieve both computational precision and speed. The load balancing strategies for the permanental polynomial computation are further improved with the help of the theory of parallel machine scheduling in combinatorial optimization. The specia...

متن کامل

Properties and simulation of α-permanental random fields

An α-permanental random field is briefly speaking a model for a collection of random variables with positive associations, where α is a positive number and the probability generating function is given in terms of a covariance or more general function so that density and moment expressions are given by certain α-permanents. Though such models possess many appealing probabilistic properties, many...

متن کامل

Remarks on the Relations Between the Permanental and Characteristic Polynomials of Fullerenes∗

Several relations between the coefficients of the permanental and characteristic polynomials were given by Gutman and Cash [ MATCH Commun. Math. Comput. Chem. 45 (2002) 55-70]. In this paper, some more and general connections between those coefficients are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2000