1,606 research outputs found
Representation theories of some towers of algebras related to the symmetric groups and their Hecke algebras
We study the representation theory of three towers of algebras which are
related to the symmetric groups and their Hecke algebras. The first one is
constructed as the algebras generated simultaneously by the elementary
transpositions and the elementary sorting operators acting on permutations. The
two others are the monoid algebras of nondecreasing functions and nondecreasing
parking functions. For these three towers, we describe the structure of simple
and indecomposable projective modules, together with the Cartan map. The
Grothendieck algebras and coalgebras given respectively by the induction
product and the restriction coproduct are also given explicitly. This yields
some new interpretations of the classical bases of quasi-symmetric and
noncommutative symmetric functions as well as some new bases.Comment: 12 pages. Presented at FPSAC'06 San-Diego, June 2006 (minor
explanation improvements w.r.t. the previous version
PSPACE Bounds for Rank-1 Modal Logics
For lack of general algorithmic methods that apply to wide classes of logics,
establishing a complexity bound for a given modal logic is often a laborious
task. The present work is a step towards a general theory of the complexity of
modal logics. Our main result is that all rank-1 logics enjoy a shallow model
property and thus are, under mild assumptions on the format of their
axiomatisation, in PSPACE. This leads to a unified derivation of tight
PSPACE-bounds for a number of logics including K, KD, coalition logic, graded
modal logic, majority logic, and probabilistic modal logic. Our generic
algorithm moreover finds tableau proofs that witness pleasant proof-theoretic
properties including a weak subformula property. This generality is made
possible by a coalgebraic semantics, which conveniently abstracts from the
details of a given model class and thus allows covering a broad range of logics
in a uniform way
Towards a Theory of Glue
We propose and study the notions of behaviour type and composition operator
making a first step towards the definition of a formal framework for studying
behaviour composition in a setting sufficiently general to provide insight into
how the component-based systems should be modelled and compared. We illustrate
the proposed notions on classical examples (Traces, Labelled Transition Systems
and Coalgebras). Finally, the definition of memoryless glue operators, takes us
one step closer to a formal understanding of the separation of concerns
principle stipulating that computational aspects of a system should be
localised within its atomic components, whereas coordination layer responsible
for managing concurrency should be realised by memoryless glue operators.Comment: In Proceedings ICE 2012, arXiv:1212.345
Minimization via duality
We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata. The basic idea is that instead of constructing a maximal quotient we go to the dual and look for a minimal subalgebra and then return to the original category. Duality ensures that the minimal subobject becomes the maximally quotiented object
- …