Related papers: Discrete density comonads and graph parameters
Despite their success in various domains, the growing dependence on GNNs raises a critical concern about the nature of the combinatorial reasoning underlying their predictions, which is often hidden within their black-box architectures.…
In the study of computational effects, it is important to consider the notion of computational effects with parameters. The need of such a notion arises when, for example, statically estimating the range of effects caused by a program, or…
We consider representations of quivers taking values in monads or comonads over a Grothendieck category $\mathcal C$. We treat these as scheme like objects whose ``structure sheaf'' consists of monads or comonads. By using systems of…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
This paper extends the theory of universal measuring comonoids to modules and comodules in braided monoidal categories. We generalise the universal measuring comodule Q(M,N), originally introduced for modules over k-algebras when k is a…
Bisimilarity as an equivalence notion of systems has been central to process theory. Due to the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.), bisimilarity has been extended in various ways:…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…
Commutativity gadgets provide a technique for lifting classical reductions between constraint satisfaction problems to quantum-sound reductions between the corresponding nonlocal games. We develop a general framework for commutativity…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
One way of interpreting a left Kan extension is as taking a kind of "partial colimit", whereby one replaces parts of a diagram by their colimits. We make this intuition precise by means of the "partial evaluations" sitting in the so-called…
Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…
We study continuous bounded cohomology of totally disconnected locally compact groups with coefficients in a non-Archimedean valued field $K$. To capture the features of classical amenability that induce the vanishing of real bounded…
It is well known that Barr and Beck's definition of comonadic homology makes sense also with a functor of coefficients taking values in a semi-abelian category instead of an abelian one. The question arises whether such a homology theory…
A classical result due to Lovasz (1967) shows that the isomorphism type of a graph is determined by homomorphism counts. That is, graphs G and H are isomorphic whenever the number of homomorphisms from K to G is the same as the number of…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…