نتایج جستجو برای: mathcal c reticulation

تعداد نتایج: 1063285  

Journal: :journal of linear and topological algebra (jlta) 0
h barzegar tafresh university h arianpoor tafresh university

‎for the subclasses ${mathcal m}_1$ and ${mathcal m}_2$ of‎‎monomorphisms in a concrete category $mathcal c$‎, ‎if ${mathcal‎‎m}_2subseteq {mathcal m}_1$‎, ‎then ${mathcal m}_1$-injectivity‎‎implies ${mathcal m}_2$-injectivity‎. ‎the baer type criterion is about‎ ‎the converse of this fact‎. ‎in this paper‎, ‎we apply injectivity to the classes of {it $c$-dense‎, ‎$c$-closed}‎ ‎monomorphisms‎. ...

Journal: :bulletin of the iranian mathematical society 2015
d. hadwin

suppose $pi:mathcal{a}rightarrow mathcal{b}$ is a surjective unital $ast$-homomorphism between c*-algebras $mathcal{a}$ and $mathcal{b}$, and $0leq aleq1$ with $ain  mathcal{a}$. we give a sufficient condition that ensures there is a proection $pin mathcal{a}$ such that $pi left( pright) =pi left( aright) $. an easy consequence is a result of [l. g. brown and g. k. pedersen, c*-algebras of real...

Journal: :CoRR 2018
Angsheng Li Yicheng Pan

We propose the notion of {\it resistance of a graph} as an accompanying notion of the structure entropy to measure the force of the graph to resist cascading failure of strategic virus attacks. We show that for any connected network $G$, the resistance of $G$ is $\mathcal{R}(G)=\mathcal{H}^1(G)-\mathcal{H}^2(G)$, where $\mathcal{H}^1(G)$ and $\mathcal{H}^2(G)$ are the one- and two-dimensional s...

Journal: :CoRR 2017
Alexey Pushnyakov

A compact metric space $(X, \rho)$ is given. Let $\mu$ be a Borel measure on $X$. By $r$-cluster we mean a measurable subset of $X$ with diameter at most $r$. A family of $k$ $2r$-clusters is called a $r$-cluster structure of order $k$ if any two clusters from the family are separated by a distance at least $r$. By measure of a cluster structure we mean a sum of clusters measures from the clust...

Journal: :CoRR 2017
Mathieu Hoyrup

Descriptive set theory was originally developed on Polish spaces. It was later extended to $\omega$-continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 2013]. All these spaces are countably-based. Extending descriptive set theory and its effective counterpart to general represented spaces, including non-countably-based spaces has been started in [Pauly, de Brecht ...

Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...

‎Let $\Omega_X$ be a bounded‎, ‎circular and strictly convex domain in a complex Banach space $X$‎, ‎and $\mathcal{H}(\Omega_X)$ be the space of all holomorphic functions from $\Omega_X$ to $\mathbb{C}$‎. ‎The growth space $\mathcal{A}^\nu(\Omega_X)$ consists of all $f\in\mathcal{H}(\Omega_X)$‎ ‎such that $$|f(x)|\leqslant C \nu(r_{\Omega_X}(x)),\quad x\in \Omega_X,$$‎ ‎for some constant $C>0$‎...

Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain  mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...

Journal: :bulletin of the iranian mathematical society 2014
themba dube oghenetega ighedo

let $l$ be a completely regular frame and $mathcal{r}l$ be the ‎ring of continuous real-valued functions on $l$‎. ‎we show that the‎ ‎lattice $zid(mathcal{r}l)$ of $z$-ideals of $mathcal{r}l$ is a‎ ‎normal coherent yosida frame‎, ‎which extends the corresponding $c(x)$‎ ‎result of mart'{i}nez and zenk‎. ‎this we do by exhibiting‎ ‎$zid(mathcal{r}l)$ as a quotient of $rad(mathcal{r}l)$‎, ‎the‎ ‎...

Journal: :CoRR 2018
Delia Kesner Alejandro Ríos Andrés Viso

We show that call-by-need is observationally equivalent to weak-head needed reduction. The proof of this result uses a semantical argument based on a (non-idempotent) intersection type system called $\mathcal{V}$. Interestingly, system $\mathcal{V}$ also allows to syntactically identify all the weak-head needed redexes of a term.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید