#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Marcel Erné
- Applied Categorical Structures
- 1999

A subset selection Z assigns to each partially ordered set P a certain collection ZP of subsets. The theory of topological and of algebraic (i.e. finitary) closure spaces extends to the general Z-level, by replacing finite or directed sets, respectively, with arbitrary ‘Z-sets’. This leads to a theory of Z-union completeness, Z-arity, Z-soberness etc.… (More)

- Marcel Erné, Jobst Heitzig, Jürgen Reinhold
- Electr. J. Comb.
- 2002

We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and useful for combinatorial identities and inequalities are the numbers vk of vertically indecomposable distributive lattices of size k. We present the explicit values of the numbers… (More)

- Marcel Erné
- Applied Categorical Structures
- 2007

We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawson duality between continuous frames and locally compact sober spaces, the Hofmann–Mislove theorems about continuous semilattices of compact saturated sets, or the theory of stably… (More)

- Marcel Erné, Kurt Stege
- Ars Comb.
- 1995

- Paul Erdös, Marcel Erné
- Discrete Mathematics
- 1986

Many graph-theoretical problems involve the study of cliques, i .e ., complete subgraphs (not necessarily maximal) . In this context the following combinatorial problem arises naturally: For which numbers n and c is there a graph with n vertices and exactly c cliques? For fixed n, let G(n) denote the set of all such `clique numbers' c . Since each singleton… (More)

- Marcel Erné
- Math. Log. Q.
- 2009

Klaus Ambos-Spies, Heidelberg Klaus Meer, Cottbus Marat M. Arslanov, Kazan Wolfram Pohlers, Münster Günter Asser, Greifswald Pavel Pudlak, Prague John T. Baldwin, Chicago Andrzej Rosłanowski, Omaha Douglas S. Bridges, Canterbury Jörg Rothe, Düsseldorf Ramon Jansana, Barcelona Wilfried Sieg, Pittsburgh Carl G. Jockusch, Urbana Stephen G. Simpson, State… (More)

- Marcel Erné
- Discrete Mathematics
- 1981

- Marcel Erné, Mai Gehrke, Ales Pultr
- Applied Categorical Structures
- 2007

From the work of Simmons about nuclei in frames it follows that a topological space X is scattered if and only if each congruence Θ on the frame of open sets is induced by a unique subspace A so that Θ = {(U, V ) |U ∩A = V ∩A}, and that the same holds without the uniqueness requirement iff X is weakly scattered (corrupt). We prove a seemingly similar but… (More)

- K. Deiters, Marcel Erné
- Discrete Mathematics
- 1998

- Marcel Erné, Dongsheng Zhao
- Applied Categorical Structures
- 2001