On Series of Ordinals and Combinatorics

This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑_bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑_bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑_β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.     

Injections into function spaces over ordinals

We investigate when and how function spaces over subspaces of ordinals admit continuous injections into each other. To formulate our results let τ be an uncountable regular cardinal. We prove, in particular, that: (1) If A and B are disjoint stationary subsets of τ then Cp(A) does not admit a continuous injection into Cp(B); (2) For A⊂ω₁, admits a continuous injection into iff A is countable or ω₁ embeds into A (which, in its turn, is equivalent to the statement “ embeds into ”).     

A note on Dilworth's theorem in the infinite case

If is a poset and every antichain is finite, and if the length of the well-founded poset of antichains is less than ² ₁, then is the union of countably many chains. We also compute the length of the poset of antichains in the product of two ordinals, x.     

An algebraic version of Tamano's theorem for countably compact spaces

We show that if X is countably compact but not compact then one can find a compact space K such that X⊕K does not embed closedly into any normal topological group.     

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM

In this paper, we develop primitive recursive analogues of regular cardinals by using ordinal representation systems for KPi and KPM. We also define primitive recursive analogues of inaccessible and hyperinaccessible cardinals. Moreover, we characterize the primitive recursive analogue of the least (uncountable) regular cardinal.     

Strong zero-dimensionality of hyperspaces

For a space X, X² denotes the collection of all non-empty closed sets of X with the Vietoris topology, and K(X) denotes the collection of all non-empty compact sets of X with the subspace topology of X². The following are known:

•

ω² is not normal, where ω denotes the discrete space of countably infinite cardinality.

•

For every non-zero ordinal γ with the usual order topology, K(γ) is normal iff whenever cf γ is uncountable.

In this paper, we will prove:

(1)

ω² is strongly zero-dimensional.

(2)

K(γ) is strongly zero-dimensional, for every non-zero ordinal γ.

In (2), we use the technique of elementary submodels.     

Nonparametric ANCOVA with two and three covariates

Fully nonparametric analysis of covariance with two and three covariates is considered. The approach is based on an extension of the model of Akritas et al. (Biometrika 87(3) (2000) 507). The model allows for possibly nonlinear covariate effect which can have different shape in different factor level combinations. All types of ordinal data are included in the formulation. In particular, the response distributions are not restricted to comply to any parametric or semiparametric model. In this nonparametric model, hypotheses of no main effect no interaction and no simple effect, which adjust for the covariate values, are defined through a decomposition of the conditional distribution functions of the response given to the factor level combination and covariate values. The test statistics are based on averages over the covariate values of certain Nadaraya–Watson regression quantities. Under their respective null hypotheses, such test statistics are shown to have a central χ² distribution. Small sample corrections are also provided. Simulation results and the analysis of two real datasets are also presented.     

Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions

We present a new method, called UTA^GMS, for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. The preference information provided by the decision maker is a set of pairwise comparisons on a subset of alternatives A^R ⊆ A, called reference alternatives. The preference model built via ordinal regression is the set of all additive value functions compatible with the preference information. Using this model, one can define two relations in the set A: the necessary weak preference relation which holds for any two alternatives a, b from set A if and only if for all compatible value functions a is preferred to b, and the possible weak preference relation which holds for this pair if and only if for at least one compatible value function a is preferred to b. These relations establish a necessary and a possible ranking of alternatives from A, being, respectively, a partial preorder and a strongly complete relation. The UTA^GMS method is intended to be used interactively, with an increasing subset A^R and a progressive statement of pairwise comparisons. When no preference information is provided, the necessary weak preference relation is a weak dominance relation, and the possible weak preference relation is a complete relation. Every new pairwise comparison of reference alternatives, for which the dominance relation does not hold, is enriching the necessary relation and it is impoverishing the possible relation, so that they converge with the growth of the preference information. Distinguishing necessary and possible consequences of preference information on the complete set of actions, UTA^GMS answers questions of robustness analysis. Moreover, the method can support the decision maker when his/her preference statements cannot be represented in terms of an additive value function. The method is illustrated by an example solved using the UTA^GMS software. Some extensions of the method are also presented.     

Register computations on ordinals

We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the sets of ordinals in a model of the Zermelo-Fraenkel axioms ZFC. This allows the following characterization of computable sets: a set of ordinals is ordinal register computable if and only if it is an element of Gödel’s constructible universe L.     

ORDINAL NUMBERS IN ARITHMETIC PROGRESSION

The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers (ß + δγ)γ<γ<>r, δ ≠ 0.     

Universal Alignment Probability Revisited

We found a minor error in the proof of paper “Universal Alignment Probability Revisited” by S.Y. Lin and Y.C. Ho (J. Optim. Theory Appl. 113(2):399–407, 2002). In this note, we give a counterexample and explain the reason. We also show that the conclusion of that paper is still correct despite this minor error. A new proof of the conclusion is given. This work was supported by NSFC Grants 60574067, 60704008, 60721003 and 60736027, NCET Program NCET-04-0094 of China, National New Faculty Funding for Universities with Doctoral Program 20070003110, Program of Introducing Talents of Discipline to Universities (National 111 International Collaboration Project) B06002, and High-Level Graduate Student Scholarship 2007 of China Scholarship Council.     

Co-constructive development of a green chemistry-based model for the assessment of nanoparticles synthesis

Nanomaterials (materials at the nanoscale, ${10}^{?9}$ meters) are extensively used in several industry sectors due to the improved properties they empower commercial products with. There is a pressing need to produce these materials more sustainably. This paper proposes a Multiple Criteria Decision Aiding (MCDA) approach to assess the implementation of green chemistry principles as applied to the protocols for nanoparticles synthesis. In the presence of multiple green and environmentally oriented criteria, decision aiding is performed with a synergy of ordinal regression methods; preference information in the form of desired assignment for a subset of reference protocols is accepted. The classification models, indirectly derived from such information, are composed of an additive value function and a vector of thresholds separating the pre-defined and ordered classes. The method delivers a single representative model that is used to assess the relative importance of the criteria, identify the possible gains with improvement of the protocol’s evaluations and classify the non-reference protocols. Such precise recommendation is validated against the outcomes of robustness analysis exploiting the sets of all classification models compatible with all maximal subsets of consistent assignment examples. The introduced approach is used with real-world data concerning silver nanoparticles. It is proven to effectively resolve inconsistency in the assignment examples, tolerate ordinal and cardinal measurement scales, differentiate between inter- and intra-criteria attractiveness and deliver easily interpretable scores and class assignments. This work thoroughly discusses the learning insights that MCDA provided during the co-constructive development of the classification model.     

Post’s Problem for ordinal register machines: An explicit approach

We provide a positive solution for Post’s Problem for ordinal register machines, and also prove that these machines and ordinal Turing machines compute precisely the same partial functions on ordinals. To do so, we construct ordinal register machine programs which compute the necessary functions. In addition, we show that any set of ordinals solving Post’s Problem must be unbounded in the writable ordinals.     

A potential approach for ordinal games

We introduce the class of ordinal games with a potential, which are characterized by the absence of weak improvement cycles, the same condition used by Voorneveld and Norde (1997) for ordinal potential games.     

Addition and multiplication of sets

Ordinal addition and multiplication can be extended in a natural way to all sets. I survey the structure of the sets under these operations. In particular, the natural partial ordering associated with addition of sets is shown to be a tree. This allows us to prove that any set has a unique representation as a sum of additively irreducible sets, and that the non-empty elements of any model of set theory can be partitioned into infinitely many submodels, each isomorphic to the original model. Also any model of set theory has an isomorphic extension in which the empty set of the original model is non-empty. Among other results, the relations between the arithmetical operations and the transitive closure and the adductive hierarchy are elucidated. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)