A5072292087- semigroups and automata theory
- Advanced Topics in Algebra
- Algebraic structures and combinatorial models
- Advanced Algebra and Logic
- Rings, Modules, and Algebras
- Finite Group Theory Research
- Fuzzy and Soft Set Theory
- Nonlinear Waves and Solitons
- Graph theory and applications
- graph theory and CDMA systems
- Geometric and Algebraic Topology
- Advanced Graph Theory Research
- Chemical Synthesis and Analysis
- Synthesis and Properties of Aromatic Compounds
- Advanced Combinatorial Mathematics
- Graph Labeling and Dimension Problems
- Coding theory and cryptography
- Commutative Algebra and Its Applications
- Particle Accelerators and Free-Electron Lasers
- Advanced Operator Algebra Research
- Multi-Criteria Decision Making
- Particle Detector Development and Performance
- Homotopy and Cohomology in Algebraic Topology
- Limits and Structures in Graph Theory
- Superconducting Materials and Applications
Lanzhou University
2014-2024
Lanzhou University of Finance and Economics
2011-2024
Chongqing University
2016-2024
Brookhaven National Laboratory
2009-2024
Bioengineering Center
2016
Ministry of Education of the People's Republic of China
2007
Sun Yat-sen University
2007
We introduce $\mathcal{Q}^N$ quivers and construct maximal green sequences for these quivers. prove that any finite connected full subquiver of the defined by Hernandez Leclerc, arising in monoidal categorifications cluster algebras, is a special case Moreover, we trees oriented cycles introduced Garver Musiker are cases This result resolves an open problem proposed Musiker, providing construction cycles. Furthermore, mutation equivalent to orientation type AD Dynkin diagram can also be recognized as
In this paper, we introduce the concept of hyperfilters an ordered semihypergroup, and present some examples in respect. Furthermore, define discuss fuzzy semihypergroups. We also completely prime hyperideals se mihypergroup S, establish relation S . particular, prove that a subset f is hyperfilter if only complement f′ hyperideal As application results corresponding ordinary semihypergroups can be obtained by moderate modification.
In this paper, the concept of ordered fuzzy points semihypergroups is introduced. By using new concept, we define and study left, right two-sided hyperideals an semihypergroup. particular, investigate properties generated by Furthermore, introduce concepts prime, semiprime, weakly prime semiprime semihyper- groups establish relationship between four classes hyperideals. Finally, give some characterizations semisimple in terms Especially, prove that semihypergroup S if only every hyperideal...
Abstract In this article, the Cayley graphs of Brandt semigroups are investigated. The basic structures and properties kind given, a necessary sufficient condition is given for components to be strongly regular. As an application, generalized Petersen graph k-partite graph, which cannot obtained from groups, can constructed as component semigroups. Key Words: semigroupCayley graphStrongly regular2000 Mathematics Subject Classification: 05C2520M99 ACKNOWLEDGMENTS authors would like express...
Employing the combined strategy to identify novel CCR5 inhibitors and provide a basis for rational drug design.
For each positive $n$ , let $\mathbf{u}_{n}\approx \boldsymbol{v}_{n}$ denote the identity obtained from Adjan $(xy)(yx)(xy)(xy)(yx)\approx (xy)(yx)(yx)(xy)(yx)$ by substituting $(xy)\rightarrow (x_{1}x_{2}\ldots x_{n})$ and $(yx)\rightarrow (x_{n}\ldots x_{2}x_{1})$ . We show that every monoid which satisfies for generates a variety containing bicyclic is nonfinitely based. This implies $U_{2}(\mathbb{T})$ (respectively, $U_{2}(\overline{\mathbb{Z}})$ ) of two-by-two upper triangular...
In this paper, we define a new coproduct on the space of decorated planar rooted forests to equip it with weighted infinitesimal unitary bialgebraic structure. We introduce concept $\Omega$-cocycle bialgebras weight $\lambda$ and then prove that $H_{\mathrm{RT}}(X,\Omega)$, together set grafting operations $\{ B^+_\omega \mid \omega\in \Omega\}$, is free bialgebra $X$, involving version Hochschild 1-cocycle condition. As an application, cocycle structure undecorated forests, which object...
Abstract We build up a multiplicative basis for locally adequate concordant semigroup algebra by constructing Rukolaĭne idempotents. This allows us to decompose the into direct product of primitive abundant <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"><m:msup><m:mrow><m:mn>0</m:mn><m:mtext>-</m:mtext><m:mi>J</m:mi></m:mrow><m:mo>*</m:mo></m:msup></m:math> $0{\rm{ - }}{\cal J}*$ -simple algebras. also deduce sum decomposition this in terms...
We give a transparent combinatorial characterization of the identities satisfied by Kauffman monoid K3. Our leads to polynomial time algorithm check whether given identity holds in