Related papers: Discrete density comonads and graph parameters

In the flavour of categorical quantum mechanics, we extend nonlocal games to allow quantum questions and answers, using quantum sets (special symmetric dagger Frobenius algebras) and the quantum functions of Musto, Reutter, and Verdon…

We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied…

This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…

This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…

Condensed mathematics as developed by Clausen and Scholze yields a version of derived functors over the category of continuous $G$-modules for a Hausdorff topological group $G$. We study the resulting notion of group cohomology and its…

In this paper we consider the problem of finding the {\em densest} subset subject to {\em co-matroid constraints}. We are given a {\em monotone supermodular} set function $f$ defined over a universe $U$, and the density of a subset $S$ is…

We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…

We introduce a novel generative formulation of deep probabilistic models implementing "soft" constraints on their function dynamics. In particular, we develop a flexible methodological framework where the modeled functions and derivatives…

We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

This paper concerns a stochastic construction of probabilistic coherent spaces by employing novel ingredients (i) linear exponential comonads arising properly in the measure-theory (ii) continuous orthogonality between measures and…

We obtain combinatorial model categories of parametrised spectra, together with systems of base change Quillen adjunctions associated to maps of parameter spaces. We work with simplicial objects and use Hovey's sequential and symmetric…

Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…

Consider a diagram of quasi-categories that admit and functors that preserve limits or colimits of a fixed shape. We show that any weighted limit whose weight is a projective cofibrant simplicial functor is again a quasi-category admitting…

We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…

In this PhD thesis we will discuss some aspects in Commutative Algebra which have interactions with Algebraic Geometry, Representation Theory and Combinatorics. In particular, in the first chapter we will focus on understanding when certain…