Results 31 to 40 of about 1,976 (187)
Algorithms for determining the type of algebraic hyperstructures and morphisms [PDF]
In 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
On generalized derivations as homomorphisms and anti-homomorphisms
The concept of derivations as well as generalized derivations (i.e. Ia,b(x) = ax + xb, for all a,b R) have been generalized as an additive function F : R R satisfying F(xy) = F(x)y + xd(y) for all x,y R, where d is a nonzero derivation on R. Such a function F is said to be a generalized derivation.
openaire +4 more sources
AbstractThe study of homomorphic encryption techniques has led to significant advancements in the computing domain, particularly in the sphere of cloud computing. Homomorphic encryption provides a means for securely transmitting and storing confidential information across and in a computer system.
Monique Ogburn +2 more
openaire +1 more source
On the stability of -homomorphisms [PDF]
8 pages, minor ...
Baak, Choonkil, Moslehian, Mohammad Sal
openaire +3 more sources
Continuous MDP Homomorphisms and Homomorphic Policy Gradient
Abstraction has been widely studied as a way to improve the efficiency and generalization of reinforcement learning algorithms. In this paper, we study abstraction in the continuous-control setting. We extend the definition of MDP homomorphisms to encompass continuous actions in continuous state spaces.
Sahand Rezaei-Shoshtari +4 more
openaire +3 more sources
ABSTRACT This paper develops a mathematical framework for interpreting observations of solar inertial waves in an idealized setting. Under the assumption of purely toroidal linear waves on the sphere, the stream function of the flow satisfies a fourth‐order scalar equation.
Tram Thi Ngoc Nguyen +3 more
wiley +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Simplifications of homomorphisms
The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is demonstrated in providing rather short proofs of the following results: (i) Given an arbitrary homomorphism h and arbitrary words x, y it is decidable whether or not there exists an integer n such that hn(x) = hn(y). (ii) Given an arbitrary homomorphism h
Andrzej Ehrenfeucht, Grzegorz Rozenberg
openaire +2 more sources
PROJECTIVE CLONE HOMOMORPHISMS [PDF]
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 +3 more sources
On the additive image of zeroth persistent homology
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source

