Results 71 to 80 of about 1,976 (187)
Determinants from homomorphisms
We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new explanation avoids linear-algebraic arguments and instead exploits a classical connection between subgraph and ...
openaire +4 more sources
Homomorphic Preimages of Geometric Paths
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source
Generalization of Pawlak’s Approximations in Hypermodules by Set-Valued Homomorphisms
The initiation and majority on rough sets for algebraic hyperstructures such as hypermodules over a hyperring have been concentrated on a congruence relation.
Mirvakili Saeed +2 more
doaj +1 more source
EVALUATING THE EFFECTIVENESS OF INNOVATION IMPLEMENTATION AT TRANSPORT ENTERPRISES UNDER CONDITIONS OF UNCERTAINTY [PDF]
In the conditions of economic uncertainty associated with war, the task of developing and applying new approaches to assessing the economic efficiency and feasibility of introducing innovations at transport enterprises has become more urgent.
Oksana O. Karpenko +3 more
doaj +1 more source
We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $φ: M \to H$, decide whether or not there exists a homomorphism $\widetildeφ: G\to H$ extending $φ$, i.e., $\widetildeφ|_M = φ$. This problem arose in the context of list-decoding homomorphism codes but is also of independent interest ...
openaire +2 more sources
FUZZY RINGS AND ITS PROPERTIES
One of algebraic structure that involves a binary operation is a group that is defined an un empty set (classical) with an associative binary operation, it has identity elements and each element has an inverse. In the structure of the group known as the
Karyati Karyati, Rifki Chandra Utama
doaj
Generalized Lower and Upper Approximations in Quantales
We introduce the concepts of set-valued homomorphism and strong set-valued homomorphism of a quantale which are the extended notions of congruence and complete congruence, respectively.
Qimei Xiao, Qingguo Li
doaj +1 more source
A New Type of Weakly Commutative Groups
The aim of the present paper is to define and study a new class of groups, namely Wm-groups with a single binary operation based on axioms of semi commutativity, right identity and left inverse.
Hariwan Z. Ibrahim, Muwafaq M. Salih
doaj +1 more source
Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
The degree-constrained Steiner problem in graphs is well known in the literature. In an undirected graph, positive integer degree bounds are associated with nodes and positive costs with the edges.
Miklos Molnar
doaj +1 more source
Q-soft Translation of Q-soft Subgroups
In this study, we introduce the concept Q-soft translations of Q-soft subgroups. Next we investigate the properties of them and we prove that every Q-soft translation of Q-soft subgroup is also Q-soft subgroup.
Rasul Rasuli
doaj

