On Outer-Commutator Words

1974 ◽  
Vol 26 (3) ◽  
pp. 608-620 ◽  
Author(s):  
Jeremy Wilson
Keyword(s):  
Arbitrary Group ◽  
Verbal Subgroup ◽  
Reduced Word ◽  
Image Position ◽  
Countably Infinite ◽  
Outer Commutator ◽  
Infinite Set

Let F be the group freely generated by the countably infinite set X = {x1, x2, . . . ,xi, . . . }. Let w(x1, x2, . . . , xn) be a reduced word representing an element of F and let G be an arbitrary group. Then V(w, G) will denote the setwhose elements will be called values of w in G. The subgroup of G generated by V(w, G) will be called the verbal subgroup of G with respect to w and be denoted by w(G).

scholarly journals REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

2017 ◽  
Vol 82 (2) ◽  
pp. 576-589 ◽  
Author(s):  
KOSTAS HATZIKIRIAKOU ◽  
STEPHEN G. SIMPSON
Keyword(s):  
Theorem Proving ◽  
Chain Condition ◽  
Reverse Mathematics ◽  
Partial Ordering ◽  
Young Diagrams ◽  
Equivalence Proof ◽  
Image Position ◽  
Countably Infinite ◽  
Infinite Set ◽  
Ascending Chain Condition

AbstractLetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$(or even over$RCA_0^{\rm{*}}$) to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

scholarly journals Further Duals of a verbal Subgroup

1959 ◽  
Vol 4 (2) ◽  
pp. 88-91
Author(s):  
S. Moran
Keyword(s):  
Minimal Subgroup ◽  
Arbitrary Group ◽  
Verbal Subgroup ◽  
The Third ◽  
New Concepts ◽  
Second Dual ◽  
Image Position

In a previous paper [3] we gave two methods for constructing subgroups which in certain senses may be considered to be dual to a verbal subgroup Vf(G) of an arbitrary group G. Associated with a word h (u, v) in the two symbols u and v, we have (i) the first dual subgroup which is defined as the minimal subgroup of G containing all elements ξ of G for whichfor all values of x1, x2, …, in xn in G, and (ii), the second dual subgroup which is defined as the minimal subgroup of G containing all elements z of G for whichfor all values of x1, x2, …, xn in G. Below we introduce slight variations to these definitions, which give rise to the concepts of the third and the fourth dual subgroups respectively. For certain values of h(u, v) we obtain concepts which also arise from and , namely, the marginal subgroup, the invariable subgroup and the centralizer of a verbal subgroup. We also obtain the new concepts of elemental subgroups and commutal subgroups and briefly sketch some of their properties. Finally we conclude by showing that MacLane's dual for the centralizer of a verbal subgroup is a closely related verbal subgroup.

Monotone but not positive subsets of the Cantor space

1987 ◽  
Vol 52 (3) ◽  
pp. 817-818 ◽  
Author(s):  
Randall Dougherty
Keyword(s):  
Partial Ordering ◽  
Background Information ◽  
Countable Union ◽  
Abstract Form ◽  
Cantor Space ◽  
Countable Intersection ◽  
Power Set ◽  
Countably Infinite ◽  
Infinite Set

A subset of the Cantor space ω2 is called monotone iff it is closed upward under the partial ordering ≤ defined by x ≤ y iff x(n) ≤ y(n) for all n ∈ ω. A set is -positive (-positive) iff it is monotone and -positive set is a countable union of -positive sets; a -positive set is a countable intersection of -positive sets. (See Cenzer [2] for background information on these concepts.) It is clear that any -positive set is and monotone; the converse holds for n ≤ 2 [2] and was conjectured by Dyck to hold for greater n. In this note, we will disprove this conjecture by giving examples of monotone sets (for n ≥ 3) which are not even -positive.First we note a few isomorphisms. The space (ω2, ≤) is isomorphic to the space (ω2 ≥), so instead of monotone and positive sets we may construct hereditary and negative sets (the analogous notions with “closed upward” replaced by “closed downward”). Also, (ω2, ≤) is isomorphic to ((ω), ⊆), where denotes the power set operator, or to ((S), ⊆) for any countably infinite set S.In order to remove extraneous notation from the proofs, we state the results in an abstract form (whose generality is deceptive).

How to Program an Infinite Abacus

1961 ◽  
Vol 4 (3) ◽  
pp. 295-302 ◽  
Author(s):  
Joachim Lambek
Keyword(s):  
Finite Number ◽  
Recursive Function ◽  
Computable Function ◽  
Unlimited Supply ◽  
Countably Infinite ◽  
Infinite Set

This is an expository note to show how an “infinite abacus” (to be defined presently) can be programmed to compute any computable (recursive) function. Our method is probably not new, at any rate, it was suggested by the ingenious technique of Melzak [2] and may be regarded as a modification of the latter.By an infinite abacus we shall understand a countably infinite set of locations (holes, wires etc.) together with an unlimited supply of counters (pebbles, beads etc.). The locations are distinguishable, the counters are not. The confirmed finitist need not worry about these two infinitudes: To compute any given computable function only a finite number of locations will be used, and this number does not depend on the argument (or arguments) of the function.

Maximal subsemigroups of some semigroups of order-preserving mappings on a countably infinite set

2017 ◽  
Vol 29 (4) ◽  
Author(s):  
Tiwadee Musunthia ◽  
Jörg Koppitz
Keyword(s):  
Natural Numbers ◽  
Maximal Subsemigroups ◽  
Countably Infinite ◽  
Infinite Set

AbstractIn this paper, we study the maximal subsemigroups of several semigroups of order-preserving transformations on the natural numbers and the integers, respectively. We determine all maximal subsemigroups of the monoid of all order-preserving injections on the set of natural numbers as well as on the set of integers. Further, we give all maximal subsemigroups of the monoid of all bijections on the integers. For the monoid of all order-preserving transformations on the natural numbers, we classify also all its maximal subsemigroups, containing a particular set of transformations.

A generalization of McDiarmid's theorem for mixed Bernoulli percolation

1980 ◽  
Vol 88 (1) ◽  
pp. 167-170 ◽  
Author(s):  
J. M. Hammersley
Keyword(s):  
Random Variables ◽  
Random Variable ◽  
Finite Sequence ◽  
Random Set ◽  
Percolation Probability ◽  
Open Path ◽  
Finite Set ◽  
Image Position ◽  
Infinite Set ◽  
Mutually Independent

Let G be an infinite partially directed graph of finite outgoing degree. Thus G consists of an infinite set of vertices, together with a set of edges between certain prescribed pairs of vertices. Each edge may be directed or undirected, and the number of edges from (but not necessarily to) any given vertex is always finite (though possibly unbounded). A path on G from a vertex V1 to a vertex Vn (if such a path exists) is a finite sequence of alternate edges and vertices of the form E12, V2, E23, V3, …, En − 1, n, Vn such that Ei, i + 1 is an edge connecting Vi and Vi + 1 (and in the direction from Vi to Vi + 1 if that edge happens to be directed). In mixed Bernoulli percolation, each vertex Vi carries a random variable di, and each edge Eij carries a random variable dij. All these random variables di and dij are mutually independent, and take only the values 0 or 1; the di take the value 1 with probability p, while the dij take the value 1 with probability p. A path is said to be open if and only if all the random variables carried by all its edges and all its vertices assume the value 1. Let S be a given finite set of vertices, called the source set; and let T be the set of all vertices such that there exists at least one open path from some vertex of S to each vertex of T. (We imagine that fluid, supplied to all the source vertices, can flow along any open path; and thus T is the random set of vertices eventually wetted by the fluid). The percolation probabilityis defined to be the probability that T is an infinite set.

A note on lemmas of Green and Kondo

1967 ◽  
Vol 63 (1) ◽  
pp. 83-85 ◽  
Author(s):  
A. O. Morris
Keyword(s):  
Symmetric Functions ◽  
Rational Numbers ◽  
Infinite Sets ◽  
Image Position ◽  
Countably Infinite

Let R be the field of rational numbers, {x} = {x1, z2, …}, {y} = {y1, y2, …} be two countably infinite sets of variables and t an indeterminate. Let (λ) = (λ1, λ2, …, λm) be a partition of n. Then Littlewood (5) has shown thatcan be expressed in the formwhere Qλ(x, t) and Qλ(y, t) denote certain symmetric functions on the sets {x} and {y} respectively. In additionwhere is the partition of n conjugate to (λ). In fact, Littlewood (5) showed thatwhere the summation is over all terms obtained by permutations of the variables xi (i = 1, 2, …) and.

Dimension subgroups modulo n

1970 ◽  
Vol 68 (3) ◽  
pp. 579-582 ◽  
Author(s):  
Siegfried Moran
Keyword(s):  
Normal Subgroup ◽  
Group Algebra ◽  
Augmentation Ideal ◽  
Arbitrary Group ◽  
Image Position

Let G be an arbitrary group and Zn(G) denote the group algebra of G over the integers modulo n. If δi(G) denotes ith power of the augmentation ideal δ(G) of Zn(G), thenis easily seen to be a normal subgroup of G. It is denoted by Di, n(G) and is called ith dimension subgroup of G modulo n. It can be shown that these dimension subgroups are determined by the dimension subgroups modulo a power of a prime p. Hence we shall restrict our attention to these dimension subgroups.

The extensions of the modal logic K5

1985 ◽  
Vol 50 (1) ◽  
pp. 102-109 ◽  
Author(s):  
Michael C. Nagle ◽  
S. K. Thomason
Keyword(s):  
Modal Logic ◽  
Classical Logic ◽  
Abstract Characterization ◽  
Propositional Modal Logic ◽  
Normal Logic ◽  
Countably Infinite ◽  
Infinite Set

Our purpose is to delineate the extensions (normal and otherwise) of the propositional modal logic K5. We associate with each logic extending K5 a finitary index, in such a way that properties of the logics (for example, inclusion, normality, and tabularity) become effectively decidable properties of the indices. In addition we obtain explicit finite axiomatizations of all the extensions of K5 and an abstract characterization of the lattice of such extensions.This paper refines and extends the Ph.D. thesis [2] of the first-named author, who wishes to acknowledge his debt to Brian F. Chellas for his considerable efforts in directing the research culminating in [2] and [3]. We also thank W. J. Blok and Gregory Cherlin for observations which greatly simplified the proofs of Theorem 3 and Corollary 10.By a logic we mean a set of formulas in the countably infinite set Var of propositional variables and the connectives ⊥, →, and □ (other connectives being used abbreviatively) which contains all the classical tautologies and is closed under detachment and substitution. A logic is classical if it is also closed under RE (from A↔B infer □A ↔□B) and normal if it is classical and contains □ ⊤ and □ (P → q) → (□p → □q). A logic is quasi-classical if it contains a classical logic and quasi-normal if it contains a normal logic. Thus a quasi-normal logic is normal if and only if it is classical, and if and only if it is closed under RN (from A infer □A).

FC-nilpotent and FC-soluble groups

1956 ◽  
Vol 52 (3) ◽  
pp. 391-398 ◽  
Author(s):  
A. M. Duguid ◽  
D. H. McLain
Keyword(s):  
Finite Number ◽  
Finite Groups ◽  
Abelian Groups ◽  
Characteristic Subgroup ◽  
Arbitrary Group ◽  
Soluble Groups ◽  
Image Position

Let an element of a group be called an FC element if it has only a finite number of conjugates in the group. Baer(1) and Neumann (8) have discussed groups in which every element is FC, and called them FC-groups. Both Abelian and finite groups are trivially FC-groups; Neumann has studied the properties common to FC-groups and Abelian groups, and Baer the properties common to FC-groups and finite groups. Baer has also shown that, for an arbitrary group G, the set H1 of all FC elements is a characteristic subgroup. Haimo (3) has defined the FC-chain of a group G byHi/Hi−1 is the subgroup of all FC elements in G/Hi−1.

Sign in / Sign up

Export Citation Format

Share Document