Results 41 to 50 of about 5,622,676 (84)
An Improved Computationally Efficient Method for Finding the Drazin Inverse
Drazin inverse is one of the most significant inverses in the matrix theory, where its computation is an intensive and useful task. The objective of this work is to propose a computationally effective iterative scheme for finding the Drazin inverse. The convergence is investigated analytically by applying a suitable initial matrix.
Haifa Bin Jebreen +2 more
wiley +1 more source
Finite models for positive combinatorial and exponential algebra
Abstract We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined.
Tumadhir Alsulami, Marcel Jackson
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
Cayley automaton semigroups [PDF]
Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core +2 more sources
A coboundary Temperley–Lieb category for sl2$\mathfrak {sl}_{2}$‐crystals
Abstract By considering a suitable renormalization of the Temperley–Lieb category, we study its specialization to the case q=0$q=0$. Unlike the q≠0$q\ne 0$ case, the obtained monoidal category, TL0(k)$\mathcal {TL}_0(\mathbb {k})$, is not rigid or braided. We provide a closed formula for the Jones–Wenzl projectors in TL0(k)$\mathcal {TL}_0(\mathbb {k})$
Moaaz Alqady, Mateusz Stroiński
wiley +1 more source
On idempotent generated semigroups [PDF]
We provide short and direct proofs for some classical theorems proved by Howie, Levi and McFadden concerning idempotent generated semigroups of transformations on a finite set.
Araújo, João
core +1 more source
Traces on the uniform tracial completion of Z$\mathcal {Z}$‐stable C∗${\rm C}^*$‐algebras
Abstract The uniform tracial completion of a C∗${\rm C}^*$‐algebra A$A$ with compact trace space T(A)≠∅$T(A) \ne \emptyset$ is obtained by completing the unit ball with respect to the uniform 2‐seminorm ∥a∥2,T(A)=supτ∈T(A)τ(a∗a)1/2$\Vert a\Vert _{2,T(A)}=\sup _{\tau \in T(A)} \tau (a^*a)^{1/2}$. The trace problem asks whether every trace on the uniform
Samuel Evington
wiley +1 more source
Subgroups of free idempotent generated semigroups: full linear monoid
We hope to use similar methods to study the higher rank ...
Brittenham, Mark +2 more
openaire +2 more sources
Unipotency of Matrix Group Generated by Two Matrices
In this paper, the problem of unipotency for the matrix group generated by two matrices is examined. By employing matrix logarithms as a tool, various combinatorial formulas for matrices were derived by selecting different primitive elements. Key conclusions were then reached through the organization and simplification of these formulas.
Yanshuo Cheng, Xinsong Yang, Kamal Kumar
wiley +1 more source
Weak ω‐Approximate Biprojectivity of Banach Algebras
For a given Banach algebra M and a continuous endomorphism ω on M, we define weakly ω‐approximately biprojective and weakly ω‐approximately Helemskii biflat Banach algebras. We then examine the relationship between them and express the correlation between them and ω‐pseudoamenability.
Zahra Ghorbani, Elena Guardo
wiley +1 more source

