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 12 of 12 for “"elementary proof"”.
-
The Rogers -Ramanujan Continued Fraction and a Certain Quotient of ETA Functions Found in Ramanujan's Lost Notebook
Finally, a new proof of Winquist's identity which is essential for an elementary proof for Ramanujan's famous partition identity modulo 11, p(11n + 6) ≡ 0 (mod 11) is provided in the last part of the thesis.
-
Uma formalização da mecânica analítica dos sistemas de corpos rígidos
… equations, without using Euler's angles. And an elementary proof for the velocity field of a rigid body moving with a fixed point is presented.
-
Eternal Solutions and Heteroclinic Orbits of a Semilinear Parabolic Equation
… variable coefficients. Along the way, a new and elementary proof of existence and uniqueness of solutions is given. Heteroclinic orbits are shown to be characterized by a particular functional being finite. A novel asymptotic-numeric matching scheme is used to uncover delicate bifurcation …
-
Several Problems Concerning Multivariate Functions and Associated Operators
… on the bidisk using positive kernels. An elementary proof of the existence of Agler decompositions is provided, which uses special shift-invariant subspaces of the Hardy space. These shift-invariant subspaces are specific cases of Hilbert spaces that can be defined from Agler …
-
Identities involving theta functions and analogues of theta functions
… functions. In Chapter 1, we give a completely elementary proof of Ramanujan's circular summation formula of theta functions and its generalizations given by S. H. Chan and Z. -G. Liu, and J. M. Zhu, who used the theory of elliptic functions. In contrast to all other proofs, our proofs are …
-
On subset-sum-distinct sequences of positive integers
… sequence. Here his result is obtained by elementary ""Karamata-type"" inequalities that are shown to have a wide range of applicability to many related problems. Included is an elementary proof of the theorem of Steele, Hanson, and Stenger. In addition to many variations on the original …
-
MF algebras and a Bishop -Stone -Weierstrass theorem result
… the second part of the dissertation, we give an elementary proof of the Bishop-Stone-Weierstrass theorem for all unital subalgebras of M2&parl0;C&parr0; n with respect to its pure states. We show that the pure-state Bishop hull of a unital subalgebra (not necessarily selfadjoint) of …
-
Chain and antichain enumeration in posets, and b-ary partitions
… and antichains in these lattices. We give an elementary proof of the rank-unimodality of L(2, n, m), and find a symmetric chain decomposition of L(2, 2, m). We also present some partial results and conjectures about related posets, including a theorem on the size of the largest union of k …
-
Free entropy dimensions and approximate liftings
… chapter of the dissertation, we give a very elementary proof of a more detailed version of one of D. Voiculescu's results, which was a key ingredient in Voiculescu's proof that his free entropy is additive when the variables are free.</p><p>In the second chapter of the dissertation, based on …
-
Homological Illusions of Persistence and Stability
… A side effect of the update algorithm is an elementary proof of the stability of persistence diagrams. We introduce a parametrized family of persistence diagrams called persistence vineyards and illustrate the concept with a vineyard describing a folding of a small peptide. We also base a …
-
Distances in planar graphs
… and diameter of a maximal planar graph, give an elementary proof of the well known characterisation of minimal separators in maximal planar graphs, characterise non-separating sets of these graphs, and demonstrate that the centre of a maximal planar graph may have arbitrarily many components. We …
-
Geometric algorithms for reconfigurable structures
… and Mayer-Vietoris sequences, but we give an elementary proof based on purely geometric arguments. The Line-Piercing Theorem also leads to efficient algorithms for computing the maxspan of fixed-angle chains. In the third problem, efficient reconfiguration of pivoting tiles, we present an …