Related papers: On rectification and enrichment of infinity proper…
Enriched categories are categories whose sets of morphisms are enriched with extra structure. Such categories play a prominent role in the study of higher categories, homotopy theory, and the semantics of programming languages. In this…
Experience shows that the poset of levels (or dimensions) of the topos of presheaves on some elegant Reedy categories may be equipped with a monotone increasing `successor' function which, as the case of simplicial sets shows, is different…
In this paper, we introduce a new notion of algebra over a linear $\infty$-operad and a corresponding notion of coalgebra over an $\infty$-cooperad. We next extend the Koszul duality between linear $\infty$-operads and linear…
We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
Considering uniform hypergraphs, we prove that for every non-negative integer $h$ there exist two non-negative integers $k$ and $t$ with $k\leq t$ such that two $h$-uniform hypergraphs ${\mathcal H}$ and ${\mathcal H}'$ on the same set $V$…
We describe a category of Feynman graphs and show how it relates to compact symmetric multicategories (coloured modular operads) just as linear orders relate to categories and rooted trees relate to multicategories. More specifically we…
In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the complementary graph entropy $\overline{H}$ of the characteristic graph. It has no single-letter formula, except for perfect graphs, for the pentagon…
Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h, let r_{A}(n,h) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,..., a_h are elements of A and…
We prove that topological Hochschild homology (THH) arises from a presheaf of circles on a certain combinatorial category, which gives a universal construction of THH for any enriched infinity category. Our results rely crucially on an…
In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
Throughout the paper, an analytic field means a non-archimedean complete real-valued one, and our main objective is to extend to these fields the basic theory of transcendental extensions. One easily introduces a topological analogue of the…
As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an…
We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We develop a theory of weighted colimits in the framework of weakly bienriched $\infty$-categories, an extension of Lurie's notion of enriched $\infty$-categories. We prove an existence result for weighted colimits, study weighted colimits…
An old result of M\"uller and R\"odl states that a countable graph $G$ has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of $G$ by positive integers, an infinite increasing path can be found. They…