Results 41 to 50 of about 167 (147)
On H-complete topological semilattices [PDF]
Математичні Студії, 2012 In the paper we describe the structure of$mathscr{A!H}$-completions and $mathscr{H}$-completions ofthe discrete semilattices $(mathbb{N},min)$ and$(mathbb{N},max)$.
S. Bardyla, O. Gutik
doaj
On the Malcev products of some classes of epigroups, I
Open Mathematics, 2020 A semigroup is called an epigroup if some power of each element lies in a subgroup. Under the universal of epigroups, the aim of the paper is devoted to presenting elements in the groupoid together with the multiplication of Malcev products generated by ...
Liu Jingguo
doaj +1 more source
Determinants on Semilattices [PDF]
Proceedings of the American Mathematical Society, 1969 This corollary can be applied to the construction of some (? 1)determinants with large values. For the background on generalized M\4obius functions we refer to the paper [2 ] by Gian-Carlo Rota. 2. We first prove a lemma. LEMMA. Let X be a finite-semilattice and a, b CX such that b $ a.
openaire +2 more sources
Some Properties of Hyper Ideals in Hyper Hoop‐Algebras
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.In this paper, we investigate the structural properties of hyper ideals in hyper hoop‐algebras, a generalization of hoop‐algebras under the framework of hyperstructures. Building upon foundational concepts in hyper group theory and hoop theory, the study introduces definitions for hyper ideals and weak hyper ideals, as well as their absorptive and ...
Teferi Getachew Alemayehu +5 more
wiley +1 more source
Equationally Extremal Semilattices [PDF]
Journal of Siberian Federal University. Mathematics & Physics, 2017 In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations. Moreover, we find a semilattice in $\mathbf{S}_n$ with maximal sum of numbers of solutions of equations.
openaire +3 more sources
Corrigendum to “Perfect semilattices” [PDF]
Semigroup Forum, 1985 B. M. Schein let us know that \(S_ 3\) is not perfect. In fact, it is the smallest non-perfect semilattice. Consequently, Theorem 1 of the paper mentioned in the title [ibid. 32, 23-29 (1985; Zbl 0564.06004)] has to be corrected as follows. Let S be a semilattice. Then the following are equivalent: (1) S is perfect; (4) S is a chain.
Hansoul, G., Varlet, J.
openaire +2 more sources
Equivariant Hilbert and Ehrhart series under translative group actions
Journal of the London Mathematical Society, Volume 112, Issue 5, November 2025.Abstract We study representations of finite groups on Stanley–Reisner rings of simplicial complexes and on lattice points in lattice polytopes. The framework of translative group actions allows us to use the theory of proper colorings of simplicial complexes without requiring an explicit coloring to be given.
Alessio D'Alì, Emanuele Delucchi
wiley +1 more source
Continuous and dually continuous idempotent L-semimodules [PDF]
Математичні Студії, 2012 We introduce L-idempotent analogues of topological vector spaces by means of domain theory, study their basic properties, and prove the existence of free (dually) continuous L-semi- modules over domains, (dually) continuous lattices and semilattices.
O. R. Nykyforchyn
doaj
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
Periodic Orbits of MAX and MIN Multistate Networks
Mathematical Methods in the Applied Sciences, Volume 48, Issue 12, Page 11620-11629, August 2025.ABSTRACT This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set 𝒞, which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary 𝒞‐maxterm (or 𝒞‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean
Juan A. Aledo +3 more
wiley +1 more source