ﻻ يوجد ملخص باللغة العربية
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the variety it represents, and powerful randomized algorithms for computing triangular decompositions using Hensel lifting in the zero-dimensional case and for irreducible varieties. However, in the general case, most of the algorithms computing triangular decompositions produce embedded components, which makes it impossible to directly apply the intrinsic degree bounds. This, in turn, is an obstacle for efficiently applying Hensel lifting due to the higher degrees of the output polynomials and the lower probability of success. In this paper, we give an algorithm to compute an irredundant triangular decomposition of an arbitrary algebraic set $W$ defined by a set of polynomials in C[x_1, x_2, ..., x_n]. Using this irredundant triangular decomposition, we were able to give intrinsic degree bounds for the polynomials appearing in the triangular sets and apply Hensel lifting techniques. Our decomposition algorithm is randomized, and we analyze the probability of success.
We propose an algorithm to compute the GIT-fan for torus actions on affine varieties with symmetries. The algorithm combines computational techniques from commutative algebra, convex geometry and group theory. We have implemented our algorithm in the
Let $mathfrak g$ be a Kac-Moody algebra. We show that every homogeneous right coideal subalgebra $U$ of the multiparameter version of the quantized universal enveloping algebra $U_q(mathfrak{g}),$ $q^m eq 1$ containing all group-like elements has a t
We consider self-injective finite-dimensional graded algebras admitting a triangular decomposition. In a preceding paper, we have shown that the graded module category of such an algebra is a highest weight category and has tilting objects in the sen
In this work we study line arrangements consisting in lines passing through three non aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a Roots-of-Unity-Arrangement
We generalize an example, due to Sylvester, and prove that any monomial of degree $d$ in $mathbb R[x_0, x_1]$, which is not a power of a variable, cannot be written as a linear combination of fewer than $d$ powers of linear forms.