Results 31 to 40 of about 143,594 (316)
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
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
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
The diameter of the isomorphism class of a Banach space [PDF]
Annals of Mathematics, 2005 We prove that if X is a separable infinite dimensional Banach space then its isomorphism class has infinite diameter with respect to the Banach-Mazur distance. One step in the proof is to show that if X is elastic then X contains an isomorph of c_0. We call X elastic if for some K < infinity for every Banach space Y which embeds into X, the space Y ...
Johnson, W. B., Odell, E.
openaire +2 more sources
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
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
Graph Isomorphism for unit square graphs [PDF]
, 2016 In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects.
Neuen, Daniel
core +2 more sources
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability [PDF]
QuantumMančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al.
Prem Nigam Kar +3 more
doaj +1 more source
Isomorphism test for digraphs with weighted edges [PDF]
, 2018 Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges.
Piperno, Adolfo
core +2 more sources