A hallmark of graph neural networks is their ability to distinguish the isomorphism class of their inputs. This study derives hardness results for the classification variant of graph isomorphism in the message-passing model (MPNN). MPNN encompasses the maj ...
Let R be a semilocal principal ideal domain. Two algebraic objects over R in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all completions of R and its fract ...
Let A and B be two finite dimensional algebras over an algebraically closed field, related to each other by a stable equivalence of Morita type. We prove that A and B have the same number of isomorphism classes of simple modules if and only if their 0-degr ...
This dissertation is concerned with modular representation theory of finite groups, and more precisely, with the study of classes of representations, which we shall term relative endotrivial modules. Given a prime number p, a finite group G of order divisi ...
We construct all possible noncommutative deformations of a Kleinian singularity C-2/Gamma of type D-n in terms of generators and relations, and solve the isomorphism problem for the associative algebras thus constructed. We prove that (in our parametrizati ...
This dissertation is concerned with the study of a new family of representations of finite groups, the endo-p-permutation modules. Given a prime number p, a finite group G of order divisible by p and an algebraically closed field k of characteristic p, we ...
Let g be a nilpotent Lie algebra (of finite dimension n over an algebraically closed field of characteristic zero) and let Der(g) be the algebra of derivations of g. The system of weights of g is defined as being that of the standard representation of a "m ...