Results 81 to 90 of about 462 (185)
On Multilevel Energy‐Based Fragmentation Methods
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
On homological classification of pomonoids by GP-po-flatness of S-posets
In this paper, we introduce GP-po-flatness property of S-posets over a pomonoid S, which lies strictly between principal weak po-flatness and po-torsion freeness.
Liang Xingliang +2 more
doaj +1 more source
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
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
Hypergeometric motives from Euler integral representations
Abstract We revisit certain one‐parameter families of affine covers arising naturally from Euler's integral representation of hypergeometric functions. We introduce a partial compactification of this family. We show that the zeta function of the fibers in the family can be written as an explicit product of L$L$‐series attached to nondegenerate ...
Tyler L. Kelly, John Voight
wiley +1 more source
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
Torsion classes of extended Dynkin quivers over commutative rings
Abstract For a Noetherian R$R$‐algebra Λ$\Lambda$, there is a canonical inclusion torsΛ→∏p∈SpecRtors(κ(p)Λ)$\mathop {\mathsf {tors}}\Lambda \rightarrow \prod _{\mathfrak {p}\in \operatorname{Spec}R}\mathop {\mathsf {tors}}(\kappa (\mathfrak {p})\Lambda)$, and each element in the image satisfies a certain compatibility condition.
Osamu Iyama, Yuta Kimura
wiley +1 more source
Countably QC-Approximating Posets
As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized ...
Xuxin Mao, Luoshan Xu
doaj +1 more source
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
Connectivity of the coset poset and the subgroup poset of a group [PDF]
28 ...
openaire +3 more sources

