Related papers: A Macaulay 2 interface for Normaliz
After recalling the definitions and the properties of the generic base algebra and of the universal comodule algebra attached to a Hopf algebra by Aljadeff and the second-named author, we determine these algebras for the Taft algebras, the…
We explain a Macaulay2 implementation of a construction, which appeared in [Holweck-Oeding arXiv:2206.13662], of a graded algebra structure on the direct sum of a Lie algebra $\mathfrak{g}$ (typically $\mathfrak{sl}_n$) and a…
This note presents the definition of a proposed generalization of the conchoid at the plane. Known conchoids, such as the Nicomedes and the Lima\c{c}on of Pascal are part of this set. Following the definition, one can generate other…
We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…
In this thesis, we generalize the Koszul duality for associative algebras and operads to PROPs. The operads are algebraic objects that represent the operations with multiple inputs but only one output acting on a certain type of algebras. A…
Normalizing flows model probability distributions by learning invertible transformations that transfer a simple distribution into complex distributions. Since the architecture of ResNet-based normalizing flows is more flexible than that of…
This paper stands at the intersection of two distinct lines of research. One line is "holographic algorithms," a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is "normal factor…
Modern research in code generators for dense linear algebra computations has shown the ability to produce optimized code with a performance which compares and often exceeds the one of state-of-the-art implementations by domain experts.…
A generalized Melvin solution for an arbitrary simple finite-dimensional Lie algebra $\cal G$ is considered. The solution contains a metric, $n$ Abelian 2-forms and $n$ scalar fields, where $n$ is the rank of $\cal G$. It is governed by a…
We complete the classification of algebraic monoid structures on the affine 3-space. The result is based on a reduction of the general case to that of commutative monoids. We also study various algebraic properties of all monoids appearing…
Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…
We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive $2$-representation of the…
The method of subquotients is developed and used to determine all finite dimensional rank 2 Nichols algebras of diagonal type over an arbitrary field of characteristic zero. Key Words: Hopf algebra, Nichols algebra
In this paper, we first introduce the reader to the Basic Scheme of Moulinec and Suquet in the setting of quasi-static linear elasticity, which takes advantage of the fast Fourier transform on homogenized microstructures to accelerate…
In this paper, we present an algorithm which computes a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables, based on (Barkatou, 1997). A first step was set in…
We give a necessary condition for Morita equivalence of simple Generalized Weyl algebras of classical type. We propose a reformulation of Hodges' result, which describes Morita equivalences in case the polynomial defining the Generalized…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
In characteristic zero, we construct principalization of ideals on smooth orbifolds endowed with a normal crossings divisor and a foliation. We then illustrate how the method can be used in the general study of foliations via two…
Normalizing flows are a class of machine learning models used to construct a complex distribution through a bijective mapping of a simple base distribution. We demonstrate that normalizing flows are particularly well suited as a Monte Carlo…
This paper reports on the development of a Web platform to host the Mizar Mathematical Library (MML). In recent years, the size of formalized mathematical libraries has been drastically increasing, and this has led to a growing demand for…