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 271 for “"Homomorphism"”.

  1. Globular multicategories with homomorphism types

    … various notions of globular multicategory with homomorphism types. We develop a higher dimensional modules construction that constructs globular multicategories with strict homomorphism types. We illustrate how this construction is related to iterated enrichment. We show how various collections …

    oxford Repository record for Globular multicategories with homomorphism types (opens in a new tab)

  2. Density and Structure of Homomorphism-Critical Graphs

    … if every proper subgraph of $G$ admits a homomorphism to $H$, but $G$ itself does not. In 1981, Jaeger made the following conjecture concerning odd-cycle critical graphs: every planar graph of girth at least $4t$ admits a homomorphism to $C_{2t+1}$ (or equivalently, has a …

    waterloo Repository record for Density and Structure of Homomorphism-Critical Graphs (opens in a new tab)

  3. Smoothening Functions and the Homomorphism Learning Problem

    … On the algebraic front, we view it as a Learning Homomorphisms with Noise problem, and provide a generic construction of a public-key cryptosystem based on this generalization. On the geometric front, we explore the importance of the Gaussian distribution for the existing relationships between LWE …

    waterloo Repository record for Smoothening Functions and the Homomorphism Learning Problem (opens in a new tab)

  4. Graph Relations and Constrained Homomorphism Partial Orders

    We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives from relations between graphs and is related to …

    qucosa-diss

  5. The Existence of a Discontinuous Homomorphism Requires a Strong Axiom of Choice

    Conner and Spencer used ultrafilters to construct homomorphisms between fundamental groups that could not be induced by continuous functions between the underlying spaces. We use methods from Shelah and Pawlikowski to prove that Conner and Spencer could not have constructed these homomorphisms with …

    byu Repository record for The Existence of a Discontinuous Homomorphism Requires a Strong Axiom of Choice (opens in a new tab) Download PDF for The Existence of a Discontinuous Homomorphism Requires a Strong Axiom of Choice (opens in a new tab)

  6. Canonical solution groups of a homomorphism : manipulator kinematics, nonparametric regression and distributed object systems

    … mapping of a rigid open-link manipulator is a homomorphism between Lie groups. The homomorphisrn has solution groups that act on an inverse kinematic solution element. A canonical representation of solution group operators that act on a solution element of three and seven degree-of-freedom …

    aston Download PDF for Canonical solution groups of a homomorphism : manipulator kinematics, nonparametric regression and distributed object systems (opens in a new tab)

  7. Secure data processing using homomorphism in cryptography - applications in multi-party search, signatures, neural networks and e-voting

    Homomorphism is a fascinating property in Mathematics that has found its way into the field of cryptography. This property allows for the preservation of the structure of a system during an operation, enabling the manipulation of encrypted data that was previously incomprehensible. As the field of …

    cork Repository record for Secure data processing using homomorphism in cryptography - applications in multi-party search, signatures, neural networks and e-voting (opens in a new tab) Embargoed until 2027-05-31

  8. The complexity of digraph homomorphisms: Local tournaments, injective homomorphisms and polymorphisms

    … the computational complexity of certain digraph homomorphism problems. A homomorphism between digraphs, denoted by $f: G \to H$, is a mapping from the vertices of $G$ to the vertices of $H$ such that the arcs of $G$ are preserved. The problem of deciding whether a homomorphism to a fixed digraph …

    uvic Repository record for The complexity of digraph homomorphisms: Local tournaments, injective homomorphisms and polymorphisms (opens in a new tab)

  9. On the H̃-cobordism group of S¹ × S²’S

    … called H̃-cobordism. This group receives a homomorphism from the knot concordance group, given by the operation of zero-surgery. We apply knot concordance invariants derived from knot Floer homology to study the kernel of the zero-surgery homomorphism. As a consequence, we show that the …

    msu Repository record for On the H̃-cobordism group of S¹ × S²’S (opens in a new tab)

  10. Gamma-Switchable 2-Colourings of (m,n)-Mixed Graphs

    … that the resulting $(m,n)$-mixed graph admits a homomorphism to some $(m,n)$-mixed graph on $2$ vertices?'' We show the following: (1) When restricted to $(m,0)$-mixed graphs $H$ on at most $2$ vertices, the $\Gamma$-switchable homomorphism decision problem is solvable in polynomial time; (2) for …

    uvic Repository record for Gamma-Switchable 2-Colourings of (m,n)-Mixed Graphs (opens in a new tab)

  11. ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS

    … least $\ell$ together with a surjective acyclic homomorphism $c:D\rightarrow C$ such that (i) for every digraph $C'$ with at most $k$ vertices, there exists an acyclic homomorphism $g:D\rightarrow C'$ if and only if there exists an acyclic homomorphism $f:C\rightarrow C'$ and (ii) for every …

    montana-tech Repository record for ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS (opens in a new tab)

  12. ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS

    … least $\ell$ together with a surjective acyclic homomorphism $c:D\rightarrow C$ such that (i) for every digraph $C'$ with at most $k$ vertices, there exists an acyclic homomorphism $g:D\rightarrow C'$ if and only if there exists an acyclic homomorphism $f:C\rightarrow C'$ and (ii) for every …

    montana Repository record for ASPECTS OF UNIQUE D-COLORABILITY FOR DIGRAPHS (opens in a new tab)

  13. Some Mapping and Homological Properties of g-Functions

    … strong conditions, both induce the same homomorphism of Cech homology groups. A realisation theorem giving conditions under which a homomorphism of Cech homology groups is induced by a continuous function is proved.</p>

    mcmaster Repository record for Some Mapping and Homological Properties of g-Functions (opens in a new tab)

  14. Homomorphisms of semi-holonomic verma modules : an exceptional case.

    … orthogonal group SO(n, C). A Verma module homomorphism will corresponds to an invariant operator on the flat space. The obvious question is: how can we generalize these operators to cases where there is curvature? In this thesis we will look at a variation of Verma modules called …

    adelaide Repository record for Homomorphisms of semi-holonomic verma modules : an exceptional case. (opens in a new tab)

  15. An Axiomatic Approach to the Hurewicz Theorem for Symmetric Spectra

    … the second is reasonably easier. The Hurewicz homomorphism is a natural transformation between these invariants which can make computation of some homotopy groups easier. In this thesis we will look at the analogue of these invariants, and of the Hurewicz homomorphism, for the category of …

    calgary Repository record for An Axiomatic Approach to the Hurewicz Theorem for Symmetric Spectra (opens in a new tab)

  16. Schreier groups and symmetric neighborhoods with a finite number of open components

    … finite number of components. Theorem 1 exibits a homomorphism from the Schreier group into the direct product of the underlying topological group and a specified finitely presented group with the components of U as generators. Theorem 2 shows that in euclidean space the given homomorphism is an …

    ut-knoxville Repository record for Schreier groups and symmetric neighborhoods with a finite number of open components (opens in a new tab)

  17. Injective Modules And Divisible Groups

    … <em>A</em> to <em>B</em>, any <em>R</em>-homomorphism <em>f</em> from <em>A</em> to <em>M</em> can be extended to an <em>R</em>-homomorphism <em>h</em> from <em>B</em> to <em>M</em> such that <em>hg</em> = [equals] <em>f</em>. That is one of several equivalent statements of injective …

    ut-knoxville Repository record for Injective Modules And Divisible Groups (opens in a new tab)

  18. Virtual Braids and Virtual Curve Diagrams

    There is a well-known injective homomorphism from the n-strand braid group B_n into Aut(F_n), the automorphism group of a free group on n symbols, first described by Artin. This homomorphism induces an action of B_n on F_n that can be recovered by considering the braid group as the mapping class …

    toronto-retro Repository record for Virtual Braids and Virtual Curve Diagrams (opens in a new tab)

Page 1 of 14