Results 111 to 120 of about 4,538 (218)

Connectivity of the coset poset and the subgroup poset of a group [PDF]

Journal of Group Theory, 2005
28 ...
openaire   +3 more sources

Going down in (semi)lattices of finite Moore families and convex geometries [PDF]

In this paper we first study the changes occuring in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the ...
Gabriela Bordalo, Nathalie Caspard, Bernard Monjardet   +2 more
core  

Error-block codes and poset metrics [PDF]

, 2015
Let P = ({1, 2,..., n},
Firer, Marcelo, Alves, Marcelo Muniz S., Panek, Luciano   +2 more
core   +1 more source

Bilinear forms into poset representation

, 2023
Um dos maiores propósitos da teoria de representações de álgebras é descrever (da melhor forma possível) todas as representações indecomponíveis (a menos de isomorfismos) de uma dada álgebra.
Fonseca, Claudia Cavalcante
core   +1 more source

On poset similarity

Discrete Mathematics, 2000
As there is a theory of random graphs, there is a theory of random posets based on a variety of models trickier to produce because of transitivity. One of these is the Brightwell-model \(O(W_1, \dots, W_n)=O (S_1, \dots,S_n)\), \(|W_i|=S_i\), where \(\{W_1,\dots,W_n\}\) partitions the set \(W\) on which the random posets \(P\) are defined.
openaire   +1 more source

The Combinatorics of Poset Associahedra [PDF]

In this dissertation, we study poset associahedra and the combinatorics surrounding them. We provide a simple realization of poset associahedra and affine poset cyclohedra.
Sack, Andrew Ian
core  

The Poset Cover Problem

, 2012
A partial order or poset P = (X,
Heath, Lenwood S., Nema, Ajit Kumar
core   +1 more source

SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

Ural Mathematical Journal
For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of  \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj   +1 more source

On multipartite posets

Discrete Mathematics, 2008
6 ...
openaire   +2 more sources

Geometric Applications of Posets

Computational Geometry, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Segal 0001, Klara Kedem
openaire   +2 more sources