Results 81 to 90 of about 619 (166)
Probability Functions on Posets
Mathematics, 2019 In this paper, we define the notion of a probability function on a poset which is similar to the probability function discussed on d-algebras, and obtain three probability functions on posets. Moreover, we define a probability realizer of a poset, and we
Jae Hee Kim +2 more
doaj +1 more source
Annalen der Physik, Volume 537, Issue 12, December 2025.A set of particle representations, familiar from the Standard Model, collectively form a superalgebra. Those representations mirroring the behaviour of the Standard Model's gauge bosons, and three generations of fermions, are each included in this algebra, with exception only to those representations involving the top quark.
N. Furey
wiley +1 more source
A study on strongly convex hyper S-subposets in hyper S-posets
Open Mathematics, 2020 In this paper, we study various strongly convex hyper S-subposets of hyper S-posets in detail. To begin with, we consider the decomposition of hyper S-posets.
Tang Jian, Xie Xiang-Yun, Davvaz Bijan
doaj +1 more source
Combination of open covers with π1$\pi _1$‐constraints
Bulletin of the London Mathematical Society, Volume 57, Issue 12, Page 3886-3901, December 2025.Abstract Let G$G$ be a group and let F$\mathcal {F}$ be a family of subgroups of G$G$. The generalised Lusternik–Schnirelmann category catF(G)$\operatorname{cat}_\mathcal {F}(G)$ is the minimal cardinality of covers of BG$BG$ by open subsets with fundamental group in F$\mathcal {F}$.
Pietro Capovilla, Kevin Li, Clara Löh
wiley +1 more source
, 2006 We define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism, event and order morphisms, resulting in categories FPos and FPosv. We then show the following: - Families of posets, in contrast to families of configurations, are always ...
openaire +3 more sources
On the Intersection Graphs Associeted to Posets
Discussiones Mathematicae - General Algebra and Applications, 2020 Let (P, ≤) be a poset with the least element 0. The intersection graph of ideals of P, denoted by G(P), is a graph whose vertices are all nontrivial ideals of P and two distinct vertices I and J are adjacent if and only if I ∩ J ≠ {0}.
Afkhami M. +2 more
doaj +1 more source
On posets with isomorphic interval posets [PDF]
Czechoslovak Mathematical Journal, 1999 Let \((A,\leq)\) be a partially ordered set (poset). By an interval of \(A\) is meant a nonempty set \(\{x\in A; a\leq x \leq b\}\), for some \(a,b\in A\), \(a\leq b\). Denote by \(\operatorname {Int} A\) the poset of all intervals of \(A\) ordered by set inclusion.
openaire +1 more source
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
Ural Mathematical JournalFor 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
Posets having a selfdual interval poset [PDF]
Czechoslovak Mathematical Journal, 1994 Let \(P\) be a partially ordered set every interval of which contains a finite maximal chain. The author poses the problem when the poset \((\text{Int } P, \subseteq)\) of all intervals in \(P\) is selfdual. Let \(U\), \(V\) be equivalence relations on \(P\) with the properties: (i) if \(a\in P\) then \([a] U=\langle u_ 1, v_ 1\rangle\), \([a] V ...
openaire +2 more sources
A symmetric chain decomposition of L(5,n) [PDF]
Enumerative Combinatorics and Applications, 2023 Xiangdong Wen
doaj +1 more source