Related papers: How to introduce the connective implication in ort…
We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…
The Sasaki projection and its dual were introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. In a previous paper the authors showed that the Sasaki operations induced by the Sasaki…
We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as…
In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…
First we show that tight nonorthogonal fusion frames a relatively easy to com by. In order to do this we need to establish a classification of how to to wire a self adjoint operator as a product of (nonorthogonal) projection operators. We…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
We define oriented posets with correpsonding rank matrices, where linking two posets by an edge corresponds to matrix multiplication. In particular, linking chains via this method gives us fence posets, and taking traces gives us circular…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs…
We introduce vincular pattern posets, then we consider in particular the quasi-consecutive pattern poset, which is defined by declaring $\sigma \leq \tau$ whenever the permutation $\tau$ contains an occurrence of the permutation $\sigma$ in…
An orthoset is a non-empty set together with a symmetric and irreflexive binary relation $\perp$, called the orthogonality relation. An orthoset with 0 is an orthoset augmented with an additional element 0, called falsity, which is…
Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with…
Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…
We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…
The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…
Motivated by the study of the recurrent orbits in a Morse set of a Morse decomposition, we introduce the concept of Morse predecomposition of an isolated invariant set in the setting of combinatorial and classical dynamical systems. We…
We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…