In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...