Related papers: Ramsey degrees and entropy of combinatorial struct…
The division by N! in the expression of statistical entropy is usually justified to students by the statement that classical particles should be counted as indistinguishable. Sometimes, quantum indistinguishability is invoked to explain it.…
We review and generalize the recently introduced framework of entropy vectors for detecting and quantifying genuine multipartite entanglement in high dimensional multicomponent quantum systems. We show that these ideas can be extended to…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
Let $\Lambda$ be a complex manifold and let $(f_\lambda)_{\lambda\in \Lambda}$ be a holomorphic family of rational maps of degree $d\geq 2$ of $\mathbb{P}^1$. We define a natural notion of entropy of bifurcation, mimicking the classical…
A combinatorial theory of associative $n$-categories has recently been proposed, with strictly associative and unital composition in all dimensions, and the weak structure arising as a combinatorial notion of homotopy with a natural…
In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between…
We introduce the notion of a {\it semi-retraction}. Given two structures $\A$ and $\B$, $\A$ is a semi-retraction of $\B$ if there exist quantifier-free type respecting maps $f: \B \raw \A$ and $g: \A \raw \B$ such that $f \circ g$ is an…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…
In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^\omega$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^\omega$, viewed as a topological space, has finite big Ramsey…
We prove a new characterization of the Ramsey property of categories in terms of a generalized form of K\H{o}nig's tree lemma. Afterwards, we discuss its applications to structural Ramsey theory. In particular, we provide a new proof of the…
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erd\H{o}s-R\'enyi-type model for random monomial ideals…
The combinatorial basis of entropy by Boltzmann can be written $H= {N}^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy of a system, per unit entity, $N$ is the number of entities and $\mathbb{W}$ is the number of ways in which…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Logical entropy gives a measure, in the sense of measure theory, of the distinctions of a given partition of a set, an idea that can be naturally generalized to classical probability distributions. Here, we analyze how fundamental concepts…
Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…
Complex systems are characterised by a tight, nontrivial interplay of their constituents, which gives rise to a multi-scale spectrum of emergent properties. In this scenario, it is practically and conceptually difficult to identify those…
Stochastic blockmodels are generative network models where the vertices are separated into discrete groups, and the probability of an edge existing between two vertices is determined solely by their group membership. In this paper, we…
We investigate causal inference in the asymptotic regime as the number of variables approaches infinity using an information-theoretic framework. We define structural entropy of a causal model in terms of its description complexity measured…