Related papers: Computing monomial bases in Lie theory using OSCAR

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

In this short note we study Lie algebras in the framework of symmetric monoidal categories. After a brief review of the existing work in this field and a presentation of earlier studied and new examples, we examine which functors preserve…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

Lie-integration is one of the most efficient algorithms for numerical integration of ordinary differential equations if high precision is needed for longer terms. The method is based on the computation of the Taylor-coefficients of the…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…

In this paper, we propose compactly supported radial basis functions for solving some well- known classes of astrophysics problems categorized as non-linear singular initial ordinary dif- ferential equations on a semi-infinite domain. To…

Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…

With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to…

We solved the long-standing problem of describing the cohomology ring of semiample hypersurfaces in complete simplicial toric varieties. Also, the monomial-divisor mirror map is generalized to a map between the whole Picard group and the…

We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse…

We give a brief introduction to Hamiltonian optics and Lie algebraic methods. We use these methods to describe the operators governing light propagation, refraction and reflection in phase space. The method offers a systematic way to find…

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

A novel method of determining which Dynkin diagrams represent simple finite-dimensional Lie algebras over $\mathbb{C}$ is presented. It is based on a condition that is both necessary and sufficient for a suitably defined Cartan matrix to be…

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…

We study the structure of a family of algebras which encodes a generalization of the Pieri Rule for the complex orthogonal group. In particular, we show that each of these algebras has a standard monomial basis and has a flat deformation to…

Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical…

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…