Related papers: On some properties of polynomial composites
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
Idempotents dominate the structure theory of rings. The Peirce decomposition induced by an idempotent provides a natural environment for defining and classifying new types of rings. This point of view offers a way to unify and to expand the…
We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…
Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…
Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…
We develop a diagrammatic categorification of the polynomial ring $Z[x]$. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to $x^n$ and…
We introduce Courant algebroids, providing definitions, some historical notes, and some elementary properties. Next, we summarize basic properties of graded manifolds. Then, drawing on the work of Roytenberg and others, we introduce the…
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…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…
When considering the unit group of $\mathcal{O}_F G$ ($\mathcal{O}_F$ the ring of integers of an abelian number field $F$ and a finite group $G$) certain components in the Wedderburn decomposition of $FG$ cause problems for known generic…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
We address some questions concerning indecomposable polynomials and their spectrum. How does the spectrum behave via reduction or specialization, or via a more general ring morphism? Are the indecomposability properties equivalent over a…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
In this paper, we gave some properties of binomial coefficient.
Cohomology and deformation theories are developed for Poisson algebras starting with the more general concept of a Leibniz pair, namely of an associative algebra $A$ together with a Lie algebra $L$ mapped into the derivations of $A$. A…
As a generalisation of Graham and Lehrer's cellular algebras, affine cellular algebras have been introduced in [12] in order to treat affine versions of diagram algebras like affine Hecke algebras of type A and affine Temperley-Lieb…
We compute the class group of a full rank upper cluster algebra in terms of its exchange polynomials. As a corollary, we recover a theorem by Cao, Keller, and Qin from 2023 characterizing the UFDs among these algebras. Furthermore, under…
Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this…
Motivated by the work of Koornwinder, Macdonald, Cherednik, Noumi, and van Diejen we define a 6-parameter double affine Hecke algebra and establish its basic structural properties, including the existence of an involution. We relate the…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…