Unitary Representations of Wavelet Groups and Encoding of Iterated Function Systems in Solenoids

For points in $d$ real dimensions, we introduce a geometry for general digit sets. We introduce a positional number system where the basis for our representation is a fixed $d$ by $d$ matrix over \bz. Our starting point is a given pair $(A, \mathcal D)$ with the matrix $A$ assumed expansive, and $\mathcal D$ a chosen complete digit set, i.e., in bijective correspondence with the points in \bz^d/A^T\bz^d. We give an explicit geometric representation and encoding with infinite words in letters from $\mathcal D$. We show that the attractor $X(A^T,\mathcal D)$ for an affine Iterated Function System (IFS) based on $(A,\mathcal D)$ is a set of fractions for our digital representation of points in \br^d. Moreover our positional "number representation" is spelled out in the form of an explicit IFS-encoding of a compact solenoid \sa associated with the pair $(A,\mathcal D)$. The intricate part (Theorem \ref{thenccycl}) is played by the cycles in \bz^d for the initial $(A,\mathcal D)$-IFS. Using these cycles we are able to write down formulas for the two maps which do the encoding as well as the decoding in our positional $\mathcal D$-representation. We show how some wavelet representations can be realized on the solenoid, and on symbolic spaces

On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups

In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSPACE-complete word problem. We also show that there is an automaton group for which the word problem with a single rational constraint is PSPACE-complete. Additionally, we provide simpler constructions for the uniform word problems of these classes. For the uniform word problem for automaton groups (without rational constraints), we show NL-hardness. Finally, we investigate a question asked by Cain about a better upper bound for the length of a word on which two distinct elements of an automaton semigroup must act differently

Self-dual tilings with respect to star-duality

The concept of star-duality is described for self-similar cut-and-project tilings in arbitrary dimensions. This generalises Thurston's concept of a Galois-dual tiling. The dual tilings of the Penrose tilings as well as the Ammann-Beenker tilings are calculated. Conditions for a tiling to be self-dual are obtained.Comment: 15 pages, 6 figure

Symmetric interpolatory dual wavelet frames

For any symmetry group $H$ and any appropriate matrix dilation we give an explicit method for the construction of $H$-symmetric refinable interpolatory refinable masks which satisfy sum rule of arbitrary order $n$. For each such mask we give an explicit technique for the construction of dual wavelet frames such that the corresponding wavelet masks are mutually symmetric and have the vanishing moments up to the order n. For an abelian symmetry group $H$ we modify the technique such that each constructed wavelet mask is $H$-symmetric.Comment: 22 page

Towards Realizability Checking of Contracts using Theories

Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. Such proofs build from "leaf-level" assume/guarantee component contracts through architectural layers towards top-level safety properties. The proofs are built upon the premise that each leaf-level component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. Without engineering support it is all too easy to write leaf-level components that can't be realized. Realizability checking for propositional contracts has been well-studied for many years, both for component synthesis and checking correctness of temporal logic requirements. However, checking realizability for contracts involving infinite theories is still an open problem. In this paper, we describe a new approach for checking realizability of contracts involving theories and demonstrate its usefulness on several examples.Comment: 15 pages, to appear in NASA Formal Methods (NFM) 201