Results 11 to 20 of about 153,244 (275)

Capturing Homomorphism-Closed Decidable Queries with Existential Rules [PDF]

open access: yesInternational Conference on Principles of Knowledge Representation and Reasoning, 2021
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering.
Camille Bourgaux   +4 more
semanticscholar   +1 more source

Higher Homomorphisms and ‎Their Approximations [PDF]

open access: yesJournal of Mahani Mathematical Research, 2023
‎In this paper‎, ‎we introduce a class of higher homomorphisms on an algebra $ \mathcal{A} $ and we characterize the structure of them as a linear combination of some ‎sequences‎ of homomorphisms‎.‎ ‎Also ‎‎we prove that for any approximate higher ring ...
Sayed khalil Ekrami
doaj   +1 more source

A NOTE ON β-DERIVATIONS IN PRIME NEAR RING [PDF]

open access: yesMatrix Science Mathematic, 2021
In this paper, we prove commutativity of prime near rings by using the notion of β-derivations. Let M be a prime near ring. If there exist p,q ϵ M and two sided nonzero β-derivation f on M, where β:M→M is a homomorphism, satisfying the following ...
Abdul Rauf Khan   +2 more
doaj   +1 more source

A NOTE ON COMMUTATIVITY OF PRIME NEAR RING WITH GENERALIZED β-DERIVATION [PDF]

open access: yesMatrix Science Mathematic, 2021
In this paper, we prove commutativity of prime near rings by using the notion of β-derivations. Let M be a prime near ring. If there exist 𝑢1 , 𝑣1 𝜖 𝑀 and two sided generalized β-derivation G associated with the nonzero two sided β-derivation 𝑔 on M ...
Abdul Rauf Khan   +2 more
doaj   +1 more source

The quantum-to-classical graph homomorphism game [PDF]

open access: yesJournal of Mathematics and Physics, 2020
Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a “quantum–classical game,” that is, a non-local game of two players involving ...
Michael Brannan   +2 more
semanticscholar   +1 more source

The Chebyshev–Frobenius homomorphism for stated skein modules of 3-manifolds [PDF]

open access: yesMathematische Zeitschrift, 2020
We study the stated skein modules of marked 3-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin ...
W. Bloomquist, Thang T. Q. Lê
semanticscholar   +1 more source

Jordan Homomorphism on ΓM- Modules [PDF]

open access: yesمجلة جامعة الانبار للعلوم الصرفة, 2016
The aim object of this paper is present and study the concepts of homomorphism and Jordan homomorphism on -module and prove that every Jordan homomorphism from -ring M Into prime -module X is either a homomorphism from M into X or anti-homomorphism from ...
Sind K. Ibrahim
doaj   +1 more source

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles [PDF]

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2020
Counting homomorphisms of a constant sized pattern graph $H$ in an input graph $G$ is a fundamental computational problem. There is a rich history of studying the complexity of this problem, under various constraints on the input $G$ and the pattern $H$.
Suman Kalyan Bera   +2 more
semanticscholar   +1 more source

Between the enhanced power graph and the commuting graph

open access: yesJournal of Graph Theory, Volume 102, Issue 2, Page 295-303, February 2023., 2023
Abstract The purpose of this note is to define a graph whose vertex set is a finite group G $G$, whose edge set is contained in that of the commuting graph of G $G$ and contains the enhanced power graph of G $G$. We call this graph the deep commuting graph of G $G$.
Peter J. Cameron, Bojan Kuzma
wiley   +1 more source

Locally common graphs

open access: yesJournal of Graph Theory, Volume 102, Issue 3, Page 472-483, March 2023., 2023
Abstract Goodman proved that the sum of the number of triangles in a graph on n n nodes and its complement is at least n3∕24 Endre Csóka   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy