In this paper we define neutrosophic bi-LAsemigroup and neutrosophic N-LA-semigroup. Infact this paper is an extension of our previous paper neutrosophic left almost semigroup shortly neutrosophic LAsemigroup. We also extend the neutrosophic ideal to neutrosophic biideal and neutrosophic N-ideal. We also find some new type of neutrosophic ideal which is related to the strong or pure part of neu...

‎Let $S$ be an inverse semigroup with the set of idempotents $E$‎. We prove that the semigroup algebra $ell^{1}(S)$ is always‎ ‎$2n$-weakly module amenable as an $ell^{1}(E)$-module‎, ‎for any‎ ‎$nin mathbb{N}$‎, ‎where $E$ acts on $S$ trivially from the left‎ ‎and by multiplication from the right‎. ‎Our proof is based on a common fixed point property for semigroups‎.  

A class of differential Riccati equations (DREs) is considered whereby the evolution of any solution can be identified with the propagation of a value function of a corresponding optimal control problem arising in L2-gain analysis. By exploiting the semigroup properties inherited from the attendant dynamic programming principle, a max-plus primal space fundamental solution semigroup of max-plus...

Given continuous functions M and N of two variables, it is shown that if in a continuous iteration semigroup with only (M,N)-convex or (M,N)-concave elements there are two (M,N)-affine elements, then M = N and every element of the semigroup is M -affine. Moreover, all functions in the semigroup either are M -convex or M -concave.

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of...

The dynamics of recombination in genetics leads to an interesting nonlinear differential equation, which has a natural generalization to a measure valued version. The latter can be solved explicitly under rather general circumstances. It admits a closed formula for the semigroup of nonlinear positive operators that emerges from the forward flow and is, in general, embedded in a multi-parameter ...

We investigate the semigroup structure of bosonic Gaussian quantum channels. Particular focus lies on the sets of channels which are divisible, idempotent or Markovian (in the sense of either belonging to one-parameter semigroups or being infinitesimal divisible). We show that the non-compactness of the set of Gaussian channels allows for remarkable differences when comparing the semigroup stru...

The following results (and one or two others like them) are proved in [3]; the continuous-parameter analogues will appear in [4] and some applications will be discussed in [5]. The proofs are based on Sz.-Nagy's group of theorems [9] which show how a discreteor continuous-parameter semigroup of contraction operators on Hilbert space can be "dilated" to a similar semigroup (actually a group) of ...

We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover’s long-term private key. The latter is equivalent to solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X−1AX and A. The platform semigroup that we suggest here is the semigroup of n×n matrices over truncated multivariable ...