Related papers: Homogeneous Algebraic Complexity Theory and Algebr…

We develop algebraic geometry for general Segal's Gamma-rings and show that this new theory unifies two approaches we had considered earlier on (for a geometry under Spec Z). The starting observation is that the category obtained by gluing…

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

We discuss the theory of Poisson vertex algebras and their generalizations in relation to integrability of Hamiltonian PDE. In particular, we discuss the theory of affine classical W-algebras and apply it to construct a large class of…

Let $(R,\mathfrak{m})$ be a Noetherian local ring and $\widehat{R}$ its $\mathfrak{m}$-adic completion. We study the problem of determining when a finitely generated $\widehat{R}$-module arises from an $R$-module, i.e., when it is…

We reprove the results of Jordan [18] and Siebert [31] and show that the Lie algebra of polynomial vector fields on an irreducible affine variety X is simple if and only if X is a smooth variety. Given proof is self-contained and does not…

We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…

Studies on time and memory costs of products in geometric algebra have been limited to cases where multivectors with multiple grades have only non-zero elements. This allows to design efficient algorithms for a generic purpose; however, it…

A correspondence exists between affine tropical varieties and algebraic objects, following the classical Zariski correspondence between irreducible affine varieties and the prime spectrum of the coordinate algebra in affine algebraic…

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

In order to understand the structure of the cohomologies involved in the study of projectively equivariant quantizations, we introduce a notion of affine representation of a Lie algebra.We show how it is related to linear representations…

We develop an elementary method to compute spaces of equivariant maps from a homogeneous space $G/H$ of a Lie group $G$ to a module of this group. The Lie group is not required to be compact. More generally, we study spaces of invariant…

The aim of this paper is to study the behavior of Hodge-theoretic (intersection homology) genera and their associated characteristic classes under proper morphisms of complex algebraic varieties. We obtain formulae that relate (parametrized…

For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

This is a continuation of our work to understand vertex operator algebras using the geometric properties of varieties attached to vertex operator algebras. For a class of vertex operator algebras including affine vertex operator algebras…

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…

The relationship between associative composition algebras of dimensions 2 and 4 within the context of homogeneous spaces, with a particular focus on Hamiltonian quaternions, is explored. In the special case of Hamiltonian quaternions, the…