Order isomorphism

Results: 15



#Item
1QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday 25 JanuaryDaya) Show that, up to isomorphism, there is a unique group of order 15.

QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday 25 JanuaryDaya) Show that, up to isomorphism, there is a unique group of order 15.

Add to Reading List

Source URL: www.math.harvard.edu

Language: English - Date: 2016-02-04 13:15:17
    2CANONICAL SUBGROUPS VIA BREUIL-KISIN MODULES SHIN HATTORI Abstract. Let p > 2 be a rational prime and K/Qp be an extension of complete discrete valuation fields. Let G be a truncated BarsottiTate group of level n, heigh

    CANONICAL SUBGROUPS VIA BREUIL-KISIN MODULES SHIN HATTORI Abstract. Let p > 2 be a rational prime and K/Qp be an extension of complete discrete valuation fields. Let G be a truncated BarsottiTate group of level n, heigh

    Add to Reading List

    Source URL: www2.math.kyushu-u.ac.jp

    Language: English
    3The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka

    The homomorphism order Constrained homomorphisms Locally constrained homomorphism orders Constrained homomorphism orders Jan Hubiˇcka

    Add to Reading List

    Source URL: www.ucw.cz

    Language: English - Date: 2013-11-18 11:40:56
    4QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday 25 JanuaryDaya) Show that, up to isomorphism, there is a unique group of order 15.

    QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday 25 JanuaryDaya) Show that, up to isomorphism, there is a unique group of order 15.

    Add to Reading List

    Source URL: math.harvard.edu

    Language: English - Date: 2016-02-04 13:15:17
      5The Complexity of Order Type Isomorphism implementation of the predicate (e.g. solving geoGreg Aloupis1 John Iacono2 Stefan Langerman3 2 Stefanie Wuhrer4 ¨ ur Ozkan ¨ Ozg¨ Abstract The order type of a point set in Rd

      The Complexity of Order Type Isomorphism implementation of the predicate (e.g. solving geoGreg Aloupis1 John Iacono2 Stefan Langerman3 2 Stefanie Wuhrer4 ¨ ur Ozkan ¨ Ozg¨ Abstract The order type of a point set in Rd

      Add to Reading List

      Source URL: www-cs.engr.ccny.cuny.edu

      Language: English - Date: 2013-10-07 15:46:33
        6Electronic Notes in Theoretical Computer Science 44 No[removed]URL: http://www.elsevier.nl/locate/entcs/volume44.html 14 pages When is a function a fold or an unfold? Jeremy Gibbons a , Graham Hutton b , and Thorsten A

        Electronic Notes in Theoretical Computer Science 44 No[removed]URL: http://www.elsevier.nl/locate/entcs/volume44.html 14 pages When is a function a fold or an unfold? Jeremy Gibbons a , Graham Hutton b , and Thorsten A

        Add to Reading List

        Source URL: www.cs.nott.ac.uk

        Language: English - Date: 2001-05-08 03:49:24
        7ENUMERATION OF STEINER TRIPLE SYSTEMS WITH SUBSYSTEMS PETTERI KASKI, PATRIC R. J. ÖSTERGÅRD, AND ALEXANDRU POPA A Steiner triple system of order v , an STS(v ), is a set of 3-element subsets, called blocks, of a v -ele

        ENUMERATION OF STEINER TRIPLE SYSTEMS WITH SUBSYSTEMS PETTERI KASKI, PATRIC R. J. ÖSTERGÅRD, AND ALEXANDRU POPA A Steiner triple system of order v , an STS(v ), is a set of 3-element subsets, called blocks, of a v -ele

        Add to Reading List

        Source URL: users.tkk.fi

        Language: English - Date: 2014-03-11 07:03:54
        8Global Supervenience and Identity across Times and Worlds∗ Theodore Sider Philosophy and Phenomenological Research[removed]): 913–937

        Global Supervenience and Identity across Times and Worlds∗ Theodore Sider Philosophy and Phenomenological Research[removed]): 913–937

        Add to Reading List

        Source URL: tedsider.org

        Language: English - Date: 2010-07-28 16:02:58
        9Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

        Planar Graph Growth Constants Steven Finch August 25, 2004 A graph of order n consists of a set of n vertices (points) together with a set of edges (unordered pairs of distinct points). Note that loops and multiple paral

        Add to Reading List

        Source URL: www.people.fas.harvard.edu

        Language: English - Date: 2006-04-26 14:46:20
        10Finite Model Theory and Graph Isomorphism. I. Anuj Dawar

        Finite Model Theory and Graph Isomorphism. I. Anuj Dawar

        Add to Reading List

        Source URL: www.cl.cam.ac.uk

        Language: English - Date: 2013-12-16 05:15:33