English
Related papers

Related papers: Computing monomial bases in Lie theory using OSCAR

200 papers

In this paper, we provide a systematic and constructive description of Vaisman structures on certain principal elliptic bundles over complex flag manifolds. From this description we explicitly classify homogeneous l.c.K. structures on…

Differential Geometry · Mathematics 2022-03-28 Eder M. Correa

We explicitly provide minimal Gr\"obner bases for simple, finite-dimensional modules of complex Lie algebras of types A and C, using a homogeneous ordering that is compatible with the PBW filtration on the universal enveloping algebras.

Representation Theory · Mathematics 2024-01-12 Ghislain Fourier , León van Eß

We derive a formula for the the modular class of a Lie algebroid with a regular twisted Poisson structure in terms of a canonical Lie algebroid representation of the image of the Poisson map. We use this formula to compute the modular…

Symplectic Geometry · Mathematics 2012-12-05 Yvette Kosmann-Schwarzbach , Milen Yakimov

Known classification results allow us to find the number of (equivalence classes of) fine gradings on matrix algebras and on classical simple Lie algebras over an algebraically closed field $\mathbb{F}$ (assuming $\mathrm{char}…

Rings and Algebras · Mathematics 2015-06-02 Mikhail Kochetov , Nicholas Parsons , Sergey Sadov

Let $L$ be a Lie algebra of Block type over $\C$ with basis $\{L_{\alpha,i}\,|\,\alpha,i\in\Z\}$ and brackets $[L_{\alpha,i},L_{\beta,j}]=(\beta(i+1)-\alpha(j+1))L_{\alpha+\beta,i+j}$. In this paper, we shall construct a formal distribution…

Representation Theory · Mathematics 2012-10-24 Ming Gao Ying Xu Xiaoqing Yue

We generalize methods to compute various kinds of rank to the case of a toric variety $X$ embedded into projective space using a very ample line bundle $\mathcal{L}$. We find an upper bound on the cactus rank. We use this to compute rank,…

Algebraic Geometry · Mathematics 2020-01-28 Maciej Gałązka

Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…

Symbolic Computation · Computer Science 2014-06-26 Jean-Charles Faugere , Pierre-Jean Spaenlehauer , Jules Svartz

The aim of this article is to give a method to construct bimodule resolutions of associative algebras, generalizing Bardzell's well-known resolution of monomial algebras. We stress that this method leads to concrete computations, providing…

K-Theory and Homology · Mathematics 2014-09-17 Sergio Chouhy , Andrea Solotar

This paper presents an innovative approach, the Adaptive Orthogonal Basis Method, tailored for computing multiple solutions to differential equations characterized by polynomial nonlinearities. Departing from conventional practices of…

Numerical Analysis · Mathematics 2024-04-23 Lin Li , Yangyi Ye , Huiyuan Li

We illustrate some simple ideas that can be used for obtaining a classification of small-dimensional solvable Lie algebras.Using these we obtain the classification of 3 and 4 dimensional solvable Lie algebras (over fields of any…

Rings and Algebras · Mathematics 2007-05-23 W. A. de Graaf

For an affine algebraic variety $X$ we study a category of modules that admit compatible actions of both the algebra of functions on $X$ and the Lie algebra of vector fields on $X$. In particular, for the case when $X$ is the sphere…

Representation Theory · Mathematics 2017-07-11 Yuly Billig , Jonathan Nilsson

A certain type of integer grid, called here an echelon grid, is an object found both in coherent systems whose components have a finite or countable number of levels and in algebraic geometry. If \alpha=(\alpha_1,...,\alpha_d) is an integer…

Statistics Theory · Mathematics 2007-06-13 Beatrice Giglio , Henry P. Wynn

In this paper, by using Composition-Diamond lemma for Lie algebras, we give a Gr\"obner-Shirshov basis for free partially commutative Lie algebra over a commutative ring with unit. As an application, we obtain a normal form for such a Lie…

Rings and Algebras · Mathematics 2014-01-28 Yuqun Chen , Qiuhui Mo

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…

Commutative Algebra · Mathematics 2017-10-27 Mohamed Barakat , Markus Lange-Hegermann

The standard way to compute the structure constants of semi-simple Lie algebras involves the additive structure of the roots. In earlier work, I described how ideas of Jacques Tits could be applied to do this by using the structure of the…

Representation Theory · Mathematics 2021-07-05 Bill Casselman

For any grading by an abelian group $G$ on the exceptional simple Lie algebra $\mathcal{L}$ of type $E_6$ or $E_7$ over an algebraically closed field of characteristic zero, we compute the graded Brauer invariants of simple…

Representation Theory · Mathematics 2017-11-27 Cristina Draper , Alberto Elduque , Mikhail Kochetov

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

Numerical Analysis · Mathematics 2017-12-04 Nicholas Hale , Sheehan Olver

A simple formula computing the multiplier ideal of a monomial ideal on an arbitrary affine toric variety is given. Variants for the multiplier module and test ideals are also treated.

Algebraic Geometry · Mathematics 2007-05-23 Manuel Blickle

This paper is, essentially, a survey related to the problem of understanding the combinatorics of the action of the monoidal category of finite dimensional modules over a simple finite dimensional Lie algebra on various categories of Lie…

Representation Theory · Mathematics 2025-09-03 Volodymyr Mazorchuk , Xiaoyu Zhu

In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…

Information Theory · Computer Science 2023-02-22 I. Álvarez-Barrientos , M. Borges-Quintana , M. A. Borges Trenard , E. Martínez Moro , J. A. Ornella