Related papers: No-Go Theorems for Distributive Laws
The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…
Composite theories are the algebraic equivalent of distributive laws. In this paper, we delve into the details of this correspondence and concretely show how to construct a composite theory from a distributive law and vice versa. Using term…
Subgraphs such as cliques, loops and stars form crucial connections in the topologies of real-world networks. Random graph models provide estimates for how often certain subgraphs appear, which in turn can be tested against real-world…
The Newcomb-Benford Law, which is also called the first digit phenomenon, has applications in diverse phenomena ranging from social and computer networks, engineering systems, natural sciences, and accounting. In forensics, it has been used…
A general theorem on conservation laws for arbitrary difference equations is proved. The theorem is based on an introduction of an adjoint system related with a given difference system, and it does not require the existence of a difference…
Some formats of well-behaved operational specifications, correspond to natural transformations of certain types (for example, GSOS and coGSOS laws). These transformations have a common generalization: distributive laws of monads over…
Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and…
This article provides a brief overview on a range of basic dynamical systems that conform to the logarithmic distribution of significant digits known as Benford's law. As presented here, most theorems are special cases of known, more…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
Dempster-Shafer theory of evidence is widely applied to uncertainty modelling and knowledge reasoning because of its advantages in dealing with uncertain information. But some conditions or requirements, such as exclusiveness hypothesis and…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
The family of Boltzmann distributions is used in statistical mechanics to describe the distribution of states in systems with a given temperature. We give a novel characterization of this family as the unique one satisfying independence for…
Norms, defined as generally accepted behaviour in societies without central authority (and thus distinguished from laws), are very powerful mechanism leading to coherent behaviour of the society members. This paper examines, within a simple…
We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax…
The missing mass problem has not been solved decisively yet. Observations show that if gravity is to be modified, then the MOND theory is its excellent approximation on galactic scales. MOND suggests an adjustments of the laws of physics in…
We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…
Distributed certification, whether it be proof-labeling schemes, locally checkable proofs, etc., deals with the issue of certifying the legality of a distributed system with respect to a given boolean predicate. A certificate is assigned to…
Benford's law is a famous law in statistics which states that the leading digits of random variables in diverse data sets appear not uniformly from 1 to 9; the probability that d (d=1,...,9) appears as a leading digit is given by…
The occurrence of digits 1 through 9 as the leftmost nonzero digit of numbers from real-world sources is distributed unevenly according to an empirical law, known as Benford's law or the first digit law. It remains obscure why a variety of…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…