No Arabic abstract
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 Singular library gitfan.lib. Using our implementation, we compute the Mori chamber decomposition of the cone of movable divisors of $bar{M}_{0,6}$.
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 triangular decomposition $U=U^-otimes_{{bf k}[F]} {bf k}[H] otimes_{{bf k}[G]} U^+$, where $U^-$ and $ U^+$ are right coideal subalgebras of negative and positive quantum Borel subalgebras. However if $ U_1$ and $ U_2$ are arbitrary right coideal subalgebras of respectively positive and negative quantum Borel subalgebras, then the triangular composition $ U_2otimes_{{bf k}[F]} {bf k}[H]otimes_{{bf k}[G]} U_1$ is a right coideal but not necessary a subalgebra. Using a recent combinatorial classification of right coideal subalgebras of the quantum Borel algebra $U_q^+(mathfrak{so}_{2n+1}),$ we find a necessary condition for the triangular composition to be a right coideal subalgebra of $U_q(mathfrak{so}_{2n+1}).$ If $q$ has a finite multiplicative order $t>4,$ similar results remain valid for homogeneous right coideal subalgebras of the multiparameter version of the small Lusztig quantum groups $u_q({frak g}),$ $u_q(frak{so}_{2n+1}).$
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 sense of Ringel. In this paper we focus on the degree zero part of the algebra, the core of the algebra. We show that the core captures essentially all relevant information about the graded representation theory. Using tilting theory, we show that the core is cellular. We then describe a canonical construction of a highest weight cover, in the sense of Rouquier, of this cellular algebra using a finite subquotient of the highest weight category. Thus, beginning with a self-injective graded algebra admitting a triangular decomposition, we canonically construct a quasi-hereditary algebra which encodes key information, such as graded multiplicities, of the original algebra. Our results are general and apply to a wide variety of examples, including restricted enveloping algebras, Lusztigs small quantum groups, hyperalgebras, finite quantum groups, and restricted rational Cherednik algebras. We expect that the cell modules and quasi-hereditary algebras introduced here will provide a new way of understanding these important examples.
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, which is a particular class of triangular arrangements. Among these Roots-of Unity-Arrangements we characterize the free ones and show that Teraos conjecture holds for this family. Finally, we give two triangular arrangements having the same weak combinatorics, such that one is free but the other one is not.
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.