A Property Equivalent to n-permutability for Infinite Groups
|
|
- Ophelia Fowler
- 5 years ago
- Views:
Transcription
1 Journal of Algebra 221, (1999) Article ID jabr , available online at on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar Mohammadi Hassanabadi Department of Mathematics, University of Isfahan, Isfahan, Iran and Bijan Taeri Department of Mathematics, University of Technology of Isfahan, Isfahan, Iran Communicated by Gernot Stroth Received September 7, 1998 Let n be an integer greater than 1. A group G is said to be n-permutable whenever for every n-tuple x 1 x n of elements of G there exists a non-identity permutation σ of 1 n such that x 1 x n = x σ 1 x σ n In this paper we prove that an infinite group G is n-permutable if and only if for every n infinite subsets X 1 X n of G there exists a non-identity permutation σ on 1 n such that X 1 X n X σ 1 X σ n 1999 Academic Press 1. INTRODUCTION Permutable groups have been studied by various people (for example, see ). Let n be an integer greater than 1. Recall that a group G is called n-permutable whenever for every n-tuple x 1 x n of elements of G there exists a non-identity permutation σ of 1 n such that x 1 x n = x σ 1 x σ n. Also a group is said to be permutable if it is n-permutable for some integer n>1. The main result for groups in this class was obtained by Curzio et al. in [3], where it was shown that such * abdolahi@math.ui.ac.ir. aamohaha@math.ui.ac.ir. b.taeri@cc.iut.ac.ir /99 $30.00 Copyright 1999 by Academic Press All rights of reproduction in any form reserved. 570
2 n-permutability 571 groups are finite-by-abelian-by-finite. Let n > 1 and m be positive integers. Let S n denote the group of all permutations on the set 1 n. A natural extension of permutable groups, namely m n -permutable groups, groups in which X 1 X n σ S n \1 X σ 1 X σ n for all subsets X i of G where X i =m for all i = 1 n, was introduced by Mohammadi Hassanabadi and Rhemtulla in [9]. It was proved there that such a group either is n-permutable or is finite of order bounded by a function of m and n. In [8] Mohammadi Hassanabadi investigated another extension of m n -permutable groups as follows. For positive integers n>1 and m a group G is called restricted m n -permutable if X 1 X n σ S n \1 X σ 1 X σ n for all subsets X i of G where X i =m for all i = 1 n. It was proved there that such a group is finite-by-abelian-by-finite. In [4] Longobardi et al. called a group G a Pn -group (n an integer greater than 1) if for every sequence X 1 X n of infinite subsets of G there exist x i in X i such that x 1 x n = x σ 1 x σ n for some non-trivial permutation σ in S n. They proved that every infinite Pn -group is an n-permutable group. Here we deal with another extension of infinite restricted m n -permutable and Pn -groups. Let n be an integer greater than 1. We call a group G a restricted n permutable group if X 1 X n σ S n \1 X σ 1 X σ n for all infinite subsets X 1 X n of G. Our main result is the following, which sharpens and generalizes that of [8] and also generalizes the result of [4] concerning Pn. Every infinite restricted n -permutable group is n-per- Theorem. mutable. 2. PROOFS To prove the theorem, we need the following results. Lemma 2.1. Let G be an infinite residually finite group which is a restricted n -permutable group. Then G is an n-permutable group. Proof. Let x 1 x n be arbitrary elements of G and S = { x 1 x n x σ 1 x σ n 1 σ S n \1 } Suppose, for a contradiction, that 1 S. Since G is residually finite and S is finite, there exists a normal subgroup N of finite index in G such that S N =. Now considering infinite subsets Nx 1 Nx n, there exists σ S n \1 such that Nx 1 Nx n Nx σ 1 Nx σ n and so x 1 x n x σ 1 x σ n 1 N, which is a contradiction.
3 572 abdollahi, mohammadi hassanabadi, and taeri Lemma 2.2. Let G = Dr i I G i be an infinite direct product of non-abelian subgroups. Then G is not a restricted n -permutable group for all integers n>1. Proof. Suppose, for a contradiction, that G is a restricted n permutable group for some integer n > 1. We show that G is an n- permutable group, which contradicts Corollary 2.9 of [1]. Let x 1 x n G and put S = x 1 x n x σ 1 x σ n 1 σ S n \1. Letk be any integer greater than S. Since G is an infinite direct product of normal subgroups, there exist k infinite normal subgroups N 1 N k of G such that N i N j = 1 for all distinct i j 1 k. Let l 1 k and consider infinite subsets N l x 1 N l x n. By the hypothesis, there exists σ l S n \1 such that x 1 x n x σl 1 x σl n 1 N l Therefore there exist two distinct i j 1 k and an element s S such that s N i N j = 1 and so G is an n-permutable group. We denote by A 1 the set a 1 a A for any non-empty subset A of a group. Let a and g be arbitrary elements of a group G. We define S a g = x G a x = g which is either an empty set or a right coset of the centralizer of a in G. A key result required in the proof of the theorem is the following: Lemma 2.3. Let G be an infinite restricted n -permutable group. Then the FC-centre of G is non-trivial. Proof. Suppose, for a contradiction, that the FC-centre of G is trivial. We construct n infinite subsets X 1 X n of G such that X 1 X n X σ 1 X σ n = for all non-identity permutations σ in S n. For this, for each m we construct n subsets X i m = a i 1 a i m of G (i = 1 n), such that X 1 m X n m X σ 1 m X σ n m = # for all non-identity permutations σ in S n. We argue by induction on m. Let m = 1. By Lemma 2.1 in [3], G is not an n-permutable group and so there exist a 1 1 a n 1 G such that a 1 1 a n 1 a σ 1 1 a σ n 1 for all σ S n \1. Now suppose that we have already defined subsets X i m = a i 1 a i m of G (i = 1 n) satisfying # for all σ S n \1. Suppose that we have already defined a i m+1 and so X i m+1 for i = 1 r such that for all σ S n \1 X 1 m+1 X 2 m+1 X r m+1 X r+1 m X n m X σ 1 j1 X σ n jn =
4 n-permutability 573 where j t = m + 1 whenever σ t 1 r and otherwise j t = m. Let T r+1 be the union of all the following sets where σ varies over S n \1, X 1 σ i 1 s i 1 X 1 σ 1 s 1 X 1 m+1 X r m+1 X r+1 m X n m X 1 σ n s n X 1 σ i+1 s i+1 where s l = m + 1 whenever σ l 1 r and otherwise s l = m; also i varies over 1 n and if i = 1ori = n then we define respectively X 1 σ i 1 s i 1 X 1 σ 1 s 1 = 1 or X 1 σ n s n X 1 σ i+1 s i+1 = 1. Also put ( U r+1 = X 1 r m+1 X 1 1 m+1 T r+1 1 σ S n X σ 1 j1 X σ n jn ) X 1 n m X 1 r+2 m where j l = m + 1 whenever σ l 1 r and otherwise j l = m. Now we prove that there exists an element a r+1 m+1 G\U r+1 such that if X r+1 m+1 = a r+1 1 a r+1 m+1 then for all σ S n \1 X 1 m+1 X r+1 m+1 X r+2 m X n m X σ 1 j1 X σ n jn = where j l = m + 1 whenever σ l 1 r + 1 and otherwise j l = m. Suppose not. Therefore a 1 i1 a 2 i2 a n in = a σ 1 j1 a σ 2 j2 a σ n jn for some 1 i 1 i r+1 m i r+2 m 1 j 1 m, and 1 j s m + 1 whenever σ s 1 r + 1. Suppose that σ t =r + 1. If i r+1 m + 1orj t m + 1 then we get contradiction with the induction hypothesis or the choice of a r+1 m+1. Therefore we must always have i r+1 = j t = m + 1 and so ( ) 1 a r+2 ir+2 a n in aσ t+1 jt+1 a σ n jn = a 1 r+1 i r+1 (a 1 i1 a r ir ) 1 a σ 1 j1 a σ t 1 jt 1 a r+1 jt Now we define g σ and f σ for all σ S n \1as ( ) 1 a r+2 ir+2 a n in aσ t+1 jt+1 a σ n jn if 1 t n 1 f σ = a r+2 ir+2 a n in if t = n and ( ) 1aσ 1 j1 a1 i1 a r ir a σ t 1 jt 1 if 2 t n g σ = ( ) 1 a1 i1 a r ir if t = 1 where t = σ 1 r + 1. Hence a r+1 m+1 S g σ f σ and so ( ) G = U r+1 S gσ f σ
5 574 abdollahi, mohammadi hassanabadi, and taeri where σ in varies over the set of all non-identity permutations in S n such that S g σ f σ. Obviously the set of pairs g σ f σ is finite. Therefore shows that G is a finite union of right cosets of the centralizers of g σ s. Thus by the famous theorem of Neumann [10] there exists g σ in the FC-centre of G such that S g σ f σ. But by the hypothesis g σ = f σ = 1. Thus there exist n 1 -tuples i 1 i r i r+2 and j 1 j t 1 j t+1 where 1 i 1 i r m + 1, 1 i r+2 m, t = σ 1 r + 1, and j l = m + 1 whenever 1 σ l r and otherwise j l = m such that ( ) 1 a r+2 ir+2 a n in a σ t+1 jt+1 a σ n jn = ( a 1 i1 a r ir ) 1aσ 1 j1 a σ t 1 jt 1 = 1 So for any a X r+1 m we have the following, which contradicts the induction hypothesis: a 1 i1 a r ir aa r+2 ir+2 a n in = a σ 1 j1 a σ 2 j2 a σ t 1 jt 1 aa σ t+1 jt+1 a σ n jn Therefore we have defined X r+1 m+1. Thus we have inductively defined X i m = a i 1 a i m for all m such that for all σ S n \1 X 1 m X n m X σ 1 m X σ n m = Now set X i = m=1 X i m (i = 1 n), then X i is infinite and X 1 X n X σ 1 X σ n = for all σ S n \1. Otherwise there exist n-tuples i 1 and j 1 on and π S n \1 such that a 1 i1 a n in = a π 1 j1 a π n jn Let s = Max i 1 j 1. Then X 1 s X n s X π 1 s X π n s, which is a contradiction with the construction of X i s (i = 1 n). By Lemma 2.3, every non-trivial restricted n -permutable group has a non-trivial FC-element and since the class of restricted n permutable groups is closed under homomorphic images we have: Every restricted n -permutable group is FC-hyper- Corollary 2.4. central. Lemma 2.5. Let G be an infinite restricted n -permutable group. If G is finitely generated or non-periodic then G is an n-permutable group.
6 n-permutability 575 Proof. Suppose that G is finitely generated. By Corollary 2.4, G is FChypercentral. Now by a result of McLain [7] (or see p. 133 of [11]) a finitely generated FC-hypercentral group is nilpotent-by-finite. Therefore G is a finitely generated nilpotent-by-finite group and so G is residually finite. Thus G is n-permutable by Lemma 2.1. Now assume that G is non-periodic. Then there is an element x of infinite order in G.Letx 1 x n be arbitrary elements of G. By the previous part x x 1 x n is an n-permutable group and so G is n-permutable. Lemma 2.6. Let G be a restricted n -permutable group. Then G is hyperabelian-by-finite. Proof. We may assume that G is infinite, and it suffices to show that G contains a non-trivial normal abelian subgroup. Suppose no such normal abelian subgroup exists, and let x be a non-identity element in the FC-centre of G which exists by Lemma 2.3. Let N 1 = x G be the normal closure of x in G, and let C = C G N 1. Then G C is finite and N 1 C = Z N 1 is a normal abelian subgroup of G. Hence N 1 C = 1. Therefore N 1 is finite and, having a trivial centre, it is certainly non-abelian. Now suppose, inductively, that we have already defined normal non-abelian finite subgroups N 1 N t of G such that N 1 N t generate their direct product in G. Write D = C G N 1 N t ; thus G D is finite. Now using Lemma 2.3 we can choose a non-trivial element y in the FC-centre of D. Then y is an element of the FC-centre of G. LetN t+1 = y G. It is easily seen that N t+1 is a finite non-abelian group. Moreover, N t+1 D, so that N 1 N t N t+1 generate their direct product in G. Thus we have found in G an infinite direct product N 1 N 2 N t of finite non-abelian groups, which together with Lemma 2.2 gives a contradiction. Lemma 2.7. Let G be an infinite restricted n -permutable group which is not Černikov. Then G is an n-permutable group. Proof. By Lemma 2.5, we may assume that G is periodic. By Lemma 2.6, there exists a normal hyperabelian subgroup H of finite index in G. Therefore H is a periodic locally soluble group and G is locally finite. Let x 1 x n be arbitrary elements in G and let A be the finite subgroup generated by x 1 x n. We note that H is not a Černikov group and A can be regarded as a finite group of automorphisms of H. Now by a result of Zaicev [13], there exists an abelian subgroup B of H which is not Černikov and B is a normal subgroup of AB. Since B is periodic it is a direct product of the Sylow p-subgroups B p of B. If infinitely many B p are non-trivial, then since A has only finitely many prime divisors, there exists an infinite subgroup D of B which is normal in AB such that A D = 1. Consider the n infinite subsets Dx 1 Dx n. By the hypothesis there exists
7 576 abdollahi, mohammadi hassanabadi, and taeri σ S n \1 such that Dx 1 Dx n Dx σ 1 Dx σ n and so x 1 x n x σ 1 x σ n 1 A D = 1. Therefore x 1 x n = x σ 1 x σ n as required. So assume that there exist only finitely many B p which are non-trivial. Since B is not a Černikov group and since the product of two normal Černikov subgroups of a group is a Černikov group, then there exists a prime number p such that B p is not Černikov. Thus by Theorem of [12], C = b B b p = 1 is an infinite elementary abelian p-group. Clearly C is normal in AB. Now the infinite group AC is a residually finite-by-finite group and so AC is residually finite. Therefore by Lemma 2.1, AC is an n-permutable group and the proof is complete. We need the following remark in the final step of the proof of the theorem. Here x denotes the order of an element x of a group. Remark 2.8. We note that if x 1 x n (n>1) are p-elements (p a prime) of distinct orders in an abelian group then r< x 1 x n t where r = Min x 1 x n and t = Max x 1 x n. Proof of the Theorem. Let G be an infinite restricted n -permutable group. By Lemma 2.7, we may assume that G is a Černikov group. Thus there exists an infinite normal subgroup A of G which is a direct product of finitely many groups isomorphic to C p, the quasicyclic p-group, for some prime number p. Letx 1 x n G and let X be the finite subgroup generated by x 1 x n (we note that G is locally finite). Let Y be the group of automorphisms of A induced by the elements of X under conjugation. Then Y is finite. Let α 0 be an integer such that a p α 0 for any a X A. By Lemma 3.5 of [4] there are infinite sequences α 0 <α 1 < of integers and a 1 a 2 of elements of A such that for any i, a i =p α i, and ai y >p α i 1, for any y Y \CY a i. Now partition the set a i i 1 into n infinite disjoint subsets J i, i = 1 n. Consider the set J i x i, i = 1 n, and let σ S n \1 be such that a i1 x 1 a in x n = a j1 x σ 1 a jn x σ n for suitable a i1 J 1 a in J n and a j1 J σ 1 a jn J σ n. Therefore x = x 1 x n 1 x σ 1 x σ n = a x 1 x n i 1 a x ( x n σ 1 x σ n a j 1 a x ) σ n 1 We note that i 1 are pairwise distinct as are j 1.If i 1 j 1 =
8 n-permutability 577 then by Remark 2.8, p α r < x where r = Min i 1 j 1, which is a contradiction, since α r >α 0 and x X A. Thus F = i 1 j 1.Let F =s. We may assume, without loss of generality, that i 1 = j 1 i s = j s. Then we may write x = a i1 y 1 z1 a is y s z s a y s+1 i s+1 a y ( n z a s+1 j s+1 a z ) n 1 for some y 1 y n z 1 z n X. Now suppose, for a contradiction, that x 1. If a i1 y 1 = = a is y s =1 then s<n, since x 1. Then since i s+1 j s+1 are pairwise distinct, by Remark 2.8, x >p α k where k = Min i s+1 j s+1, which is a contradiction. Thus we may assume, without loss of generality, that y l Y \C Y a il, for l = 1 s and i 1 < <i s. Now we claim that the elements [ ] [ ] y ai1 y 1 ais y s a s+1 i s+1 a y n a z s+1 j s+1 a z n have distinct orders. For, since p α i l 1 < a il y l p α i l for l = 1 s and α i1 < <α is, then the elements a i1 y 1 a is y s have distinct orders. Clearly a y s+1 i s+1 a y n a z s+1 j s+1 a z n have distinct orders. If there exist l 1 s and k s + 1 n such that a il y l = a ik or a il y l = a jk then since p α i l 1 < a il y l p α i l, αil = α ik or α il = α jk and so i l = i k or i l = j k, a contradiction. Now by Remark 2.8, p t < x, where p t = Min a i1 y 1 a is y s a y s+1 i s+1 a y n a z s+1 j s+1 a z n But t>α 0 which is a contradiction. REFERENCES 1. R. D. Blyth, Rewriting products of group elements, I, J. Algebra 116 (1988), R. D. Blyth, Rewriting products of group elements, II, J. Algebra 119 (1988), M. Curzio, P. Longobardi, M. Maj, and D. J. S. Robinson, A permutational property of groups, Arch. Math. 44 (1985), P. Longobardi, M. Maj, and A. H. Rhemtulla, Infinite groups in a given variety and Ramsey s theorem, Comm. Algebra 20 (1992), P. Longobardi, M. Maj, and S. E. Stonehewer, The classification of groups in which every product of four elements can be reordered, Rend. Sem. Mat. Univ. Padova 93 (1995), M. Maj, On the derived length of groups with some permutational property, J. Algebra 136 (1991), D. H. McLain, Remarks on the upper central series of a group, Proc. Glasgow Math. Assoc. 3 (1956), A. Mohammadi Hassanabadi, A property equivalent to permutability for groups, Rend. Sem. Mat. Univ. Padova, 100 (1998), A. Mohammadi Hassanabadi and A. H. Rhemtulla, Criteria for commutativity in large groups, Canad. Math. Bull. 41, No. 1 (1998),
9 578 abdollahi, mohammadi hassanabadi, and taeri 10. B. H. Neumann, Groups covered by permutable subsets, J. London Math. Soc. 29 (1954), D. J. S. Robinson, Finiteness Conditions and Generalized Soluble Groups, Part 1, Springer-Verlag, Berlin, D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed., Springer-Verlag, Berlin, D. I. Zaicev, On solvable subgroups of locally solvable groups, Dokl. Akad. Nauk SSSR 214 (1974), [Translation in Soviet Math. Dokl. 15 (1974), ]
Algebra homework 8 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 8 Homomorphisms, isomorphisms For every n 1 we denote by S n the n-th symmetric group. Exercise 1. Consider the following permutations: ( ) ( 1 2 3 4 5
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationOrthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF
Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster
More informationLaurence Boxer and Ismet KARACA
SOME PROPERTIES OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and
More informationLaurence Boxer and Ismet KARACA
THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.
More informationOn the generalized σ-fitting subgroup of finite groups
Rend. Sem. Mat. Univ. Padova 1xx (201x) Rendiconti del Seminario Matematico della Università di Padova c European Mathematical Society On the generalized σ-fitting subgroup of finite groups Bin Hu Jianhong
More informationAbstract Algebra Solution of Assignment-1
Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,
More informationCongruence lattices of finite intransitive group acts
Congruence lattices of finite intransitive group acts Steve Seif June 18, 2010 Finite group acts A finite group act is a unary algebra X = X, G, where G is closed under composition, and G consists of permutations
More informationSEMICENTRAL IDEMPOTENTS IN A RING
J. Korean Math. Soc. 51 (2014), No. 3, pp. 463 472 http://dx.doi.org/10.4134/jkms.2014.51.3.463 SEMICENTRAL IDEMPOTENTS IN A RING Juncheol Han, Yang Lee, and Sangwon Park Abstract. Let R be a ring with
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More informationThe Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.
The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationNotes, Comments, and Letters to the Editor. Cores and Competitive Equilibria with Indivisibilities and Lotteries
journal of economic theory 68, 531543 (1996) article no. 0029 Notes, Comments, and Letters to the Editor Cores and Competitive Equilibria with Indivisibilities and Lotteries Rod Garratt and Cheng-Zhong
More informationCONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION
Bulletin of the Section of Logic Volume 42:1/2 (2013), pp. 1 10 M. Sambasiva Rao CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Abstract Two types of congruences are introduced
More informationPURITY IN IDEAL LATTICES. Abstract.
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLV, s.i a, Matematică, 1999, f.1. PURITY IN IDEAL LATTICES BY GRIGORE CĂLUGĂREANU Abstract. In [4] T. HEAD gave a general definition of purity
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More informationThe illustrated zoo of order-preserving functions
The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second
More informationLECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS
LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS Recall from Lecture 2 that if (A, φ) is a non-commutative probability space and A 1,..., A n are subalgebras of A which are free with respect to
More informationarxiv: v2 [math.lo] 13 Feb 2014
A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationCHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n
CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put
More informationINTERVAL DISMANTLABLE LATTICES
INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationmaps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7).
Math 430 Dr. Songhao Li Spring 2016 HOMEWORK 3 SOLUTIONS Due 2/15/16 Part II Section 9 Exercises 4. Find the orbits of σ : Z Z defined by σ(n) = n + 1. Solution: We show that the only orbit is Z. Let i,
More informationInterpolation of κ-compactness and PCF
Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has
More informationExistentially closed models of the theory of differential fields with a cyclic automorphism
Existentially closed models of the theory of differential fields with a cyclic automorphism University of Tsukuba September 15, 2014 Motivation Let C be any field and choose an arbitrary element q C \
More informationOn the smallest abundant number not divisible by the first k primes
On the smallest abundant number not divisible by the first k rimes Douglas E. Iannucci Abstract We say a ositive integer n is abundant if σ(n) > 2n, where σ(n) denotes the sum of the ositive divisors of
More informationOn Applications of Matroids in Class-oriented Concept Lattices
Math Sci Lett 3, No 1, 35-41 (2014) 35 Mathematical Sciences Letters An International Journal http://dxdoiorg/1012785/msl/030106 On Applications of Matroids in Class-oriented Concept Lattices Hua Mao Department
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More informationA relation on 132-avoiding permutation patterns
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,
More informationA Translation of Intersection and Union Types
A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationBest response cycles in perfect information games
P. Jean-Jacques Herings, Arkadi Predtetchinski Best response cycles in perfect information games RM/15/017 Best response cycles in perfect information games P. Jean Jacques Herings and Arkadi Predtetchinski
More informationNew tools of set-theoretic homological algebra and their applications to modules
New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,
More informationTheorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.
CONGRUENCE-PRESERVING EXTENSIONS OF FINITE LATTICES TO SEMIMODULAR LATTICES G. GRÄTZER AND E.T. SCHMIDT Abstract. We prove that every finite lattice hasa congruence-preserving extension to a finite semimodular
More informationThe Binomial Theorem and Consequences
The Binomial Theorem and Consequences Juris Steprāns York University November 17, 2011 Fermat s Theorem Pierre de Fermat claimed the following theorem in 1640, but the first published proof (by Leonhard
More informationFuzzy L-Quotient Ideals
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 3 (2013), pp. 179-187 Research India Publications http://www.ripublication.com Fuzzy L-Quotient Ideals M. Mullai
More informationMore On λ κ closed sets in generalized topological spaces
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center,
More informationSome Remarks on Finitely Quasi-injective Modules
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing
More informationSkew lattices of matrices in rings
Algebra univers. 53 (2005) 471 479 0002-5240/05/040471 09 DOI 10.1007/s00012-005-1913-5 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Skew lattices of matrices in rings Karin Cvetko-Vah Abstract.
More informationCARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS
CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS KEITH A. KEARNES AND GREG OMAN Abstract. We determine the relationship between the cardinality of a Noetherian integral domain and the cardinality
More informationON A PROBLEM BY SCHWEIZER AND SKLAR
K Y B E R N E T I K A V O L U M E 4 8 ( 2 1 2 ), N U M B E R 2, P A G E S 2 8 7 2 9 3 ON A PROBLEM BY SCHWEIZER AND SKLAR Fabrizio Durante We give a representation of the class of all n dimensional copulas
More informationOrdered Semigroups in which the Left Ideals are Intra-Regular Semigroups
International Journal of Algebra, Vol. 5, 2011, no. 31, 1533-1541 Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups Niovi Kehayopulu University of Athens Department of Mathematics
More informationPalindromic Permutations and Generalized Smarandache Palindromic Permutations
arxiv:math/0607742v2 [mathgm] 8 Sep 2007 Palindromic Permutations and Generalized Smarandache Palindromic Permutations Tèmítópé Gbóláhàn Jaíyéọlá Department of Mathematics, Obafemi Awolowo University,
More informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Department of Computer Science, University of Toronto, shlomoh,szeider@cs.toronto.edu Abstract.
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 286 290 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml The number of spanning trees of a graph Jianxi
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis
ORDERED SEMIGROUPS HAVING THE P -PROPERTY Niovi Kehayopulu, Michael Tsingelis ABSTRACT. The main results of the paper are the following: The ordered semigroups which have the P -property are decomposable
More informationThe finite lattice representation problem and intervals in subgroup lattices of finite groups
The finite lattice representation problem and intervals in subgroup lattices of finite groups William DeMeo Math 613: Group Theory 15 December 2009 Abstract A well-known result of universal algebra states:
More informationThis is an author version of the contribution published in Topology and its Applications
This is an author version of the contribution published in Topology and its Applications The definitive version is available at http://www.sciencedirect.com/science/article/pii/s0166864109001023 doi:10.1016/j.topol.2009.03.028
More informationREMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7
REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More informationCONSISTENCY AMONG TRADING DESKS
CONSISTENCY AMONG TRADING DESKS David Heath 1 and Hyejin Ku 2 1 Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA, email:heath@andrew.cmu.edu 2 Department of Mathematics
More informationarxiv: v1 [math.lo] 24 Feb 2014
Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei
More informationContinuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals
Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Philipp Moritz Lücke (joint work with Philipp Schlicht) Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität
More informationOn the Number of Permutations Avoiding a Given Pattern
On the Number of Permutations Avoiding a Given Pattern Noga Alon Ehud Friedgut February 22, 2002 Abstract Let σ S k and τ S n be permutations. We say τ contains σ if there exist 1 x 1 < x 2
More informationABSTRACT GENERALIZING THE FUTURAMA THEOREM. The 2010 episode of Futurama titled The Prisoner of Benda centers
ABSTRACT GENERALIZING THE FUTURAMA THEOREM The 2010 episode of Futurama titled The Prisoner of Benda centers around a machine that swaps the brains of any two people who use it. The problem is, once two
More informationEquivalence Nucleolus for Partition Function Games
Equivalence Nucleolus for Partition Function Games Rajeev R Tripathi and R K Amit Department of Management Studies Indian Institute of Technology Madras, Chennai 600036 Abstract In coalitional game theory,
More informationTHE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES
THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point
More informationMath-Stat-491-Fall2014-Notes-V
Math-Stat-491-Fall2014-Notes-V Hariharan Narayanan December 7, 2014 Martingales 1 Introduction Martingales were originally introduced into probability theory as a model for fair betting games. Essentially
More informationKAPLANSKY'S PROBLEM ON VALUATION RINGS
proceedings of the american mathematical society Volume 105, Number I, January 1989 KAPLANSKY'S PROBLEM ON VALUATION RINGS LASZLO FUCHS AND SAHARON SHELAH (Communicated by Louis J. Ratliff, Jr.) Dedicated
More informationA note on the number of (k, l)-sum-free sets
A note on the number of (k, l)-sum-free sets Tomasz Schoen Mathematisches Seminar Universität zu Kiel Ludewig-Meyn-Str. 4, 4098 Kiel, Germany tos@numerik.uni-kiel.de and Department of Discrete Mathematics
More informationUnary PCF is Decidable
Unary PCF is Decidable Ralph Loader Merton College, Oxford November 1995, revised October 1996 and September 1997. Abstract We show that unary PCF, a very small fragment of Plotkin s PCF [?], has a decidable
More informationarxiv: v1 [math.lo] 27 Mar 2009
arxiv:0903.4691v1 [math.lo] 27 Mar 2009 COMBINATORIAL AND MODEL-THEORETICAL PRINCIPLES RELATED TO REGULARITY OF ULTRAFILTERS AND COMPACTNESS OF TOPOLOGICAL SPACES. V. PAOLO LIPPARINI Abstract. We generalize
More informationEpimorphisms and Ideals of Distributive Nearlattices
Annals of Pure and Applied Mathematics Vol. 18, No. 2, 2018,175-179 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 November 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n2a5
More informationIEOR E4004: Introduction to OR: Deterministic Models
IEOR E4004: Introduction to OR: Deterministic Models 1 Dynamic Programming Following is a summary of the problems we discussed in class. (We do not include the discussion on the container problem or the
More informationIntroduction to Priestley duality 1 / 24
Introduction to Priestley duality 1 / 24 2 / 24 Outline What is a distributive lattice? Priestley duality for finite distributive lattices Using the duality: an example Priestley duality for infinite distributive
More informationA Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs
A Combinatorial Proof for the Circular Chromatic Number of Kneser Graphs Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles, USA Email: dliu@calstatela.edu Xuding Zhu
More informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More information4 Martingales in Discrete-Time
4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1
More informationLie Algebras and Representation Theory Homework 7
Lie Algebras and Representation Theory Homework 7 Debbie Matthews 2015-05-19 Problem 10.5 If σ W can be written as a product of t simple reflections, prove that t has the same parity as l(σ). Let = {α
More informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More informationUPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES
UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES JOHN BALDWIN, DAVID KUEKER, AND MONICA VANDIEREN Abstract. Grossberg and VanDieren have started a program to develop a stability theory for
More informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationON THE QUOTIENT SHAPES OF VECTORIAL SPACES. Nikica Uglešić
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 21 = 532 (2017): 179-203 DOI: http://doi.org/10.21857/mzvkptxze9 ON THE QUOTIENT SHAPES OF VECTORIAL SPACES Nikica Uglešić To my Master teacher Sibe Mardešić - with
More informationTABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC
TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC THOMAS BOLANDER AND TORBEN BRAÜNER Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known
More informationSequentially perfect and uniform one-factorizations of the complete graph
Sequentially perfect and uniform one-factorizations of the complete graph Jeffrey H. Dinitz Mathematics and Statistics University of Vermont, Burlington, VT, USA 05405 Jeff.Dinitz@uvm.edu Peter Dukes Mathematics
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More informationON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH
Discussiones Mathematicae Graph Theory 37 (2017) 623 632 doi:10.7151/dmgt.1941 ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH WITH GIVEN k-connectivity Yuefang Sun Department of Mathematics Shaoxing University
More information1 Directed sets and nets
subnets2.tex April 22, 2009 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/topo/ This text contains notes for my talk given at our topology seminar. It compares 3 different definitions of subnets.
More informationAlgebra and Number Theory Exercise Set
Algebra and Number Theory Exercise Set Kamil Niedzia lomski 1 Algebra 1.1 Complex Numbers Exercise 1. Find real and imaginary part of complex numbers (1) 1 i 2+i (2) (3 + 7i)( 3 + i) (3) ( 3+i)( 1+i 3)
More informationGeneral Lattice Theory: 1979 Problem Update
Algebra Universalis, 11 (1980) 396-402 Birkhauser Verlag, Basel General Lattice Theory: 1979 Problem Update G. GRATZER Listed below are all the solutions or partial solutions to problems in the book General
More informationAn effective perfect-set theorem
An effective perfect-set theorem David Belanger, joint with Keng Meng (Selwyn) Ng CTFM 2016 at Waseda University, Tokyo Institute for Mathematical Sciences National University of Singapore The perfect
More information2 Deduction in Sentential Logic
2 Deduction in Sentential Logic Though we have not yet introduced any formal notion of deductions (i.e., of derivations or proofs), we can easily give a formal method for showing that formulas are tautologies:
More informationThe Sorting Index and Permutation Codes. Abstract
The Sorting Index and Permutation Codes William Y.C. Chen a, George Z. Gong b, Jeremy J.F. Guo b a Center for Applied Mathematics, Tianjin University, Tianjin 300072, P. R. China b Center for Combinatorics,
More informationOn Packing Densities of Set Partitions
On Packing Densities of Set Partitions Adam M.Goyt 1 Department of Mathematics Minnesota State University Moorhead Moorhead, MN 56563, USA goytadam@mnstate.edu Lara K. Pudwell Department of Mathematics
More informationEquilibrium selection and consistency Norde, Henk; Potters, J.A.M.; Reijnierse, Hans; Vermeulen, D.
Tilburg University Equilibrium selection and consistency Norde, Henk; Potters, J.A.M.; Reijnierse, Hans; Vermeulen, D. Published in: Games and Economic Behavior Publication date: 1996 Link to publication
More informationNOTE. A Note on the Trinomial Analogue of Bailey's Lemma
Journal of Combinatorial Theory Series A 8 48 (998) Article No. TA972830 NOTE A Note on the Trinomial Analogue of Bailey's emma S. Ole Warnaar* Department of athematics University of elbourne Parkville
More informationNOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING
NOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING K.Umadevi 1, V.Gopalakrishnan 2 1Assistant Professor,Department of Mathematics,Noorul Islam University,Kumaracoil,Tamilnadu,India 2Research
More informationReceived May 27, 2009; accepted January 14, 2011
MATHEMATICAL COMMUNICATIONS 53 Math. Coun. 6(20), 53 538. I σ -Convergence Fatih Nuray,, Hafize Gök and Uǧur Ulusu Departent of Matheatics, Afyon Kocatepe University, 03200 Afyonkarahisar, Turkey Received
More informationON THE LATTICE OF ORTHOMODULAR LOGICS
Jacek Malinowski ON THE LATTICE OF ORTHOMODULAR LOGICS Abstract The upper part of the lattice of orthomodular logics is described. In [1] and [2] Bruns and Kalmbach have described the lower part of the
More informationVariations on a theme by Weetman
Variations on a theme by Weetman A.E. Brouwer Abstract We show for many strongly regular graphs, and for all Taylor graphs except the hexagon, that locally graphs have bounded diameter. 1 Locally graphs
More informationAn Optimal Odd Unimodular Lattice in Dimension 72
An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then
More informationEquivalence between Semimartingales and Itô Processes
International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes
More information10.1 Elimination of strictly dominated strategies
Chapter 10 Elimination by Mixed Strategies The notions of dominance apply in particular to mixed extensions of finite strategic games. But we can also consider dominance of a pure strategy by a mixed strategy.
More informationGenerating all nite modular lattices of a given size
Generating all nite modular lattices of a given size Peter Jipsen and Nathan Lawless Dedicated to Brian Davey on the occasion of his 65th birthday Abstract. Modular lattices, introduced by R. Dedekind,
More informationFair semigroups. Valdis Laan. University of Tartu, Estonia. (Joint research with László Márki) 1/19
Fair semigroups Valdis Laan University of Tartu, Estonia (Joint research with László Márki) 1/19 A semigroup S is called factorisable if ( s S)( x, y S) s = xy. 2/19 A semigroup S is called factorisable
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More information