Related papers: Syntax for Split Preorders
We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…
We show that a divisor in a rational homogenous variety with split normal sequence is the preimage of a hyperplane section in either the projective space or a quadric.
The paper determines the algebraic and logic structure of the multiset semantics of the core patterns of SPARQL. We prove that the fragment formed by AND, UNION, OPTIONAL, FILTER, MINUS and SELECT corresponds precisely to both, the…
String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the…
In this paper, we study the Green ring and the stable Green ring of a Hopf algebra $H$ by means of bilinear forms. We show that the Green ring of a Hopf algebra of finite representation type is a Frobenius algebra over $\mathbb{Z}$ with a…
Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the…
In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We develop a string-net construction of a modular functor whose algebraic input is a pivotal bicategory; this extends the standard construction based on a spherical fusion category. An essential ingredient in our construction is a graphical…
We prove that the Leibniz PROP is isomorphic (as $\Bbbk$-linear categories) to the symmetric crossed presimplicial algebra $\Bbbk[(\Delta^+)^{op} \mathbb{S}]$ where $\Delta^+$ is the skeletal category of finite well-ordered sets with…
This paper investigates the algebraic and graphical structure of the ring $\mathbb{Z}_{sp}$, with a focus on its decomposition into finite fields, kernels, and special subsets. We establish classical isomorphisms between $\mathbb{F}_s$ and…
By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in…
Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…
Motivated by the Hilbert-space model for quantum mechanics, we define a pre-Hilbert space logic to be a pair $(S,\el)$, where $S$ is a pre-Hilbert space and $\el$ is an orthocomplemented poset of orthogonally closed linear subspaces of $S$,…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We fix the lexicographic order $\prec$ on the polynomial ring $S=k[x_{1},...,x_{n}]$ over a ring $k$. We define $\Hi^{\prec\Delta}_{S/k}$, the moduli space of reduced Gr\"obner bases with a given finite standard set $\Delta$, and its open…
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…
The notion of a pre-truss, that is, a set that is both a heap and a semigroup is introduced. Pre-trusses themselves as well as pre-trusses in which one-sided or two-sided distributive laws hold are studied. These are termed near-trusses and…
Semantic role labeling is primarily used to identify predicates, arguments, and their semantic relationships. Due to the limitations of modeling methods and the conditions of pre-identified predicates, previous work has focused on the…