a topoframe, denoted by $l_{ tau}$,  is a pair $(l, tau)$ consisting of a frame $l$ and a subframe $ tau $ all of whose elements are complementary elements in$l$. in this paper, we define and study the notions of a$tau $-real-continuous function on a frame $l$ and the set of realcontinuous functions $mathcal{r}l_tau $ as an $f$-ring.we show that $mathcal{r}l_{ tau}$is actually a generalization ...

Let $ mathcal{H}(mathbb{D}) $ denote the space of analytic functions on the open unit disc $mathbb{D}$. For a weight $mu$ and a nonnegative integer $n$, the $n$'th weighted type space $ mathcal{W}_mu ^{(n)} $ is the space of all $fin mathcal{H}(mathbb{D}) $ such that $sup_{zin mathbb{D}}mu(z)left|f^{(n)}(z)right|begin{align*}left|f right|_{mathcal{W}_...

 A topoframe, denoted by $L_{ tau}$,  is a pair $(L, tau)$ consisting of a frame $L$ and a subframe $ tau $ all of whose elements are complementary elements in $L$. In this paper, we define and study the notions of a $tau $-real-continuous function on a frame $L$ and the set of real continuous functions $mathcal{R}L_tau $ as an $f$-ring. We show that $mathcal{R}L_{ tau}$ is actually a generali...

We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC$^0$ a tree straight-line program of logarithmi...

in this work‎, ‎an iterative method based on a matrix form of lsqr algorithm is constructed for solving the linear operator equation $mathcal{a}(x)=b$‎ ‎and the minimum frobenius norm residual problem $||mathcal{a}(x)-b||_f$‎ ‎where $xin mathcal{s}:={xin textsf{r}^{ntimes n}~|~x=mathcal{g}(x)}$‎, ‎$mathcal{f}$ is the linear operator from $textsf{r}^{ntimes n}$ onto $textsf{r}^{rtimes s}$‎, ‎$ma...

a unital $c^*$ -- algebra $mathcal a,$ endowed withthe lie product $[x,y]=xy- yx$ on $mathcal a,$ is called a lie$c^*$ -- algebra. let $mathcal a$ be a lie $c^*$ -- algebra and$g,h:mathcal a to mathcal a$ be $bbb c$ -- linear mappings. a$bbb c$ -- linear mapping $f:mathcal a to mathcal a$ is calleda lie $(g,h)$ -- double derivation if$f([a,b])=[f(a),b]+[a,f(b)]+[g(a),h(b)]+[h(a),g(b)]$ for all ...

In his technical report~\cite[sec. 6]{barrontech}, Barron states that the de Bruijn's identity for Gaussian perturbations holds for any RV having a finite variance. In this report, we follow Barron's steps as we prove the existence of $J_{\alpha}\left(X + \sqrt[\alpha]{\eta}N\right)$, $\eta>0$ for any Radom Variable (RV) $X \in \mathcal{L}$ where \begin{equation*} \mathcal{L} = \left\{ \text{RV...

let $m_r$ be a non-zero‎ ‎module and ${mathcal f}‎: ‎sigma[m_r]times sigma[m_r]‎ ‎rightarrow$ mod-$bbb{z}$ a bifunctor‎. ‎the‎ ‎$mathcal{f}$-reversibility of $m$ is defined by ${mathcal‎ ‎f}(x,y)=0 rightarrow {mathcal f}(y,x)=0$ for all non-zero $x,y$‎ ‎in $sigma[m_r]$‎. ‎hom (resp‎. ‎rej)-reversibility of $m$ is‎ ‎characterized in different ways‎. ‎among other things‎, ‎it is shown‎ ‎th...

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...