Multiplicatively idempotent semirings [PDF]
Let \((S,+,\cdot)\) be an additively commutative semiring with absorbing zero \(0\) and identity \(1\). It is shown that \((S,\cdot)\) is idempotent if and only if there exist positive integers \(n\) and \(m\geq 2\) such that \(x^{n+1}=x^n\) and \(x^m=x\) for all \(x\in S\).
Chajda, Ivan +2 more
openaire +4 more sources
Projective Essential Idempotents
<p>This paper introduces the concept of projective essential idempotents. These are primitive central idempotents in a twisted group algebra. The first main result provides conditions for the existence of them. In the second main result, we prove that every $q$-ary simplex code can be seen as an ideal of a twisted group algebra generated by a ...
openaire +1 more source
Absolutely flat idempotents [PDF]
11 pages, Electronic Journal of Linear ...
Johnson, Charles R. +4 more
openaire +3 more sources
Self-Adaptation and Secure Information Flow in Multiparty Structured Communications: A Unified Perspective [PDF]
We present initial results on a comprehensive model of structured communications, in which self- adaptation and security concerns are jointly addressed.
Castellani, Ilaria +2 more
core +8 more sources
Strongly barycentrically associative and preassociative functions [PDF]
We study the property of strong barycentric associativity, a stronger version of barycentric associativity for functions with indefinite arities. We introduce and discuss the more general property of strong barycentric preassociativity, a generalization ...
Marichal, Jean-Luc, Teheux, Bruno
core +3 more sources
Introduction to Dependence Relations and Their Links to Algebraic Hyperstructures
The aim of this paper is to study, from an algebraic point of view, the properties of interdependencies between sets of elements (i.e., pieces of secrets, atmospheric variables, etc.) that appear in various natural models, by using the algebraic ...
Irina Cristea +2 more
doaj +1 more source
Maps Preserving Idempotence on Matrix Spaces
Suppose F is an arbitrary field. Let |F| be the number of the elements of F. Let Mn(F) be the space of all n×n matrices over F, let Sn(F) be the subset of Mn(F) consisting of all symmetric matrices, and let Tn(F) be the subset of Mn(F) consisting of all ...
Yuqiu Sheng, Hanyu Zhang
doaj +1 more source
Students’ Innovation Ability Evaluation in Vocational Colleges Based on the STEAM Education Concept: A Neutrosophic SuperHyper Pentapartitioned Process Model [PDF]
Innovation ability is increasingly regarded as a core competence in vocational education, particularly under the STEAM (Science, Technology, Engineering, Arts, Mathematics) paradigm that emphasizes integrative and creative problem-solving.
Xiaodan Kong
doaj +1 more source
Cognitive constraints, contraction consistency, and the satisficing criterion [PDF]
© 2007, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4 ...
Aleskerov +24 more
core +1 more source
Neutrosophic Super-Hypergraph Fusion for Proactive Cyberattack Countermeasures: A Soft Computing Framework [PDF]
Cyber defense often fails early because heterogeneous signals noisy logs, shifting baselines, and adversarial deception are collapsed into a single score.
Ehab Roshdy +2 more
doaj +1 more source

