English
Related papers

Related papers: The List Object Endofunctor is Polynomial

200 papers

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

Combinatorics · Mathematics 2016-01-19 Christian Jäkel

Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…

Category Theory · Mathematics 2007-05-23 David Ellerman

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…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

An (additive) functor F from an additive category A to an additive category B is said to be objective, provided any morphism f in A with F(f) = 0 factors through an object K with F(K) = 0. In this paper we concentrate on triangle functors…

Representation Theory · Mathematics 2015-06-19 Claus Michael Ringel , Pu Zhang

Let $\mathcal F$ be either the set of all bounded holomorphic functions or the set of all $m$-homogeneous polynomials on the unit ball of $\ell\_r$. We give a systematic study of the sets of all $u\in\ell\_r$ for which the monomial…

Functional Analysis · Mathematics 2016-02-01 Frédéric Bayart , Andreas Defant , Sunke Schlüters

We extend the classification of complete polynomial vector fields on C^2 given by Marco Brunella (Topology 43(2): 433-445, 2004) to cover the case of holomorphic (non-polynomial) vector fields whose underlying foliation is however still…

Complex Variables · Mathematics 2010-11-13 Alvaro Bustinduy

Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…

Logic · Mathematics 2023-08-04 Benjamin Castle , Chieu-Minh Tran

In this paper we consider the class of l-bijective C-systems, i.e., C-systems for which the length function is a bijection. The main result of the paper is a construction of an isomorphism between two categories - the category of…

Logic · Mathematics 2015-12-29 Vladimir Voevodsky

We give conditions for when two Euler products are the same given that they satisfy a functional equation and their coefficients are not too large and do not differ from each other by too much. Additionally, we prove a number of…

Number Theory · Mathematics 2025-05-13 David W. Farmer , Ameya Pitale , Nathan C. Ryan , Ralf Schmidt

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

We derive the Taylor polynomial of a function, which is $m$-times continuously differentiable and positive homogeneous of order $m$. The Taylor polynomial in $a$ for $f(b)$ of order $m$ in general is a polynomial of order $m$ in $b-a$. If…

General Mathematics · Mathematics 2024-04-24 Joachim Paulusch , Sebastian Schlütter

The volume conjecture and its generalizations say that the colored Jones polynomial corresponding to the N-dimensional irreducible representation of sl(2;C) of a (hyperbolic) knot evaluated at exp(c/N) grows exponentially with respect to N…

Geometric Topology · Mathematics 2008-04-19 Kazuhiro Hikami , Hitoshi Murakami

Lenses may be characterised as objects in the category of algebras over a monad, however they are often understood instead as morphisms, which propagate updates between systems. Working internally to a category with pullbacks, we define…

Category Theory · Mathematics 2020-09-16 Bryce Clarke

It is well known that to give an oplax functor of bicategories $\mathbf{1}\to\mathscr{C}$ is to give a comonad in $\mathscr{C}$. Here we generalize this fact, replacing the terminal bicategory by any bicategory $\mathscr{A}$ for which the…

Category Theory · Mathematics 2018-05-07 Charles Walker

In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…

Representation Theory · Mathematics 2018-05-22 Eivind Eriksen

We introduce and study a general notion of polynomial functor from a small monoidal symmetric category whose unit is an initial object and give a classification result of polynomial functors of degree smaller of equal to n modulo those of…

Algebraic Topology · Mathematics 2017-06-02 Aurélien Djament , Christine Vespa

The canonical polynomial is an important output of the multivariable topological Poincar\'e series associated with a normal surface singularity. It can be considered as a multivariable polynomial generalization of the Seiberg--Witten…

Geometric Topology · Mathematics 2024-10-18 Tamás László

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…

Category Theory · Mathematics 2014-07-15 Joachim Kock

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

Category Theory · Mathematics 2009-06-01 Panagis Karazeris , Apostolos Matzaris , Jiri Velebil

Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any standard Turing machine, it is possible to…

Computational Complexity · Computer Science 2017-03-31 Bruno Bauwens , Anton Makhlin , Nikolay Vereshchagin , Marius Zimand