Related papers: Algebraic Laws for True Concurrency
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research…
This paper investigates applicability of thermodynamic concepts and principles to competitive systems. We show that Tsallis entropies are suitable for characterisation of systems with transitive competition when mutations deviate from Gibbs…
We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as finding a set of semantics-preserving rewrite rules from one…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
In this paper, we discuss an interaction between complex geometry and integrable systems. Section 1 reviews the classical results on integrable systems. New examples of integrable systems, which have been discovered, are based on the Lax…
We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.
We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…
This paper presents an algebraic theory of instruction sequences with instructions for a random access machine (RAM) as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction…
Recently, a new fractional derivative called the conformable fractional derivative is given on based basic limit definition derivative in [4]. Then, the fractional versions of chain rules, exponential functions, Gronwalls inequality,…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
This book offers an introduction to vertex algebra based on a new approach. The new approach says that a vertex algebra is an associative algebra such that the underlying Lie algebra is a vertex Lie algebra. In particular, vertex algebras…
The notion of geometric version of an infinitely divisible law is introduced. Concepts parallel to attraction and partial attraction are developed and studied in the setup of geometric summing of random variables.
We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the…
We derive some equalities for relations on the algebra A, under the assumption that every subalgebra of A $\times$ A is congruence modular.
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
In this work I present a generalization of Amdahl's law on the limits of a parallel implementation with many processors. In particular I establish some mathematical relations involving the number of processors and the dimension of the…
Graph theory is an interdisciplinary field of study that has various applications in mathematical modeling and computer science. Research in graph theory depends on the creation of not only theorems but also conjectures. Conjecture-refuting…