Related papers: On Finite Bases for Weak Semantics: Failures versu…
We study a quantum mechanical potential introduced previously as a conditionally exactly solvable (CES) model. Besides an analysis following its original introduction in terms of the point canonical transformation, we also present an…
Using the language of coarse homology theories, we provide an axiomatic account of vanishing results for the fibres of forget-control maps associated to spaces with equivariant finite decomposition complexity.
We present the universal theory of weak crossed biproducts, and we prove that every weak projection of weak bialgebras induces an example of this crossed structure. As an example, we give the construction of a weak projection of a weak…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
This system description introduces an enhancement to the Yices2 SMT solver, enabling it to reason over non-linear polynomial systems over finite fields. Our reasoning approach fits into the model-constructing satisfiability (MCSat)…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
We show that the weak infinitesimal generator of a class of Markov processes acts on bounded continuous functions with bounded continuous second derivative as a singular integral with respect to the orthogonality measure of the explicit…
This paper aims to unify and extend existing techniques for deriving upper bounds on the transient of max-plus matrix powers. To this aim, we introduce the concept of weak CSR expansions: A^t=CS^tR + B^t. We observe that most of the known…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
In this article, the weakest possible theorem providing a foundation for the Hilbert space formalism of quantum theory is stated. The necessary postulates are formulated, and the mathematics is spelt out in detail. It is argued that, from…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…
We design a reversible version of truly concurrent process algebra CTC which is called RCTC. It has good properties modulo several kinds of strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…
We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the finite model property and decidability from the modal logic of…
Finite versions of W-algebras are introduced by considering (symplectic) reductions of finite dimensional simple Lie algebras. In particular a finite analogue of $W^{(2)}_3$ is introduced and studied in detail. Its unitary and non-unitary,…
We consider mixed finite element methods for linear elasticity where the symmetry of the stress tensor is weakly enforced. Both an a priori and a posteriori error analysis are given for several known families of methods that are uniformly…