Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 170 for “"poset"”.
-
Combinatorics of poset polytopes
… between a finite partially ordered set (a poset for short) and polytopes constructed from it: order polytopes and chain polytopes. We study correspondences between parts of the poset and faces of the polytopes. We compare these two polytopes to each other and prove inequalities between …
-
Shelling The Coset Poset
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. It is also shown that the order complex is Cohen-Macaulay under the same circumstances. The group theoretical tools used are relatively elementary, and avoid the classification …
-
Códigos NMDS sob a métrica poset
… por uma Ordem parciaL deñnimos os espaços poset e estu- damos os Códigos lineares NMDS em tais espaços, Obtendo Caracterizações para estes. Com 0 auxílio de tais Caracterizações, apresentamos duas aplicações Com respeito à distribuiçõesz a distribuição de pesos de um Código e, no Caso …
-
Código MDS com a métrica POSET
… generalização da métrica de Hamming é a métrica poset. Faremos um estudo detalhado dos espaços poset, hierarquia de I-pesos e a I-distribuição de pesos, dando ênfase aos códigos poset não degenerados. Verificamos a relação de dualidade poset entre as hierarquias de um código e seu dual. Definimos …
-
Poset Ramsey Numbers for Boolean Lattices
… denote the Boolean lattice of dimension n. For posets P, P', define the poset Ramsey number R(P,P') to be the least N such that for any red/blue coloring of the elements of QN, there exists either a subposet isomorphic to P with all elements red, or a subposet isomorphic to P' with all elements …
-
Zero Divisor Graphs and Poset Decomposition
… some known results on zero-divisor graphs of posets as well as the concept of compactness as it relates to zero-divisor graphs. We will dicuss equivalence class graphs defined on the elements of various algebraic structures and also the reduced graph defined on the vertices of a compact graph. …
-
Computing Winning Strategies for Poset Games
… we are concerned with Partially-Ordered Set (Poset) games. We present two new methods for proving that computing winning strategies for the game of Chomp is in PSPACE. \Ne also present the idea of "Game Completeness", and give an overview of efforts to translate any poset game into an …
-
Problems in extremal graphs and poset theory
… topics. We introduce partially ordered sets (posets) and study two types of problems concerning them-- forbidden subposet problems and induced-poset-saturation problems. We conclude by presenting results obtained from studying vertex-identifying codes in graphs.</p> <p>In studying forbidden …
-
Poset and polytope perspectives on alternating sign matrices.
… larger context by studying a certain tetrahedral poset and its subposets. We prove the order ideals of these subposets are in bijection with a variety of interesting combinatorial objects, including ASMs, totally symmetric self--complementary plane partitions (TSSCPPs), Catalan objects, …
-
Random and deterministic versions of extremal poset problems
… Boolean lattice is a partially ordered set, or poset, consisting of the elements of P(n), partially ordered by set inclusion. A basic question in extremal poset theory asks the following: Given a poset P, how big is the largest family of sets in the Boolean lattice which does not contain the …
-
On the Mo?bius function and topology of the permutation poset
… ordered by pattern containment, is a poset. In this thesis we study the behaviour of the Mo?bius function and topology of the permutation poset. The first major result in this thesis is on the Mo?bius function of intervals [1,?], such that ? = ????. . . ?n has exactly one descent, …
-
Shortest Path Poset Of Bruhat Intervals And The Complete Cd-Index
… paths. Here we define the shortest path poset of [u, v ], denoted by SP (u, v ), which arises from the shortest u-v paths of B (u, v ). If W is finite, then SP (e, w0 ) is the union of Boolean posets, where w0 is the longest-length word of W . Furthermore, if SP (u, v ) has a unique …
-
Poset Convex-Ear Decompositions and Applications to the Flag h-Vector
… for the order complexes of rank-selected subposets of supersolvable lattices with nowhere-zero M\"obius functions, rank-selected subposets of geometric lattices, and rank-selected face posets of shellable complexes (when the rank-selection does not include the maximal rank). Using these …
-
Efficient generation of the ideals of a poset in Gray code order
… de leur code Gray pour les idéaux d'un poset (ensemble partiellement ordonné) où deux idéaux adjacents diffèrent par un ou deux éléments. Leur algorithme fonctionne en temps amorti de O(n) par idéal. Squire a présenté une récurrence pour les idéaux d'un poset qui lui a permis de trouver …
-
Topics in combinatorics and combinatorial algorithms
… structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The interval number is related to a well-studied poset parameter, partial order dimension. We derive an upper bound on the interval number of a …
-
Structural aspects of differential posets
… some structural properties of differential posets and answers some open questions. There are three main results. First, a proof is given that the largest rank size of the nth rank of an r-differential poset is given by the nth rank of the Fibonacci r-differential poset. This solves a …
-
Facial weak order, Coxeter groups and oriented matroids
On étudie l'ordre faible facial, un poset introduit par Krob, Latapy, Novelli, Phan et Schwer à FPSAC 2001 sur les groupes symétriques. L'ordre faible facial est une extension de l'ordre faible d'un groupe de Coxeter fini W à l'ensemble des faces du permutoèdre de W. On commence par donner les …
-
Digraphs modulo primitive positive constructability
… positive formulas. In this way, we define the poset of all finite digraphs ordered by primitive positive constructability. This poset, which is the object studied in this dissertation, is important for studying the complexity of constraint satisfaction problems and for studying clones ordered …
-
Topology posets and an unramified symmetric model for set theory
<p>A poset (P,≤) with maximum 1 is called compact (C) iff sup W exists and is not 1 for any nonempty well ordered subset W of (P - 1). P is classically compact (CC) iff whenever sup S = 1 for some S ⊆ P, then sup F = 1 for some finite F ⊆ S. The product ∏[superscript] P[subscript] i (ordered …
Page 1 of 9