Fine Hochschild invariants of derived categories for symmetric algebras

Let $A$ be a symmetric $k$-algebra over a perfect field $k$. K\"ulshammer defined for any integer $n$ a mapping $\zeta\_n$ on the degree 0 Hochschild cohomology and a mapping $\kappa\_n$ on the degree 0 Hochschild homology of $A$ as adjoint mappings of the respective $p$-power mappings with respect to the symmetrizing bilinear form. In an earlier paper it is shown that $\zeta\_n$ is invariant under derived equivalences. In the present paper we generalize the definition of $\kappa\_n$ to higher Hochschild homology and show the invariance of $\kappa$ and its generalization under derived equivalences. This provides fine invariants of derived categories

Visibly Linear Dynamic Logic

We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a variable to its original value after its execution, even in the presence of an unbounded number of intermediate recursive calls. We prove that VLDL describes exactly the $\omega$-visibly pushdown languages. Thus it is strictly more expressive than LTL and able to express recursive properties of programs with unbounded call stacks. The main technical contribution of this work is a translation of VLDL into $\omega$-visibly pushdown automata of exponential size via one-way alternating jumping automata. This translation yields exponential-time algorithms for satisfiability, validity, and model checking. We also show that visibly pushdown games with VLDL winning conditions are solvable in triply-exponential time. We prove all these problems to be complete for their respective complexity classes.Comment: 25 Page