Related papers: Polygraphs and Discrete Conduch{\'e} $\omega$-Func…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
We define the monoidal category $(Poly_E,y,\triangleleft)$ of polynomials under composition in any category $E$ with finite limits, including both cartesian and vertical morphisms of polynomials, and generalize to this setting the Dirichlet…
A digraph $D$ is an efficient closed domination digraph if there exists a subset $S$ of $V(D)$ for which the closed out-neighborhoods centered in vertices of $S$ form a partition of $V(D)$. In this work we deal with efficient closed…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
The concept of a morphism determined by an object provides a method to construct or classify morphisms in a fixed category. We show that this works particularly well for triangulated categories having Serre duality. Another application of…
A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…
We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…
A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…
There are several ways to construct omega-categories from combinatorial objects such as pasting schemes or parity complexes. We make these constructions into a functor on a category of chain complexes with additional structure, which we…
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed in \cite{Yoshinaga2015} that two finite graphs have isomorphic chromatic functors if and only if they have the same chromatic…
We prove the functoriality for proper push-forward of the characteristic cycles of constructible complexes by morphisms of smooth projective schemes over a perfect field, under the assumption that the direct image of the singular support…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We consider convergence sets of formal power series of the form $f(z,t)=\sum_{n=0}^{\infty} f_n(z)t^n$, where $f_n(z)$ are holomorphic functions on a domain $\Omega$ in $\mathbb{C}$. A subset $E$ of $\Omega$ is said to be a convergence set…
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…
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,…