Related papers: Multi-Hypersubstitutions and Colored Solid Varieti…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…
We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to…
Meadows - commutative rings equipped with a total inversion operation - can be axiomatized by purely equational means. We study subvarieties of the variety of meadows obtained by extending the equational theory and expanding the signature.
Algorithms for the symbolic computation of polynomial conservation laws, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations (DDEs) are presented. The algorithms can be used to test the…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…
Recent results show that the structural similarity of graphs can be characterized by counting homomorphisms to them: the Tree Theorem states that the well-known color-refinement algorithm does not distinguish two graphs G and H if and only…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
Van der Waerden's (VDW) colouring theorem in combinatoric number theory [1] has scope for physical applications.The solution of the two colour case has enabled the construction of an explicit mapping of an infinite, one dimensional…
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
Let $H=(V,E)$ be a hypergraph. A {\em conflict-free} coloring of $H$ is an assignment of colors to $V$ such that in each hyperedge $e \in E$ there is at least one uniquely-colored vertex. This notion is an extension of the classical graph…
Geometrical meaning of superstring pictures is discussed in details. An off-shell generalization of the picture changing operation and its inverse are constructed. It is demonstrated that the generalised operations are inverse to each other…
Color names are often made up of multiple words. As a task in natural language understanding we investigate in depth the capacity of neural networks based on sums of word embeddings (SOWE), recurrence (LSTM and GRU based RNNs) and…
We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…