scholarly journals Enveloping semigroups and quasi-discrete spectrum

2015 ◽  
Vol 36 (8) ◽  
pp. 2627-2660 ◽  
Author(s):  
JUHO RAUTIO

The structures of the enveloping semigroups of certain elementary finite- and infinite-dimensional distal dynamical systems are given, answering open problems posed in 1982 by Namioka [Ellis groups and compact right topological groups. Conference in Modern Analysis and Probability (New Haven, CT, 1982) (Contemporary Mathematics, 26). American Mathematical Society, Providence, RI, 1984, 295–300]. The universal minimal system with (topological) quasi-discrete spectrum is obtained from the infinite-dimensional case. It is proved that, on the one hand, a minimal system is a factor of this universal system if and only if its enveloping semigroup has quasi-discrete spectrum and that, on the other hand, such a factor need not have quasi-discrete spectrum in itself. This leads to a natural generalization of the property of having quasi-discrete spectrum, which is named the ${\mathcal{W}}$-property.

1979 ◽  
Vol 86 (3) ◽  
pp. 427-435 ◽  
Author(s):  
Paul Milnes

AbstractCompact right topological groups appear naturally in topological dynamics. Some continuity properties of the one arising as an enveloping semigroup from the distal function are considered here (and, by way of comparison, the enveloping semigroups arising from two almost automorphic functions are discussed). The continuity properties are established either explicitly or by citing a theorem which is proved here and gives some characterizations of almost periodic functions. One characterization is proved using the result (essentially due to W. A. Veech) that a distal, almost automorphic function is almost periodic. A proof of this last result is also given.


2015 ◽  
Vol 08 (04) ◽  
pp. 1550085
Author(s):  
Sukhamoy Pattanayak ◽  
Abhay Kumar Singh

Quasi-cyclic (QC) codes are a natural generalization of cyclic codes. In this paper, we study some structural properties of QC codes over [Formula: see text], where [Formula: see text] is a prime and [Formula: see text]. By exploring their structure, we determine the one generator QC codes over [Formula: see text] and the size by giving a minimal spanning set. We discuss some examples of QC codes of various length over [Formula: see text].


Robotica ◽  
2004 ◽  
Vol 22 (5) ◽  
pp. 533-545 ◽  
Author(s):  
M. Benosman ◽  
G. Le Vey

A survey of the field of control for flexible multi-link robots is presented. This research area has drawn great attention during the last two decades, and seems to be somewhat less “attractive” now, due to the many satisfactory results already obtained, but also because of the complex nature of the remaining open problems. Thus it seems that the time has come to try to deliver a sort of “state of the art” on this subject, although an exhaustive one is out of scope here, because of the great amount of publications. Instead, we survey the most salient progresses – in our opinion – approximately during the last decade, that are representative of the essential different ideas in the field. We proceed along with the exposition of material coming from about 119 included references. We do not pretend to deeply present each of the methods quoted hereafter; however, our goal is to briefly introduce most of the existing methods and to refer the interested reader to more detailed presentations for each scheme. To begin with, a now well-established classification of the flexible arms control goals is given. It is followed by a presentation of different control strategies, indicating in each case whether the approach deals with the one-link case, which can be successfully treated via linear models, or with the multi-link case which necessitates nonlinear, more complex, models. Some possible issues for future research are given in conclusion.


Author(s):  
Sergei Scherbov ◽  
Warren C. Sanderson

Probably the most famous demographic riddle of all time is the one that the Sphinx was said to have posed to travellers outside the Greek city of Thebes: ‘Which creature walks on four legs in the morning, two at noon, and three in the evening?’ Unfortunate travellers who could not answer the riddle correctly were immediately devoured. Oedipus, fresh from killing his father, was the first to have got the answer right. The correct answer was ‘humans’. People crawl on their hands and knees as infants, walk on two feet in adulthood, and walk with a cane in old age. We easily recognize the three ages of humans. Humans are born dependent on the care of others. As they grow, their capacities and productivities generally increase, but eventually these reach a peak. After a while, capacities and productivities decline and, eventually, if they are lucky enough to survive, people become elderly, often again requiring transfers and care from others. The human life cycle is the basis of all studies of population ageing, and so we cannot begin to study population ageing without first answering the Sphinx’s riddle. However, answering the Sphinx’s riddle is not enough to get us started on a study of population ageing. We must take two more steps before we begin. First, we must recognize that not all people age at the same rate. As seen in Chapter 5, nowadays more educated people tend to have longer life expectancies than less educated people. Second, we must realize that there is no natural generalization of the Sphinx’s riddle to whole populations. Populations cannot be categorized into the stages of infancy, adulthood, and old age. Indeed, if the Sphinx was reborn today, we might find her sitting near another city and posing an equally perplexing riddle, one especially relevant for our times: ‘What can grow younger as it grows older?’ Answering this riddle correctly is the central challenge of this chapter and the key to understanding population ageing in the twenty-first century.


2000 ◽  
Vol 11 (01) ◽  
pp. 167-181 ◽  
Author(s):  
GHEORGHE PĂUN

Membrane Computing is a recently introduced area of Molecular Computing, where a computation takes place in a membrane structure where multisets of objects evolve according to given rules (they can also pass through membranes). The obtained computing models were called P systems. In basic variants of P systems, the use of objects evolution rules is regulated by a given priority relation; moreover, each membrane has a label and one can send objects to precise membranes, identified by their labels. We propose here a variant where we get rid of both there rather artificial (non-biochemical) features. Instead, we add to membranes and to objects an "electrical charge" and the objects are passed through membranes according to their charge. We prove that such systems are able to characterize the one-letter recursively enumerable languages (equivalently, the recursively enumerable sets of natural numbers), providing that an extra feature is considered: the membranes can be made thicker or thinner (also dissolved) and the communication through a membrane is possible only when its thickness is equal to 1. Several open problems are formulated.


Neurobiology of Monotremes brings together current information on the development, structure, function and behavioural ecology of the monotremes. The monotremes are an unusual and evolutionarily important group of mammals showing striking behavioural and physiological adaptations to their niches. They are the only mammals exhibiting electroreception (in the trigeminal sensory pathways) and the echidna shows distinctive olfactory specialisations. The authors aim to close the current gap in knowledge between the genes and developmental biology of monotremes on the one hand, and the adult structure, function and ecology of monotremes on the other. They explore how the sequence 'embryonic structure › adult structure › behaviour' is achieved in monotremes and how this differs from other mammals. The work also combines a detailed review of the neurobiology of monotremes with photographic and diagrammatic atlases of the sectioned adult brains and peripheral nervous system of the short-beaked echidna and platypus. Pairing of a detailed review of the field with the first published brain atlases of two of the three living monotremes will allow the reader to immediately relate key points in the text to features in the atlases and will extend a universal system of brain nomenclature developed in eutherian brain atlases by G Paxinos and colleagues to monotremes.


1974 ◽  
Vol 26 (1) ◽  
pp. 115-120 ◽  
Author(s):  
Carl Pearcy ◽  
Norberto Salinas

Let be a fixed separable, infinite dimensional complex Hilbert space, and let () denote the algebra of all (bounded, linear) operators on . The ideal of all compact operators on will be denoted by and the canonical quotient map from () onto the Calkin algebra ()/ will be denoted by π.Some open problems in the theory of extensions of C*-algebras (cf. [1]) have recently motivated an increasing interest in the class of all operators in () whose self-commuta tor is compact.


2019 ◽  
Vol 72 (4) ◽  
pp. 988-1023
Author(s):  
Clayton Suguio Hida ◽  
Piotr Koszmider

AbstractA subset ${\mathcal{X}}$ of a C*-algebra ${\mathcal{A}}$ is called irredundant if no $A\in {\mathcal{X}}$ belongs to the C*-subalgebra of ${\mathcal{A}}$ generated by ${\mathcal{X}}\setminus \{A\}$. Separable C*-algebras cannot have uncountable irredundant sets and all members of many classes of nonseparable C*-algebras, e.g., infinite dimensional von Neumann algebras have irredundant sets of cardinality continuum.There exists a considerable literature showing that the question whether every AF commutative nonseparable C*-algebra has an uncountable irredundant set is sensitive to additional set-theoretic axioms, and we investigate here the noncommutative case.Assuming $\diamondsuit$ (an additional axiom stronger than the continuum hypothesis), we prove that there is an AF C*-subalgebra of ${\mathcal{B}}(\ell _{2})$ of density $2^{\unicode[STIX]{x1D714}}=\unicode[STIX]{x1D714}_{1}$ with no nonseparable commutative C*-subalgebra and with no uncountable irredundant set. On the other hand we also prove that it is consistent that every discrete collection of operators in ${\mathcal{B}}(\ell _{2})$ of cardinality continuum contains an irredundant subcollection of cardinality continuum.Other partial results and more open problems are presented.


2012 ◽  
Vol 19 (04) ◽  
pp. 735-744 ◽  
Author(s):  
Wei Wang ◽  
Junbo Li ◽  
Bin Xin

Let 𝔽 be a field of characteristic 0, G an additive subgroup of 𝔽, s ∈ 𝔽 such that s ∉ G and 2s ∈ G. A class of infinite-dimensional Lie algebras [Formula: see text] called generalized Schrödinger-Virasoro algebras was defined by Tan and Zhang, which is a natural generalization of Schrödinger-Virasoro algebras. In this paper, central extensions and derivations of [Formula: see text] are determined.


Sign in / Sign up

Export Citation Format

Share Document