Factorization in Quantum Planes

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we use the information about prime factorization of the values taken by such polynomials at sufficiently large integer arguments along with the information about their root location in the complex plane. Further, these techniques are extended ...

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility as power series. Moreover, if a polynomial is reducible over Z[[x]], we provide an explicit factorization algorithm. For polynomials whose constant term is a prime power, our study leads to the discussion of p-adic integers.

Let $A$ denote the commutative polynomial ring in $n$ variables, over an algebraically closed field $k$, and let $R$ denote the standard multiparameter quantization of $A$ determined by a multiplicatively antisymmetric $n\times n$ matrix $(q_{ij})$. In this paper we prove, when -1 cannot be multiplicatively generated by the $q_{ij}$, that the primitive spectrum of $R$ is a topological quotient of $k^n$. Under the same hypothesis, we further prove that the prime spectrum of $R...

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a polynomial ideal is maximal). Checking that a polynomial is irreducible by factorizing it is unsatisfactory because it requires trusting a relatively large and complicated program (whose correctness cannot easily be verified). We present a pr...

We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we relate our theorem and the use of concrete material with some well know factoring methods for quadratic polynomial with integer coeficients.

This paper consists of three parts: (I) To develop general theory of a (large) class of central simple finite dimensional algebras and answering some natural questions about them (that in general situation it is not even clear how to approach them, and the Brauer group is a step in the right directions), (II) To introduce and develop general theory of a large class of rings, PLM-rings, (intuitively, they are the most general form of Quillen' Lemma), and (III) to apply these r...

We determine explicit quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centers and block diagonal forms {of these algebras.} In the case where $q$ is {an arbitrary} root of unity, this further determines the degrees.

We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations in small dimensions.

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much harder problem. This paper reports work-in-progress to do such verification in Lean.

The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier transform. This Fourier transform can be considered as a two-parameter extension, with a quadratic term, of the usual discrete Fourier transform. In the case where the two parameters are taken to be equal to zero, the quadratic discrete Fouri...