相关论文: Groebner basis and the Anick resolution for U_K(sl…

We apply discrete algebraic Morse theory to calculate the Anick resolution of the group algebra of the group $G_3^2$. As a corollary, we evaluate Hochschild cohomologies of $G_3^2$ with coefficients in all 1-dimensional bimodules. Almost…

We prove that applying a projective functor to a holonomic simple module over a semi-simple finite dimensional complex Lie algebra produces a module that has an essential semi-simple submodule of finite length. This implies that holonomic…

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…

We prove the existence of a new algorithm for 3-sphere recognition based on Groebner basis methods applied to the variety of $\text{\em SL}(2,\C)$-representation of the fundamental group. An essential input is a recent result of the second…

We study the category of Z^l-graded modules with finite-dimensional graded pieces for certain Z+^l-graded Lie algebras. We also consider certain Serre subcategories with finitely many isomorphism classes of simple objects. We construct…

We use the Clemens-Griffiths method to construct smooth projective threefolds, over any field $k$ admitting a separable quadratic extension, that are $k$-unirational and $\bar{k}$-rational but not $k$-rational. When $k=\mathbb{R}$, we can…

For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…

Denote by $P_k$ the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$ over the prime field of two elements, $\mathbb F_2$, with the degree of each $x_i$ being 1. We study the Peterson hit problem of determining a minimal set of…

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

Let $k$ be an arbitrary field. We study a general method to solve the subfield problem of generic polynomials for the symmetric groups over $k$ via Tschirnhausen transformation. Based on the general result in the former part, we give an…

This article undertakes an exploration of simple modules of 3-cyclic quantum Weyl algebra at roots of unity. Under the roots of unity assumption, the algebra becomes a Polynomial Identity algebra and the vector space dimension of the simple…

The rate of a standard graded $K$-algebra $A$ is a measure of the growth of the shifts in a minimal free resolution of $K$ as an $A$-module. In particular $A$ has rate one if and only if it is Koszul. It is known that a generic Artinian…

We investigate the differentiability of minimal average energy associated to the functionals $S_\ep (u) = \int_{\mathbb{R}^d} (1/2)|\nabla u|^2 + \ep V(x,u)\, dx$, using numerical and perturbative methods. We use the Sobolev gradient…

Let $\mathfrak{g}$ be a complex simple Lie algebra and $U_q(\hat{\mathfrak{g}})$ the corresponding quantum affine algebra. We prove that every irreducible finite-dimensional $U_q(\hat{\mathfrak{g}})$-module gives rise to a family of…

This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic formulas. Second, complex trigonometric functions are assigned to the variables in the elementary algebraic formulas, and…

We describe a simple algorithm for computing the canonical basis of any finite-dimensional $U_{q}(sp_{2n})$-module.

We construct an approximate trivializing map by using a Schwinger-Dyson equation. The advantage of this method is that: (1) The basis for the flow kernel can be chosen arbitrarily by hand. (2) It can be applied to the general action of…

We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with…

In this note, we discuss the choice of radial grid in the numerical resolution of the Schroedinger equation. We detail the transformation of the equation resulting from a change of variable and function for a generic radial grid, using…

Let $\mathbb{K}$ be a field and $n$ be a positive integer. Let $\Gamma =([n], E)$ be a simple graph, where $[n]=\{1,\ldots, n\}$. If $S=\mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n]$ is a polynomial ring, then the graded ideal \[…