Related papers: Laplaza Sets, or How to Select Coherence Diagrams …
The notion of a \emph{higher-order algebroid}, as introduced by J\'o\'zwikowski and Rotkiewicz in their work \emph{Higher-order analogs of Lie algebroids via vector bundle comorphisms} (SIGMA, 2018), generalizes the concepts of a…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the…
Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common…
Revisiting the results by Winternitz [Symmetry in physics, CRM Proc. Lecture Notes 34, American Mathematical Society, Providence, RI, 2004, pp. 215-227], we thoroughly refine his classification of Lie subalgebras of the real order-three…
As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second,…
We give a new construction of free distributive p-algebras. Our construction relies on a detailed description of completely meet-irreducible congruences, so it is purely universal algebraic. It yields a normal form theorem for p-algebra…
A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…
Limits and colimits of diagrams, defined by maps between sets, are universal constructions fundamental in different mathematical domains and key concepts in theoretical computer science. Its importance in semantic modeling is described by…
Pseudo $MV$-algebras are a non-commutative generalization of $MV$-algebras. The main purpose of the paper is to introduce and investigate orthocomplete pseudo $MV$-algebras. We use the concepts of projectable pseudo $MV$-algebras and large…
Quadratic algebras associated to pseudo-roots of noncommutative polynomials have been introduced by I. Gelfand, Retakh, and Wilson in connection with studying the decompositions of noncommutative polynomials. Later they (with S. Gelfand and…
Pseudo-cones are a class of unbounded closed convex sets, not containing the origin. They admit a kind of polarity, called copolarity. With this, they can be considered as a counterpart to convex bodies containing the origin in the…
Epistemic graphs are a generalization of the epistemic approach to probabilistic argumentation. Hunter proposed a 2-way generalization framework to learn epistemic constraints from crowd-sourcing data. However, the learnt epistemic…
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…
In this work, we present a theoretical study of signals with sparse representations in the vertex domain of a graph, which is primarily motivated by the discrepancy arising from respectively adopting a synthesis and analysis view of the…
We know that coalgebra measurings behave like generalized maps between algebras. In this note, we show that coalgebra measurings between commutative algebras induce morphisms between higher order Hochschild homology groups of algebras. By…
The notion of breadth of a nilpotent Lie algebra was introduced by B. Khuhirun, K.C. Misra and E. Stitzinger and used to approach problems of classification up to isomorphism. In the present paper, we study this invariant in terms of…