Let G be a finite group and A be a subgroup of Aut(G). In this work, we studied the influence of the index of fixed point subgroup of A in G on the structure of G. When A is cyclic, we proved the following: (1) [G,A] is solvable if this index is squarefree and the orders of G and A are coprime. (2) G is solvable if the index of the centralizer of each x in H-G is squarefree where H denotes the semidirect product of G by A. Moreover, for an arbitrary subgroup A of Aut(G) whose order is coprime to the order of G, we showed that when G is solvable, then the Fitting length f([G,A]) of [G,A] is bounded above by the number of primes (counted with multiplicities) dividing the index of fixed point subgroup of A in G and this bound is best possible.

The purpose of this paper is to investigate the problem of finding a common element of the set of solutions of a generalized equilibrium problem (for short, GEP) and the set of fixed points of a nonexpansive mapping in a Hilbert space. First, by using the well-known KKM technique we derive the existence and uniqueness of solutions of the auxiliary problems for the GEP. Second, on account of this result and Nadler's theorem, we introduce an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of the GEP and the set of fixed points of the nonexpansive mapping. Furthermore, it is proven that the sequences generated by this iterative scheme converge strongly to a common element of the set of solutions of the GEP and the set of fixed points of the nonexpansive mapping.

We present a novel approach for deriving analytical solutions to transport equations expressedin similarity variables. We apply a fixed-point iteration procedure to these transformedequations by formally solving for the highest derivative term and then integrating to obtainan expression for the solution in terms of a previous estimate. We are able to analyticallyobtain the Lipschitz condition for this iteration procedure and, from this (via requirements forconvergence given by the contraction mapping principle), deduce a range of values for the outerlimit of the solution domain, for which the fixed-point iteration is guaranteed to converge.

Thesis (Ph.D.)--Baylor University, 2009. / Includes bibliographical references (p. 77-79).

In this thesis we study a mathematical model that describes task partitioning in a colony of ants. This process of self-organization is modeled by a nonlinear coupled system of rst order autonomous ordinary dierential equations. We discuss how this system of equations can be derived based on the behavior of ants in a colony. We use GNU Octave (a high-level programming language) to solve the system of equations numerically for dierent sets of parameters and show how the solutions respond to changes in the parameter values. Finally, we prove that the model is well-posed locally in time. We rewrite the system of ordinary dierential equations in terms of a system of coupled Volterra integral equations and look at the right-hand side of the system as a nonlinear operator on a Banach space. By doing so, we have transformed the problem of showing existence and uniqueness of solutions to a system of ordinary dierential equations into a problem of showing existence and uniqueness of a xed point to the corresponding integral operator. Additionally, we use Gronwall's inequality to prove the stability of solutions with respect to data and parameters.

Classificação das auto-aplicações de fibrados, com fibra toro, que preservam fibra sobre o círculo, com a propriedade de poderem ser deformadas sobre o círculo a uma aplicação livre de ponto fixo. Ainda, investigamos a relação entre o número de Reidemeister sobre o círculo e a propriedade acima / Classification of all fiber-preserving self-maps of torus bundles over the circle by the property of being able to deform them over the circle into a fixed point free map by a fiberwise homotopy over the circle. We also investigate the relationship between Reidemeister number over the circle and the property above

This thesis is about implementing the functions for reciprocal, square root, inverse square root and logarithms on a DSP platform. A multi-core DSP platform that consists of one master processor core and several SIMD coprocessor cores is currently being designed by a team at the Computer Engineering Department of Linköping University. The SIMD coprocessors’ arithmetic logic unit (ALU) has 16 multipliers to support vector multiplication instructions. By efficiently using the 16 multipliers, it is possible to evaluate polynomials very fast. The ALU does not have (hardware) support for floating point arithmetic, so the challenge is to get good precision by using fixed point arithmetic. Precise and fast solutions to implement the mathematical functions are found by converting the fixed point input to a soft floating point format before polynomial approximation, choosing a polynomial based on an error analysis of the polynomial approximation, and using Newton-Raphson or Goldschmidt iterations to improve the precision of the polynomial approximations. Finally, suggestions are made of changes and additions to the instruction set architecture, in order to make the implementations faster, by efficiently using the currently existing hardware.

Abstract Digital delta-sigma modulators are used in a broad range of modern electronic sub-systems, including oversampled digital-to-analogue converters, class-D amplifiers and fractional-N frequency synthesizers. This work addresses a well known problem of unwanted spurious tones in the modulator’s output spectrum. When a delta-sigma modulator works with a constant input, the output signal can be periodic, where short periods lead to strong deterministic tones. In this work we propose means for guaranteeing that the output period will never be shorter than a prescribed minimum value for all constant inputs. This allows a relationship to be formulated between the modulator’s bus width and the spurious-free range, thereby making it possible to trade output spectrum quality for hardware consumption. The second problem addressed in this thesis is related to the finite accuracy of frequencies generated in delta-sigma fractional-N frequency synthesis. The synthesized frequencies are usually approximated with an accuracy that is dependent on the modulator’s bus width. We propose a solution which allows frequencies to be generated exactly and removes the problem of a constant phase drift. This solution, which is applicable to a broad range of digital delta-sigma modulator architectures, replaces the traditionally used truncation quantizer with a variable modulus quantizer. The modulus, provided by a separate input, defines the denominator of the rational output mean. The thesis concludes with a practical example of a delta-sigma modulator used in a fractional-N frequency synthesizer designed to meet the strict accuracy requirements of a GSM base station transceiver. Here we optimize and compare a traditional modulator and a variable modulus design in order to minimize hardware consumption. The example illustrates the use made of the relationship between the spurious-free range and the modulator’s bus width, and the practical use of the variable modulus functionality.

The relationship between the convergence of a sequence of self mappings of a metric space and their fixed points, known as the stability (or continuity) of fixed points has been of continuing interest and widely studied in fixed point theory. In this thesis we study the stability of common fixed points in a Hausdorff uniform space whose uniformity is generated by a family of pseudometrics, by using some general notations of convergence. These results are then extended to 2-metric spaces due to S. Gähler. In addition, a well-known theorem of T. Suzuki that generalized the Banach Contraction Principle is also extended to 2-metric spaces and applied to obtain a coincidence theorem for a pair of mappings on an arbitrary set with values in a 2-metric space. Further, we prove the existence of coincidence and fixed points of Ćirić type weakly generalized contractions in metric spaces. Subsequently, the above result is utilized to discuss applications to the convergence of modified Mann and Ishikawa iterations in a convex metric space. Finally, we obtain coincidence, fixed and stationary point results for multi-valued and hybrid pairs of mappings on a metric space.

This doctoral thesis is devoted to investigate the problem of establishing connections between Domain Theory and the theory of fuzzy metric spaces, in the sense of Kramosil and Michalek, by means of the notion of a formal ball, and then constructing topological and computational models for (complete) fuzzy metric spaces. The antecedents of this research are mainly the well-known articles of A. Edalat and R. Heckmann [A computational model for metric spaces, Theoret- ical Computer Science 193 (1998), 53-73], and R. Heckmann [Approximation of metric spaces by partial metric spaces, Applied Categorical Structures 7 (1999), 71-83], where the authors obtained nice and direct links between Do- main Theory and the theory of metric spaces - two crucial tools in the study of denotational semantics - by using formal balls. Since every metric induces a fuzzy metric (the so-called standard fuzzy metric), the problem of extending Edalat and Heckmann's works to the fuzzy framework arises in a natural way. In our study we essentially propose two di erent approaches. For the rst one, valid for those fuzzy metric spaces whose continuous t-norm is the minimum, we introduce a new notion of fuzzy metric completeness (the so-called standard completeness) that allows us to construct a (topological) model that includes the classical theory as a special case. The second one, valid for those fuzzy metric spaces whose continuous t-norm is greater or equal than the Lukasiewicz t-norm, allows us to construct, among other satisfactory results, a fuzzy quasi-metric on the continuous domain of formal balls whose restriction to the set of maximal elements is isometric to the given fuzzy metric. Thus we obtain a computational model for complete fuzzy metric spaces. We also prove some new xed point theorems in complete fuzzy metric spaces with versions to the intuitionistic case and the ordered case, respec- tively. Finally, we discuss the problem of extending the obtained results to the asymmetric framework. / Ricarte Moreno, L. (2013). Topological and Computational Models for Fuzzy Metric Spaces via Domain Theory [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/34670 / TESIS