Related papers: Polynomial functors in $\text{Ver}_4^+$

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…

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…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

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 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…

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…

A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…

We investigate fundamental properties of adjoint functors to the precomposition functor in the category of strict polynomial functors.

All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

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…

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

We compare derived categories of the category of strict polynomial functors over a finite field and the category of ordinary endofunctors on the category of vector spaces. We introduce two intermediate categories: the category of…

We introduce super-analogues of the Schur functors defined by Akin, Buchsbaum and Weyman. These {\em Schur superfunctors} may be viewed as characteristic-free analogues of the finite dimensional atypical irreducible modules over the Lie…