Results 61 to 70 of about 619 (166)
L-Fuzzy Semiprime Ideals of a Poset
Advances in Fuzzy Systems, 2020 In this paper, we introduce the concept of L-fuzzy semiprime ideal in a general poset. Characterizations of L-fuzzy semiprime ideals in posets as well as characterizations of an L-fuzzy semiprime ideal to be L-fuzzy prime ideal are obtained.
Berhanu Assaye Alaba +1 more
doaj +1 more source
The B-topology on S∗-doubly quasicontinuous posets
Open Mathematics, 2021 The notions of os{o}_{s}-convergence and S∗{S}^{\ast }-doubly quasicontinuous posets are introduced, which can be viewed as common generalizations of Birkhoff’s order-convergence and S∗{S}^{\ast }-doubly continuous posets, respectively. We first consider
Sun Tao, Li Qingguo, Zou Zhiwei
doaj +1 more source
On the cardinality of layers in even-valued n-dimensional lattice
Учёные записки Казанского университета: Серия Физико-математические науки, 2022 In this article, we explicitly calculated terms additional to the main one of cardinality asymptotics of central layers in the n-dimensional k-valued lattice Ekn for even k as n → ∞. The main term had been found by V.B.
T.V. Andreeva, Yu.S. Semenov
doaj +1 more source
Assembly of constructible factorization algebras
Journal of Topology, Volume 19, Issue 1, March 2026.Abstract We provide a toolbox of extension, gluing, and assembly techniques for factorization algebras. Using these tools, we fill various gaps in the literature on factorization algebras on stratified manifolds, the main one being that constructible factorization algebras form a sheaf of symmetric monoidal ∞$\infty$‐categories.
Eilind Karlsson +2 more
wiley +1 more source
Beyond Topological Persistence: Starting from Networks
Mathematics, 2021 Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and ...
Mattia G. Bergomi +3 more
doaj +1 more source
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
Hypergeometric motives from Euler integral representations
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.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
Graph Orientations and Linear Extensions. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph, and therefore we can count the number of linear extensions of ...
Benjamin Iriarte
doaj +1 more source
Algebraic Structures Induced by the Insertion and Detection of Malware
Computation, 2023 Since its introduction, researching malware has had two main goals. On the one hand, malware writers have been focused on developing software that can cause more damage to a targeted host for as long as possible.
Agustín Moreno Cañadas +2 more
doaj +1 more source
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 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