相关论文: Multialternating graded polynomials and growth of …
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…
We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.
We compute the graded polynomial identities and its graded codimension sequence for the elementary gradings of the Lie algebra of upper triangular matrices of order 3.
Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
We show that there exists a constant K such that for any PI- algebra W and any nondegenerate G-grading on W where G is any group (possibly infinite), there exists an abelian subgroup U of G with $[G : U] \leq exp(W)^K$. A G-grading $W =…
Denote by C_{n,d} the nilpotency degree of a relatively free algebra generated by d elements and satisfying the identity x^n=0. Under assumption that the characteristic p of the base field is greater than n/2, it is shown that…
We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.
We define a generalization $\mathfrak{G}$ of the Grassmann algebra $G$ which is well-behaved over arbitrary commutative rings $C$, even when $2$ is not invertible. In particular, this enables us to define a notion of superalgebras that does…
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has…
J. G. Thompson showed that a finite group G is solvable if and only if every two -generated subgroup is solvable. Recently, Grunevald, Kunyavskii, Nikolova, and Plotkin have shown that the analogue holds for finite-dimensional Lie algebras…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
Assume that $\mathcal{A}$ is a cochain DG polynomial algebra such that its underlying graded algebra $\mathcal{A}^{#}$ is a polynomial algebra generated by $n$ degree $1$ elements. We determine the DG Krull dimension, the global dimension,…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…