English
Related papers

Related papers: Strict polynomial functors and multisets

200 papers

We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…

Category Theory · Mathematics 2021-12-07 A. Silantyev

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

Category Theory · Mathematics 2015-05-13 Qimh Richey Xantcha

Clifford theory establishes a relation between the representation theory of a finite group and its normal subgroups. In this paper, we establish the Clifford theory for the modular representations of finite groups. The proofs are based on…

Representation Theory · Mathematics 2025-03-05 Devjani Basu

Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl , Dan Marsden , Nihil Shah

The main properties of hypercomplex generalization of quaternion system as antiquaternion are presented in this article. Definitions and studied of antiquaternions conjugation are introduced, their norm and zero divisor, and how to perform…

Numerical Analysis · Computer Science 2014-06-16 Yakiv O. Kalinovsky , Dmitry V. Lande , Dr. Sc. , Yuliya E. Boyarinova , Alina S. Turenko

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

Quantum Algebra · Mathematics 2010-01-20 W. Baratta

We show that single-variable polynomial functors over the category $\mathcal{S}$ of infinity groupoids, as defined by Gepner-Haugseng-Kock, are exactly colimits of representable copresheaves indexed by infinity groupoid. This allows us to…

Algebraic Topology · Mathematics 2026-02-02 Kun Chen

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Classical Analysis and ODEs · Mathematics 2020-09-28 Soham Basu

We study finiteness properties, especially the noetherian property, the Krull dimension and a variation of finite presentation, in categories of polynomial functors from a small symmetric monoidal category whose unit is an initial object to…

Algebraic Topology · Mathematics 2015-07-30 Aurélien Djament

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

Combinatorics · Mathematics 2008-03-18 Francois Descouens , Hideaki Morita , Yasuhide Numata

In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the…

Logic in Computer Science · Computer Science 2017-10-11 Richard Garner , Tom Hirschowitz

We categorify cocompleteness results of monad theory, in the context of pseudomonads. We first prove a general result establishing that, in any 2-category, weighted bicolimits can be constructed from oplax bicolimits and bicoequalizers of…

Category Theory · Mathematics 2023-02-15 Axel Osmond

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Category Theory · Mathematics 2012-01-18 Charles Grellois

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

Classical Analysis and ODEs · Mathematics 2007-12-04 Luc Vinet , Alexei Zhedanov

A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of…

Algebraic Geometry · Mathematics 2022-05-04 Arthur Bik , Alessandro Danelon , Jan Draisma , Rob H. Eggermont

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

Logic in Computer Science · Computer Science 2013-10-02 Paul-André Melliès , Noam Zeilberger

We introduce a new functor category: the category $\mathcal{P}_{d,n}$ of strict polynomial functors with bounded by $n$ domain of degree $d$ over a field of characteristic $p>0$. It is equivalent to the category of finite dimensional…

Representation Theory · Mathematics 2022-08-16 Marcin Chałupnik , Patryk Jaśniewski

We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…

Representation Theory · Mathematics 2011-08-30 J. F. van Diejen , E. Emsiz

We study polynomial functors in the incompressible category $\text{Ver}_4^+$, which can be viewed as super polynomial functors in characteristic 2. Concretely, we classify additive, exact and simple polynomial functors, and describe how…

Representation Theory · Mathematics 2026-03-16 Kevin Coulembier , Serina Hu

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…

Logic in Computer Science · Computer Science 2021-12-30 Eric Finster , Samuel Mimram , Maxime Lucas , Thomas Seiller