Let Zp be the ring of p-adic integers and Ep be the map x-->exp(px) where exp denotes the exponential map determined by the usual power series. It defines an exponential ring (Zp, + , . , 0, 1, Ep). The goal of the thesis is to study the model theory of this structure. In particular, we are interested by the question of the decidability of this theory. The main theorem of the thesis is: Theorem: If the p-adic Schanuel's conjecture is true, then the theory of (Zp, + , . , 0, 1, Ep) is decidable. The proof involves: 1- A result of effective model-completeness (chapters 3 and 4): If F is a family of restricted analytic functions (i.e. power series with coefficients in the valuation ring and convergent on Zp) closed under decomposition functions and such that the set of terms in the language LF= (+, . , 0, 1, f; f in F) is closed under derivation, then we prove that the theory of Zp in the language LF is model-complete. And furthermore, if each term of LF has an effective Weierstrass bound, then the model-completeness is effective. 2- A resolution of the decision problem for existential formulas (assuming Schanuel's conjecture) in chapter 5. We also consider the problem of the decidability of the structure (Op, + , . , 0, 1, |, E_p) where Op denotes the valuation ring of Cp. We give a positive answer to this question assuming the p-adic Schanuel's conjecture.

This dissertation is dealing with three mathematical areas, namely polynomial matrices over finite fields, linear systems and coding theory. Coprimeness properties of polynomial matrices provide criteria for the reachability and observability of interconnected linear systems. Since time-discrete linear systems over finite fields and convolutional codes are basically the same objects, these results could be transfered to criteria for non-catastrophicity of convolutional codes. We calculate the probability that specially structured polynomial matrices are right prime. In particular, formulas for the number of pairwise coprime polynomials and for the number of mutually left coprime polynomial matrices are calculated. This leads to the probability that a parallel connected linear system is reachable and that a parallel connected convolutional codes is non-catastrophic. Moreover, the corresponding probabilities are calculated for other networks of linear systems and convolutional codes, such as series connection. Furthermore, the probabilities that a convolutional codes is MDP and that a clock code is MDS are approximated. Finally, we consider the probability of finding a solution for a linear network coding problem. / Diese Dissertation beschäftigt sich mit drei Teilgebieten der Mathematik, nämlich Polynommatrizen über endlichen Körpern, linearen Systemen und Faltungscodes. Teilerfremdheitseigenschaften für Polynommatrizen stellen Kriterien für die Erreichbarkeit und Beoabachtbarkeit eines vernetzten linearen Systems zur Verfügung. Da zeit-diskrete lineare dynamische Systems und Faltungscodes im Prinzip diesselben Objekte darstellen, können diese Resultate in Kriterien dafür, dass ein Faltungscode nicht-katastrophal ist, übersetzt werden. Wir berechnen die Wahrscheinlichkeit, dass Polynommatrizen von spezieller Struktur rechtsprim sind. Im Besonderen, werden Formeln für die Anzahl paarweise teilerfremder Polynome sowie für die Anzahl wechselweise links-teilerfremder Polynommatrizen berechnet. Dies führt zu der Wahrscheinlichkeit, dass eine Parallelschaltung linearer Systeme erreichbar ist und dass eine Parallelschaltung von Faltungscodes nicht-katastrophal ist. Zudem werden andere Netzwerke linearen Systeme und von Faltungscodes, wie z.B. Reihenschaltung betrachtet. Des weiteren werden die Wahrscheinlichkeiten, dass ein Faltungscode MDP und dass ein Blockcode MDS ist, approximiert. Schließlich, betrachten wir die Wahrscheinlichkeit, eine Lösung für ein lineares Netzwerk-Kodierungsproblem zu finden.

Operators which map subsets of a given set to the set of their minimal elements with respect to some relation R form the basis of a semantic approach in non-monotonic logic, belief revision, conditional logic and updating. In this paper we investigate operators of this type from an algebraic viewpoint. A representation theorem is proved and various properties of the resulting algebras are investigated. It is shown that they behave quite differently from known algebras related to logics, e.g. modal algebras and Heyting algebras.

We report on some experience with a new version of the well known Gröbner algorithm with factorization and constraint inequalities, implemented in our REDUCE package CALI, [12]. We discuss some of its details and present run time comparisons with other existing implementations on well splitting examples.

The goal of this paper is to transfer convolution, correlation and Fourier transform to second order tensor fields. Convolution of two tensor fields is defined using matrix multiplication. Convolution of a tensor field with a scalar mask can thus be described by multiplying the scalars with the real unit matrix. The Fourier transform of tensor fields defined in this paper corresponds to Fourier transform of each of the tensor components in the field. It is shown that for this convolution and Fourier transform, the well known convolution theorem holds and optimization in speed can be achieved by using Fast Fourier transform algorithms. Furthermore, pattern matching on tensor fields based on this convolution is described.

The Discrete Nodal Domain Theorem states that an eigenfunction of the k-th largest eigenvalue of a generalized graph Laplacian has at most k (weak) nodal domains. We show that the number of strong nodal domains cannot exceed the size of a maximal induced bipartite subgraph and that this bound is sharp for generalized graph Laplacians. Similarly, the number of weak nodal domains is bounded by the size of a maximal bipartite minor.

A morphism $\sigma$ is \emph{(strongly) unambiguous} with respect to a word $\alpha$ if there is no other morphism $\tau$ that maps $\alpha$ to the same image as $\sigma$. Moreover, $\sigma$ is said to be \emph{weakly unambiguous} with respect to a word $\alpha$ if $\sigma$ is the only \emph{nonerasing} morphism that can map $\alpha$ to $\sigma(\alpha)$, i.\,e., there does not exist any other nonerasing morphism $\tau$ satisfying $\tau(\alpha) = \sigma(\alpha)$. In the first main part of the present thesis, we wish to characterise those words with respect to which there exists a weakly unambiguous \emph{length-increasing} morphism that maps a word to an image that is strictly longer than the word. Our main result is a compact characterisation that holds for all morphisms with ternary or larger target alphabets. We also comprehensively describe those words that have a weakly unambiguous length-increasing morphism with a unary target alphabet, but we have to leave the problem open for binary alphabets, where we can merely give some non-characteristic conditions. \par The second main part of the present thesis studies the question of whether, for any given word, there exists a strongly unambiguous \emph{1-uniform} morphism, i.\,e., a morphism that maps every letter in the word to an image of length $1$. This problem shows some connections to previous research on \emph{fixed points} of nontrivial morphisms, i.\,e., those words $\alpha$ for which there is a morphism $\phi$ satisfying $\phi(\alpha) = \alpha$ and, for a symbol $x$ in $\alpha$, $\phi(x) \neq x$. Therefore, we can expand our examination of the existence of unambiguous morphisms to a discussion of the question of whether we can reduce the number of different symbols in a word that is not a fixed point such that the resulting word is again not a fixed point. This problem is quite similar to the setting of Billaud's Conjecture, the correctness of which we prove for a special case.

This thesis concerns representation theory of the symmetric groups and related algebras. In recent years, the study of the “quiver Hecke algebras”, constructed independently by Khovanov and Lauda and by Rouquier, has become extremely popular. In this thesis, our motivation for studying these graded algebras largely stems from a result of Brundan and Kleshchev – they proved that (over a field) the KLR algebras have cyclotomic quotients which are isomorphic to the Ariki–Koike algebras, which generalise the Hecke algebras of type A, and thus the group algebras of the symmetric groups. This has allowed the study of the graded representation theory of these algebras. In particular, the Specht modules for the Ariki–Koike algebras can be graded; in this thesis we investigate graded Specht modules in the KLR setting. First, we conduct a lengthy investigation of the (graded) homomorphism spaces between Specht modules. We generalise the rowand column removal results of Lyle and Mathas, producing graded analogues which apply to KLR algebras of arbitrary level. These results are obtained by studying a class of homomorphisms we call dominated. Our study provides us with a new result regarding the indecomposability of Specht modules for the Ariki–Koike algebras. Next, we use homomorphisms to produce some decomposability results pertaining to the Hecke algebra of type A in quantum characteristic two. In the remainder of the thesis, we use homogeneous homomorphisms to study some graded decomposition numbers for the Hecke algebra of type A. We investigate graded decomposition numbers for Specht modules corresponding to two-part partitions. Our investigation also leads to the discovery of some exact sequences of homomorphisms between Specht modules.

The focus of this thesis is to investigate the impact of the boundary conditions on configurations in the Abelian sandpile model. We have two main results to present in this thesis. Firstly we give a family of continuous, measure preserving, almost one-to-one mappings from the wired spanning forest to recurrent sandpiles. In the special case of $Z^d$, $d \geq 2$, we show how these bijections yield a power law upper bound on the rate of convergence to the sandpile measure along any exhaustion of $Z^d$. Secondly we consider the Abelian sandpile on ladder graphs. For the ladder sandpile measure, $\nu$, a recurrent configuration on the boundary, I, and a cylinder event, E, we provide an upper bound for $\nu(E|I) − \nu(E)$.

No description available.