Log in

Relevant bibliographies by topics / Finite / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Finite.

Dissertations / Theses on the topic 'Finite'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 August 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Finite.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

江傑新 and Jackson Kong. "Analysis of plate-type structures by finite strip, finite prism and finite layer methods." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B31233594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kong, Jackson. "Analysis of plate-type structures by finite strip, finite prism and finite layer methods /." [Hong Kong : University of Hong Kong], 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13788048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pham, Du. "Comparison of finite volume and finite difference methods and convergence results for finite volume schemes." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3277975.

Full text

Abstract:

Thesis (Ph. D.)--Indiana University, Dept. of Mathematics, 2007.
Source: Dissertation Abstracts International, Volume: 68-09, Section: B, page: 6004. Adviser: Roger Temam. Title from dissertation home page (viewed May 8, 2008).

APA, Harvard, Vancouver, ISO, and other styles

4

Ersoy, Kivanc. "Centralizers Of Finite Subgroups In Simple Locally Finite Groups." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12610850/index.pdf.

Full text

Abstract:

A group G is called locally finite if every finitely generated subgroup of G is finite. In this thesis we study the centralizers of subgroups in simple locally finite groups. Hartley proved that in a linear simple locally finite group, the fixed point of every semisimple automorphism contains infinitely many elements of distinct prime orders. In the first part of this thesis, centralizers of finite abelian subgroups of linear simple locally finite groups are studied and the following result is proved: If G is a linear simple locally finite group and A is a finite d-abelian subgroup consisting of semisimple elements of G, then C_G(A) has an infinite abelian subgroup isomorphic to the direct product of cyclic groups of order p_i for infinitely many distinct primes pi. Hartley asked the following question: Let G be a non-linear simple locally finite group and F be any subgroup of G. Is CG(F) necessarily infinite? In the second part of this thesis, the following problem is studied: Determine the nonlinear simple locally finite groups G and their finite subgroups F such that C_G(F) contains an infinite abelian subgroup which is isomorphic to the direct product of cyclic groups of order pi for infinitely many distinct primes p_i. We prove the following: Let G be a non-linear simple locally finite group with a split Kegel cover K and F be any finite subgroup consisting of K-semisimple elements of G. Then the centralizer C_G(F) contains an infinite abelian subgroup isomorphic to the direct product of cyclic groups of order p_i for infinitely many distinct primes p_i.

APA, Harvard, Vancouver, ISO, and other styles

5

Abou, Ghadir Mohamed Mohamed Moustafa. "Combined finite strip and finite element methods in structural analysis." Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.446434.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ngassam, Ernest Ketcha. "Hardcoding finite automata." Pretoria : [s.n.], 2005. http://upetd.up.ac.za/thesis/available/etd-06132005-115153/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wu, Hanji. "Finite Bargaining Problems." Digital Archive @ GSU, 2007. http://digitalarchive.gsu.edu/econ_diss/32.

Full text

Abstract:

Bargaining is a process to decide how to divide shared resources between two or more players. And axiomatic bargaining specifies desirable and simple properties the outcome of the bargaining should satisfy and identifies the solution that produces this outcome. This approach was first developed by John Nash in his seminal work(Nash 1950). Since then, numerous studies have been done on bargaining problems with convex feasible set or with non-convex but comprehensive feasible set. There is, however, little work on finite bargaining problems. In this dissertation, we study finite bargaining problems systematically by extending the standard bargaining model to the one consisting of all finite bargaining problems. For our bargaining problems, we first propose the Nash, Maximin, Leximin, Maxiproportionalmin, Lexiproportianlmin solutions, which are the counterparts of those that have been studied extensively in both convex and non-convex but comprehensive problems. We then axiomatically characterize these solutions in our context. We next introduce two new solutions, the maximin-utilitarian solution and the utilitarian-maximin solution, each of which combines the maximin solution and utilitarian solution in different ways. The maximin-utilitarian solution selects the alternatives from the maximin solution that have the greatest sum of individuals’ utilities, and the utilitarian-maximin solution selects the maximin alternatives from the utilitarian solution. These two solutions attempt to combine two important but very different ethical principles to produce compromised solutions to bargaining problems. Finally, we discuss several variants of the egalitarian solution. The egalitarian solution in finite bargaining problems is more complicated than its counterpart in either convex or non-convex but comprehensive bargaining problems. Given its complexity in our context, we start our inquiry by investigating two-person, finite bargaining problems, and then extend some of the analysis to n-person, finite bargaining problems. Our analysis of finite bargaining problems and axiomatic characterizations of the extensions of various standard solutions of convex/non-convex but comprehensive bargaining problems to finite bargaining problems will shed new light on the behavior of these solutions. Our new solutions will expand our understanding of the bargaining theory and distributive justice from a different perspective.

APA, Harvard, Vancouver, ISO, and other styles

8

Phillips, Joel. "Pyramidal finite elements." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=96844.

Full text

Abstract:

Pyramidal finite elements can be used as "glue" to combine elements with triangular faces (e.g. tetrahedra) and quadrilateral faces (e.g. hexahedra) in the same mesh. Existing pyramidal finite elements are low order or unsuitable for mixed finite element formulations. In this thesis, two separate families of pyramidal finite elements are constructed. The elements are equipped with unisolvent degrees of freedom and shown to be compatible with existing high order tetrahedral and hexahedral elements. Importantly, the elements are shown to deliver high order approximations and to satisfy a "commuting diagram property", which ensures their suitability for problems whose mixed formulation lies in the spaces of the de Rham complex. It is shown that all pyramidal elements must use non-polynomial basis functions and that this means that the classical theory of finite elements is unable to determine what quadrature methods should be used to assemble stiffness matrices when using pyramids. This problem is resolved by extending the classical theory and a quadrature scheme appropriate for high order pyramidal elements is recommended. Finally, some numerical experiments using pyramidal elements are presented.
Les éléments finis pyramidaux peuvent servir comme «colle» pour combiner des éléments avec faces triangulaires (p. ex. tétraèdres) et avec faces quadrilaterales (p. ex. hexaèdres) dans un même maillage. Les éléments finis pyramidaux qui existent présentement sont soit de bas-ordre ou ne sont pas convenables pour les formulations mixtes d'éléments finis. Dans cette thèse, deux familles d'éléments finis pyramidaux sont construites. Les éléments sont équipés de degrés de libertés unisolvents et on démontre qu'ils sont compatibles avec les éléments pré-existantes triangulaires et quadrilaterales d'ordres élevés. On démontre notamment que les éléments produisent des approximations d'ordres élevés et satisfassent une «propriété de diagramme commutatif». Ceci assure que les éléments sont convenables pour des problèmes avec formulation mixte dans les espaces du complexe de Rham. On démontre que tous les éléments pyramidaux doivent utiliser des fonctions de base non-polynômes et que conséquemment la théorie classique des éléments finis ne peut pas déterminer quelles méthodes de quadrature devrait être employées pour assembler des matrices de rigidité lorsque les pyramides sont utilisées. Le problème est résolu en élargissant la théorie classique et une méthode de quadrature appropriée pour les éléments finis pyramidaux est suggérée. Finalement, des simulations numériques avec éléments pyramidaux sont présentées.

APA, Harvard, Vancouver, ISO, and other styles

9

Teng, Puay Tan Andy. "Intelligent Finite Element." Thesis, University of Exeter, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.506062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Forde, Darren Andrew. "Infrared finite amplitudes." Thesis, Durham University, 2004. http://etheses.dur.ac.uk/3047/.

Full text

Abstract:

Soft and collinear singularities, known collectively as infrared singularities here, plague the calculation of scattering amplitudes in gauge theories with massless particles such as QCD. The aim of this thesis is to describe methods of deriving amplitudes that are infrared finite and therefore do not suffer from this problem. We begin with an overview of scattering theory which includes a detailed discussion of the source of infrared singularities and outlines approaches that can be used to avoid them. Taking one of these approaches, namely that of dressed states, we give a detailed description of how such states can be constructed. We then proceed to give an explicit example calculation of the total cross section of the process e+e(^-) →2 jets at NLO. In this example we construct dressed amplitudes and demonstrate their lack of infrared singularities and then go on to show that the total cross section is the same as that calculated using standard field theory techniques. We then move on and attempt to improve the efficiency of calculations using dressed states amplitudes. We describe some of the problems of the method, specifically the large numbers of diagrams produced and the multiple different delta functions present in each amplitude. In attempting to fix these issues we demonstrate the difficulties of producing covariant amplitudes from this formalism. Finally we propose the use of the asymptotic interaction representation as a solution to these difficulties and outline a method of producing covariant infrared finite scattering amplitudes using this.

APA, Harvard, Vancouver, ISO, and other styles

11

Walczak-Typke, Agatha C. "Dedekind-finite structures." Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418189.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Angelopoulos, Nicos. "Probabilistic finite domains." Thesis, City University London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Steers, Luke. "Algebraic finite domination." Thesis, Queen's University Belfast, 2017. https://pure.qub.ac.uk/portal/en/theses/algebraic-finite-domination(f1e6eccf-ecc3-4601-9fab-6d4aa25bfd57).html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Calisch, Samuel Eli. "Physical finite elements." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/95595.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 62-65).
Engineering with digital materials, by discretely and reversibly assembling structure and function from a mass-produced construction kit of parts, is indeed an exciting vision. The ability to decouple conventionally linked material properties and reach new territory in parameter space has already been demonstrated [12] by the fabrication of ultralight samples with extreme specific stiffness. Further, these material properties can be spatially varied, opening new possibilities in engineering design. The discrete assembly process also frees us from constraints of monolithic manufacturing and the corresponding supply chains. Thus, this approach offers compelling promise for the design, manufacture, and deployment of large structures. In this thesis, we argue that digital materials offer a further benefit in the power and accuracy of simulation possible, as compared to modeling materials with less order. At the most general level, this comes from mirroring the discrete nature of the structure in the mathematical model, creating a hierarchical representation of the assembly and treating each level independently. The results can reduce the cost to design and validate complex structures, in both the required computational resources, as well as the time and testing cycles of human engineers. We outline several techniques for structural modeling of such digital material assemblies, focusing on workflow flexibility and engineering empowerment through custom design tools. We demonstrate two effective table-top part production techniques: one for producing many tightly-toleranced parts for validating simulations and one for producing high performance, directionally aligned composite parts in an out-of-autoclave process. We implement several structural tests in hardware and software, comparing results from modeling with empirical data. We show that at both the scale of individual parts, as well as of large assemblies, models synthesized from beam bending equations outperform more complicated and computationally intensive finite element simulations. Finally, we undertake an ambitious design study using these tools, using both simulation and physical testing to predict performance. The results suggest the feasibility of building skinned, lighter-than-air digital material structures, capable of withstanding atmospheric crush pressures and floating under the lift generated by the displaced air.
by Samuel Eli Calisch.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

15

Vicedo, Benoît. "Finite-g strings." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ngassam, Ernest Ketcha. "Hardcoding finite automata." Diss., University of Pretoria, 2003. http://hdl.handle.net/2263/25486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Agnew, Ryan. "In/finite limits." The Ohio State University, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=osu1322584948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Hamkar, Ahmad-Wahadj [Verfasser]. "Eine iterationsfreie Finite-Elemente Methode im Rahmen der finiten Thermoviskoelastizität / Ahmad-Wahadj Hamkar." Clausthal-Zellerfeld : Universitätsbibliothek Clausthal, 2013. http://d-nb.info/1042470359/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Xie, Li Information Technology &amp Electrical Engineering Australian Defence Force Academy UNSW. "Finite horizon robust state estimation for uncertain finite-alphabet hidden Markov models." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2004. http://handle.unsw.edu.au/1959.4/38664.

Full text

Abstract:

In this thesis, we consider a robust state estimation problem for discrete-time, homogeneous, first-order, finite-state finite-alphabet hidden Markov models (HMMs). Based on Kolmogorov's Theorem on the existence of a process, we first present the Kolmogorov model for the HMMs under consideration. A new change of measure is introduced. The statistical properties of the Kolmogorov representation of an HMM are discussed on the canonical probability space. A special Kolmogorov measure is constructed. Meanwhile, the ergodicity of two expanded Markov chains is investigated. In order to describe the uncertainty of HMMs, we study probability distance problems based on the Kolmogorov model of HMMs. Using a change of measure technique, the relative entropy and the relative entropy rate as probability distances between HMMs, are given in terms of the HMM parameters. Also, we obtain a new expression for a probability distance considered in the existing literature such that we can use an information state method to calculate it. Furthermore, we introduce regular conditional relative entropy as an a posteriori probability distance to measure the discrepancy between HMMs when a realized observation sequence is given. A representation of the regular conditional relative entropy is derived based on the Radon-Nikodym derivative. Then a recursion for the regular conditional relative entropy is obtained using an information state method. Meanwhile, the well-known duality relationship between free energy and relative entropy is extended to the case of regular conditional relative entropy given a sub-[special character]-algebra. Finally, regular conditional relative entropy constraints are defined based on the study of the probability distance problem. Using a Lagrange multiplier technique and the duality relationship for regular conditional relative entropy, a finite horizon robust state estimator for HMMs with regular conditional relative entropy constraints is derived. A complete characterization of the solution to the robust state estimation problem is also presented.

APA, Harvard, Vancouver, ISO, and other styles

20

Block, Max. "Undecidability of finite satisfiability and characterization of NP in finite model theory." Thesis, Uppsala universitet, Algebra och geometri, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-254570.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Guzelbey, Ibrahim H. "Finite and boundary element analysis of elasto-plastic finite strain contact problems." Thesis, Cranfield University, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Adams, Leila. "Finite element method using vector finite elements applied to eddy current problems." Master's thesis, University of Cape Town, 2011. http://hdl.handle.net/11427/9992.

Full text

Abstract:

Vector fields found in electromagnetics are fundamentally different to vector fields found in other research areas such as structural mechanics. Electromagnetic vector fields possess different physical behaviour patterns and different properties in comparison to the other vector fields and therein lies the necessity of the development of a finite element which would be able to cater for these differences . The vector finite element was then developed and used within the finite element method specifically for the approximation of electromagnetic problems. This dissertation investigates the partial differential equation that governs eddy current behaviour. A finite element algorithm is coded and used to solve this partial differential equation and produce vector field simulations for fundamental eddy current problems.

APA, Harvard, Vancouver, ISO, and other styles

23

Heisserer, Ulrich. "High order finite elements for material and geometric nonlinear finite strain problems." Aachen Shaker, 2008. http://d-nb.info/991820061/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Lee, Kum Young Davies William D. "Finite control in Korean." Iowa City : University of Iowa, 2009. http://ir.uiowa.edu/etd/394.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Bakalov, Bojko, Alessandro D'Andrea, Victor G. Kac, and bakalov@math mit edu. "Theory of Finite Pseudoalgebras." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi916.ps.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Brown, Scott. "Finite reducible matrix algebras." University of Western Australia. School of Mathematics and Statistics, 2006. http://theses.library.uwa.edu.au/adt-WU2006.0079.

Full text

Abstract:

[Truncated abstract] A matrix is said to be cyclic if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe of Neumann and Praeger. In 1999, Wall and Fulman independently proved that the proportion of cyclic matrices in general linear groups over a finite field of fixed order q has limit [formula] as the dimension approaches infinity. First we study cyclic matrices in maximal reducible matrix groups, that is, the stabilisers in general linear groups of proper nontrivial subspaces. We modify Wall’s generating function approach to determine the limiting proportion of cyclic matrices in maximal reducible matrix groups, as the dimension of the underlying vector space increases while that of the invariant subspace remains fixed. This proportion is found to be [formula] note the change of the exponent of q in the leading term of the expansion. Moreover, we exhibit in each maximal reducible matrix group a family of noncyclic matrices whose proportion is [formula]. Maximal completely reducible matrix groups are the stabilisers in a general linear group of a nontrivial decomposition U1⊕U2 of the underlying vector space. We take a similar approach to determine the limiting proportion of cyclic matrices in maximal completely reducible matrix groups, as the dimension of the underlying vector space increases while the dimension of U1 remains fixed. This limiting proportion is [formula]. ... We prove that this proportion is[formula] provided the dimension of the fixed subspace is at least two and the size q of the field is at least three. This is also the limiting proportion as the dimension increases for separable matrices in maximal completely reducible matrix groups. We focus on algorithmic applications towards the end of the thesis. We develop modifications of the Cyclic Irreducibility Test - a Las Vegas algorithm designed to find the invariant subspace for a given maximal reducible matrix algebra, and a Monte Carlo algorithm which is given an arbitrary matrix algebra as input and returns an invariant subspace if one exists, a statement saying the algebra is irreducible, or a statement saying that the algebra is neither irreducible nor maximal reducible. The last response has an upper bound on the probability of incorrectness.

APA, Harvard, Vancouver, ISO, and other styles

27

Mirza, Shemila. "Algorithms for finite structures." Thesis, Royal Holloway, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Margetts, Lee. "Parallel finite element analysis." Thesis, University of Manchester, 2002. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:70784.

Full text

Abstract:

Finite element analysis is versatile and used widely in a range of engineering andscientific disciplines. As time passes, the problems that engineers and designers areexpected to solve are becoming more computationally demanding. Often theproblems involve the interplay of two or more processes which are physically andtherefore mathematically coupled. Although parallel computers have been availablefor about twenty years to satisfy this demand, finite element analysis is still largelyexecuted on serial machines. Parallelisation appears to be difficult, even for thespecialist. Parallel machines, programming languages, libraries and tools are used toparallelise old serial programs with mixed success. In some cases the serialalgorithm is not naturally suitable for parallel computing. Some argue that rewritingthe programs from scratch, using an entirely different solution strategy is a betterapproach. Taking this point of view, using MPI for portability, a mesh free elementby element method for simple data distribution and the appropriate iterative solvers,a general parallel strategy for finite element analysis is developed and assessed.

APA, Harvard, Vancouver, ISO, and other styles

29

Morley-Fletcher, Mark. "Covariant infrared finite amplitudes." Thesis, Durham University, 2005. http://etheses.dur.ac.uk/2718/.

Full text

Abstract:

The calculation of observables in gauge theories with massless particles such as QCD - by traditional methods is significantly complicated by the presence of soft and collinear singularities, collectively termed infrared divergences, in the scattering amplitudes. The aim of this thesis is to investigate calculational methods which produce finite results at the amplitude level. We discuss the origin of the infrared divergences and outline some previous approaches to constructing finite amplitudes. After reviewing the traditional method for performing calculations we see how incorrect assumptions result in the presence of infrared divergences and what steps must be taken in order to produce infrared finite results. We then investigate how these ideas could be applied to the calculation of specific amplitudes. We see that there are problems involved in applying this exact approach, but that it suggests the adoption of a workable, more pragmatic alternative. We use this method in an explicit example calculation of the contributing cross sections for the process e+e (^_)> jets at O(as). We demonstrate that we recover the same result as that obtained with standard field theory techniques. We then briefly discuss how this approach might be adapted to suit more complex calculations and, eventually, a completely numerical approach.

APA, Harvard, Vancouver, ISO, and other styles

30

Bousbouras, Spiros. "Finite spectra of sentences." Thesis, University of Leeds, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435789.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Mohseninia, Mohsen. "Concurrent finite element optimisation." Thesis, University of Hertfordshire, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Voloch, J. F. "Curves over finite fields." Thesis, University of Cambridge, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

JÃnior, Raimundo de AraÃjo Bastos. "Commutators in finite groups." Universidade Federal do CearÃ, 2010. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=5496.

Full text

Abstract:

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico
Os problemas que abordaremos estÃo diretamente associados Ã existÃncia de elementos no subgrupo derivado que nÃo sÃo comutadores. Nosso objetivo serÃ apresentar os resultados de Tim Bonner, que sÃo estimativas para a razÃo entre o comprimento do derivado e a ordem do grupo (limitaÃÃo superior e determinaÃÃo do "comportamento assintÃtico"), culminando com uma prova da conjectura de Bardakov.
The problems which we address in this work are directly related to the existence of elements in the derived subgroup that are not commutators. Our purpose is to present the results of Tim Bonner [1]. In his paper, one finds estimates for the ratio between the commutator length and the order of group (more precisely, upper limits and the establishment of its asymptotic behavior), leading to the proof of Bardakov's Conjecture.

APA, Harvard, Vancouver, ISO, and other styles

34

Gupta, A. "Equilibria in finite games." Thesis, University of Liverpool, 2016. http://livrepository.liverpool.ac.uk/3001507/.

Full text

Abstract:

This thesis studies various equilibrium concepts in the context of finite games of infinite duration and in the context of bi-matrix games. We considered the game settings where a special player - the leader - assigns the strategy profile to herself and to every other player in the game alike. The leader is given the leeway to benefit from deviation in a strategy profile whereas no other player is allowed to do so. These leader strategy profiles are asymmetric but stable as the stability of strategy profiles is considered w.r.t. all other players. The leader can further incentivise the strategy choices of other players by transferring a share of her own payoff to them that results in incentive strategy profiles. Among these class of strategy profiles, an 'optimal' leader resp. incentive strategy profile would give maximal reward to the leader and is a leader resp. incentive equilibrium. We note that computing leader and incentive equilibrium is no more expensive than computing Nash equilibrium. For multi-player non-terminating games, their complexity is NP complete in general and equals the complexity of computing two-player games when the number of players is kept fixed. We establish the use of memory and study the effect of increasing the memory size in leader strategy profiles in the context of discounted sum games. We discuss various follower behavioural models in bi-matrix games assuming both friendly follower and an adversarial follower. This leads to friendly incentive equilibrium and secure incentive equilibrium for the resp. follower behaviour. While the construction of friendly incentive equilibrium is tractable and straight forward the secure incentive equilibrium needs a constructive approach to establish their existence and tractability. Our overall observation is that the leader return in an incentive equilibrium is always higher (or equal to) her return in a leader equilibrium that in turn would provide higher or equal leader return than from a Nash equilibrium. Optimal strategy profiles assigned this way therefore prove beneficial for the leader.

APA, Harvard, Vancouver, ISO, and other styles

35

Leamer, Micah J. "Groebner Finite Path Algebras." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/9998.

Full text

Abstract:

Let K be a field and Q a finite directed multi-graph. In this paper I classify all path algebras KQ and admissible orders with the property that all of their finitely generated ideals have finite Groebner bases.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

36

Tang, Heng. "Codes on finite geometries /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2002. http://uclibs.org/PID/11984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Cuti, Filippo. "The finite lambda calculus." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8203/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Stavis, Andreas. "Representations of finite groups." Thesis, Karlstads universitet, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-69642.

Full text

Abstract:

Representation theory is concerned with the ways of writing elements of abstract algebraic structures as linear transformations of vector spaces. Typical structures amenable to representation theory are groups, associative algebras and Lie algebras. In this thesis we study linear representations of finite groups. The study focuses on character theory and how character theory can be used to extract information from a group. Prior to that, concepts needed to treat character theory, and some of their ramifications, are investigated. The study is based on existing literature, with excessive use of examples to illuminate important aspects. An example treating a class of p-groups is also discussed.

APA, Harvard, Vancouver, ISO, and other styles

39

Ciocanea, teodorescu Iuliana. "Algorithms for finite rings." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0121/document.

Full text

Abstract:

Cette thèse s'attache à décrire des algorithmes qui répondent à des questions provenant de la théorie des anneaux et des modules. Nous restreindrons essentiellement notre étude à des algorithmes déterministes, en temps polynomial, ainsi qu'aux anneaux et modules finis. Le premier des principaux résultats de cette thèse concerne le problème de l'isomorphisme entre modules : nous décrivons deux algorithmes distincts qui, étant donnée un anneau fini R et deux R-modules M et N finis, déterminent si M et N sont isomorphes. S'ils le sont, les deux algorithmes exhibent un tel isomorphisme. De plus, nous montrons comment calculer un ensemble de générateurs de taille minimale pour un module donné, et comment construire des couvertures projectives et des enveloppes injectives. Nous décrivons ensuite des tests mettant en évidence le caractère simple, projectif ou injectif d'un module, ainsi qu'un test constructif de l'existence d'un homomorphisme demodules surjectif entre deux modules finis, l'un d'entre eux étant projectif. Par contraste, nous montrons le résultat négatif suivant : le problème consistant à tester l'existence d'un homomorphisme de modules injectif entre deux modules, l'un des deux étant projectif, est NP-complet.La dernière partie de cette thèse concerne le problème de l'approximation du radical de Jacobson d'un anneau fini. Il s'agit de déterminer un idéal bilatère nilpotent tel que l'anneau quotient correspondant soit \presque" semi-simple. La notion de \semi-simplicité approchée" que nous utilisons est la séparabilité
In this thesis we are interested in describing algorithms that answer questions arising in ring and module theory. Our focus is on deterministic polynomial-time algorithms and rings and modules that are finite. The first main result of this thesis concerns the module isomorphism problem: we describe two distinct algorithms that, given a finite ring R and two finite R-modules M and N, determine whether M and N are isomorphic. If they are, the algorithms exhibit such a isomorphism. In addition, we show how to compute a set of generators of minimal cardinality for a given module, and how to construct projective covers and injective hulls. We also describe tests for module simplicity, projectivity, and injectivity, and constructive tests for existence of surjective module homomorphisms between two finite modules, one of which is projective. As a negative result, we show that the problem of testing for existence of injective module homomorphisms between two finite modules, one of which is projective, is NP-complete. The last part of the thesis is concerned with finding a good working approximation of the Jacobson radical of a finite ring, that is, a two-sided nilpotent ideal such that the corresponding quotient ring is \almost" semisimple. The notion we use to approximate semisimplicity is that of separability

APA, Harvard, Vancouver, ISO, and other styles

40

Lee, Kum Young. "Finite control in Korean." Diss., University of Iowa, 2009. https://ir.uiowa.edu/etd/394.

Full text

Abstract:

This thesis explores finite control in Korean. An overview of the previous studies of control shows that the mainstream literature on control has consistently argued that referential dependence between an overt matrix argument and an embedded null subject is characteristic of non-finite clauses which contain a PRO subject. Moreover, although some evidence for finite control involving pro in several languages has been presented, a PRO analysis of finite control has been firmly established in the literature. This thesis, however, argues that the currently established approach to Obligatory Control (OC), which is confined to PRO, cannot account for OC in Korean, and provides an empirical and theoretical analysis of finite control containing a pro subject in Korean. Although finite OC in Korean differs from non-finite OC in other languages in that the former can allow an overt NP coreferential with a matrix argument in the null subject position, finite OC in Korean displays the same properties of OC which are widely employed as the criteria for defining OC in non-finite clauses. This thesis adopts the formal approach to finiteness in which finiteness is defined as an ability of licensing nominative subjects. However, reviewing the cross-linguistic data in the literature reveals that the feature determining finiteness should not be restricted to just Tense and Agreement, as the formal approaches have argued, and that languages may vary in determining finiteness. It also explores the relevance of Mood and Modality as the manifestation of finiteness in Korean. Based on this, this thesis argues for the CP status of finite OC in Korean and a pro analysis of the null subject in the constructions. Through an investigation of six complementation types that have or have not been grouped under the types of control in the literature along with ninety matrix predicates which are classified into nine different categories based on their semantic class, this thesis further argues that OC in Korean cannot be explained by a solely syntax-based or semantically-based theory. OC in Korean is mainly the result of multiple semantic factors, but syntactic and pragmatic factors can also play a role in determining control.

APA, Harvard, Vancouver, ISO, and other styles

41

Yeo, Michelle SoYeong. "CONSTRUCTION OF FINITE GROUP." CSUSB ScholarWorks, 2017. https://scholarworks.lib.csusb.edu/etd/592.

Full text

Abstract:

The main goal of this project is to present my investigation of finite images of the progenitor 2^(*n) : N for various N and several values of n. We construct each image by using the technique of double coset enumeration and give a proof of the isomorphism type of the image. We obtain the group 7^2: D_6 as a homomorphic image of the progenitor 2^(*14) : D_14, we obtain the group 2^4 : (5 : 4) as a homomorphic image of the progenitor 2^(*5) : (5 : 4), we obtain the group (10 x10) : ((3 x 4) : 2) as a homomorphic image of the progenitor 2^(*15) : (15x4), we obtain the group PGL(2; 7) as a homomorphic image of the progenitor 2^7 : D_14, we obtain the group S_6 as a homomorphic image of the progenitor 2^5 : (5 : 4), and we obtain the group S_7 as a homomorphic image of the progenitor 2^(*15) : (15 : 4). Also, have given some unsuccessful progenitors.

APA, Harvard, Vancouver, ISO, and other styles

42

Mkiva, Soga Loyiso Tiyo. "The non-cancellation groups of certain groups which are split extensions of a finite abelian group by a finite rank free abelian group." Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_8520_1262644840.

Full text

Abstract:

The groups we consider in this study belong to the class X0 of all finitely generated groups with finite commutator subgroups.

APA, Harvard, Vancouver, ISO, and other styles

43

Merryman, William Patrick. "Animating the conversion of nondeterministic finite state automata to deterministic finite state automata." Thesis, Montana State University, 2007. http://etd.lib.montana.edu/etd/2007/merryman/MerrymanW0507.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Bussing, Thomas Richard Arthur. "A finite volume method for the Navier-Stokes equations with finite rate chemistry." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/38553.

Full text

Abstract:

Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1985.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE.
Bibliography: leaves 376-380.
by Thomas Richard Arthur Bussing.
Sc.D.

APA, Harvard, Vancouver, ISO, and other styles

45

Hamilton, Brian. "Finite difference and finite volume methods for wave-based modelling of room acoustics." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/22940.

Full text

Abstract:

Wave-based models of sound propagation can be used to predict and synthesize sounds as they would be heard naturally in room acoustic environments. The numerical simulation of such models with traditional time-stepping grid-based methods can be an expensive process, due to the sheer size of listening environments (e.g., auditoriums and concert halls) and due to the temporal resolution required by audio rates that resolve frequencies up to the limit of human hearing. Finite difference methods comprise a simple starting point for such simulations, but they are known to suffer from approximation errors that may necessitate expensive grid refinements in order to achieve sufficient levels of accuracy. As such, a significant amount of research has gone into designing finite difference methods that are highly accurate while remaining computationally efficient. The problem of designing and using accurate finite difference schemes is compounded by the fact that room acoustics models require complex boundary conditions to model frequency-dependent wall impedances over non-trivial geometries. The implementation of such boundary conditions in a numerically stable manner has been a challenge for some time. Stable boundary conditions for finite difference room acoustics simulations have been formulated in the past, but generally they have only been useful in modelling trivial geometries (e.g., idealised shoebox halls). Finite volume methods have recently been shown to be a viable solution to the problem of complex boundary conditions over non-trivial geometries, and they also allow for the use of energy methods for numerical stability analyses. Finite volume methods lend themselves naturally to fully unstructured grids and they can simplify to the types of grids typically used in finite difference methods. This allows for room acoustics simulation models that balance the simplicity of finite difference methods for wave propagation in air with the detail of finite volume methods for the modelling of complex boundaries. This thesis is an exploration of these two distinct, yet related, approaches to wave-based room acoustic simulations. The overarching theme in this investigation is the balance between accuracy, computational efficiency, and numerical stability. Higher-order and optimised schemes in two and three spatial dimensions are derived and compared, towards the goal of finding accurate and efficient finite difference schemes. Numerical stability is analysed using frequency-domain analyses, as well as energy techniques whenever possible, allowing for stable and frequency-dependent boundary conditions appropriate for room acoustics modelling. Along the way, the use of non-Cartesian grids is investigated, geometric relationships between certain finite difference and finite volume schemes are explored, and some problems associated to staircasing effects at boundaries are considered. Also, models of sound absorption in air are incorporated into these numerical schemes, using physical parameters that are appropriate for room acoustic scenarios.

APA, Harvard, Vancouver, ISO, and other styles

46

Ribeiro, Beatriz Casulari da Motta 1984. "O arco associado a uma generalização da curva Hermitiana." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/307081.

Full text

Abstract:

Orientadores: Fernando Eduardo Torres Orihuela, Herivelto Martins Borges Filho
Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-19T05:54:38Z (GMT). No. of bitstreams: 1 Ribeiro_BeatrizCasularidaMotta_D.pdf: 51476410 bytes, checksum: 46cb0c7a6206a5f0683b23a73ff3938e (MD5) Previous issue date: 2011
Resumo: Obtemos novos arcos completos associados ao conjunto de pontos racionais de uma certa generalização da curva Hermitiana que é Frobenius não-clássica. A construção está relacionada ao cálculo do número de pontos racionais de uma classe de curvas de Artin-Schreier
Abstract: We obtain new complete arcs arising from the set of rational points of a certain generalization of the Hermitian plane curve which is Frobenius non-classical. Our construction is related to the computation of the number of rational points of a class of Artin-Schreier curves
Doutorado
Matematica
Doutor em Matemática

APA, Harvard, Vancouver, ISO, and other styles

47

Ebrahimi, Davoud. "Three-dimensional finite element implementation for a dynamic solid-fluid mixture at finite strain." Connect to online resource, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1446092.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Heisserer, Ulrich [Verfasser]. "High-order finite elements for material and geometric nonlinear finite strain problems / Ulrich Heisserer." Aachen : Shaker, 2008. http://d-nb.info/990727653/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Nava, JoseÌ Manuel Franco. "Finite element versus boundary element analysis of finite strain elastic and elastoplastic fracture mechanics." Thesis, Cranfield University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401612.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ersoy, Kıvanç [Verfasser]. "Centralizers and Fixed Points of Automorphisms in Finite and Locally Finite Groups / Kıvanç Ersoy." Berlin : Freie Universität Berlin, 2020. http://nbn-resolving.de/urn:nbn:de:kobv:188-refubium-26475-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!