Related papers: Polynomial Functors of Modules
In this note, we study the arithmetic nature of values of modular functions, meromorphic modular forms and meromorphic quasi-modular forms with respect to arbitrary congruence subgroups, that have algebraic Fourier coefficients. This…
We can define a module to be an exact functor on a small abelian category. This is explained and shown to be equivalent to the usual definition but it does offer a different perspective, inspired by the notions from model theory of…
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…
Unstable operations in a generalized cohomology theory E give rise to a functor from the category of algebras over E to itself which is a colimit of representable functors and a comonoid with respect to composition of such functors. In this…
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
With the goal of providing the foundations for a rigorous study of modules of bicomplex holomorphic functions, we develop a general theory of functional analysis with bicomplex scalars. Even though the basic properties of bicomplex number…
The theory developed by Gambino and Kock, of polynomials over a locally cartesian closed category E, is generalised for E just having pullbacks. The 2-categorical analogue of the theory of polynomials and polynomial functors is given, and…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
We give a description of simple functors taking finitely generated values, from a small additive category to the category of vector spaces over a field. This result is analogous to Steinberg's tensor product theorems in group representation…
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…
In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…
We introduce a notion of generalized modular functors with Hilbert spaces of infinite dimension in general, and show that a generalized modular functor with data of conformal dimensions determines uniquely wave functions as its flat…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
This paper has been withdrawn and replaced by arXiv:1309.5035. In this paper we describe some examples of so called spherical functors between triangulated categories, which generalize the notion of a spherical object. We also give…
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 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…