Zobrazeno 1 - 10
of 510
pro vyhledávání: '"Wu, Liyun"'
Autor:
Zhu, Huihui, Wu, Liyun
Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is below $b$ unde
Externí odkaz:
http://arxiv.org/abs/2309.13588
Externí odkaz:
https://doi.org/10.1093/oso/9780197638514.001.0001
Let $S$ be a $*$-semigroup and let $a,w,v\in S$. The initial goal of this work is to introduce two new classes of generalized inverses, called the $w$-core inverse and the dual $v$-core inverse in $S$. An element $a\in S$ is $w$-core invertible if th
Externí odkaz:
http://arxiv.org/abs/2205.00181
Autor:
Wu, Liyun, Li, Chaoyue, Chen, Qiaozhen, Wang, Yu, Zhang, Rui, Liu, Haokun, Han, Dong, Zhang, Zhimin, Zhu, Xiaoming, Yang, Yunxia, Xie, Shouqi, Jin, Junyan
Publikováno v:
In Aquaculture Reports October 2024 38
Publikováno v:
In Engineering Failure Analysis September 2024 163 Part B
Autor:
Tang Jingling, Xie Lulu, Liu Honglin, Wu Liyun, Li Xiaoyang, Du Hang, Wang Xinjun, Li Xiaoyun, Yang Yuan
Publikováno v:
Open Life Sciences, Vol 18, Iss 1, Pp 407-73 (2023)
Externí odkaz:
https://doaj.org/article/d6b0ce71192946e5889081a4bf88d5fc
Publikováno v:
In Plant Physiology and Biochemistry February 2024 207
In 2010, Mader [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor+m-1$ contains a path $P$ of order $m$ s
Externí odkaz:
http://arxiv.org/abs/2011.03929
Publikováno v:
In Resources Chemicals and Materials September 2024