Related papers: On The Weak Order Of Orthogonal Groups
We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…
For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…
In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…
We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…
In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…
Laplante-Anfossi associated to each rooted plane tree a polytope called an operahedron. He also defined a partial order on the vertex set of an operahedron and asked if the resulting poset is a lattice. We answer this question in the…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…
We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…
In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main…
We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
The purpose of the present paper is to give a realization of a cylindric diagram as a subset of root systems of type $A_{\kappa-1}^{(1)}$ and several characterization of its poset structure. Furthermore, the set of order ideals of a…
We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…
We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…
The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…
The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…