Results 101 to 110 of about 4,538 (218)
The Möbius function of the permutation pattern Poset
, 2010 A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma.
Steingrimsson, Einar
core
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
, 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
Journal of Applied Logic, 2016 A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals $α$ and $β$ a poset is said to be $(α,β)$-representable if an embedding into a field of sets exists that preserves ...
openaire +2 more sources
The ∞$\infty$‐categorical reflection theorem and applications
Journal of Topology, Volume 19, Issue 1, March 2026.Abstract We prove an ∞$\infty$‐categorical version of the reflection theorem of AdÁmek and Rosický [Arch. Math. 25 (1989), no. 1, 89–94]. Namely, that a full subcategory of a presentable ∞$\infty$‐category that is closed under limits and κ$\kappa$‐filtered colimits is a presentable ∞$\infty$‐category.
Shaul Ragimov, Tomer M. Schlank
wiley +1 more source
Discrete Mathematics, 1988 Let \((X,\leq)\) be an ordered set. A pair \((a,b)\) of elements of \(X\) is a covering pair if \(b\) covers \(a\). The set \(C(X)\) of all covering pairs of \(X\) can be naturally ordered by \((a,b)\leq (c,d)\) iff \((a,b)=(c,d)\) or \(b\leq c\). The poset \((C(X),\leq)\) is called the covering poset of \((X,\leq)\).
openaire +2 more sources
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, February 5, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
Group of Isometries of Niederreiter-Rosenbloom-Tsfasman Block Space
Trends in Computational and Applied Mathematics, 2020 Let P = ({1, 2, ..., n}, ≤) be a poset that is an union of disjoint chains of the same length and V = F^N_q be the space of N-tuples over the finite field Fq.
L. Panek, N. M. P. Panek
doaj +1 more source
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
Journal of Combinatorial Theory, Series A, 1985 If P is a finite poset with maximal elements \(X_ N\), then for certain posets it is possible to decompose \(L^ 2(X_ N)=\oplus^{N}_{n=0}Harm(n)| X_ N\), where \(L^ 2(X_ N)\) is the set of complex valued functions defined on \(X_ N\) acted on by the automorphism group G of P via the permutation representation induced from the stabilizer H of a fixed ...
openaire +2 more sources