Sciweavers

15 search results - page 1 / 3
» On enumeration of hypergroups of order 3
Sort
View
CMA
2010
114views more  CMA 2010»
13 years 2 months ago
On enumeration of hypergroups of order 3
In this paper we present a symbolic manipulation package that enumerates the hypergroups of order 3. It separates them to isomorphic classes and calculates their cardinality. Key ...
Ch. Tsitouras, Ch. G. Massouros
JSYML
2007
78views more  JSYML 2007»
13 years 4 months ago
The settling-time reducibility ordering
Abstract. To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a n...
Barbara F. Csima, Richard A. Shore
APAL
2011
12 years 12 months ago
Upper bounds on ideals in the computably enumerable Turing degrees
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
George Barmpalias, André Nies
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 4 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
TOG
2002
127views more  TOG 2002»
13 years 4 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers