scholarly journals Promotion and Evacuation

10.37236/75 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Richard P. Stanley
Keyword(s):  
Vector Space ◽  
Hecke Algebra ◽  
Linear Extensions ◽  
Linear Transformations ◽  
Basic Properties ◽  
Finite Poset ◽  
Order Ideals ◽  
Maximal Chains

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schützenberger. This paper surveys the basic properties of these two operations and discusses some generalizations. Linear extensions of a finite poset $P$ may be regarded as maximal chains in the lattice $J(P)$ of order ideals of $P$. The generalizations concern permutations of the maximal chains of a wider class of posets, or more generally bijective linear transformations on the vector space with basis consisting of the maximal chains of any poset. When the poset is the lattice of subspaces of ${\Bbb F}_q^n$, then the results can be stated in terms of the expansion of certain Hecke algebra products.

scholarly journals Fixed Points of the Evacuation of Maximal Chains on Fuss Shapes

10.37236/6898 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Hsiang-Chun Hsu ◽  
Yu-Pei Huang
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Hasse Diagram ◽  
Linear Extensions ◽  
Rectangular Shape ◽  
Explicit Characterization ◽  
Finite Poset ◽  
Maximal Chains

For a partition $\lambda$ of an integer, we associate $\lambda$ with a slender poset $P$ the Hasse diagram of which resembles the Ferrers diagram of $\lambda$. Let $X$ be the set of maximal chains of $P$. We consider Stanley's involution $\epsilon:X\rightarrow X$, which is extended from Schützenberger's evacuation on linear extensions of a finite poset. We present an explicit characterization of the fixed points of the map $\epsilon:X\rightarrow X$ when $\lambda$ is a stretched staircase or a rectangular shape. Unexpectedly, the fixed points have a nice structure, i.e., a fixed point can be decomposed in half into two chains such that the first half and the second half are the evacuation of each other. As a consequence, we prove anew Stembridge's $q=-1$ phenomenon for the maximal chains of $P$ under the involution $\epsilon$ for the restricted shapes.

scholarly journals Baer–Levi semigroups of linear transformations

2004 ◽  
Vol 134 (3) ◽  
pp. 477-499 ◽  
Author(s):  
Suzana Mendes-Gonçalves ◽  
R. P. Sullivan
Keyword(s):  
Vector Space ◽  
Dimensional Vector ◽  
Linear Transformations ◽  
Dimensional Vector Space ◽  
Infinite Dimensional ◽  
Basic Properties ◽  
Maximal Subsemigroups ◽  
Linear Version ◽  
Infinite Set

Given an infinite-dimensional vector space V, we consider the semigroup GS (m, n) consisting of all injective linear α: V → V for which codim ran α = n, where dim V = m ≥ n ≥ ℵ0. This is a linear version of the well-known Baer–Levi semigroup BL (p, q) defined on an infinite set X, where |X| = p ≥ q ≥ ℵ0. We show that, although the basic properties of GS (m, n) are the same as those of BL (p, q), the two semigroups are never isomorphic. We also determine all left ideals of GS (m, n) and some of its maximal subsemigroups; in this, we follow previous work on BL (p, q) by Sutov and Sullivan as well as Levi and Wood.

scholarly journals Connected Order Ideals and $P$-Partitions

10.37236/6463 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Ben P. Zhou
Keyword(s):  
Rational Functions ◽  
Independent Sets ◽  
Simple Graph ◽  
Nonempty Intersection ◽  
Alternative Proof ◽  
Linear Extensions ◽  
Connected Component ◽  
Finite Poset ◽  
Set Inclusion ◽  
Order Ideals

Given a finite poset $P$, we associate a simple graph denoted by $G_P$ with all connected order ideals of $P$ as vertices, and two vertices are adjacent if and only if they have nonempty intersection and are incomparable with respect to set inclusion. We establish a bijection between the set of maximum independent sets of $G_P$ and the set of $P$-forests, introduced by Feray and Reiner in their study of the fundamental generating function $F_P(\textbf{x})$ associated with $P$-partitions. Based on this bijection, in the cases when $P$ is naturally labeled we show that $F_P(\textbf{x})$ can factorise, such that each factor is a summation of rational functions determined by maximum independent sets of a connected component of $G_P$. This approach enables us to give an alternative proof for Feray and Reiner's nice formula of $F_P(\textbf{x})$ for the case of $P$ being a naturally labeled forest with duplications. Another consequence of our result is a product formula to compute the number of linear extensions of $P$.

scholarly journals Products of two idempotent transformations over arbitrary sets and vector spaces

1998 ◽  
Vol 57 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Rachel Thomas
Keyword(s):  
Vector Space ◽  
Transformation Semigroup ◽  
Vector Spaces ◽  
Endomorphism Monoid ◽  
Linear Transformations ◽  
Arbitrary Vector ◽  
Full Transformation ◽  
Full Transformation Semigroup

In this paper we consider the characterisation of those elements of a transformation semigroup S which are a product of two proper idempotents. We give a characterisation where S is the endomorphism monoid of a strong independence algebra A, and apply this to the cases where A is an arbitrary set and where A is an arbitrary vector space. The results emphasise the analogy between the idempotent generated subsemigroups of the full transformation semigroup of a set and of the semigroup of linear transformations from a vector space to itself.

scholarly journals Iterative Properties of Birational Rowmotion I: Generalities and Skeletal Posets

10.37236/4334 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Darij Grinberg ◽  
Tom Roby
Keyword(s):  
Finite Order ◽  
Disjoint Union ◽  
Parallel Analysis ◽  
Birational Map ◽  
Finite Poset ◽  
Order Ideals ◽  
Set Up ◽  
Grafting Onto

We study a birational map associated to any finite poset $P$. This map is a far-reaching generalization (found by Einstein and Propp) of classical rowmotion, which is a certain permutation of the set of order ideals of $P$. Classical rowmotion has been studied by various authors (Fon-der-Flaass, Cameron, Brouwer, Schrijver, Striker, Williams and many more) under different guises (Striker-Williams promotion and Panyushev complementation are two examples of maps equivalent to it). In contrast, birational rowmotion is new and has yet to reveal several of its mysteries. In this paper, we set up the tools for analyzing the properties of iterates of this map, and prove that it has finite order for a certain class of posets which we call "skeletal". Roughly speaking, these are graded posets constructed from one-element posets by repeated disjoint union and "grafting onto an antichain"; in particular, any forest having its leaves all on the same rank is such a poset. We also make a parallel analysis of classical rowmotion on this kind of posets, and prove that the order in this case equals the order of birational rowmotion.

Linear Transformations Preserving the Real Orthogonal Group

1975 ◽  
Vol 27 (3) ◽  
pp. 561-572 ◽  
Author(s):  
Albert Wei
Keyword(s):  
Vector Space ◽  
General Problem ◽  
Orthogonal Group ◽  
Linear Transformations ◽  
The Real

Let K be a field and Mn﹛K) denote the vector space of n X n matrices over K. Marcus [4] posed the following general problem: Let W be a subspace of Mn(K) and S a subset of W. Describe the set L(S, W) of all linear transformations T on W such that T(S) is contained in S.

Linear Transformations On Matrices: The Invariance of Generalized Permutation Matrices, I

1976 ◽  
Vol 28 (3) ◽  
pp. 455-472 ◽  
Author(s):  
Hock Ong ◽  
E. P. Botta
Keyword(s):  
Vector Space ◽  
Unitary Group ◽  
Linear Transformations ◽  
Permutation Matrices ◽  
Linear Maps

Let F be a field, Mn(F) be the vector space of all w-square matrices with entries in F and a subset of Mn(F). It is of interest to determine the structure of linear maps T : Mn(F) →Mn(F) such that . For example: Let be GL(n, C), the group of all nonsingular n X n matrices over C [5]; the subset of all rank 1 matrices in MmXn(F) [4] (MmXn(F) is the vector space of all m X n matrices over F) ; the unitary group [2] ; or the set of all matrices X in Mn(F) such that det(X) = 0 [1]. Other results in this direction can be found in [3].

THE REGULAR PART OF A SEMIGROUP OF LINEAR TRANSFORMATIONS WITH RESTRICTED RANGE

2017 ◽  
Vol 103 (3) ◽  
pp. 402-419 ◽  
Author(s):  
WORACHEAD SOMMANEE ◽  
KRITSADA SANGKHANAN
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Dimensional Subspace ◽  
Finite Dimensional Subspace ◽  
Restricted Range ◽  
Linear Transformations ◽  
Dimensional Vector Space ◽  
Finite Dimensional ◽  
Idempotent Rank ◽  
Image Position

Let$V$be a vector space and let$T(V)$denote the semigroup (under composition) of all linear transformations from$V$into$V$. For a fixed subspace$W$of$V$, let$T(V,W)$be the semigroup consisting of all linear transformations from$V$into$W$. In 2008, Sullivan [‘Semigroups of linear transformations with restricted range’,Bull. Aust. Math. Soc.77(3) (2008), 441–453] proved that$$\begin{eqnarray}\displaystyle Q=\{\unicode[STIX]{x1D6FC}\in T(V,W):V\unicode[STIX]{x1D6FC}\subseteq W\unicode[STIX]{x1D6FC}\} & & \displaystyle \nonumber\end{eqnarray}$$is the largest regular subsemigroup of$T(V,W)$and characterized Green’s relations on$T(V,W)$. In this paper, we determine all the maximal regular subsemigroups of$Q$when$W$is a finite-dimensional subspace of$V$over a finite field. Moreover, we compute the rank and idempotent rank of$Q$when$W$is an$n$-dimensional subspace of an$m$-dimensional vector space$V$over a finite field$F$.

scholarly journals A Norm Inequality for Linear Transformations

1961 ◽  
Vol 4 (3) ◽  
pp. 239-242
Author(s):  
B.N. Moyls ◽  
N.A. Khan
Keyword(s):  
Positive Integer ◽  
Vector Space ◽  
Hermitian Operator ◽  
Norm Inequality ◽  
Dimensional Vector ◽  
Linear Transformations ◽  
Dimensional Vector Space ◽  
Image Position ◽  
Ky Fan

In 1949 Ky Fan [1] proved the following result: Let λ1…λn be the eigenvalues of an Hermitian operator H on an n-dimensional vector space Vn. If x1, …, xq is an orthonormal set in V1, and q is a positive integer such n that 1 ≤ q ≤ n, then1

Sign in / Sign up

Export Citation Format

Share Document