Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 198 for “"reducibility"”.
-
Settling Time Reducibility Orderings
It is known that orderings can be formed with settling time domination and strong settling time domination as relations on c.e. sets. However, it has been shown that no such ordering can be formed when considering computation time domination as a relation on $n$-c.e. sets where $n \geq 3$. This …
-
Aspects of G-Complete reducibility
… of G. Corresponding to the notion of G complete reducibility, due to J.-P. Serre, we introduce a new notion of (G; ?)-complete reducibility. We show that a ?-stable subgroup of G is (G; ?)-completely reducible if and only if it is G-completely reducible. We also strengthen this result in one …
-
REDUCIBILITY OF PARABOLICALLY INDUCED REPRESENTATIONS
… Southern Illinois University Carbondale. TITLE: REDUCIBILITY OF PARABOLICALLY INDUCED REPRESENTATIONS MAJOR PROFESSOR: Dr. D. Ban Reducibility of parabolically induced representations of $p$-adic groups is one of the basic questions in the representation theory, and generally a hard question. …
-
Computable Reducibility of Equivalence Relations
Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence relations on natural numbers. Its use is important to those doing Borel equivalence relation theory, computability theory, and computable structure theory. In this thesis, we compare many naturally …
-
Enumeration Reducibility and Partial Degrees
Made available in DSpace on 2014-12-09T22:17:52Z (GMT). No. of bitstreams: 1 7000811.pdf: 1491090 bytes, checksum: c324981fa561e937da3037fdc326bb1b (MD5) Previous issue date: 1969
-
Weihrauch Reducibility and Finite-Dimensional Subspaces
… and graphs from the perspective of Weihrauch reducibility. We study the problem of decomposing a countable vector space or countable matroid into 1-dimensional subspaces. We also study the problem of producing a finite-dimensional or 1-dimensional subspace of a countable vector space, and …
-
Complete Reducibility In Euclidean Twin Buildings
… the definitions of convexity and complete reducibility in twin buildings and some implications of the two in the Euclidean case.
-
Complete reducibility in Kac-Moody groups
… concludes by defining a notion of complete reducibility for convex subsets of twin citadels. This leads to a new notion of G-complete reducibility for subgroups of Kac-Moody groups, generalising existing formulations that have been derived using the twin building.
-
Reducibility of Schrödinger Operators on Multilayer Graphs
… typically necessary for obtaining such types of reducibility. Discrete and quantum graph models are commonly used in this context as they often capture the relevant features of the physical system in consideration. This dissertation lays out the framework for studying different types of …
-
A combinatorial approach to relative complete reducibility
… group G, the notion of relative complete reducibility gives an algebraic description of the closed K-orbits in Gn, where K acts by simultaneous conjugation. In this thesis we show that questions about reductive groups acting on arbitrary affine varieties can be translated to the setting of …
-
Reducibility of Euclidean Immersions of Low Codimension
Made available in DSpace on 2014-12-09T22:17:41Z (GMT). No. of bitstreams: 1 6808011.pdf: 1409799 bytes, checksum: 7a867233d11b85255fcaac2a4df08eaa (MD5) Previous issue date: 1967
-
Algebraic Methods for Reducibility in Nowhere-Zero Flows
We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of reducibility. We define variables which in some sense count the number of …
-
Reducibility, Degree Spectra, and Lowness in Algebraic Structures
… complexities of RF, SF, and g(F) under m-reducibility and under bT-reducibility. Work by R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an …
-
Domains and reducibility (An elementary introduction to the Galois Theory)
Thesis (M.A.)--Boston University, 1933. This item was digitized by the Internet Archive.
-
Rationality problems for complete reducibility of subgroups of reductive algebraic groups
… concerning rationality problems for complete reducibility of subgroups of G and various related problems ... We obtain various general results concerning complete reducibility over an arbitrary k via geometric invariant theory (GIT for short) and the theory of spherical building (in particular …
-
Extended identities: The reducibility of non-categorical properties and their bearers
When we take apart big or complicated things—whether events, processes, systems, objects or states—we find smaller or simpler things. Still, some who purport that everything is physical also want to deny that complicated things are sets of simpler things, their relations, and interactions. But that …
-
A REDUCIBILITY PROBLEM FOR EVEN UNITARY GROUPS: THE DEPTH ZERO CASE
We study a problem concerning parabolic induction in certain p-adic unitary groups. More precisely, for $E/F$ a quadratic extension of p-adic fields the associated unitary group $\mathrm{U}(n,n)$ contains a parabolic subgroup $P$ with Levi component $L$ isomorphic to $\mathrm{GL}_n(E)$. Let $\pi$ …
Page 1 of 10