Results 21 to 30 of about 142,721 (259)
Journal of Mathematics, 2021 Set L≔H4⊗ℂR, R≔ℂt±1, and S≔ℂt±1/mm∈ℤ+. Then, L is called the loop Nappi–Witten Lie algebra. R-isomorphism classes of S/R forms of L are classified. The automorphism group and the derivation algebra of L are also characterized.
Xue Chen
doaj +1 more source
Automorphism Properties and Classification of Adinkras
Advances in Mathematical Physics, 2015 Adinkras are graphical tools for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set of local parameters.
B. L. Douglas +3 more
doaj +1 more source
Isomorphs of a class of Queueing systems [PDF]
International Journal of Mathematics and Mathematical Sciences, 1979 Restricted isomorphism between two queueing systems implies that they have equivalent distribution function for at least one (but not all) output elements (e.g. waiting time, queue size, idle time, etc.). Quasi‐isomorphism implies an approximate equivalence.
A. Ghosal, Sudhir Madan
openaire +3 more sources
Modular representations of Loewy length two
International Journal of Mathematics and Mathematical Sciences, 2003 Let G be a finite p-group, K a field of characteristic p, and J the radical of the group algebra K[G]. We study modular representations using some new results of the theory of extensions of modules.
M. E. Charkani, S. Bouhamidi
doaj +1 more source
Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We endow the set of isomorphism classes of matroids with a new Hopf algebra structure, in which the coproduct is implemented via the combinatorial operations of restriction and deletion.
Nguyen Hoang-Nghia +2 more
doaj +1 more source
Canonizing Graphs of Bounded Tree Width in Logspace [PDF]
, 2015 Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if their canons are equal.
Elberfeld, Michael, Schweitzer, Pascal
core +2 more sources
Isomorphism Classes of Certain Artinian Gorenstein Algebras [PDF]
Algebras and Representation Theory, 2009 In this paper we classify, up to analytic isomorphism, the family of almost stretched Artinian complete intersection A=R/I with a given Hilbert function, in the case R is a power series ring with an arbitrary number of variables.
J. ELIAS, VALLA, GIUSEPPE
openaire +3 more sources
Automatic Structures: Richness and Limitations [PDF]
Logical Methods in Computer Science, 2007 We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the relations by ...
Bakhadyr Khoussainov +3 more
doaj +1 more source
Heliyon, 2023 Let T(X) be the full transformation semigroup on a nonempty set X. In this paper, the Cayley digraphs of T(X) with connection sets L and R, the Green's equivalence classes of T(X) according to the Green's relations L and R, are investigated. Furthermore,
Nuttawoot Nupo, Yanisa Chaiya
doaj +1 more source
Random subgroups of Thompson's group $F$ [PDF]
, 2009 We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same for the two ...
Cleary, Sean +3 more
core +3 more sources