Determinant Expansions of Signed Matrices and of Certain Jacobians
نویسندگان
چکیده
This paper treats two topics: matrices with sign patterns and Jacobians of certain mappings. The main topic is counting the number of plus and minus coefficients in the determinant expansion of sign patterns and of these Jacobians. The paper is motivated by an approach to chemical networks initiated by Craciun and Feinberg. We also give a graph-theoretic test for determining when the Jacobian of a chemical reaction dynamics has a sign pattern.
منابع مشابه
More about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کامل5 M ay 2 00 5 Jacobians and rank 1 perturbations relating to unitary Hessenberg matrices
In a recent work Killip and Nenciu gave random recurrences for the characteristic polynomials of certain unitary and real orthogonal upper Hessenberg matrices. The corresponding eigenvalue p.d.f.’s are β-generalizations of the classical groups. Left open was the direct calculation of certain Jacobians. We provide the sought direct calculation. Furthermore, we show how a multiplicative rank 1 pe...
متن کاملP Matrix Properties, Injectivity, and Stability in Chemical Reaction Systems
In this paper we examine matrices which arise naturally as Jacobians in chemical dynamics. We are particularly interested in when these Jacobians are P matrices (up to a sign change), ensuring certain bounds on their eigenvalues, precluding certain behaviour such as multiple equilibria, and sometimes implying stability. We first explore reaction systems and derive results which provide a deep c...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملRandom matrix theory in wireless communications
Introduction. A random matrix in a linear system model [1]. Basic examples (involving a single random matrix): CDMA [2], Single-User MIMO [3], compressive sensing [4, 5]. More involved examples (involving sum and products of random matrices): multi-cell communication [6], correlated systems [7], Multiple Access Channels, relay channels [8]. Short discussion on modeling of wireless networks with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2009