Related papers: Convexities on ordered structures have their Krein…
We introduce the notion of trace convexity for functions and respectively, for subsets of a compact topological space. This notion generalizes both classical convexity of vector spaces, as well as Choquet convexity for compact metric…
Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…
We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…
Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…
The purpose of this paper is to give a self-contained overview of the theory of matrix convex sets and free spectrahedra. We will give new proofs and generalizations of key theorems. However we will also introduce various new concepts and…
This note contains some observations on abelian convexity theorems. Convexity along an orbit is established in a very general setting using Kempf-Ness functions. This is applied to give short proofs of the Atiyah-Guillemin-Sternberg theorem…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We supply the first proof of Krein's Trace Theorem which does not use complex analysis. Our proof holds for~$\sigma$-finite von Neumann algebras $\mathcal{M}$ of type II and unbounded perturbations from the predual of~$\mathcal{M}$.
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…
The Krein transform is the real counterpart of the Cayley transform and gives a one-to-one correspondence between the positive relations and symmetric contractions. It is treated with a slight variation of the usual one, resulting in an…
Krein condition have been used as a qualitative result to show the M-indeterminacy of some kind of densities. In this work we use results from the theory of the Hilbert transform to construct families of densities having all the same finite…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
Motivated by the Hofmann--Lawson theorem, which states that every continuous lattice is inf-generated by its irreducible elements, we explore how to represent posets by extreme points with respect to a closure operator. For this purpose, we…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We study Arens regularity of weighted semigroup convolution algebras for the specific case of totally ordered semilattices. This paper is a natural continuation of that of Dales and Strauss (2022) [DS22], where they studied the unweighted…
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…