Results 91 to 100 of about 14,027 (232)
On the automorphisms of the power semigroups of a numerical semigroup
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
− In this paper, we introduce the concept of set-valued homomorphism of a lattice which isthe generalization of ordinary lattice homomorphism. We construct generalized rough lower and upperapproximations operators, by means of a set-valued mapping, which
Dipankar Rana, Sankar Kumar Roy
doaj
Distributive and Dual Distributive Elements in Hyperlattices
In this paper we introduce and study distributive elements, dual distributive elements in hyperlattices, and prove that these elements forms ∧-semi lattice and ∨-semi hyperlattice, respectively.
Ameri Reza +3 more
doaj +1 more source
Associative triples and homomorphisms between travel groupoids on finite geodetic graphs [PDF]
Sergiy Kozerenko, Yur-Liubomysl Dekhtiar
doaj +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
The mod 2 Seiberg–Witten invariants of spin structures and spin families
Abstract We completely determine the mod 2 Seiberg–Witten invariants for any spin structure on any closed, oriented, smooth 4‐manifold X$X$. Our computation confirms the validity of the simple‐type conjecture mod 2 for spin structures. Our proof also works for families of spin 4‐manifolds and thus computes the mod 2 Seiberg–Witten invariants for spin ...
David Baraglia
wiley +1 more source
The Complexity of Homomorphism Indistinguishability [PDF]
For every graph class {F}, let HomInd({F}) be the problem of deciding whether two given graphs are homomorphism-indistinguishable over {F}, i.e., for every graph F in {F}, the number hom(F, G) of homomorphisms from F to G equals the corresponding number ...
Rattan, Gaurav +3 more
core +1 more source
A Common External Framework for Kleene and McCarthy Algebras
ABSTRACT Algebras of disjoint alternatives (ADAs), introduced by Manes, are extensions of McCarthy algebras by a unary operator acting as an oracle for the halting problem, and provide a semantics for the equational theory of the if–then–else construct.
Gandolfo Vergottini +2 more
wiley +1 more source
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 +5 more sources
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

