Results 141 to 150 of about 14,027 (232)
Creating a network-state homomorphism through optimization
In graph theory, a mapping between two graphs that generally preserves the structure is called a graph homomorphism, which has been a fundamental notion and extensively studied in combinatorial and algebraic areas.
Yilun Shang
core +1 more source
Adjoint <i>L</i>-functions, congruence ideals, and Selmer groups over GL n. [PDF]
Fong HL.
europepmc +1 more source
<i>N</i> =1 Super Virasoro Tensor Categories. [PDF]
Creutzig T +3 more
europepmc +1 more source
Homomorphism between quantum groups
For every simple Lie algebra g and a complex number Q different from -1, Drinfeld and Jimbo introduced a quantum group Uq(g). Uq(g) is a certain Hopf algebra deformation of the universal enveloping algebra U(g).In this thesis, we prove that there is an ...
Chan, Cheuk Hang
core
Congruency, Homomorphism and Isomorphism on Autometrized Algebras. [PDF]
Tilahun GY.
europepmc +1 more source
Minimal volume entropy of mapping tori over 3-manifolds. [PDF]
Bargagnati G +3 more
europepmc +1 more source
Ramifications of generalized Feller theory. [PDF]
Cuchiero C, Möllmann T, Teichmann J.
europepmc +1 more source
The Number of finite homomorphism-homogeneous tournaments with loops
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Nešetřil introduced a relaxed version of homogeneity: we say that a
Mašulović Dragan
core
A graph homomorphism approach for unraveling histories of metastatic cancers and viral outbreaks under evolutionary constraints. [PDF]
Kuzmin K +5 more
europepmc +1 more source
On the boundary Carrollian conformal algebra. [PDF]
Buzaglo L +5 more
europepmc +1 more source

