Skip to search formSkip to main contentSkip to account menu

Hasse diagram

Known as: Hasse, Hasse diagrams 
In order theory, a Hasse diagram (/ˈhæsə/; German: /ˈhasə/) is a type of mathematical diagram used to represent a finite partially ordered set, in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
Bipolar orientationC-elementControlled grammarDiagram

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Generalized Hasse invariants for Shimura varieties of Hodge type
We construct canonical Hasse invariants for arbitrary Shimura varieties of Hodge type. MSC 2010. 14G35, 14K10, 20G40, 11G18 
2010
2010
Hasse Diagram Generators and Petri Nets
In [18] Lorenz and Juhas raised the question of whether there exists a suitable formalism for the representation of infinite… 
2008
2008
A new model of evaluating concept similarity
2004
2004
Hasse Principle" for Finite p-Groups with Cyclic Subgroups of Index p2
Let G be a group. A map f : G −→ G satisfying f(xy) = f(x)f(y)x for every x, y ∈ G, where f(y)x = xf(y)x−1, is called a cocycle… 
2003
2003
Merging individual conceptual models of requirements
While it is acknowledged that system requirements will never be complete, incompleteness is often due to an inadequate process… 
2002
2002
A Controlled Language to Assist Conversion of Use Case Descriptions into Concept Lattices
System requirements are often incomplete and riddled with contradictions leading to failed projects. Formal methods have been… 
2001
2001
Bridging the gap between Use Case Analysis and Class Structure Design by Formal Concept Analysis
The early stages of software development are increasingly supported by objectoriented analysis and design (OOA/OOD) techniques… 
Review
1999
Review
1999
Excitation and visibility of high-degree modes in stars
ABSTRA C T Observational evidence for excitation of non-radial modes in stars is confronted with the results of linear stability… 
Highly Cited
1998
Highly Cited
1998
Quasi-Upward Planarity
AbstractAn upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by… 
1987
1987
Codes on the Klein quartic, ideals, and decoding
A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)