Wada s Representations of the. Pure Braid Group of High Degree
|
|
- Harold Harris
- 5 years ago
- Views:
Transcription
1 Theoretical Mathematics & Applications, vol2, no1, 2012, ISSN: (print), (online) International Scientific Press, 2012 Wada s Representations of the Pure Braid Group of High Degree Ihsan A Daakur 1 and Mohammad N Abdulrahim 2 Abstract We consider the representation obtained by composing the embeddingmapofthepurebraidgroupp n P n+k andwada srepresentation of degree n+k to get a linear representation P n GL n+k (C[t ±1 1,,t±1 n+k ]), whose composition factors are to be determined A similar work was done in a previous work in the case of the Gassner representation of P n Mathematics Subject Classification: 20F36 Keywords: pure braid group, Wada s representation 1 Introduction The braid group on n strands, denoted by B n, is defined as an abstract group with generators σ 1,σ 2,,σ n 1 and relations σ i σ j = σ j σ i, i j 2, 1 i, j n 1; σ i σ i+1 σ i = σ i+1 σ i σ i+1 for 1 i n 2 1 Department of Mathematics, Beirut Arab University, PO Box: , Beirut, Lebanon, iad101@bauedulb 2 Department of Mathematics, Beirut Arab University, PO Box: , Beirut, Lebanon, mna@bauedulb Article Info: Received : December 28, 2011 Revised : January 19, 2012 Published online : March 5, 2012
2 118 Wada s Representations of the Pure Braid Group of High Degree The pure braid group, P n, is a normal subgroup of the braid group, B n, on n strings It has many linear representations One of them is Wada s representation, which is an embedding P n Aut(F n ), the automorphism group of a free group on n generators In [1], Abdulrahim has constructed an embedding of the pure braid group P n P n+k and composed it with the Gassner representation of P n+k to get a linear representation P n GL n+k (C[t ±1 1,,t ±1 n,,t ±1 n+k ]), where the composition factors were completely determined In our work, we consider Wada s representation instead of the Gassner representation, where σ i, takes x i x i x 1 i+1 x i, x i+1 x i ; and fixes all other free generators Our main theorem is similar to that obtained in [1], where the composition factors of the representation obtained by composing the embedding map and Wada s representation are to be determined However, for the sake of our work, the embedding map P n P n+k has to be defined in a different way, where a generator of P n is mapped to another generator of P n+k, rather than to a product of generators of P n+k as in [1] 2 Preliminaries Definition 21 Let F n be a free group of rank n, with free basis x 1,,x n We define for j = 1,2,,n the free derivatives on the group ZF n by (i) x i xj = δ i,j, (ii) x 1 i = δ xj i,j x 1 i, (iii) x j (uv) = u v ɛ(v)+u u,v ZF xj xj Here δ i,j is the Kronecker symbol For simplicity, we denote x j by d j Definition 22 The pure braid group, P n, is defined as the kernel of the homomorphism B n S n, defined by σ i (i,i+1),1 i n 1 It has the following generators: A i,,j j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 σ j 1, 1 i < j n
3 I Daakur and M Abdulrahim 119 Definition 23 Wada s representation is defined as the representation of theautomorphism correspondingtothe braidgeneratorσ i, takes x i x i x 1 i+1 x i, x i+1 x i and fixes all other free generators It is easy to see that the inverse σ 1 i, takes x i x i+1, x i+1 x 1 i+1 x ix 1 i+1 ; and fixes all other generators For more details, see [3] 3 Main Results We determine the action of the automorphisms A i,j on the generators of the free group F n We then define an embedding of the pure braid group P n P n+k and compose the embedding map and Wada s representation of the pure braid group P n+k 31 Action of the automorphisms on the free group Lemma 31 As automorphisms of the free group F n, the generators, A i,j, act on the free group F n as follows: (i) A i,j (x i ) = x i x 1 x 1 (ii) A i,j (x j ) = x i x 1 (iii) A i,j (x r ) = x r (iv) A i,j (x r ) = (x i x 1 x j )x 1 r (x x 1 ) if 1 r < i or j < r n if i < r < j Proof We have that A i,,j j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 σ j 1, 1 i < j n We need to consider A i,j as left automorphisms acting on the generators of F n from the left To prove (i): σ 1 j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 σ j 1 (x i )
4 120 Wada s Representations of the Pure Braid Group of High Degree j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 (x i ) j 1 σ 1 j 2 σ 1 i+1 σ i(σ i (x i )) j 1 σ 1 j 2 σ 1 i+1 σ i(x i x 1 j 1 σ 1 j 2 σ 1 i+1 (x ix 1 i+1 x ix 1 i x i x 1 j 1 σ 1 j 2 σ 1 i+1 (x ix 1 i+1 x ix 1 j 1 σ 1 j 2 σ 1 i+2 (x ix 1 i+2 x ix 1 i+2 x i) j 1 σ 1 j 2 σ 1 i+3 (x ix 1 i+3 x ix 1 i+3 x i) j 1 σ 1 j 2 (x ix 1 j 2 x ix 1 j 2 x i) j 1 (x ix 1 j 1 x ix 1 j 1 x i) = x i x 1 x 1 To prove (ii): σ 1 j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 σ j 1 (x j ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 (x j 1 ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 3 (x j 2 ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 4 (x j 3 ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 (x i+2 ) j 1 σ 1 j 2 σ 1 i+1 σ2 i(x i+1 ) j 1 σ 1 j 2 σ 1 i+1 σ i(x i ) j 1 σ 1 j 2 σ 1 i+1 (x ix 1 j 1 σ 1 j 2 σ 1 i+2 (x ix 1 i+2 x i) j 1 σ 1 j 2 σ 1 i+3 (x ix 1 i+3 x i) j 1 σ 1 j 2 σ 1 i+4 (x ix 1 i+4 x i) j 1 σ 1 j 2 (x ix 1 j 2 x i) j 1 (x ix 1 j 1 x i) = x i x 1 To prove (iii): Since r > j, that is, the smallest possible value of r is j+1, then A i,j (x r ) = x r for j < r n Now, since r < i, that is, the greatest possible value of r is i 1, then A i,j (x r ) = x r for 1 r < i
5 I Daakur and M Abdulrahim 121 To prove (iv): Since i < r < j, the largest index of x, namely r, is j 1 and the smallest index of x, namely r, is i 1 Then σ 1 j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ j 2 σ j 1 (x r ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ r 1 σ r (x r ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ r 1 (x r x 1 r+1x r ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 σ r 2 (x r 1 x 1 r+1x r 1 ) j 1 σ 1 j 2 σ 1 i+1 σ2 iσ i+1 (x i+2 x 1 r+1x i+2 ) j 1 σ 1 j 2 σ 1 i+1 σ2 i(x i+1 x 1 r+1x i+1 ) j 1 σ 1 j 2 σ 1 i+1 σ i(x i x 1 r+1x i ) j 1 σ 1 j 2 σ 1 i+1 (x ix 1 i+1 x ix 1 r+1x i x 1 j 1 σ 1 j 2 σ 1 i+2 (x ix 1 i+2 x ix 1 r+1x i x 1 i+2 x i) j 1 σ 1 j 2 σ 1 i+3 (x ix 1 i+3 x ix 1 r+1x i x 1 i+3 x i) j 1 σ 1 j 2 σ 1 r (x i x 1 r x i x 1 r+1x i x 1 r x i ) j 1 σ 1 j 2 σ 1 r+1(x i x 1 r+1x i x r+1 x 1 r x r+1 x i x 1 r+1x i ) j 1 σ 1 j 2 σ 1 r+2(x i x 1 r+2x i x r+2 x 1 r x r+2 x i x 1 r+2x i ) j 1 σ 1 j 2 (x ix 1 j 2 x ix j 2 x 1 r x j 2 x i x 1 j 2 x i) j 1 (x ix 1 j 1 x ix j 1 x 1 r x j 1 x i x 1 j 1 x i) = x i x 1 x j x 1 r x x 1 = (x i x 1 x j )x 1 r (x x 1 ) 32 The embedding P n P n+k In [1], the embedding of the pure braid group was defined in a way that the generators A 1,j were mapped to a product of generators of P n+k and other generators A i,j to A i+k,j+k Whereas in our work, we require that the generator of P n is to be mapped to another generator of P n+k More precisely, we define the following map: Ψ : P n P n+k
6 122 Wada s Representations of the Pure Braid Group of High Degree as Ψ(A i,j ) = { A 1,j+k, i = 1 and 2 j n A i+k,j+k, 2 i < j n, where Ψ(A i,j ) is a generator of P n+k, that is an automorphism of F n+k whose action on the free generator x 1,x 2,,x n,,x n+k is defined in Lemma 31 We compose the map above with the embedding P n+k Aut(F n+k ) The image of the generators under this embedding is treated as left automorphisms of the free froup F n+k As a basis for the free group F n+k, we take the following generators: y 1 = x 1, y 2 = x k+2, y 3 = x k+3,,y n = x k+n, y n+1 = x 2, y n+2 = x 3,,y n+k = x k+1 Using the action of the automorphism, σ i, on the basis of F n+k, we have the following lemmas about the images of the generators of P n, namely Ψ(A i,j ) for 1 i < j n Lemma 32 For 1 < j n, the action of the images of the generators, A 1,j on the basis of F n+k is given by (i) Ψ(A 1,j )(y 1 ) = y 1 (y 1 j y 1 y 1 j y 1 ), (ii) Ψ(A 1,j )(y j ) = y 1 y 1 j y 1, (iii)ψ(a 1,j )(y r ) = y r for j < r n, (iv) Ψ(A 1,j )(y r ) = (y 1 y 1 j y 1 y j )yr 1 (y j y 1 y 1 j y 1 ) for 1 < r < j, (v) Ψ(A 1,j )(y n+r ) = (y 1 y 1 j y 1 y j )yn+r(y 1 j y 1 y 1 j y 1 ) for 1 r k Proof Since the image of A 1,j under Ψ is a generator of P n+k namely A 1,j+k, it suffices only to prove (v) We have that Ψ(A 1,j ) = A 1,j+k j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ j+k 1 To prove (v): Let y n+r = x r+1, for 1 r k Then 1 r < j +k 1 and we have that σ 1 j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ j+k 1 (x r+1 ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ r σ r+1 (x r+1 )
7 I Daakur and M Abdulrahim 123 j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ r (x r+1 x 1 r+2x r+1 ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ r 1 (x r x 1 r+2x r ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1σ 2 2 σ 3 σ k σ k+1 σ k+2 σ r 2 (x r 1 x 1 r+2x r 1 ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ1(x 2 2 x 1 r+2x 2 ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 σ 1 (x 1 x 1 r+2x 1 ) j+k 1 σ 1 j+k 2 σ 1 3 σ2 1 (x 1 x 1 2 x 1 x 1 r+2x 1 x 1 2 x 1 ) j+k 1 σ 1 j+k 2 σ 1 3 (x 1 x 1 3 x 1 x 1 r+2x 1 x 1 3 x 1 ) j+k 1 σ 1 j+k 2 σ 1 4 (x 1 x 1 4 x 1 x 1 r+2x 1 x 1 4 x 1 ) j+k 1 σ 1 j+k 2 σ 1 r+2σr+1(x 1 1 x 1 r+1x 1 x 1 r+2x 1 x 1 r+1x 1 ) j+k 1 σ 1 j+k 2 σ 1 r+2(x 1 x 1 r+2x 1 x r+2 x 1 r+1x r+2 x 1 x 1 r+2x 1 ) j+k 1 σ 1 j+k 2 σ 1 r+3(x 1 x 1 r+3x 1 x r+3 x 1 r+1x r+3 x 1 x 1 r+3x 1 ) j+k 1 (x 1x 1 j+k 1 x 1x j+k 1 x 1 r+1x j+k 1 x 1 x 1 j+k 1 x 1) = x 1 x 1 j+k x 1x j+k x 1 r+1x j+k x 1 x 1 j+k x 1 = (y 1 y 1 j y 1 y j )y 1 n+r(y j y 1 y 1 j y 1 ) For 1 < i < j n, we have that Ψ(A i,j ) = A i+k,j+k Acting on the generators of F n+k, namely, x 1,,x n+k subject to the rules stated in Lemma 31, we easily verify the following lemma Lemma 33 For 1 < i < j n, the action of the images of the generators A i,j on the basis of F n+k is as follows: (i) Ψ(A i,j )(y i ) = y i (y 1 j y i y 1 j y i ) (ii) Ψ(A i,j )(y j ) = y i y 1 j y i (iii) Ψ(A i,j )(y r ) = y r j < r n (iv)ψ(a i,j )(y r ) = (y i y 1 j y i y j )yr 1 (y j y i y 1 j y i ) (v) Ψ(A i,j )(y n+r ) = y n+r for i < r < j for 1 r < i or for 1 r k Proof As in Lemma 32, we only need to prove (v): Let y n+r = x r+1, for 1 r k Since r k, that is, the greatest possible value of r + 1 is k+1, it follows that Ψ(A i,j )(y n+r ) = Ψ(A i,j )(x r+1 ) = A i+k,j+k (x r+1 ) = x r+1 = y n+r
8 124 Wada s Representations of the Pure Braid Group of High Degree Let φbe a homomorphism from F n+k to (C ) n+k defined by φ(y i ) = t i, for 1 i n + k Let D i = φ y i Our objective now is to determine the Jacobian matrix of the image of the generator A i,j under the map, namely the automorphism Ψ(A i,j ) on the free group F n+k defined in Lemma 32 and Lemma 33, so that we can find the linear representation obtained by composing the map P n P n+k with Wada s representation By intuition, the order of the generators of F n+k is: y 1,,y n,y n+1,,y n+k Consider Ψ(A i,j ), the image of A i,j under the map P n P n+k, and call it A i,j for simplicity Then we define the jacobian matrix as follows: J(A i,j ) = D 1 (A i,j (y 1 )) D n+k (A i,j (y 1 )) D 1 (A i,j (y n+k )) D n+k (A i,j (y n+k )) 119] The construction used here is the Magnus representation of P n+k [2, p115- We now prove our main theorem Theorem 34 By composing the embedding P n P n+k with Wada s representation of P n+k, we get a linear representation of degree n+k whose one of the composition factors is isomorphic to Wada s representation of P n and the other is a diagonal representation The matrix that corresponds to the image of A i,j has the following form: [ γ(a i,j ) 0 where γ(a i,j ) is the image of A i,j under Wada s representation of degree n and M k is a diagonal representation whose diagonal entries are all ones in the case 1 < i n and t 2 1t 1 n+r when i = 1 and 1 r k Proof From Lemma 32 and Lemma 33, we easily verify that statements (i), (ii), (iii) and (iv) coincidewith thedefinitionoftheimage of A i,j underthe M k ],
9 I Daakur and M Abdulrahim 125 Wada s representation of P n specified by the basis {y 1,,y n } (See Lemma 31) Furthermore, statement (v) in Lemma 32 asserts that Ψ(A 1,j )(y n+r ) = (y 1 y 1 j y 1 y j )y 1 n+r(y j y 1 y 1 j y 1 ), for any 1 r k, which in turn implies that D n+r (Ψ(A 1,j )(y n+r )) = t 2 1t 1 n+r Statement (v) in Lemma 33 asserts that for 1 < i < j n, we have that Ψ(A i,j )(y n+r ) = y n+r for 1 r k, which implies that This completes the proof D n+r (Ψ(A i,j )(y n+r )) = 1 4 Conclusion In our work, we have completely determined the composition factors of the representation obtained by composing the embedding map P n P n+k and Wada s representation of the pure braid group P n+k References [1] MN Abdulrahim, On embeddings of pure braid groups P n P n+k, Int J Appl Math, 16(1), (2004), 1-12 [2] JS Birman, Braids, Links and Mapping Class Groups, Annals of Mathematical Studies, vol 82, Princeton University Press, New Jersey, 1975 [3] M Wada, Group Invaraints of Links, Topolgy, 31(1), (1992),
Epimorphisms 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 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 informationAlgebra 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 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 informationDouble Ore Extensions versus Iterated Ore Extensions
Double Ore Extensions versus Iterated Ore Extensions Paula A. A. B. Carvalho, Samuel A. Lopes and Jerzy Matczuk Departamento de Matemática Pura Faculdade de Ciências da Universidade do Porto R.Campo Alegre
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 informationSome Bounds for the Singular Values of Matrices
Applied Mathematical Sciences, Vol., 007, no. 49, 443-449 Some Bounds for the Singular Values of Matrices Ramazan Turkmen and Haci Civciv Department of Mathematics, Faculty of Art and Science Selcuk University,
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 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 informationProjective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle
Projective Lattices with applications to isotope maps and databases Ralph Freese CLA 2013. La Rochelle Ralph Freese () Projective Lattices Oct 2013 1 / 17 Projective Lattices A lattice L is projective
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 informationTranslates of (Anti) Fuzzy Submodules
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 5, Issue 2 (December 2012), PP. 27-31 P.K. Sharma Post Graduate Department of Mathematics,
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 informationPermutation Factorizations and Prime Parking Functions
Permutation Factorizations and Prime Parking Functions Amarpreet Rattan Department of Combinatorics and Optimization University of Waterloo Waterloo, ON, Canada N2L 3G1 arattan@math.uwaterloo.ca June 10,
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 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 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 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 informationCS 4110 Programming Languages & Logics. Lecture 2 Introduction to Semantics
CS 4110 Programming Languages & Logics Lecture 2 Introduction to Semantics 29 August 2012 Announcements 2 Wednesday Lecture Moved to Thurston 203 Foster Office Hours Today 11a-12pm in Gates 432 Mota Office
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 informationA Property Equivalent to n-permutability for Infinite Groups
Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar
More informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationValue of Flexibility in Managing R&D Projects Revisited
Value of Flexibility in Managing R&D Projects Revisited Leonardo P. Santiago & Pirooz Vakili November 2004 Abstract In this paper we consider the question of whether an increase in uncertainty increases
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 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 informationOn the Pentagon Relations of Valued Quivers
International Journal of Algebra, Vol. 9, 2015, no. 8, 355-369 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2015.5745 On the Pentagon Relations of Valued Quivers Yousuf A. Alkhezi Public
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 informationV. Fields and Galois Theory
Math 201C - Alebra Erin Pearse V.2. The Fundamental Theorem. V. Fields and Galois Theory 4. What is the Galois roup of F = Q( 2, 3, 5) over Q? Since F is enerated over Q by {1, 2, 3, 5}, we need to determine
More informationThe Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)
The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract) Patrick Bindjeme 1 James Allen Fill 1 1 Department of Applied Mathematics Statistics,
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 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 informationInversion Formulae on Permutations Avoiding 321
Inversion Formulae on Permutations Avoiding 31 Pingge Chen College of Mathematics and Econometrics Hunan University Changsha, P. R. China. chenpingge@hnu.edu.cn Suijie Wang College of Mathematics and Econometrics
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Chapter 6: Mixed Strategies and Mixed Strategy Nash Equilibrium
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 informationSimplicity of associative and non-associative Ore extensions
Simplicity of associative and non-associative Ore extensions Johan Richter Mälardalen University The non-associative part is joint work by Patrik Nystedt, Johan Öinert and myself. Ore extensions, motivation
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 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 informationLevel by Level Inequivalence, Strong Compactness, and GCH
Level by Level Inequivalence, Strong Compactness, and GCH Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationSquare-Root Measurement for Ternary Coherent State Signal
ISSN 86-657 Square-Root Measurement for Ternary Coherent State Signal Kentaro Kato Quantum ICT Research Institute, Tamagawa University 6-- Tamagawa-gakuen, Machida, Tokyo 9-86, Japan Tamagawa University
More informationSolutions of Bimatrix Coalitional Games
Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8435-8441 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410880 Solutions of Bimatrix Coalitional Games Xeniya Grigorieva St.Petersburg
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 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 informationHyperidentities in (xx)y xy Graph Algebras of Type (2,0)
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool
More informationMath 546 Homework Problems. Due Wednesday, January 25. This homework has two types of problems.
Math 546 Homework 1 Due Wednesday, January 25. This homework has two types of problems. 546 Problems. All students (students enrolled in 546 and 701I) are required to turn these in. 701I Problems. Only
More informationValuation of performance-dependent options in a Black- Scholes framework
Valuation of performance-dependent options in a Black- Scholes framework Thomas Gerstner, Markus Holtz Institut für Numerische Simulation, Universität Bonn, Germany Ralf Korn Fachbereich Mathematik, TU
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 informationBINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES
Journal of Science and Arts Year 17, No. 1(38), pp. 69-80, 2017 ORIGINAL PAPER BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES CAN KIZILATEŞ 1, NAIM TUGLU 2, BAYRAM ÇEKİM 2
More informationINFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION
INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA Phone:(808)956-4655 Abstract. We introduce a
More informationAccounting Conservatism, Market Liquidity and Informativeness of Asset Price: Implications on Mark to Market Accounting
Journal of Applied Finance & Banking, vol.3, no.1, 2013, 177-190 ISSN: 1792-6580 (print version), 1792-6599 (online) Scienpress Ltd Accounting Conservatism, Market Liquidity and Informativeness of Asset
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 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 informationMartingales. by D. Cox December 2, 2009
Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a
More informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More informationarxiv: v1 [math.co] 6 Oct 2009
THE DESCENT STATISTIC OVER 123-AVOIDING PERMUTATIONS arxiv:0910.0963v1 [math.co] 6 Oct 2009 MARILENA BARNABEI, FLAVIO BONETTI, AND MATTEO SILIMBANI Abstract We exploit Krattenthaler s bijection between
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 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 informationTHE OPTIMAL HEDGE RATIO FOR UNCERTAIN MULTI-FOREIGN CURRENCY CASH FLOW
Vol. 17 No. 2 Journal of Systems Science and Complexity Apr., 2004 THE OPTIMAL HEDGE RATIO FOR UNCERTAIN MULTI-FOREIGN CURRENCY CASH FLOW YANG Ming LI Chulin (Department of Mathematics, Huazhong University
More informationRUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS
RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS PETER JIPSEN, ALEXANDER PINUS, HENRY ROSE Abstract. The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised
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 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 information3.4 Copula approach for modeling default dependency. Two aspects of modeling the default times of several obligors
3.4 Copula approach for modeling default dependency Two aspects of modeling the default times of several obligors 1. Default dynamics of a single obligor. 2. Model the dependence structure of defaults
More informationWEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS
WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS BYEONG-KWEON OH Abstract Let L, N and M be positive definite integral Z-lattices In this paper, we show some relation between the
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationSecant Varieties, Symbolic Powers, Statistical Models
Secant Varieties, Symbolic Powers, Statistical Models Seth Sullivant North Carolina State University November 19, 2012 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, 2012 1 / 27 Joins and Secant
More informationRatio Mathematica 20, Gamma Modules. R. Ameri, R. Sadeghi. Department of Mathematics, Faculty of Basic Science
Gamma Modules R. Ameri, R. Sadeghi Department of Mathematics, Faculty of Basic Science University of Mazandaran, Babolsar, Iran e-mail: ameri@umz.ac.ir Abstract Let R be a Γ-ring. We introduce the notion
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 informationThe Factor Sets of Gr-Categories of the Type (Π,A)
International Journal of Algebra, Vol. 4, 2010, no. 14, 655-668 The Factor Sets of Gr-Categories of the Type (Π,A) Nguyen Tien Quang Department of Mathematics, Hanoi National University of Education 136
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 informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SET THEORY MTHE6003B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Notes are not permitted
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 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 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 informationSupplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4.
Supplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4. If the reader will recall, we have the following problem-specific
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 informationWeak compactness in Banach lattices
Weak compactness in Banach lattices Pedro Tradacete Universidad Carlos III de Madrid Based on joint works with A. Avilés, A. J. Guirao, S. Lajara, J. López-Abad, J. Rodríguez Positivity IX 20 July 2017,
More informationInfluence of Real Interest Rate Volatilities on Long-term Asset Allocation
200 2 Ó Ó 4 4 Dec., 200 OR Transactions Vol.4 No.4 Influence of Real Interest Rate Volatilities on Long-term Asset Allocation Xie Yao Liang Zhi An 2 Abstract For one-period investors, fixed income securities
More informationPortfolio Choice. := δi j, the basis is orthonormal. Expressed in terms of the natural basis, x = j. x j x j,
Portfolio Choice Let us model portfolio choice formally in Euclidean space. There are n assets, and the portfolio space X = R n. A vector x X is a portfolio. Even though we like to see a vector as coordinate-free,
More informationarxiv: v5 [quant-ph] 16 Oct 2008
Violation of Equalities in Bipartite Qutrits Systems Hossein Movahhedian Department of Physics, Shahrood University of Technology, Seventh Tir Square, Shahrood, Iran We have recently shown that for the
More informationAsymptotic methods in risk management. Advances in Financial Mathematics
Asymptotic methods in risk management Peter Tankov Based on joint work with A. Gulisashvili Advances in Financial Mathematics Paris, January 7 10, 2014 Peter Tankov (Université Paris Diderot) Asymptotic
More informationBest-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015
Best-Reply Sets Jonathan Weinstein Washington University in St. Louis This version: May 2015 Introduction The best-reply correspondence of a game the mapping from beliefs over one s opponents actions to
More informationSemantics with Applications 2b. Structural Operational Semantics
Semantics with Applications 2b. Structural Operational Semantics Hanne Riis Nielson, Flemming Nielson (thanks to Henrik Pilegaard) [SwA] Hanne Riis Nielson, Flemming Nielson Semantics with Applications:
More informationarxiv: v1 [q-fin.mf] 16 Jan 2019
arxiv:1901.05113v1 [q-fin.mf] 16 Jan 2019 Instantaneous Arbitrage and the CAPM Lars Tyge Nielsen Department of Mathematics Columbia University January 2019 Abstract This paper studies the concept of instantaneous
More informationDENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE
DENSITY OF PERIODIC GEODESICS IN THE UNIT TANGENT BUNDLE OF A COMPACT HYPERBOLIC SURFACE Marcos Salvai FaMAF, Ciudad Universitaria, 5000 Córdoba, Argentina. e-mail: salvai@mate.uncor.edu Abstract Let S
More informationControlling the distance to the Kemeny consensus without computing it
Controlling the distance to the Kemeny consensus without computing it Yunlong Jiao Anna Korba Eric Sibony Mines ParisTech, LTCI, Telecom ParisTech/CNRS ICML 2016 Outline Ranking aggregation and Kemeny
More informationThe Asymptotic Shapley Value for a Simple Market Game
The Asymptotic Shapley Value for a Simple Market Game Thomas M. Liggett, Steven A. Lippman, and Richard P. Rumelt Mathematics Department, UCLA The UCLA Anderson School of Management The UCLA Anderson School
More informationCartesian Product of Two S-Valued Graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 347-355 International Research Publication House http://www.irphouse.com Cartesian Product of
More informationGame-Theoretic Risk Analysis in Decision-Theoretic Rough Sets
Game-Theoretic Risk Analysis in Decision-Theoretic Rough Sets Joseph P. Herbert JingTao Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: [herbertj,jtyao]@cs.uregina.ca
More informationOn Packing Densities of Set Partitions
On Packing Densities of Set Partitions arxiv:1301.1303v1 [math.co] 7 Jan 2013 Adam M.Goyt 1 Department of Mathematics Minnesota State University Moorhead Moorhead, MN 56563, USA goytadam@mnstate.edu Lara
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 informationCompositional Models in Valuation-Based Systems
Appeared in: Belief Functions: Theory and Applications, T. Denoeux and M.-H. Masson (eds.), Advances in Intelligent and Soft Computing 164, 2012, pp. 221--228, Springer-Verlag, Berlin. Compositional Models
More informationConditional Square Functions and Dyadic Perturbations of the Sine-Cosine decomposition for Hardy Martingales
Conditional Square Functions and Dyadic Perturbations of the Sine-Cosine decomposition for Hardy Martingales arxiv:1611.02653v1 [math.fa] 8 Nov 2016 Paul F. X. Müller October 16, 2016 Abstract We prove
More informationSPLITTING FIELDS KEITH CONRAD
SPLITTING FIELDS EITH CONRAD 1. Introuction When is a fiel an f(t ) [T ] is nonconstant, there is a fiel extension / in which f(t ) picks up a root, say α. Then f(t ) = (T α)g(t ) where g(t ) [T ] an eg
More informationSome derivative free quadratic and cubic convergence iterative formulas for solving nonlinear equations
Volume 29, N. 1, pp. 19 30, 2010 Copyright 2010 SBMAC ISSN 0101-8205 www.scielo.br/cam Some derivative free quadratic and cubic convergence iterative formulas for solving nonlinear equations MEHDI DEHGHAN*
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 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 informationHomomorphism and Cartesian Product of. Fuzzy PS Algebras
Applied Mathematical Sciences, Vol. 8, 2014, no. 67, 3321-3330 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.44265 Homomorphism and Cartesian Product of Fuzzy PS Algebras T. Priya Department
More informationTHE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE
THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE GÜNTER ROTE Abstract. A salesperson wants to visit each of n objects that move on a line at given constant speeds in the shortest possible time,
More informationκ-bounded Exponential-Logarithmic Power Series Fields
κ-bounded Exponential-Logarithmic Power Series Fields Salma Kuhlmann and Saharon Shelah 17. 06. 2004 Abstract In [K K S] it was shown that fields of generalized power series cannot admit an exponential
More informationGame Theory: Normal Form Games
Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.
More information