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 2172 for “"generalizations"”.

  1. Generalizations of Total Positivity

    The theory of total positivity was classically concerned with totally nonnegative matrices (matrices with all nonnegative minors). These matrices appear in many varied areas of mathematics including probability, asymptotic representation theory, algebraic and enumerative combinatorics, and linear …

    umn Repository record for Generalizations of Total Positivity (opens in a new tab)

  2. Generalizations of Schottky groups

    Schottky groups are classical examples of free groups acting properly discontinuously on the complex projective line. We discuss two different applications of similar constructions. The first gives examples of 3-dimensional Lorentzian Kleinian groups which act properly discontinuously on an open …

    maryland Repository record for Generalizations of Schottky groups (opens in a new tab)

  3. CS-Modules and Generalizations

    As a generalization of the divisibility of an abelian group, injectivity was defined for modules by Baer in 1940. Since then this concept has attracted much interest. The starting point of this thesis is that for any torsion-free abelian group A (Z-module) let B ≤ A such that A / B is torsion-free, …

    glasgow Download PDF for CS-Modules and Generalizations (opens in a new tab)

  4. Some generalizations of injectivity

    … of injectivity and some of its well-known generalizations are stated. Chapter 2 is concerned with two generalizations of injectivity, namely near and essential injectivity. These concepts, together with the notion of the exchange property, prove to be a key tool in obtaining …

    glasgow Download PDF for Some generalizations of injectivity (opens in a new tab)

  5. Generalizations of comparability graphs

    In rational decision-making models, transitivity of preferences is an important principle. In a transitive preference, one who prefers x to y and y to z must prefer x to z. Many preference relations, including total order, weak order, partial order, and semiorder, are transitive. As a preference …

    colostate Repository record for Generalizations of comparability graphs (opens in a new tab)

  6. Generalizations of persistent homology

    … In this dissertation we develop both of these generalizations by defining persistence diagrams for chain complexes in an essentially small abelian category filtered over any finite lattice.

    colostate Repository record for Generalizations of persistent homology (opens in a new tab)

  7. Simple Games: Weightedness and Generalizations

    This thesis contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern. One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The necessary and …

    auckland-ms Repository record for Simple Games: Weightedness and Generalizations (opens in a new tab)

  8. Overlap-Free Words and Generalizations

    … This thesis will consider several different generalizations of Thue's work. In particular we shall study the properties of infinite words avoiding various types of repetitions. In Chapter 1 we introduce the theory of combinatorics on words. We present the basic definitions and give an …

    waterloo Repository record for Overlap-Free Words and Generalizations (opens in a new tab)

  9. On Generalizations of Gowers Norms

    Inspired by the definition of Gowers norms we study integrals of products of multivariate functions. The Lp norms, certain trace norms, and the Gowers norms are all defined by taking the proper root of one of these integrals. These integrals are important from a combinatorial point of view as …

    toronto-retro Repository record for On Generalizations of Gowers Norms (opens in a new tab)

  10. On Generalizations of Supereulerian Graphs

    A graph is supereulerian if it has a spanning closed trail. Pulleyblank in 1979 showed that determining whether a graph is supereulerian, even when restricted to planar graphs, is NP-complete. Let $\kappa'(G)$ and $\delta(G)$ be the edge-connectivity and the minimum degree of a graph $G$, …

    wvu Repository record for On Generalizations of Supereulerian Graphs (opens in a new tab)

  11. Heterogeneous Generalizations of Vertex Coloring

    … a collection of results in some heterogeneous generalizations of vertex coloring, i.e. generalizations in which the relationship between the colors of two adjacent vertices may differ throughout the graph. For the most part, the results are from group coloring, group list coloring, and DP …

    wvu Repository record for Heterogeneous Generalizations of Vertex Coloring (opens in a new tab)

  12. Clique Generalizations and Related Problems

    … all pos- sible edges. As a consequence, clique generalizations were introduced to overcome the disadvantages of the clique model. In this thesis, I present three computationally dif- ficult combinatorial optimization problems related to clique generalization problems: co-2-plexes and k-cores. A …

    rice Repository record for Clique Generalizations and Related Problems (opens in a new tab)

  13. 3-Maps And Their Generalizations

    A 3-map is a 3-region colorable map. They have been studied by Craft and White in their paper 3-maps. This thesis introduces topological graph theory and then investigates 3-maps in detail, including examples, special types of 3-maps, the use of 3-maps to find the genus of special graphs, and a …

    vcu Repository record for 3-Maps And Their Generalizations (opens in a new tab)

  14. Distributional learning of syntactic generalizations

    … a learnability paradox. On one hand, there are generalizations that children must learn. On the other hand, language is known for its arbitrariness, so children also need to decide when not to generalize and just resort to memorization. Finally, the picture is further complicated by the lack of …

    penn Repository record for Distributional learning of syntactic generalizations (opens in a new tab)

  15. Ádám's Conjecture and Its Generalizations

    … examines idam's conjuecture and some of its generalizations. In terms of Adam's conjecture, we prove Alspach and Parson's results f or Zpq and ZP2. More generally, we prove Babai's characterization of the CI-property, Palfy's characterization of CI-groups, and Brand's result for Zpr for …

    unt Repository record for Ádám's Conjecture and Its Generalizations (opens in a new tab)

Page 1 of 109