English
Related papers

Related papers: On commuting integer matrices

200 papers

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

Combinatorics · Mathematics 2012-01-17 Greta Panova

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Data Structures and Algorithms · Computer Science 2024-02-20 Naoto Ohsaka

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

Data Structures and Algorithms · Computer Science 2024-01-03 Pascal Koiran

In this article we further the study of noncommutative numerical motives. By exploring the change-of-coefficients mechanism, we start by improving some of our previous main results. Then, making use of the notion of Schur-finiteness, we…

K-Theory and Homology · Mathematics 2011-10-12 Matilde Marcolli , Goncalo Tabuada

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

Let $G$ be a connected compact group equipped with the normalised Haar measure $\mu$. Our first result shows that given $\alpha, \beta>0$, there is a constant $c = c(\alpha,\beta)>0$ such that for any compact sets $A,B\subseteq G$ with $…

Combinatorics · Mathematics 2023-07-12 Yifan Jing , Akshat Mudgal

Let G be a graph with set of vertices 1,...,n and adjacency matrix A of size nxn. Let d(i,j)=d, we say that f_d:N->N is a d-function on G if for every pair of vertices i,j and k>=d, we have a_ij^(k)=f_d(k). If this function f_d exists on G…

Combinatorics · Mathematics 2013-04-02 Ernesto Estrada , Jose A. de la Pena

Higher-rank versions of Wold decomposition are shown to hold for doubly commuting isometric representations of product systems of C*-correspondences over N^k, generalising the classical result for a doubly commuting pair of isometries due…

Operator Algebras · Mathematics 2007-05-23 Adam Skalski , Joachim Zacharias

We present an explicit structure for the Baer invariant of a finitely generated abelian group with respect to the variety $[\mathfrak{N}_{c_1},\mathfrak{N}_{c_2}]$, for all $c_2\leq c_1\leq 2c_2$. As a consequence we determine necessary and…

Group Theory · Mathematics 2015-11-26 Mohsen Parvizi , Behrooz Mashayekhy

A binary matrix is a matrix with entries from the set $\{0,1\}$. We say that a binary matrix $A$ contains a binary matrix $S$ if $S$ can be obtained from $A$ by removal of some rows, some columns, and changing some $1$-entries to…

Combinatorics · Mathematics 2019-10-15 Josef Cibulka , Jan Kynčl

A permutation $\pi$ is ballot if, for all $k$, the word $\pi_1\cdots \pi_k$ has at least as many ascents as it has descents. Let $b(n)$ denote the number of ballot permutations of order $n$, and let $p(n)$ denote the number of permutations…

Combinatorics · Mathematics 2019-03-15 Sam Spiro

We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map $s$. As a first application, we give a new proof of Zeilberger's formula for the number of 2-stack-sortable…

Combinatorics · Mathematics 2020-01-09 Colin Defant

The orbits of Weyl groups W(B(n)), W(C(n)) and W(D(n)) of the simple Lie algebras B(n), C(n) and D(n) are reduced to the union of the orbits of Weyl groups of the maximal reductive subalgebras of B(n), C(n) and D(n). Matrices transforming…

Mathematical Physics · Physics 2015-05-27 M. Larouche , J. Patera

In this paper we study various simplicial complexes associated to the commutative structure of a finite group G. We define NC(G) (resp. C(G)) as the complex associated to the poset of pairwise non-commuting (resp. commuting) sets in G. We…

Algebraic Topology · Mathematics 2013-05-06 Jonathan Pakianathan , Ergün Yalçin

Let $\mathfrak{S}(\underline{s},w)$ be the graph whose vertices are all subexpressions with target $w$ of a fixed expression $\underline{s}$ in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2.…

Representation Theory · Mathematics 2025-09-18 Vladimir Shchigolev

We prove that, over a field $\mathbb{F}$ of odd characteristic $p$, a companion matrix $C$ is the sum of $E$ and $N$, with $E$ $p$-potent (i.e. $E^p = E$,) and $N$ nilpotent, if and only if the trace of $C$ is an integer multiple of unity…

Rings and Algebras · Mathematics 2025-08-14 Andrada Pojar

It is well known that central extensions of a group G correspond to 2-cocycles on G. Cocycles can be used to construct extensions of G-graded algebras via a version of the Drinfeld twist introduced by Majid. We show how 2-cocycles can be…

Quantum Algebra · Mathematics 2013-02-12 Yuri Bazlov , Arkady Berenstein

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

An $N\times n$ matrix on $q$ symbols is called $\{w_1,\ldots,w_t\}$-separating if for arbitrary $t$ pairwise disjoint column sets $C_1,\ldots,C_t$ with $|C_i|=w_i$ for $1\le i\le t$, there exists a row $f$ such that $f(C_1),\ldots,f(C_t)$…

Combinatorics · Mathematics 2018-08-21 Gennian Ge , Chong Shangguan , Xin Wang
‹ Prev 1 4 5 6 7 8 10 Next ›