Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning

Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries like term and graph rewriting. Realistic problems, however, call for suitable techniques to guarantee scalability. For instance, many domains exhibit a hierarchical structure that can be exploited conveniently. This is particularly evident for composition associations of models. We propose an explicit representation of such structured models and a methodology that exploits it for the description and analysis of model- and rule-based systems. The approach is presented in the framework of rewriting logic and its efficient implementation in the rewrite engine Maude and is illustrated with a case study.

Homotopy theory of Spectral categories

We construct a Quillen model structure on the category of spectral categories, where the weak equivalences are the symmetric spectra analogue of the notion of equivalence of categories.Comment: 19 page

The Fourier U(2) Group and Separation of Discrete Variables

The linear canonical transformations of geometric optics on two-dimensional screens form the group $Sp(4,R)$, whose maximal compact subgroup is the Fourier group $U(2)_F$; this includes isotropic and anisotropic Fourier transforms, screen rotations and gyrations in the phase space of ray positions and optical momenta. Deforming classical optics into a Hamiltonian system whose positions and momenta range over a finite set of values, leads us to the finite oscillator model, which is ruled by the Lie algebra $so(4)$. Two distinct subalgebra chains are used to model arrays of $N^2$ points placed along Cartesian or polar (radius and angle) coordinates, thus realizing one case of separation in two discrete coordinates. The $N^2$-vectors in this space are digital (pixellated) images on either of these two grids, related by a unitary transformation. Here we examine the unitary action of the analogue Fourier group on such images, whose rotations are particularly visible

Combinatorial Hopf algebras in quantum field theory I

This manuscript stands at the interface between combinatorial Hopf algebra theory and renormalization theory. Its plan is as follows: Section 1 is the introduction, and contains as well an elementary invitation to the subject. The rest of part I, comprising Sections 2-6, is devoted to the basics of Hopf algebra theory and examples, in ascending level of complexity. Part II turns around the all-important Faa di Bruno Hopf algebra. Section 7 contains a first, direct approach to it. Section 8 gives applications of the Faa di Bruno algebra to quantum field theory and Lagrange reversion. Section 9 rederives the related Connes-Moscovici algebras. In Part III we turn to the Connes-Kreimer Hopf algebras of Feynman graphs and, more generally, to incidence bialgebras. In Section10 we describe the first. Then in Section11 we give a simple derivation of (the properly combinatorial part of) Zimmermann's cancellation-free method, in its original diagrammatic form. In Section 12 general incidence algebras are introduced, and the Faa di Bruno bialgebras are described as incidence bialgebras. In Section 13, deeper lore on Rota's incidence algebras allows us to reinterpret Connes-Kreimer algebras in terms of distributive lattices. Next, the general algebraic-combinatorial proof of the cancellation-free formula for antipodes is ascertained; this is the heart of the paper. The structure results for commutative Hopf algebras are found in Sections 14 and 15. An outlook section very briefly reviews the coalgebraic aspects of quantization and the Rota-Baxter map in renormalization.Comment: 94 pages, LaTeX figures, precisions made, typos corrected, more references adde