Results 61 to 70 of about 11,002 (236)
Generalization of Pawlak’s Approximations in Hypermodules by Set-Valued Homomorphisms
Foundations of Computing and Decision Sciences, 2017 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
Algorithms for determining the type of algebraic hyperstructures and morphisms [PDF]
Mathematics and Computational SciencesIn this paper, we present some primary methods to define a hypergroupoid by algorithm. Then, we present algorithms for checking if it is closed under ο, associativity, weak associativity, commutativity, weak commutativity, establishing the reproduction ...
Aboutorab Pourhaghani +2 more
doaj +1 more source
Rendiconti del Seminario Matematico della Università di Padova, 2008 Inspired by an analogous result of Arnautov about isomorphisms, we prove that all continuous surjective homomorphisms of topological groups f :G → H can be obtained as restrictions of open continuous surjective homomorphisms
openaire +4 more sources
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
International Journal of Mechanical System Dynamics, EarlyView.ABSTRACT Fractional calculus, with its unique advantage in describing memory and nonlocal effects, has become a key tool for modeling nonlinear dynamic systems. Its integration with circuit systems has opened up a new paradigm for modern circuit design.
Zhimo Jian +4 more
wiley +1 more source
Homomorphisms and amalgamation
Discrete Mathematics, 2003 A graph \(G\) is called core if each homomorphism \(G \to G\) is an automorphism of \(G\). A graph \(H\) is called \(G\)-colourable if there is a homomorphism \(H \to G\). The author proves that if \(G\) is a finite core, then the class of \(G\)-colourable graphs is a pseudo-amalgamation class in the sense of \textit{R.
openaire +2 more sources
PROJECTIVE CLONE HOMOMORPHISMS [PDF]
The Journal of Symbolic Logic, 2019 AbstractIt is known that a countable $\omega $ -categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone homomorphism.
Manuel Bodirsky +2 more
openaire +4 more sources
Sliding Motions on Non‐Euclidean State Spaces: A Differential‐Geometric Perspective
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This paper extends sliding‐mode control theory to nonlinear systems evolving on smooth manifolds. Building on differential geometric methods, we reformulate Filippov's notion of solutions, characterize well‐defined vector fields on quotient spaces, and provide a consistent geometric definition of higher‐order sliding modes.
Fernando Castaños
wiley +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
On r-Ideals and m-k-Ideals in BN-Algebras
Axioms, 2022 A BN-algebra is a non-empty set X with a binary operation “∗” and a constant 0 that satisfies the following axioms: (B1) x∗x=0, (B2) x∗0=x, and (BN) (x∗y)∗z=(0∗z)∗(y∗x) for all x, y, z ∈X.
Sri Gemawati +4 more
doaj +1 more source