A Euclidean comparison theory for the size of sets

We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle "the whole is greater than the part". The former being deeply investigated since the very birth of set theory, we concentrate here on the "Euclidean" notion of size (numerosity), that maintains the Cantorain defiitions of order, addition and multiplication, while preserving the natural idea that a set is (strictly) larger than its proper subsets. These numerosities satisfy the five Euclid's common notions, and constitute a semiring of nonstandarda natural numbers, thus enjoying the best arithmetic. Most relevant is the natural set theoretic definition} of the set-preordering: X\prec Y\ \ \Iff\ \ \exists Z\ X\simeq Z\subset Y Extending this ``proper subset property" from countable to uncountable sets has been the main open question in this area from the beginning of the century.Comment: 17 pages. arXiv admin note: substantial text overlap with arXiv:2207.0750

Euclidean integers, Euclidean ultrafilters, and Euclidean numerosities

We introduce a "Euclidean" notion of size (numerosity) for "Punktmengen", i.e. sets of points of Euclidean (finitely dimensional) spaces over any "line" L, namely one that maintains the Cantorian defiitions of order, addition and multiplication, while preserving the ancient principle that "the whole is greater than the part" (a set is (strictly) larger than its proper subsets). These numerosities satisfy the five Euclid's common notions, thus enjoying a very good arithmetic, since they constitute the nonnegative part of the ordered ring of the Euclidean integers, here introduced by suitably assigning a transfinite sum to (ordinally indexed) kappa-sequences of integers (so generating a semiring of nonstandard natural numbers). Most relevant is the natural set theoretic definition of the set-preordering <: given any two sets X, Y of any cardinality, one has X<Y if and only if there exists a proper superset of X that is equinumerous to Y . Extending this "superset property" from countable to uncountable sets has been one of the main open question in this area from the beginning of the century

Particle swarm optimization with composite particles in dynamic environments

This article is placed here with the permission of IEEE - Copyright @ 2010 IEEEIn recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with composite particles (PSO-CP), to address dynamic optimization problems. PSO-CP partitions the swarm into a set of composite particles based on their similarity using a "worst first" principle. Inspired by the composite particle phenomenon in physics, the elementary members in each composite particle interact via a velocity-anisotropic reflection scheme to integrate valuable information for effectively and rapidly finding the promising optima in the search space. Each composite particle maintains the diversity by a scattering operator. In addition, an integral movement strategy is introduced to promote the swarm diversity. Experiments on a typical dynamic test benchmark problem provide a guideline for setting the involved parameters and show that PSO-CP is efficient in comparison with several state-of-the-art PSO algorithms for dynamic optimization problems.This work was supported in part by the Key Program of the National Natural Science Foundation (NNSF) of China under Grant 70931001 and 70771021, the Science Fund for Creative Research Group of the NNSF of China under Grant 60821063 and 70721001, the Ph.D. Programs Foundation of the Ministry of education of China under Grant 200801450008, and by the Engineering and Physical Sciences Research Council of U.K. under Grant EP/E060722/1