Related papers: Intuitionistic Euler-Venn Diagrams (extended)
We develop the Lie theory of Lie-admissible algebras whose product is enriched with higher operations modeled on directed graphs with a view to apply it to the deformation theories controlled by this kind of Lie algebras. We produce…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
It is shown that non-commutative spaces, which are quotients of associative algebras by ideals generated by non-linear relations of a particular type, admit extremely simple formulae for deformed or star products. Explicit construction of…
Representing knowledge as high-dimensional vectors in a continuous semantic vector space can help overcome the brittleness and incompleteness of traditional knowledge bases. We present a method for performing deductive reasoning directly in…
We investigate the properties of a class of regularisation-free approaches for Gaussian graphical inference based on the information-geometry-driven sequential growth of initially edgeless graphs. Relating the growth of a graph to a…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…
A novel partial order is defined on the space of digraphs or hypergraphs, based on assessing the cost of producing a graph via a sequence of elementary transformations. Leveraging work by Knuth and Skilling on the foundations of inference,…
In this paper we motivate and study the possibility of an intuitionistic quantum logic. An explicit investigation of the application of the theory of Bruns and Lakser on distributive hulls on traditional quantum logic (as suggested in…
The formal system of intuitionistic epistemic logic IEL was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Hayting-Kolmogorov…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
Linear projection schemes like Proper Orthogonal Decomposition can efficiently reduce the dimensions of dynamical systems but are naturally limited, e.g., for convection-dominated problems. Nonlinear approaches have shown to outperform…
Ideas from deformation quantization are applied to deform the expression of elements of an algebra. Extending these ideas to certain transcendental elements implies that $\frac{1}{i\h}uv$ in the Weyl algebra is naturally viewed as an…
We make explicit computations in the formal symplectic geometry of Kontsevich and determine the Euler characteristics of the three cases, namely commutative, Lie and associative ones, up to certain weights.From these, we obtain some…
We establish a correspondence between automorphisms and derivations on certain algebras of generalised power series. In particular, we describe a Lie algebra of derivations on a field $k(\!(G)\!)$ of generalised power series, exploiting our…
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods.…
Massive vector fields can be described in a gauge invariant way with the introduction of compensating fields. In the unitary gauge one recovers the original formulation. Although this gauging mechanism can be extended to noncommutative…