arXiv subjects

Thomas Lamkin

Publications and source records attributed to Thomas Lamkin.

4 recordsLinked to original sources

arXiv2024

Four-vertex quivers supporting twisted graded Calabi-Yau algebras

We study quivers supporting twisted graded Calabi-Yau algebras, building on work of Rogalski and the first author. Specifically, we classify quivers on four vertices in which the Nakayama automorphism acts on the degree zero part by either a four-cycle, a three-cycle, or two two-cycles. In order to realize algebras associated to some of these quivers, we show that graded twists of a twisted graded Calabi-Yau algebra is another algebra of the same type.

math.RA↗

arXiv2023

Universal Enveloping Algebras of Poisson Superalgebras

In this paper, we define and study the universal enveloping algebra of a Poisson superalgebra. In particular, a new PBW Theorem for Lie-Rinehart superalgebras is proved leading to a PBW Theorem for Poisson superalgebras, we show the universal enveloping algebra of a Poisson Hopf superalgebra (resp. Poisson-Ore extension) is a Hopf superalgebra (resp. iterated Ore extension), and we study the universal enveloping algebra for interesting classes of Poisson superalgebras such as Poisson symplectic superalgebras.

math.RA↗

arXiv2022

Centers and automorphisms of PI Quantum Matrix Algebras

We study PI quantum matrix algebras and their automorphisms using the noncommutative discriminant. In the multi-parameter case at $n=2$ and $n=3$, we show that all automorphisms are graded when the center is a polynomial ring. In the single-parameter case, we determine a presentation of the center and show that the automorphism group is not graded, though are able to describe certain families of automorphisms in this case, as well as those of certain subalgebras.

math.RA↗

arXiv2020

Non-Asymptotic Connectivity of Random Graphs and Their Unions

Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When graphs are time-varying, it is common to assume that their unions are connected over time, yet, to the best of our knowledge, there are not results that determine the number of finite-size random graphs needed to attain a connected union. Therefore, this paper bounds the probability that individual random graphs are connected and bounds the same probability for connectedness of unions of random graphs. The random graph model used is a generalization of the classic Erdos-Renyi model which allows some edges never to appear. Numerical results are presented to illustrate the analytical developments made.

math.OC↗