• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • 2
  • 2
  • Tagged with
  • 9
  • 9
  • 4
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 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

Equivalent Sets and Cardinal Numbers

Hsueh, Shawing 12 1900 (has links)
The purpose of this thesis is to study the equivalence relation between sets A and B: A o B if and only if there exists a one to one function f from A onto B. In Chapter I, some of the fundamental properties of the equivalence relation are derived. Certain basic results on countable and uncountable sets are given. In Chapter II, a number of theorems on equivalent sets are proved and Dedekind's definitions of finite and infinite are compared with the ordinary concepts of finite and infinite. The Bernstein Theorem is studied and three different proofs of it are given. In Chapter III, the concept of cardinal number is introduced by means of two axioms of A. Tarski, and some fundamental theorems on cardinal arithmetic are proved.
2

On the Fundamental Relationships Among Path Planning Alternatives

Knepper, Ross A 01 June 2011 (has links)
Robotic motion planning aspires to match the ease and efficiency with which humans move through and interact with their environment. Yet state of the art robotic planners fall short of human abilities; they are slower in computation, and the results are often of lower quality. One stumbling block in traditional motion planning is that points and paths are often considered in isolation. Many planners fail to recognize that substantial shared information exists among path alternatives. Exploitation of the geometric and topological relationships among path alternatives can therefore lead to increased efficiency and competency. These benefits include: better-informed path sampling, dramatically faster collision checking, and a deeper understanding of the trade-offs in path selection. In path sampling, the principle of locality is introduced as a basis for constructing an adaptive, probabilistic, geometric model to influence the selection of paths for collision test. Recognizing that collision testing consumes a sizable majority of planning time and that only collision-free paths provide value in selecting a path to execute on the robot, this model provides a significant increase in efficiency by circumventing collision testing paths that can be predicted to collide with obstacles. In the area of collision testing, an equivalence relation termed local path equivalence, is employed to discover when the work of testing a path has been previously performed. The swept volumes of adjoining path alternatives frequently overlap, implying that a continuum of intermediate paths exists as well. By recognizing such neighboring paths with related shapes and outcomes, up to 90% of paths may be tested implicitly in experiments, bypassing the traditional, expensive collision test and delivering a net 300% boost in collision test performance. Local path equivalence may also be applied to the path selection problem in order to recognize higher-level navigation options and make smarter choices. This thesis presents theoretical and experimental results in each of these three areas, as well as inspiration on the connections to how humans reason about moving through spaces.
3

The Boundary A-(T)-menability of the Space of Finite Bounded Degree Graphs

Businhani Biz, Leonardo 23 November 2021 (has links)
Following the mechanisms, where the coarse geometric properties of a space with bounded geometry can induce properties on the related coarse (boundary) groupoid and vice versa, we prove that a sequence of bounded degree graphs being hyperfinite is equivalent to the equivalence relation induced by the coarse boundary groupoid associated to this sequence being hyperfinite. Even more, we introduce a coarse and weaker notion of Property A in a sequence of graphs, called Property A on average, that also turns out to be equivalent to the hyperfiniteness of a sequence of bounded degree graphs. Furthermore, we show that if the coarse boundary groupoid is topologically a-T-menable, then the related sequence of bounded degree graphs is asymptotically coarsely embeddable into a Hilbert space. In the measurable case, we also have the asymptotic coarse embeddability of the sequence of graphs after discarding small subgraphs along the sequence and looking at this new sequence of graphs with the induced length metric of original graph. Afterwards those result are applicable to sofic groups. When we take the sequence of graphs to be a sofic approximation of an amenable discrete finitely generated sofic group, we know that this sequence is hyperfinte, has property A on average and property almost-A. If the group is a-T-menable then the sequence of graphs is weakly asymptotically coarsely embeddable into a Hilbert space.
4

Abelian Group Actions and Hypersmooth Equivalence Relations

Cotton, Michael R. 05 1900 (has links)
We show that any Borel action on a standard Borel space of a group which is topologically isomorphic to the sum of a countable abelian group with a countable sum of lines and circles induces an orbit equivalence relation which is hypersmooth. We also show that any Borel action of a second countable locally compact abelian group on a standard Borel space induces an orbit equivalence relation which is essentially hyperfinite, generalizing a result of Gao and Jackson for the countable abelian groups.
5

Propriétés algébriques d'une algèbre de convolution

Magnifo Kahou, Florence Laure January 2009 (has links)
Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal.
6

Propriétés algébriques d'une algèbre de convolution

Magnifo Kahou, Florence Laure January 2009 (has links)
Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal
7

Definovatelne grafy / Definable graphs

Grebík, Jan January 2020 (has links)
In this thesis we consider various questions and problems about graphs that appear in the framework of descriptive set theory. The main object of study are graphons, graphings and variations of the graph G0. We establish an approach to the compactness of the graphon space via the weak* topology and introduce the notion of a fractional isomorphism for graphons. We use a variant of the G0-dichotomy in the context of the classification problem. Finally, we show a measurable version of the Vizing's theorem for graphings. 1
8

Construção dos números reais via cortes de Dedekind / Construction of the real numbers via Dedekind cuts

Pimentel, Thiago Trindade 03 September 2018 (has links)
O objetivo desta dissertação é apresentar a construção dos números reais a partir de cortes de Dedekind. Para isso, vamos estudar os números naturais, os números inteiros, os números racionais e as propriedades envolvidas. Então, a partir dos números racionais, iremos construir o corpo dos números reais e estabelecer suas propriedades. Um corte de Dedekind, assim nomeado em homenagem ao matemático alemão Richard Dedekind, é uma partição dos números racionais em dois conjuntos não vazios A e B em que cada elemento de A é menor do que todos os elementos de B e A não contém um elemento máximo. Se B contiver um elemento mínimo, então o corte representará este elemento mínimo, que é um número racional. Se B não contiver um elemento mínimo, então o corte definirá um único número irracional, que preenche o espaço entre A e B. Desta forma, pode-se construir o conjunto dos números reais a partir dos racionais e estabelecer suas propriedades. Esta dissertação proporcionará aos estudantes do Ensino Médio, interessados em Matemática, uma formação sólida em um de seus pilares, que é o conjunto dos números reais e suas operações algébricas e propriedades. Isso será muito importante para a formação destes alunos e sua atuação educacional. / The purpose of this dissertation is to present the construction of the real numbers from Dedekind cuts. For this, we study the natural numbers, the integers, the rational numbers and some properties involved. Then, based on the rational numbers, we construct the field of the real numbers and establish their properties. A Dedekind cut, named after the German mathematician Richard Dedekind, is a partition of the rational numbers into two non-empty sets A and B, such that each element of A is smaller than all elements of B and A does not contain a maximum element. If B contains a minimum element, then the cut represents this minimum element, which is a rational number. If B does not contain a minimal element, then the cut defines a single irrational number, which \"fills the gap\" between A and B. In this way, one can construct the set of real numbers from the rationals and establish their properties. This dissertation provides students who like Mathematics a solid basis in one of the pillars of Mathematics, which is the set of real numbers and their algebraic operations and properties. This text will be very important for your educational background and performance.
9

Construção dos números reais via cortes de Dedekind / Construction of the real numbers via Dedekind cuts

Thiago Trindade Pimentel 03 September 2018 (has links)
O objetivo desta dissertação é apresentar a construção dos números reais a partir de cortes de Dedekind. Para isso, vamos estudar os números naturais, os números inteiros, os números racionais e as propriedades envolvidas. Então, a partir dos números racionais, iremos construir o corpo dos números reais e estabelecer suas propriedades. Um corte de Dedekind, assim nomeado em homenagem ao matemático alemão Richard Dedekind, é uma partição dos números racionais em dois conjuntos não vazios A e B em que cada elemento de A é menor do que todos os elementos de B e A não contém um elemento máximo. Se B contiver um elemento mínimo, então o corte representará este elemento mínimo, que é um número racional. Se B não contiver um elemento mínimo, então o corte definirá um único número irracional, que preenche o espaço entre A e B. Desta forma, pode-se construir o conjunto dos números reais a partir dos racionais e estabelecer suas propriedades. Esta dissertação proporcionará aos estudantes do Ensino Médio, interessados em Matemática, uma formação sólida em um de seus pilares, que é o conjunto dos números reais e suas operações algébricas e propriedades. Isso será muito importante para a formação destes alunos e sua atuação educacional. / The purpose of this dissertation is to present the construction of the real numbers from Dedekind cuts. For this, we study the natural numbers, the integers, the rational numbers and some properties involved. Then, based on the rational numbers, we construct the field of the real numbers and establish their properties. A Dedekind cut, named after the German mathematician Richard Dedekind, is a partition of the rational numbers into two non-empty sets A and B, such that each element of A is smaller than all elements of B and A does not contain a maximum element. If B contains a minimum element, then the cut represents this minimum element, which is a rational number. If B does not contain a minimal element, then the cut defines a single irrational number, which \"fills the gap\" between A and B. In this way, one can construct the set of real numbers from the rationals and establish their properties. This dissertation provides students who like Mathematics a solid basis in one of the pillars of Mathematics, which is the set of real numbers and their algebraic operations and properties. This text will be very important for your educational background and performance.

Page generated in 0.1191 seconds