Related papers: A Constructive Characterization of Solvable Polyno…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
The paper is devoted to the so-called complete Leibniz algebras. It is known that a Lie algebra with a complete ideal is split. We will prove that this result is valid for Leibniz algebras whose complete ideal is a solvable algebra such…
We give closed formulas for all vectors of the canonical basis of a level 2 irreducible integrable representation of $U_v(sl_\infty)$. These formulas coincide at v=1 with Lusztig's formulas for the constructible characters of the…
In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…
We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.
We study the Onsager algebra from the ideal theoretic point of view. A complete classification of closed ideals and the structure of quotient algebras are obtained. We also discuss the solvable algebra aspect of the Onsager algebra through…
The main properties of indefinite Kac-Moody and Borcherds algebras, considered in a unified way as Lorentzian algebras, are reviewed. The connection with the conformal field theory of the vertex operator construction is discussed. By the…
In this paper solvable Leibniz algebras with naturally graded non-Lie $p$-filiform $(n-p\geq4)$ nilradical and with one-dimensional complemented space of nilradical are described. Moreover, solvable Leibniz algebras with abelian nilradical…
In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
In this paper we classify solvable Leibniz algebras whose nilradical is a null-filiform algebra. We extend the obtained classification to the case when the solvable Leibniz algebra is decomposed as a direct sum of its nilradical, which is a…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…