Related papers: Freer Arrows and Why You Need Them in Haskell
We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…
Recently, the author discovered an interesting class of knot-like objects called free knots. These purely combinatorial objects are equivalence classes of Gauss diagrams modulo Reidemeister moves (the same notion in the language of words…
This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their…
Tensegrity structures have been extensively studied over the last years due to their potential applications in modern engineering like metamaterials, deployable structures, planetary lander modules, etc. Many of the form-finding methods…
We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…
The Isabelle Archive of Formal Proofs has grown to a significant size in the past years. It makes up for an impressive body of research, which enables a number of statistical approaches to various aspects in theorem proving, and has not yet…
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of…
It is shown that a compound elastic structure, which displays a dynamic instability, may be designed as the union (or 'fusion') of two structures which are stable when separately analyzed. The compound elastic structure has two degrees of…
Parametric Markov chains occur quite naturally in various applications: they can be used for a conservative analysis of probabilistic systems (no matter how the parameter is chosen, the system works to specification); they can be used to…
Convex polyhedral abstractions of logic programs have been found very useful in deriving numeric relationships between program arguments in order to prove program properties and in other areas such as termination and complexity analysis. We…
The design and implementation of static analyzers has become increasingly systematic. Yet for a given language or analysis feature, it often requires tedious and error prone work to implement an analyzer and prove it sound. In short, static…
In this article the 2-adjunction that relates universal arrows and extensive monads is constructed explicitly. This 2-adjunction resembles the one that relates adjunctions and monads since the 2-category of universal arrows is isomorphic to…
The monadic shallow linear (MSL) class is a decidable fragment of first-order Horn clauses that was discovered and rediscovered around the turn of the century, with applications in static analysis and verification. We propose a new class of…
We give an explicit construction of the free monoid in monoidal abelian categories when the monoidal product does not necessarily preserve coproducts. We apply it to several new monoidal categories that appeared recently in the theory of…
Learning probabilistic models over strings is an important issue for many applications. Spectral methods propose elegant solutions to the problem of inferring weighted automata from finite samples of variable-length strings drawn from an…
Dataframes are a popular abstraction to represent, prepare, and analyze data. Despite the remarkable success of dataframe libraries in Rand Python, dataframes face performance issues even on moderately large datasets. Moreover, there is…
We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to…
Geometric motivations warranted the study of hypergraphs on ordered vertices that have no pair of hyperedges that induce an alternation of some given length. Such hypergraphs are called ABA-free, ABAB-free and so on. Since then various…
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of…
Orders in an algebraic number field form a class of rings which are of special historical interest to the field of factorization theory. One of the primary tools used to study factorization is elasticity - a measure of how badly unique…