English
Related papers

Related papers: Determinants of Block Matrices with Noncommuting B…

200 papers

A new matrix operation based on inserting columns and rows, similarly to the mediant operation between fractions, gives rise to the Farey determinants matrix or, equivalently, the matrix of the numerators of the differences of Farey…

Number Theory · Mathematics 2018-09-25 Rogelio Tomas

Consider rectangular matrices over a local ring R. In the previous work we have obtained criteria for block-diagonalization of such matrices, i.e. U A V=A_1\oplus A_2, where U,V are invertible matrices over R. In this short note we extend…

Representation Theory · Mathematics 2014-11-25 Dmitry Kerner

The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…

Condensed Matter · Physics 2009-10-22 T. Temesvari , C De Dominicis , I. Kondor

Block coordinate methods have been extensively studied for minimization problems, where they come with significant complexity improvements whenever the considered problems are compatible with block decomposition and, moreover, block…

Optimization and Control · Mathematics 2025-01-31 Jelena Diakonikolas

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

Probability · Mathematics 2021-02-25 Johannes Alt , Torben Krüger

We consider the noncolliding Brownian motion (BM) with $N$ particles starting from the eigenvalue distribution of Gaussian unitary ensemble (GUE) of $N \times N$ Hermitian random matrices with variance $\sigma^2$. We prove that this process…

Probability · Mathematics 2015-12-18 Makoto Katori

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

We present a novel class of real symmetric matrices in arbitrary dimension $d$, linearly dependent on a parameter $x$. The matrix elements satisfy a set of nontrivial constraints that arise from asking for commutation of pairs of such…

Strongly Correlated Electrons · Physics 2009-11-11 B Sriram Shastry

We consider pairs of anti-commuting $2p$-by-$2p$ Hermitian matrices that are chosen randomly with respect to a Gaussian measure. Generically such a pair decomposes into the direct sum of $2$-by-$2$ blocks on which the first matrix has…

Probability · Mathematics 2023-12-25 John E. McCarthy , Hazel T. McCarthy

Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of…

Social and Information Networks · Computer Science 2019-04-10 Caterina Fenu , Desmond J. Higham

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

Functional Analysis · Mathematics 2025-06-06 Michael T. Jury , George Roman

We give a simple proof of a major index determinant formula in the symmetric group discovered by Krattenthaler and first proved by Thibon using noncommutative symmetric functions. We do so by proving a factorization of an element in the…

Combinatorics · Mathematics 2021-02-26 Thomas McConville , Donald Robertson , Clifford Smyth

In this document we study the uniform local path connectivity of sets of $m$-tuples of pairwise commuting normal matrices with some additional constraints. More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in…

Numerical Analysis · Mathematics 2019-12-19 Fredy Vides

Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…

Rings and Algebras · Mathematics 2023-05-02 Tomáš Kepka , Miroslav Korbelář

By definition, admissible matrix groups are those that give rise to a wavelet-type inversion formula. This paper investigates necessary and sufficient admissibility conditions for abelian matrix groups. We start out by deriving a block…

Functional Analysis · Mathematics 2011-04-12 Joaquim Bruna , Julià Cufí , Hartmut Führ , Margarida Miró

We compute $M$-point conformal blocks with scalar external and exchange operators in the so-called comb configuration for any $M$ in any dimension $d$. Our computation involves repeated use of the operator product expansion to increase the…

High Energy Physics - Theory · Physics 2020-09-22 Jean-François Fortin , Wenjie Ma , Witold Skiba

This paper introduces and studies a new class of rings called {\it $U\sqrt{\Delta}$-rings}. A ring $R$ is $U\sqrt{\Delta}$ if every non-unit element can be written as the product of a unit and an element from $\sqrt{\Delta(R)}$, where…

Rings and Algebras · Mathematics 2026-02-17 Omid Hasanzadeh , Ahmad Moussavi , Peter Danchev

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…

Combinatorics · Mathematics 2007-05-23 Josep M. Brunat , Antonio Montes

In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…

General Mathematics · Mathematics 2023-06-02 Benjamin T. Hendel , Rafael Ruggiero

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion,…

Information Theory · Computer Science 2010-08-10 Frederique Oggier , Patrick Sole , Jean-Claude Belfiore