Related papers: Characterizing partitioned assemblies and realizab…

All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…

We use double categories to obtain a single theorem characterizing certain exponentiable morphisms of small categories, topological spaces, locales, and posets.

We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In…

Many ex/reg completions $J:\mathcal C\to\mathcal C_{\rm ex/reg}$ that arise in categorical realizability and tripos theory admit left Kan extensions of arbitrary finitely continuous functors to arbitrary exact categories. This paper…

We recover the rays in the tensor product of Hilbert spaces within a larger class of so called `states of compoundness', structured as a complete lattice with the `state of separation' as its top element. At the base of the construction…

In this paper, we characterize stratifiable (or semi-stratifiable) spaces, and monotonically countably paracompact (or monotonically countably metacompact) spaces by expansions of locally upper bounded semi-continuous poset-valued maps.…

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

With a grading previously introduced by the second-named author, the multiplication maps in the preprojective algebra satisfy a maximal rank property that is similar to the maximal rank property proven by Hochster and Laksov for the…

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

We give a characterization of subsets of effect algebras, that can be embedded into a range of an observable. To give this characterization, we introduce a new notion of {\em compatibility support mappings.}

The present work develops a construction of a CD category of partial kernels from a particular type of Markov category called a partializable Markov category. These are a generalization of earlier models of categories of partial morphisms…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…

Let $A$ be a differential graded algebra with cohomology ring $H^*A$. A graded module over $H^*A$ is called \emph{realisable} if it is (up to direct summands) of the form $H^*M$ for some differential graded $A$-module $M$. Benson, Krause…

In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…

Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…