相关论文: On sigma-entangled linear orders
We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…
We provide a classification of entangled states that uses new discrete entanglement invariants. The invariants are defined by algebraic properties of linear maps associated with the states. We prove a theorem on a correspondence between the…
Similarly to noises, Boolean algebras of sigma-fields can be black. A noise may be treated as a homomorphism from a Boolean algebra of regular open sets to a Boolean algebra of sigma-fields. Spectral sets are useful also in this framework.
A particular form of non-linear $\sigma$-model, having a global gauge invariance, is studied. The detailed discussion on current algebra structures reveals the non-abelian nature of the invariance, with {\it{field dependent structure…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…
This article is devoted to the investigation of structure of wrap groups of fiber bundles over ultra-normed infinite fields and more generally over Cayley-Dickson algebras. Iterated wrap groups are studied as well. Their smashed products…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
In Functional Analysis, certain conclusions apply to sequences, but they cannot be carried over when we consider nets. In fact, some nets, including sequences, can behave unexpectedly. In this paper we are interested in exploring the…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
The class of Hausdorff spaces that are continuous images of compact orderable spaces is studied by analyzing the relationship between the elements of this class and compact orderable spaces in a back-and-forth fashion. Structure results for…
We continue our investigation =of Shelah's interpretability orders $\trianglelefteq^*_\kappa$ as well as the new orders $\trianglelefteq^\times_\kappa$. In particular, we give streamlined proofs of the existence of minimal unstable,…
Strong subadditivity goes beyond the tensored subsystem and commuting operator models. As previously noted by Petz and later by Araki and Moriya, two subalgebras of observables satisfy a generalized SSA-like inequality if they form a…
The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely semilattices with a contact relation. Another significant motivation for…