Related papers: On posetal and complete partial applicative struct…

We introduce a new invariant for triangulated categories: the poset of spherical subcategories ordered by inclusion. This yields several numerical invariants, like the cardinality and the height of the poset. We explicitly describe…

We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear…

Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…

Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and…

Given a planar algebra we show the equivalence of the notions of a module over this algebra (in the operadic sense), and module over a universal annular algebra. We classify such modules, with invariant inner products, in the generic region…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…

We describe the structure of bimodules (over finite dimensional algebras) which have the property that the functor of tensoring with such a bimodule sends any module to a projective module. The main result is that all such bimodules are…

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…

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…

The aim of this paper is to give some combinatorial relations linked polynomials generalizing those of Appell type to the partial r-Bell polynomials. We give an inverse relation, recurrence relations involving some family of polynomials and…

A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le…

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

We investigate the mathematical structure of unit systems and the relations between them. Looking over the entire set of unit systems, we can find a mathematical structure that is called preorder (or quasi-order). For some pair of unit…

We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…

Tannaka duality and its extensions by Lurie, Sch\"appi et al. reveal that many schemes as well as algebraic stacks may be identified with their tensor categories of quasi-coherent sheaves. In this thesis we study constructions of cocomplete…

We introduce and study some new uniform structures for Hilbert $C^*$-modules over an algebra $A$. In particular, we prove that in some cases they have the same totally bounded sets. To define one of them, we introduce a new class of…

Computability relative to a partial function $f$ on the natural numbers can be formalized using the notion of an oracle for this function $f$. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of…