Related papers: Theta Theory: operads and coloring
Fluid mixtures, such as the cellular cytoplasm and synthetic DNA nanostars, can spontaneously compartmentalize into many coexisting phases through liquid-liquid phase separation. Despite the diversity of fluid structures that emerge from…
Self-organization creates new order and shifts sub-boundaries while reorganizing energy and entropy within a control volume. This article examines pathway selection and tests whether maximizing the entropy generation rate can forecast…
We introduce an operad of formal fractions, abstracted from the Mould operads and containing both the Dendriform and the Tridendriform operads. We consider the smallest set-operad contained in this operad and containing four specific…
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…
Neural language models exhibit impressive performance on a variety of tasks, but their internal reasoning may be difficult to understand. Prior art aims to uncover meaningful properties within model representations via probes, but it is…
We study properties of differential graded (dg) operads modulo weak equivalences, that is, modulo the relation given by the existence of a chain of dg operad maps inducing a homology isomorphism. This approach, naturally arising in string…
A unified theory of language combines a Bayesian cognitive linguistic model of language processing, with the proposal that language evolved by sexual selection for the display of intelligence. The theory accounts for the major facts of…
A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators $\mathfrak{G}$…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
Model merging combines fine-tuned checkpoints into a single multi-task model without retraining. Existing methods - such as task arithmetic, model soups, TIES, and DARE - are computationally efficient and empirically successful, but rely on…
An outline and summary of four new potential applications of category theory to OOP research are presented. These include (1) the use of operads to model Java subtyping, (2) the use of Yoneda's lemma and representable functors in the…
A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…
Recent work on permutation-based model merging has shown impressive low- or zero-barrier mode connectivity between models from completely different initializations. However, this line of work has not yet extended to the Transformer…
The idea of the work is to find an invariant way to pass from deformation theory to cohomology, which does not use any explicit cocycles. The appropriate cohomology theory is based on considering sheaves on a certain site. An advantage of…
We study cobordisms of a class of topological operads called ``manifold operads''. These operads are generalizations of the Fulton-MacPherson operad: an operad built from configurations of points in Euclidean space. Cobordism of manifold…
We introduce a novel perspective by linking ordered probabilistic choice to copula theory, a mathematical framework for modeling dependencies in multivariate distributions. Each representation of ordered probabilistic choice behavior can be…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
We extend the rational homotopy theory of operads developed by B. Fresse to several types of modules over operads.
This paper presents the benefits of formal modelling and verification techniques for self-stabilising distributed algorithms. An algorithm is studied, that takes a set of processes connected by a tree topology and converts it to a ring…
In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree Delta, a Delta + 1 coloring is the…