中文
相关论文

相关论文: A combinatorial determinant

200 篇论文

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

环与代数 · 数学 2011-12-22 Philip D. Powell

Sets of $d\times d$ matrices sharing a common invariant cone enjoy special properties, which are widely used in applications. However, finding this cone or even proving its existence/non-existence is hard. This problem is known to be…

数值分析 · 数学 2025-05-05 Thomas Mejstrik , Vladimiar Yu. Protasov

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…

组合数学 · 数学 2026-05-13 Steven Finch

It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…

环与代数 · 数学 2009-09-09 Ronan Quarez

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…

组合数学 · 数学 2007-05-23 J. Richard Lundgren , Simone Severini , Dustin J. Stewart

Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…

环与代数 · 数学 2026-04-16 Darij Grinberg

We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…

统计理论 · 数学 2010-11-22 Louigi Addario-Berry , Nicolas Broutin , Luc Devroye , Gábor Lugosi

Due to their rich algebraic structures and various applications, circulant matrices have been of interest and continuously studied. In this paper, the notions of Binomial-related matrices have been introduced. Such matrices are circulant…

环与代数 · 数学 2018-04-05 Trairat Jantaramas , Somphong Jitman , Pornpan Kaewsaard

One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…

代数几何 · 数学 2012-04-09 Aron Simis , Rafael H. Villarreal

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

数据结构与算法 · 计算机科学 2019-08-01 Richard Kueng , Joel A. Tropp

Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…

环与代数 · 数学 2021-12-08 Olaf Dreyer

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =\Delta \neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm…

数论 · 数学 2021-03-04 Edita Pelantová , Tomáš Vávra

We study the Poincar\'e series of the mixed and pure trace rings of generic matrices. These series are known to be rational functions. We obtain an explicit formula in lowest terms in the case of $2\times2$ matrices; a denominator, which we…

环与代数 · 数学 2022-09-07 Allan Berele

One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…

离散数学 · 计算机科学 2019-02-19 Valentin Bakoev

Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…

组合数学 · 数学 2009-08-04 S. M. Sadegh Tabatabaei Yazdi , Serap A. Savari

Let $A$ and $ B$ be $n\times n$ positive definite complex matrices, let $\sigma$ be a matrix mean, and let $f : [0,\infty)\to [0,\infty)$ be a differentiable convex function with $f(0)=0$. We prove that $$f^{\prime}(0)(A \sigma B)\leq…

泛函分析 · 数学 2024-04-19 Manisha Devi , Jaspal Singh Aujla , Mohsen Kian , Mohammad Sal Moslehian

We derive some formulas that rule the behaviour of finite differences under composition of functions with vector values and arguments.

历史与综述 · 数学 2008-11-27 P. Duarte , M. J. Torres

As well known, permanent of a square (0,1)-matrix $A$ of order $n$ enumerates the permutations $\beta$ of $1,2,...,n$ with the incidence matrices $B\leq A.$ To obtain enumerative information on even and odd permutations with condition…

组合数学 · 数学 2014-06-05 Vladimir Shevelev

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

组合数学 · 数学 2010-05-03 Richard P. Brent , Brendan D. McKay

We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…

组合数学 · 数学 2011-04-20 Christian Krattenthaler , Johann Cigler