Results 1 to 10 of about 142 (106)
Construction of lattice orders on the semigroup ring of a positive rooted monoid
Let \((M,+,\leq)\) be a strictly partially ordered monoid such that (1) the set of all upper bounds of each element in \(M\) is a chain, (2) each non-zero element \(a\in M\) is positive (i.e ...
Ma, Jingjing, Steinberg, Stuart A.
openaire +2 more sources
On Naturally Ordered Abundant Semigroups with an Adequate Monoid Transversal
In this paper, we study a class of naturally ordered abundant semigroups with an adequate monoid transversal, namely, naturally ordered concordant semigroups with an adequate monoid transversal. After giving some properties of such semigroups, we obtain a structure theorem for naturally ordered concordant semigroups with an adequate monoid transversal.
openaire +3 more sources
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Oppenheim–Schur inequalities for causal products
Abstract We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting.
Dominique Guillot +2 more
wiley +1 more source
Algebraic singular functions are not always dense in the ideal of C∗$C^*$‐singular functions
Abstract We give the first examples of étale (non‐Hausdorff) groupoids G$\mathcal {G}$ whose C∗$C^*$‐algebras contain singular elements that cannot be approximated by singular elements in Cc(G)$\mathcal {C}_c(\mathcal {G})$. We provide two examples: one is a bundle of groups and the other a minimal and effective groupoid constructed from a self‐similar
Diego Martínez, Nóra Szakács
wiley +1 more source
Some Properties of Hyper Ideals in Hyper Hoop‐Algebras
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
On the Presentation and Cayley Graph of the Bruck–Reilly Idealization Semigroup
Transferring constructions between different algebraic structures often reveals deep connections and enables the application of techniques from one theory to another. The idealization of the module over a ring, introduced by Nagata in 1962, has been a powerful tool in commutative algebra for decades.
Suha Wazzan +3 more
wiley +1 more source
Is every product system concrete?
Abstract Is every product system of Hilbert spaces over a semigroup P$P$ concrete, that is, isomorphic to the product system of an E0$E_0$‐semigroup over P$P$? The answer is no if P$P$ is discrete, cancellative and does not embed in a group. However, we show that the answer is yes for a reasonable class of semigroups.
S. Sundar
wiley +1 more source
Growth problems in diagram categories
Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
On Endomorphism Universality of Sparse Graph Classes
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

