scholarly journals Posets of Finite Functions

10.37236/5272 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Konrad Pióro

The symmetric group $ S(n) $ is partially ordered by Bruhat order. This order is extended by L. Renner to the set of partial injective functions of $ \{ 1, 2, \ldots, n \} $ (see, Linear Algebraic Monoids, Springer, 2005). This poset is investigated by M. Fortin in his paper The MacNeille Completion of the Poset of Partial Injective Functions [Electron. J. Combin., 15, R62, 2008]. In this paper we show that Renner order can be also defined for sets of all functions, partial functions, injective and partial injective functions from $ \{ 1, 2, \ldots, n \} $ to $ \{ 1, 2, \ldots, m \} $. Next, we generalize Fortin's results on these posets, and also, using simple facts and methods of linear algebra, we give simpler and shorter proofs of some fundamental Fortin's results. We first show that these four posets can be order embedded in the set of $ n \times m $-matrices with non-negative integer entries and with the natural componentwise order. Second, matrix representations of the Dedekind-MacNeille completions of our posets are given. Third, we find join- and meet-irreducible elements for every finite sublattice of the lattice of all $ n \times m $-matrices with integer entries. In particular, we obtain join- and meet-irreducible elements of these Dedekind-MacNeille completions. Hence and by general results concerning Dedekind-MacNeille completions, join- and meet-irreducible elements of our four posets of functions are also found. Moreover, subposets induced by these irreducible elements are precisely described.

10.37236/786 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Marc Fortin

Renner has defined an order on the set of partial injective functions from $[n]=\{1,\ldots,n\}$ to $[n]$. This order extends the Bruhat order on the symmetric group. The poset $P_{n}$ obtained is isomorphic to a set of square matrices of size $n$ with its natural order. We give the smallest lattice that contains $P_{n}$. This lattice is in bijection with the set of alternating matrices. These matrices generalize the classical alternating sign matrices. The set of join-irreducible elements of $P_{n}$ are increasing functions for which the domain and the image are intervals.


2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Collins Amburo Agyingi ◽  
Paulus Haihambo ◽  
Hans-Peter A. Künzi

We continue our work on endpoints and startpoints inT0-quasimetric spaces. In particular we specialize some of our earlier results to the case of two-valuedT0-quasimetrics, that is, essentially, to partial orders. For instance, we observe that in a complete lattice the startpoints (resp., endpoints) in our sense are exactly the completely join-irreducible (resp., completely meet-irreducible) elements. We also discuss for a partially ordered set the connection between its Dedekind-MacNeille completion and theq-hyperconvex hull of its naturalT0-quasimetric space.


1971 ◽  
Vol 23 (5) ◽  
pp. 866-874 ◽  
Author(s):  
Raymond Balbes

For a distributive lattice L, let denote the poset of all prime ideals of L together with ∅ and L. This paper is concerned with the following type of problem. Given a class of distributive lattices, characterize all posets P for which for some . Such a poset P will be called representable over. For example, if is the class of all relatively complemented distributive lattices, then P is representable over if and only if P is a totally unordered poset with 0, 1 adjoined. One of our main results is a complete characterization of those posets P which are representable over the class of distributive lattices which are generated by their meet irreducible elements. The problem of determining which posets P are representable over the class of all distributive lattices appears to be very difficult.


2015 ◽  
Vol Vol. 17 no. 1 (Combinatorics) ◽  
Author(s):  
Bridget Eileen Tenner

Combinatorics International audience In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related by a certain property of their reduced words. We show that the property does not hold when w is a decomposable permutation, and that the property always holds when w is the longest permutation.


1962 ◽  
Vol 14 ◽  
pp. 476-481 ◽  
Author(s):  
Bjarni Jónsson

In § 1 we give a characterization of a lattice L that is freely α-generated by a given partially ordered set P. In § 2 we obtain a representation of an element of such a lattice as a sum (product) of additively (multiplicatively) irreducible elements which, although not unique, has some of the desirable features of the canonical representation, in Whitman (2), of an element of a free lattice. The usefulness of this representation is illustrated in § 3, where some further arithmetic properties of these lattices are derived.We use + and . for the binary operations of lattice addition and multiplication, and Σ and II for the corresponding operations on arbitrary sets and sequences of lattice elements. In other respects the terminology will be the same as in Crawley and Dean (1).


Author(s):  
W. D. Munn

There are two natural analogues of the symmetric group on n symbols in the theory of semigroups, namely, the set of all mappings of a set of n symbols into itself, and the set of all partial transformations of such a set, with the obvious definitions of multiplication. We are concerned here with the latter system. This is an inverse semigroup, and accordingly we call it the ‘symmetric inverse semigroup’. It gives rise to a semisimple algebra over a field of characteristic zero or a prime greater than n, and its matrix representations over such a field are thus completely reducible.


Sign in / Sign up

Export Citation Format

Share Document