• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 29
  • 1
  • 1
  • Tagged with
  • 31
  • 31
  • 16
  • 16
  • 16
  • 14
  • 9
  • 7
  • 6
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

On Beatty sets and some generalisations thereof / Über Beatty-Mengen und einige Verallgemeinerungen dieser

Technau, Marc January 2018 (has links) (PDF)
Beatty sets (also called Beatty sequences) have appeared as early as 1772 in the astronomical studies of Johann III Bernoulli as a tool for easing manual calculations and - as Elwin Bruno Christoffel pointed out in 1888 - lend themselves to exposing intricate properties of the real irrationals. Since then, numerous researchers have explored a multitude of arithmetic properties of Beatty sets; the interrelation between Beatty sets and modular inversion, as well as Beatty sets and the set of rational primes, being the central topic of this book. The inquiry into the relation to rational primes is complemented by considering a natural generalisation to imaginary quadratic number fields. / Zu gegebener Beatty-Menge \(\mathscr{B}(\alpha,\beta) = \{ n\alpha+\beta : n\in\mathbb{N} \}\) mit irrationalem \(\alpha>1\) und \(\beta\in\mathbb{R}\), sowie gegebener Primzahl \(p\) und hierzu teilerfremdem \(z\) untersuchen wir das Problem der Auffindung von Punkten \((m,\tilde{m})\) auf der modularen Hyperbel \[ \mathscr{H}_{z,p} = \{(m,\tilde{m}) \in \mathbb{Z}^2\cap[1,p )^2 : m\tilde{m}\equiv z\mod p\} \] mit \(\max\{ m, \tilde{m} \}\) so klein wie möglich, d.h. wir für gewisse \(\alpha\) beweisen nichttriviale Abschätzungen für \[ \min\{ \max\{ m, \tilde{m} \} : (m,\tilde{m})\in\mathscr{H}_{z,p}, \, m\in\mathscr{B}(\alpha,\beta) \}. \] Der Beweis fußt auf neuen Abschätzungen für unvollständige Kloosterman-Summen entlang \(\mathscr{B}(\alpha,\beta)\), welche durch das Speisen einer Methode von Banks und Shparlinski mit neuen Abschätzungen für die periodische Autokorrelation der endlichen Folge \[ 0,\, \operatorname{e}_p(y\overline{1}),\, \operatorname{e}_p(y\overline{2}),\, \ldots,\, \operatorname{e}_p(y\overline{p-1}), \quad \text{with \(y\) indivisible by \(p\)}, \] erhalten werden; (Hierbei bezeichnet \(\overline{m}\) die eindeutige natürliche Zahl \(m'\in[1,p)\) mit \(mm'\equiv 1\bmod p\) und wir schreiben \(\operatorname{e}_p(x) = \exp(2\pi i x/p)\).) Für letzteres adaptieren wir Ideen von Kloosterman. Des weiteren untersuchen wir Mengen der Form \(\{\lfloor m\alpha_1+n\alpha_2+\beta\rfloor : m,n\in\mathbb{N} \}\). Wir zeigen, dass diese stets in einer gewöhnlichen Beatty-Menge \(\mathscr{B}(\tilde{\alpha},\tilde{\beta})\) enthalten sind und geben zulässige Werte für \(\tilde{\alpha}\) und \(\tilde{\beta}\) an. Das Komplement \(\mathscr{C} = \mathscr{B}(\tilde{\alpha},\tilde{\beta}) \setminus \{\lfloor m\alpha_1+n\alpha_2+\beta\rfloor : m,n\in\mathbb{N} \}\) erweist sich als endliche Menge und wir bestimmen obere Schranken für das Supremum von \(\mathscr{C}\). Die Beweise gründen sich auf einfache Verteilungseigenschaften der Folge der Nachkommastellen \(\{n\alpha_1^{-1}\alpha_2\}\), \(n=1,2,\ldots\), sofern \(\alpha_1^{-1}\alpha_2\) irrational ist, und berufen sich anderenfalls auf die Endlichkeit der Frobenius-Zahl einer geeignet gewählten Instanz des Frobeniusschen Münzproblems. Abschließend verallgemeinern wir die Definition von Beatty-Mengen auf imaginär-quadratische Zahlkörper in einer natürlichen Weise. Hat der fragliche Zahlkörper Klassenzahl \(1\), so können wir zeigen, dass diese Beatty-artigen Mengen unendlich viele Primelemente enthalten, sofern der zugehörige Parameter \(\alpha\) nicht im betrachteten Zahlkörper enthalten ist. Für den speziellen Zahlkörper \(\mathbb{Q}(i)\) erhalten wir unter Benutzung des Hurwitzschen Kettenbruch-Algorithmus eine Zahlkörper-Variante eines früheren Resultats von Steuding und dem Autor, welches ein Beatty-Analogon des klassischen Linnikschen Satzes über die kleinste Primzahl in einer arithmetischen Progression darstellt. Die erwähnten Resultate werden durch Zahlkörper-Varianten von klassischen Ergebnissen über die Verteilung von \(\{ p\vartheta \}\), \(p=2,3,5,7,11,\ldots\), \(\vartheta\in\mathbb{R}\setminus\mathbb{Q}\), erhalten; Diese wurden kürzlich von Baier mittels der Harmanschen Siebmethode für \(\mathbb{Q}(i)\) bewiesen. Wir übertragen die zugehörigen Überlegungen auf Zahlkörper mit Klassenzahl \(1\). / For Beatty sets \(\mathscr{B}(\alpha,\beta) = \{ n\alpha+\beta : n\in\mathbb{N} \}\) with irrational \(\alpha>1\) and \(\beta\in\mathbb{R}\), and \(p\) prime and coprime to \(z\), we investigate the problem of detecting points \((m,\tilde{m})\) on the modular hyperbola \[ \mathscr{H}_{z,p} = \{(m,\tilde{m}) \in \mathbb{Z}^2\cap[1,p )^2 : m\tilde{m}\equiv z\mod p\} \] with \(\max\{ m, \tilde{m} \}\) as small as possible, i.e., we obtain non-trivial estimates for \[ \min\{ \max\{ m, \tilde{m} \} : (m,\tilde{m})\in\mathscr{H}_{z,p}, \, m\in\mathscr{B}(\alpha,\beta) \} \] for certain \(\alpha\). The proof rests on new estimates for incomplete Kloosterman sums along \(\mathscr{B}(\alpha,\beta)\) which are in turn obtained on supplying a method due to Banks and Shparlinski with a new estimate for the periodic autocorrelation of the finite sequence \[ 0,\, \operatorname{e}_p(y\overline{1}),\, \operatorname{e}_p(y\overline{2}),\, \ldots,\, \operatorname{e}_p(y\overline{p-1}), \quad \text{with \(y\) indivisible by \(p\)}, \] (\(\overline{m}\) denoting the unique integer \(m'\in[1,p)\) with \(mm'\equiv 1\bmod p\) and \(\operatorname{e}_p(x) = \exp(2\pi i x/p)\), the latter being obtained from adapting an argument due to Kloosterman. Furthermore, we investigate sets of the shape \(\{\lfloor m\alpha_1+n\alpha_2+\beta\rfloor : m,n\in\mathbb{N} \}\). We show that they are always contained in some ordinary Beatty set \(\mathscr{B}(\tilde{\alpha},\tilde{\beta})\) where we give admissible choices for \(\tilde{\alpha}\) and \(\tilde{\beta}\). Their respective complement \(\mathscr{C}\) in this ordinary Beatty set is shown to be finite and bounds for the supremum of \(\mathscr{C}\) are provided. The proofs are based on basic distribution properties of the sequence of fractional parts \(\{n\alpha_1^{-1}\alpha_2\}\), \(n=1,2,\ldots\), when \(\alpha_1^{-1}\alpha_2\) is irrational, and appeal to the finiteness of the Frobenius number associated with a suitably chosen instance of the Frobenius coin problem otherwise. Lastly, we generalise the definition of Beatty sets to imaginary quadratic number fields in a natural fashion. Assuming the number field in question to have class number \(1\), we are able to show that these Beatty-type sets contain infinitely many prime elements provided that the parameter corresponding to \(\alpha\) from above is not contained in the number field. When the number field is \(\mathbb{Q}(i)\), then, using the Hurwitz continued fraction expansion, we obtain a number field analogue of a previous result of Steuding and the author, who gave a Beatty set analogue of Linnik's famous theorem on the least prime number in an arithmetic progression. These results are obtained from number field analogues of classical results about the distribution of \(\{ p\vartheta \}\), \(p=2,3,5,7,11,\ldots\), \(\vartheta\in\mathbb{R}\setminus\mathbb{Q}\), which were worked out recently by Baier for \(\mathbb{Q}(i)\) using Harman's sieve method. We generalise these arguments to imaginary quadratic number fields with class number \(1\).
2

Algebraic Numbers in Symbolic Computations

Gräbe, Hans-Gert 25 January 2019 (has links)
There are many good reasons to teach a course on a systematic introduction to symbolic methods not only to students of mathematics but also to those of technical sciences. The design of such a course meets an essential difficulty since the principles to be demonstrated appear only in non trivial applications in a convincing way, but there is no time to teach the necessary contexts to a large extend. Hence the material intended to demonstrate different effects has to be chosen with great care. The goal of this paper is to show that for such a course algebraic numbers are not only interesting by their mathematical content but also as a complex target where different concepts and principles of symbolic computations become apparent. Thus they may serve at once as a non trivial application of the basic concepts, notations and principles developed earlier in such a course.
3

Minimal Primary Decomposition and Factorized Gröbner Bases

Gräbe, Hans-Gert 25 January 2019 (has links)
This paper continues our study of applications of factorized Gröbner basis computations in [8] and [9]. We describe a way to interweave factorized Gröbner bases and the ideas in [5] that leads to a significant speed up in the computation of isolated primes for well splitting examples. Based on that observation we generalize the algorithm presented in [22] to the computation of primary decompositions for modules. It rests on an ideal separation argument. We also discuss the practically important question how to extract a minimal primary decomposition, neither addressed in [5] nor in [17]. For that purpose we outline a method to detect necessary embedded primes in the output collection of our algorithm, similar to [22, cor. 2.22]. The algorithms are partly implemented in version 2.2.1 of our REDUCE package CALI [7].
4

Algorithms in Local Algebra

Gräbe, Hans-Gert 25 January 2019 (has links)
Let k be a field, S = k[xv : v ϵ V] be the polynomial ring over the finite set of variables (xv : v ϵ V), and m = (xv : v ϵ V) the ideal defining the origin of Spec S. It is theoretically known (see e.g. Alonso et el., 1991) that the algorithmic ideas for the computation of ideal (and module) intersections, quotients, deciding radical membership etc. in S may be adopted not only for computations in the local ring Sm but also for term orders of mixed type with standard bases replacing Gröbner bases. Using the generalization of Mora's tangent cone algorithm to arbitrary term orders we give a detailed description of the necessary modifications and restrictions. In a second part we discuss a generalization of the deformation argument for standard bases and independent sets to term orders of mixed type. For local term orders these questions were investigated in Gräbe (1991). The main algorithmic ideas described are implemented in the author's REDUCE package CALI (Gräbe, 1993a).
5

Continuously Parameterized Symmetries and Buchberger's Algorithm

Hemmecke, Ralf 06 February 2019 (has links)
Systems of polynomial equations often have symmetries. In solving such a system using Buchberger's algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enables us to solve larger problems than with Buchberger's algorithm alone. This paper presents a method that shows how this can be achieved and also gives an algorithm that brings together continuously parameterized symmetries with Buchberger's algorithm.
6

Counting Polynomial Matrices over Finite Fields : Matrices with Certain Primeness Properties and Applications to Linear Systems and Coding Theory

Lieb, Julia (Dr.) January 2017 (has links) (PDF)
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.
7

The algebraic face of minimality

Wolter, Frank 11 October 2018 (has links)
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.
8

On Factorized Gröbner Bases

Gräbe, Hans-Gert 25 January 2019 (has links)
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.
9

Convolution and Fourier Transform of Second Order Tensor Fields

Hlawitschka, Mario, Ebling, Julia, Scheuermann, Gerik 04 February 2019 (has links)
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.
10

Nodal Domain Theorems and Bipartite Subgraphs

Biyikoglu, Türker, Leydold, Josef, Stadler, Peter F. 09 November 2018 (has links)
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.

Page generated in 0.0498 seconds