English
Related papers

Related papers: Decomposition results for Gram matrix determinants

200 papers

We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic…

Rings and Algebras · Mathematics 2007-05-23 Mark Kambites , Benjamin Steinberg

Let $R=K[[x_1,...,x_s]]$ be the ring of formal power series with maximal ideal $\mathfrak{m}$ over a field $K$ of arbitrary characteristic. On the ring $M_{m,n}$ of $m\times n$ matrices $A$ with entries in $R$ we consider several…

Algebraic Geometry · Mathematics 2016-09-19 Gert-Martin Greuel , Thuy Huong Pham

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Combinatorics · Mathematics 2010-01-18 Christian Krattenthaler , Thomas Müller

The approximation of matrices to the sum of tensor products of Hermitian matrices is studied. A minimum decomposition of matrices on tensor space $H_1\otimes H_2$ in terms of the sum of tensor products of Hermitian matrices on $H_1$ and…

Quantum Physics · Physics 2009-11-13 Shao-Ming Fei , Naihuan Jing , Bao-Zhi Sun

We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…

Commutative Algebra · Mathematics 2025-12-09 Yulia Alexandr , Kristen Dawson , Hannah Friedman , Fatemeh Mohammadi , Pardis Semnani , Teresa Yu

Let $\Gamma=(V,E)$ be a finite simple graph. A matching $M \subseteq E$ is positive if there exists a weight function on $V$ such that the matching $M$ is characterized by those edges with positive weights. A positive matching decomposition…

Combinatorics · Mathematics 2025-02-06 Mohammad Farrokhi Derakhshandeh Ghouchan , Ali Akbar Yazdan Pour

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

Group Theory · Mathematics 2024-10-23 Julian Wykowski

We derive an identity for the determinant of the sum of two $n\times n$ matrices, $A$ and $B$, whose entries are defined via contour integrals. Specifically, we consider $A(i,j)=\frac{1}{2\pi\mathrm{i}}\oint_0…

Classical Analysis and ODEs · Mathematics 2026-04-28 Zhipeng Liu , Tejaswi Tripathi

Given an Hadamard matrix $H\in M_N(\pm1)$ we consider the function $\varphi:\mathbb Z_2^N\times\mathbb Z_2^N\to\mathbb Z$ given by $\varphi(a,b)=\sum_{ij}a_ib_jH_{ij}$, which sums the entries of the various conjugates of $H$, obtained by…

Combinatorics · Mathematics 2014-12-03 Teodor Banica

Let $n$ be a prime or its square. We prove that the congruence subgroup $\Gamma_0(n)$ admits a free product decomposition into cyclic factors in such a way that the $(2,1)$-component of each cyclic generator is either $n$ or $0$, answering…

Number Theory · Mathematics 2023-02-10 Nhat Minh Doan , Sang-hyun Kim , Mong Lung Lang , Ser Peow Tan

Some sum of squares (SOS) polynomials admit decomposition certificates, or positive semidefinite Gram matrices, with additional structure. In this work, we use the structure of Gram matrices to relate the representation theory of $SL(2)$ to…

Optimization and Control · Mathematics 2024-07-30 Mitchell Tong Harris

Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…

Computational Complexity · Computer Science 2018-10-12 Ranveer Singh , Vivek Vijay , RB Bapat

We consider a $Q$-polynomial distance-regular graph $\Gamma$ with vertex set $X$ and diameter $D \geq 3$. For $\mu, \nu \in \lbrace \downarrow, \uparrow \rbrace$ we define a direct sum decomposition of the standard module $V=\C X$, called…

Combinatorics · Mathematics 2007-10-25 Joohyung Kim

It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert…

Combinatorics · Mathematics 2007-08-14 Robert Shwartz , Ron M. Adin , Yuval Roichman

In a recent paper we have presented a method to evaluate certain Hankel determinants as almost products; i.e. as a sum of a small number of products. The technique to find the explicit form of the almost product relies on…

Combinatorics · Mathematics 2009-04-22 Omer Egecioglu , Timothy Redmond , Charles Ryavec

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that…

Combinatorics · Mathematics 2011-09-13 Peter Allen , Julia Böttcher , Yury Person

Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…

Group Theory · Mathematics 2026-03-13 Elia Fioravanti

Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…

Mathematical Physics · Physics 2007-05-23 Jean-Marie Normand

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

Combinatorics · Mathematics 2019-10-31 Augusto Ferrante , Fabrizio Padula , Lorenzo Ntogramatzidis