相关论文: Functorial Properties of the Reticulation of a Uni…

With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…

Decomposing a deep neural network's learned representations into interpretable features could greatly enhance its safety and reliability. To better understand features, we adopt a geometric perspective, viewing them as a learned coordinate…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

Referring image segmentation is an advanced semantic segmentation task where target is not a predefined class but is described in natural language. Most of existing methods for this task rely heavily on convolutional neural networks, which…

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

In this paper, we introduce the notion of a pseudo-irreducible filter in a residuated lattice and compare this concept with related notions such as prime and maximal filters. Then, we recall the Boolean lifting property for filters and…

Suppose that f is a projective birational morphism with at most one-dimensional fibres between d-dimensional varieties X and Y, satisfying ${\bf R}f_* \mathcal{O}_X = \mathcal{O}_Y$. Consider the locus L in Y over which f is not an…

We introduce a use of the \(M\)-cover (or \(M\)-layer) transform for machine learning. The method replicates a model \(M\) times, but instead of coupling the copies through parameter averaging or an explicit attractive force, as in…

We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…

The pull-back, push-forward and multiplication of smooth functions can be extended to distributions if their wave front set satisfies some conditions. Thus, it is natural to investigate the topological properties of these operations between…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…

We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…

We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…

Highest-weight representations of infinite dimensional Lie algebras and Hilbert schemes of points are considered, together with the applications of these concepts to partition functions, which are most useful in physics. Partition functions…

We investigate Riguet congruences and generalized congruences on a category, focusing on their interrelations from both lattice-theoretic and category-theoretic perspectives. We also characterize functors that are full and surjective on…

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…