相关论文: Two-sorted algebraic decompositions of Brookes's s…
Compositional representations are thought to enable humans to generalize across combinatorially vast state spaces. Models with learnable object slots, which encode information about objects in separate latent codes, have shown promise for…
We show for bicommutative graded connected Hopf algebras that a certain distributive (Laplace) subgroup of the convolution monoid of 2-cochains parameterizes certain well behaved Hopf algebra deformations. Using the Laplace group, or its…
In distributed classification, each learner observes its environment and deduces a classifier. As a learner has only a local view of its environment, classifiers can be exchanged among the learners and integrated, or merged, to improve…
We identify Melrose's suspended algebra of pseudodifferential operators with a subalgebra of the algebra of parametric pseudodifferential operators with parameter space $\R$. For a general algebra of parametric pseudodifferential operators,…
This paper presents a block-structured formulation of Operator Inference as a way to learn structured reduced-order models for multiphysics systems. The approach specifies the governing equation structure for each physics component and the…
Recursive reasoning systems alternate between acquiring new evidence and refining an accumulated understanding. Two design choices are typically left implicit: how to represent the evolving reasoning state, and when to stop iterating. This…
We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing…
Within the framework of Gaussian graphical models, a prior distribution for the underlying graph is introduced to induce a block structure in the adjacency matrix of the graph and learning relationships between fixed groups of variables. A…
In this work we present a coupled-cluster theory for the propagation of multireference electronic systems initiating at general quantum mechanical states. Our formalism is based on the infinitesimal analysis of modified cluster operators,…
We present a model for exact recursive Bayesian filtering based on lifted multiset states. Combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to…
In this paper we study an one-dimensional two-species exclusion model with open boundaries. The model consists of two types of particles moving in opposite directions on an open lattice. Two adjacent particles swap their positions with rate…
We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which…
The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages. In abstract GSOS, bisimilarity is always a…
This paper continues the study of decompositions of a smooth 4-manifold into two handlebodies with handles of index $\leq2$. Part I gave existence results in terms of spines and chain complexes over the fundamental group of the ambient…
We revisit the duality between Kripke and algebraic semantics of intuitionistic and intuitionistic modal logic. We find that there is a certain mismatch between the two semantics, which means that not all algebraic models can be embedded…
The Gibbs Mixing Paradox is a conceptual touchstone for understanding mixtures in statistical mechanics. While debates over the theoretical subtleties of particle distinguishability continue to this day, we seek to extend the discussion in…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…
Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous pi-calculus are used as locks. Our calculus also features a construct to deallocate a lock once we know that…