Related papers: A recognition criterion for lax-idempotent pseudom…
The algebraic properties of the combination of probabilistic choice and nondeterministic choice have long been a research topic in program semantics. This paper explains a formalization in the Coq proof assistant of a monad equipped with…
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…
We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.
We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…
We completely classify all varieties of aperiodic monoids with commuting idempotents whose subvariety lattice is distributive.
We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…
We follow a polynomial approach to analyse strong stability of linear difference equations with rationally independent delays. Upon application of the Hermite stability criterion on the discrete-time homogeneous characteristic polynomial,…
We completely classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is distributive.
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the…
We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…
The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…
Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…
Just as the Hamming weight spectrum of a linear block code sheds light on the performance of a maximum likelihood decoder, the pseudo-weight spectrum provides insight into the performance of a linear programming decoder. Using properties of…
Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the…
Although multiplier bimonoids in general are not known to correspond to comonoids in any monoidal category, we classify them in terms of maps from the Catalan simplicial set to another suitable simplicial set; thus they can be regarded as…
Monoidal functors U:C --> M with left adjoints determine, in a universal way, monoids T in the category of oplax monoidal endofunctors on M. Such monads will be called bimonads. Treating bimonads as abstract "quantum groupoids" we derive…
With increasing requirements for greater precision, it becomes essential to describe the effects of isospin breaking induced by both quark masses and electro-magnetic effects. In this work we perform a lattice analysis of the weak decay…
We give necessary and sufficient conditions for weak and strong embeddability of amalgams in each subvariety of the category of all nilpotent groups of class at most two; this generalizes B. Maier's result for the latter class. We also…
Rational pairs generalize the notion of rational singularities to reduced pairs $(X,D)$. In this paper we deal with the problem of determining whether a normal variety $X$ has a rationalizing divisor, i.e. a reduced divisor $D$ such that…
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…