Related papers: The Combinatorics of Polynomial Functors
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…
We introduce heavily separable functors of the second kind and study them in three different situations. The first of these is with restrictions and extensions of scalars for modules over small preadditive categories. The second is with…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…
In Goodwillie calculus, unpublished work of Dwyer and Rezk provides a classification of reduced filtered colimit preserving $d$-excisive functors from pointed spaces to spectra as spectrum-valued functors on the category of finite sets of…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
We study Translation functors and Wall-Crossing functors on infinite dimensional representations of a complex semisimple Lie algebra using D-modules. This functorial machinery is then used to prove the Endomorphism-theorem and the…
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
In this article we extend evaluations of the Kauffman bracket on regular isotopy classes of knots and links to a variety of functors defined on the category of framed tangles. We show that many such functors exist, and that they correspond…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
We generalize the construction of tensor categories of endomorphisms of a type III factor $M$ associated with a $G$-kernel, from the case of a discrete group $G$ to that of a compact second countable group. Our approach is based on the…
The main purpose of this paper is to introduce a new category, which we call a resonance category, whose combinatorics reflect that of canonical stratifications of $n$-fold symmetric smash products. The study of the stratifications can then…