51 |
Extremal problems and designs on finite sets.Roberts, Ian T. January 1999 (has links)
This thesis considers three related structures on finite sets and outstanding conjectures on two of them. Several new problems and conjectures are stated.A union-closed collection of sets is a collection of sets which contains the union of each pair of sets in the collection. A completely separating system of sets is a collection of sets in which for each pair of elements of the universal set, there exists a set in the collection which contains the first element but not the second, and another set which contains the second element but not the first. An antichain (Sperner Family) is a collection of distinct sets in which no set is a subset of another set in the collection. The size of an antichain is the number of sets in the collection. The volume of an antichain is the sum of the cardinalities of the sets in the collection. A flat antichain is an antichain in which the difference in cardinality between any two sets in the antichain is at most one.The two outstanding conjectures considered are:The union-closed sets conjecture - In any union-closed collection of non-empty sets there is an element of the universal set in at least half of the sets in the collection;The flat antichain conjecture - Given an antichain with size s and volume V, there is a flat antichain with the same size and volume.Union-closed collections are considered in two ways. Improvements are made to the previously known bounds concerning the minimum size of a counterexample to the union-closed sets conjecture. Results are derived on the minimum size of a union-closed collection generated by a given number of k-sets. An ordering on sets is described, called order R and it is conjectured that choosing a collection of m k-sets in order R will always minimise the size of the union-closed collection generated by m k-sets.Several variants on completely separating systems of sets are considered. A ++ / determination is made of the minimum size of such collections, subject to various constraints on the collections. In particular, for each n and k, exact values or bounds are determined for the minimum size of completely separating systems on a n-set in which each set has cardinality k.Antichains are considered in their relationship to completely separating systems and the flat antichain conjecture is shown to be true in certain cases.
|
52 |
Representations of quivers over finite fieldsHua, Jiuzhao , Mathematics & Statistics, Faculty of Science, UNSW January 1998 (has links)
The main purpose of this thesis is to obtain surprising identities by counting the representations of quivers over finite fields. A classical result states that the dimension vectors of the absolutely indecomposable representations of a quiver ?? are in one-to-one correspondence with the positive roots of a root system ??, which is infinite in general. For a given dimension vector ?? ??? ??+, the number A??(??, q), which counts the isomorphism classes of the absolutely indecomposable representations of ?? of dimension ?? over the finite field Fq, turns out to be a polynomial in q with integer coefficients, which have been conjectured to be nonnegative by Kac. The main result of this thesis is a multi-variable formal identity which expresses an infinite series as a formal product indexed by ??+ which has the coefficients of various polynomials A??(??, q) as exponents. This identity turns out to be a qanalogue of the remarkable Weyl-Macdonald-Kac denominator identity modulus a conjecture of Kac, which asserts that the multiplicity of ?? is equal to the constant term of A??(??, q). An equivalent form of this conjecture is established and a partial solution is obtained. A new proof of the integrality of A??(??, q) is given. Three Maple programs have been included which enable one to calculate the polynomials A??(??, q) for quivers with at most three nodes. All sample out-prints are consistence with Kac???s conjectures. Another result of this thesis is as follows. Let A be a finite dimensional algebra over a perfect field K, M be a finitely generated indecomposable module over A ???K ??K. Then there exists a unique indecomposable module M??? over A such that M is a direct summand of M??? ???K ??K, and there exists a positive integer s such that Ms = M ??? ?? ?? ?? ??? M (s copies) has a unique minimal field of definition which is isomorphic to the centre of End ??(M???) rad (End ??(M???)). If K is a finite field, then s can be taken to be 1.
|
53 |
Subnormal structure of finite soluble groupsWetherell, Chris. January 2001 (has links)
No description available.
|
54 |
Computing automorphisms of finite groupsBidwell, Jonni, n/a January 2007 (has links)
In this thesis we explore the problem of computing automorphisms of finite groups, eventually focusing on some group product constructions. Roughly speaking, the automorphism group of a group gives the nature of its internal symmetry. In general, determination of the automorphism group requires significant computational effort and it is advantageous to find situations in which this may be reduced.
The two main results give descriptions of the automorphism groups of finite direct products and split metacyclic p-groups. Given a direct product G = H x K where H and K have no common direct factor, we give the order and structure of Aut G in terms of Aut H, Aut K and the central homomorphism groups Hom (H, Z(K)) and Hom (K, Z(H)). A similar result is given for the the split metacyclic p-group, in the case where p is odd. Implementations of both of these results are given as functions for the computational algebra system GAP, which we use extensively throughout.
An account of the literature and relevant standard results on automorphisms is given. In particular we mention one of the more esoteric constructions, the automorphism tower. This is defined as the series obtained by repeatedly taking the automorphism group of some starting group G₀. There is interest as to whether or not this series terminates, in the sense that some group is reached that is isomorphic to its group of automorphisms. Besides a famous result of Wielandt in 1939, there has not been much further insight gained here. We make use of the technology to construct several examples, demonstrating their complex and varied behaviour.
For the main results we introduce a 2 x 2 matrix description for the relevant automorphism groups, where the entries come from the homorphism groups mentioned previously. In the case of the direct product, this is later generalised to an n x n matrix (when we consider groups with any number of direct factors) and the common direct factor restriction is relaxed to the component groups not having a common abelian direct factor. In the case of the split metacyclic p-group, our matrices have entries that are not all homomorphisms, but are similar. We include the code for our GAP impementation of these results, which we show significantly expedites computation of the automorphism groups.
We show that this matrix language can be used to describe automorphisms of any semidirect product and certain central products too, although these general cases are much more complicated. Specifically, multiplication is no longer defined in such a natural way as is seen in the previous cases and the matrix entries are mappings much less well-behaved than homomorphisms. We conclude with some suggestion of types of semidirect products for which our approach may yield a convenient description of the automorphisms.
|
55 |
Some irreducible characters of groups with BN pairsHowlett, Robert Brian. January 1975 (has links) (PDF)
No description available.
|
56 |
Error estimates for finite element approximations of effective elastic properties of periodic structures / Feluppskattningar för finita element-approximationer av effektiva elastiska egenskaper hos periodiska strukturerPettersson, Klas January 2010 (has links)
<p>Techniques for a posteriori error estimation for finite element approximations of an elliptic partial differential equation are studied.This extends previous work on localized error control in finite element methods for linear elasticity.The methods are then applied to the problem of homogenization of periodic structures. In particular, error estimates for the effective elastic properties are obtained. The usefulness of these estimates is twofold.First, adaptive methods using mesh refinements based on the estimates can be constructed.Secondly, one of the estimates can give reasonable measure of the magnitude ofthe error. Numerical examples of this are given.</p>
|
57 |
New methods for finite field arithmeticYanik, Tu��rul 21 November 2001 (has links)
We describe novel methods for obtaining fast software implementations of the
arithmetic operations in the finite field GF(p) and GF(p[superscript k]). In GF(p) we realize
an extensive speedup in modular addition and subtraction routines and some small
speedup in the modular multiplication routine with an arbitrary prime modulus p
which is of arbitrary length. The most important feature of the method is that it
avoids bit-level operations which are slow on microprocessors and performs word-level
operations which are significantly faster. The proposed method has applications in
public-key cryptographic algorithms defined over the finite field GF(p), most notably
the elliptic curve digital signature algorithm. The new method provides up to 13% speedup in the execution of the ECDSA algorithm over the field GF(p) for the
length of p in the range 161���k���256.
In the finite extension field GF(p[superscript k]) we describe two new methods for obtaining
fast software implementations of the modular multiplication operation with an
arbitrary prime modulus p, which has less bit-length than the word-length of a microprocessor
and an arbitrary generator polynomial. The second algorithm is a significant
improvement over the first algorithm by using the same concepts introduced
in GF(p) arithmetic. / Graduation date: 2002
|
58 |
Finite volume methods and adaptive refinement for tsunami propagation and inundation /George, David L., January 2006 (has links)
Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (p. 181-188).
|
59 |
Adaptive finite element analysis for 2D elastostatic problemsLee, Chi-king. January 1992 (has links)
Thesis (M.Phil.)--University of Hong Kong, 1993. / Also available in print.
|
60 |
Hierarchical strategy for rapid finite element analysisVarghese, Julian 30 September 2004 (has links)
A new methodology is introduced where the natural hierarchical character of model descriptions and simulation results are exploited to expedite analysis of problems. The philosophy and the different concepts involved are illustrated by implementing the strategy to solve some practical problems. The end result was a mix of mechanics, well-designed data structures and software interfaces that forms a rapid analysis environment. This can be very advantageous for cases where a sequence of analyses is required because of safety concerns or cost. When designing a structure, it is common to make frequent modifications to the model during the process. In such cases, the ability to use data from different models within the same analysis environment becomes a major advantage. The proposed system's forte is its hierarchical framework that allows models to communicate with each other and share information with one another. This makes it ideal for global local analyses where solutions from a global model are used to derive the boundary conditions for the local model. The system was also used to conduct a micro mechanical analysis on unidirectional composites that have a non-uniform spatial distribution of the fibers. The hierarchical strategy is not tied to any specific methodology and can be adapted to solve problem using different technologies. This allows the strategy to be used across multiple length scales and governing equations.
|
Page generated in 0.0227 seconds