Related papers: Polygraphs and Discrete Conduch{\'e} $\omega$-Func…

In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…

A variant of the trace in a monoidal category is given in the setting of closed monoidal derivators, which is applicable to endomorphisms of fiberwise dualizable objects. Functoriality of this trace is established. As an application, an…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

In the group of polynomial automorphisms of the plane, the conjugacy class of an element is closed if and only if the element is diagonalisable. In this article, we show that this does not hold for the group of special automorphisms, giving…

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…

We construct new families of discrete vector orthogonal polynomials that have the property to be eigenfunctions of some difference operator. They are extensions of Charlier, Meixner and Kravchuk polynomial systems. The ideas behind our…

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…

The aim of this paper is to study the behavior of Hodge-theoretic (intersection homology) genera and their associated characteristic classes under proper morphisms of complex algebraic varieties. We obtain formulae that relate (parametrized…

In this paper we show that an affine space is determined by the abstract group structure of its group of regular automorphisms in the category of connected affine varieties. To prove this we study commutative subgroups of the group of…

Given a right adjoint functor between triangulated categories and an object in the target category, we show that the unit map of adjunction on that object is a split monomorphism if and only if the object belongs to the additive closure of…

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…

We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…

We build a concrete and natural model for the strict 2-category of orbifolds. In particular we prove that if one localizes the 2-category of proper etale Lie groupoids at a class of 1-arrows that we call "covers", then the strict 2-category…

This monograph is about discrete energy minimization for discrete graphical models. It considers graphical models, or, more precisely, maximum a posteriori inference for graphical models, purely as a combinatorial optimization problem.…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Let $(G, \omega)$ be a hyperelliptic vertex-weighted graph of genus $g \geq 2$. We give a characterization of $(G, \omega)$ for which there exists a smooth projective curve $X$ of genus $g$ over a complete discrete valuation field with…