scholarly journals Composition Matrices, (2+2)-Free Posets and their Specializations

10.37236/531 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Mark Dukes ◽  
Vít Jelínek ◽  
Martina Kubitzke

In this paper we present a bijection between composition matrices and ($\mathbf{2+2}$)-free posets. This bijection maps partition matrices to factorial posets, and induces a bijection from upper triangular matrices with non-negative entries having no rows or columns of zeros to unlabeled ($\mathbf{2+2}$)-free posets. Chains in a ($\mathbf{2+2}$)-free poset are shown to correspond to entries in the associated composition matrix whose hooks satisfy a simple condition. It is shown that the action of taking the dual of a poset corresponds to reflecting the associated composition matrix in its anti-diagonal. We further characterize posets which are both ($\mathbf{2+2}$)- and ($\mathbf{3+1}$)-free by certain properties of their associated composition matrices.

10.37236/325 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Mark Dukes ◽  
Robert Parviainen

This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics on these structures under this bijection and prove that some of these statistics are equidistributed. Several special classes of matrices are shown to have simple formulations in terms of ascent sequences. Binary matrices are shown to correspond to ascent sequences with no two adjacent entries the same. Bidiagonal matrices are shown to be related to order-consecutive set partitions and a simple condition on the ascent sequences generate this class.


2006 ◽  
Vol 183 (2) ◽  
pp. 729-737 ◽  
Author(s):  
Rafael Álvarez ◽  
Francisco Ferrández ◽  
José-Francisco Vicent ◽  
Antonio Zamora

2019 ◽  
Vol 26 (1/2) ◽  
pp. 197-201
Author(s):  
Driss Aiat Hadj Ahmed

Let ℱ be a field of zero characteristic, let Nn(ℱ) denote the algebra of n×n strictly upper triangular matrices with entries in ℱ, and let f:Nn(ℱ)→Nn(ℱ) be a nonlinear Jordan centralizer of Nn(ℱ),that is, a map satisfying that f(XY+YX)=Xf(Y)+f(Y)X, for all X, Y∈Nn(ℱ). We prove that f(X)=λX+η(X) where λ∈ℱ and η is a map from Nn(ℱ) into its center 𝒵(Nn(ℱ)) satisfying that η(XY+YX)=0 for every X,Yin Nn(F).


Author(s):  
Xinlei Wang ◽  
Dein Wong ◽  
Fenglei Tian

Let [Formula: see text] be a finite field with [Formula: see text] elements, [Formula: see text] a positive integer, [Formula: see text] the semigroup of all [Formula: see text] upper triangular matrices over [Formula: see text] under matrix multiplication, [Formula: see text] the group of all invertible matrices in [Formula: see text], [Formula: see text] the quotient group of [Formula: see text] by its center. The one-divisor graph of [Formula: see text], written as [Formula: see text], is defined to be a directed graph with [Formula: see text] as vertex set, and there is a directed edge from [Formula: see text] to [Formula: see text] if and only if [Formula: see text], i.e. [Formula: see text] and [Formula: see text] are, respectively, a left divisor and a right divisor of a rank one matrix in [Formula: see text]. The definition of [Formula: see text] is motivated by the definition of zero-divisor graph [Formula: see text] of [Formula: see text], which has vertex set of all nonzero zero-divisors in [Formula: see text] and there is a directed edge from a vertex [Formula: see text] to a vertex [Formula: see text] if and only if [Formula: see text], i.e. [Formula: see text]. The automorphism group of zero-divisor graph [Formula: see text] of [Formula: see text] was recently determined by Wang [A note on automorphisms of the zero-divisor graph of upper triangular matrices, Lin. Alg. Appl. 465 (2015) 214–220.]. In this paper, we characterize the automorphism group of one-divisor graph [Formula: see text] of [Formula: see text], proving that [Formula: see text], where [Formula: see text] is the automorphism group of field [Formula: see text], [Formula: see text] is a direct product of some symmetric groups. Besides, an application of automorphisms of [Formula: see text] is given in this paper.


Sign in / Sign up

Export Citation Format

Share Document