Related papers: Rule Algebras for Adhesive Categories
Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice…
We develop the theory of double multiplicative Poisson vertex algebras. These structures, defined at the level of associative algebras, are shown to be such that they induce a classical structure of multiplicative Poisson vertex algebra on…
We study diverse parametrized versions of the operad of associative algebra, where the parameter are taken in an associative semigroup $\Omega$ (generalization of matching or family associative algebras) or in its cartesian square…
In this paper, we prove a structure theorem for the infinite union of $n$-adic doubling measures via techniques which involve far numbers. Our approach extends the results of Wu in 1998, and as a by product, we also prove a classification…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
In this paper, we extend the investigation of four-dimensional partially alternative algebras $\mathcal A$ initiated in \cite{HNT}. The partial alternativity condition, a natural generalization of the alternativity axiom, broadens the class…
A double Poisson bracket, in the sense of M. Van den Bergh, is an operation on an associative algebra $A$ which induces a Poisson bracket on each representation space $\operatorname{Rep}(A,n)$ in an explicit way. In this note, we study the…
Assembly theory has received considerable attention in the recent past. Here we analyze the formal framework of this model and show that assembly pathways coincide with certain minimal hyperpaths in B-hypergraphs. This makes it possible to…
We consider existential rules (aka Datalog+) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these…
A two-parameter family of discrete-time exactly-solvable exclusion processes on a one-dimensional lattice is introduced, which contains the asymmetric simple exclusion process and the drop-push model as particular cases. The process is…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
Diffusion policies have recently emerged as a powerful class of visuomotor controllers for robot manipulation, offering stable training and expressive multi-modal action modeling. However, existing approaches typically treat action…
Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…
The practical applications of diffusion models have been limited by the misalignment between generated images and corresponding text prompts. Recent studies have introduced direct preference optimization (DPO) to enhance the alignment of…
The $\lambda$-differential operators and modified $\lambda$-differential operators are generalizations of classical differential operators. This paper introduces the notions of $\lambda$-differential Poisson ($\lambda$-DP for short)…
Modeling the complex relationships between multiple categorical response variables as a function of predictors is a fundamental task in the analysis of categorical data. However, existing methods can be difficult to interpret and may lack…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
A discriminative structured analysis dictionary is proposed for the classification task. A structure of the union of subspaces (UoS) is integrated into the conventional analysis dictionary learning to enhance the capability of…
With recent dramatic increases in AI system capabilities, there has been growing interest in utilizing machine learning for reasoning-heavy, quantitative tasks, particularly mathematics. While there are many resources capturing mathematics…
Drazin inverses are a fundamental algebraic structure which have been extensively deployed in semigroup theory, ring theory, and matrix theory. Drazin inverses can also be defined for endomorphisms in any category. However, beyond a paper…