Binary codes from graphs on triples and permutation decoding
|
|
- Dinah Cole
- 5 years ago
- Views:
Transcription
1 Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics ad Iformatio Techology Uiversity of Natal-Pietermaritzburg Pietermaritzburg 3209 South Africa April Abstract We show that permutatio decodig ca be used ad give explicit PD-sets i the symmetric group for some of the biary codes obtaied from the adjacecy matrices of the graphs o ` 3 vertices for 7 with adjacecy defied by the vertices as 3-sets beig adjacet if they have zero oe or two elemets i commo respectively. 1 Itroductio MacWilliams [8] itroduced a algorithm for permutatio decodig employig it mostly for cyclic codes ad the Golay codes. It ivolves choosig appropriate iformatio sets for the code ad fidig a set of automorphisms that satisfies particular coditios (see below such a set beig called a PD-set. This work was supported by the DoD Multidiscipliary Uiversity Research Iitiative (MURI program admiistered by the Office of Naval Research uder Grat N ad NSF grat # Support of NRF ad the Uiversity of Natal (URF ackowledged. Post-graduate scholarship of DAAD (Germay ad the Miistry of Petroleum (Agola ackowledged. 1
2 2 BACKGROUND AND TERMINOLOGY 2 Appropriate iformatio sets ad PD-sets for ifiite classes of codes defied by some strogly regular graphs with the symmetric group as a automorphism group were foud i [6 7]. I [5] we examied the biary codes from a similar class of graphs ot strogly regular but with the symmetric group as automorphism group ad obtaied the dimesio the miimum weight ad some classes of miimum words for these codes: see Sectio 3 Result 1 for a statemet of the mai theorem obtaied. I that paper we aouced that we would iclude the establishmet of PD-sets for the iterestig members of this set of codes i a further paper ad this curret paper addresses that issue. Here we prove the followig: Theorem 1 Let Ω be a set of size where 7 ad is odd. Let P = Ω {3} the set of subsets of Ω of size 3 be the vertex set of the graph A 2 ( with adjacecy defied by two vertices (as 3-sets beig adjacet if the 3-sets meet i two elemets. Let C 2 ( deote the code formed from the row spa over F 2 of a adjacecy matrix for A 2 (. The dual C 2 ( is a [ ( ( ]2 code with I = {{i j } 1 i < j < } {{ 3 2 1}} \ {{ 2 1 }} as iformatio set. The C 2 ( has a PD-set i S give by the followig elemets of S i their atural actio o triples of elemets of Ω = { }: S = {( i( 1 j( 2 k 1 i 1 j 1 1 k 2} where (i i deotes the idetity elemet of S. Note that the size of the PD-set is of the order of 3 as is the legth of the code. The proof of the theorem is give i Sectio 3. I Sectio 4 we metio oe of the other dual codes ad give a PD-set. 2 Backgroud ad termiology Our otatio for desigs ad codes will be stadard ad as i [1]. A icidece structure D = (P B I with poit set P block set B ad icidece I is a t-(v k λ desig if P = v every block B B is icidet with precisely k poits ad every t distict poits are together icidet with precisely λ blocks. The desig is symmetric if it has the same umber of poits ad blocks. The code C F of the desig D over the fiite field F is the space spaed by the icidece vectors of the blocks over F. If the poit set of D is deoted by P ad the block set by B ad if Q is ay subset of P the
3 2 BACKGROUND AND TERMINOLOGY 3 we will deote the icidece vector of Q by v Q. Thus C F = v B B B ad is a subspace of V = F P the full vector space of fuctios from P to F. For ay vector w V the coordiate of w at the poit P P is deoted by w(p. All our codes here will be liear codes i.e. subspaces of the ambiet vector space. If a code C over a field of order q is of legth dimesio k ad miimum weight d the we write [ k d] q to show this iformatio. A geerator matrix for the code is a k matrix made up of a basis for C. The dual or orthogoal code C is the orthogoal uder the stadard ier product ( i.e. C = {v F (v c = 0 for all c C}. A check (or parity-check matrix for C is a geerator matrix H for C. If c is a codeword the the support of c is the set of o-zero coordiate positios of c. A costat vector is oe for which all the o-zero etries are equal to 1. The all-oe vector will be deoted by j ad is the costat vector of weight the legth of the code. Two liear codes of the same legth ad over the same field are equivalet if each ca be obtaied from the other by permutig the coordiate positios ad multiplyig each coordiate positio by a o-zero field elemet. They are isomorphic if they ca be obtaied from oe aother by permutig the coordiate positios. A automorphism of a code C is a isomorphism from C to C. The automorphism group will be deoted by Aut(C. Termiology for graphs is stadard: the graphs Γ = (V E with vertex set V ad edge set E are udirected ad the valecy of a vertex is the umber of edges cotaiig the vertex. A graph is regular if all the vertices have the same valecy. Ay code is isomorphic to a code with geerator matrix i so-called stadard form i.e. the form [I k A]; a check matrix the is give by [ A T I k ]. The first k coordiates are the iformatio symbols ad the last k coordiates are the check symbols. Permutatio decodig was first developed by MacWilliams [8]. It ivolves fidig a set of automorphisms of a code such that the set satisfies certai coditios that allow it to be used for decodig; such a set is called a PD-set. The method is described fully i MacWilliams ad Sloae [9 Chapter 15] ad Huffma [3 Sectio 8]. A PD-set for a t-error-correctig code C is a set S of automorphisms of C which is such that the every possible error vector of weight s t ca be moved by some member of S to aother vector where the s o-zero etries have bee moved out of the iformatio positios. I other words every t-set of coordiate positios is moved by at least oe member of S to a t-set cosistig oly of checkpositio coordiates. That such a set will fully use the error-correctio potetial of the code follows easily ad is proved i Huffma [3 Theorem 8.1]. Of course such a set might ot exist at all ad existece is ot ivariat uder equivalece or isomorphism of codes. Furthermore there
4 3 THE CODES AND PD-SETS 4 is a boud o the miimum size that the set S may have: see Gordo [2] or [3]. The algorithm for permutatio decodig the is as follows: we have a t-error-correctig [ k d] q code C with check matrix H i stadard form. Thus the geerator matrix G for C that is used for ecodig has I k as the first k colums ad hece the first k coordiate positios correspod to the iformatio symbols. So G = [I k A] ad H = [A T I k ] for some A ad ay vector v of legth k is ecoded as vg. Suppose x is set ad y is received ad at most t errors occur. Let S = {g 1... g s } be the PD-set. Compute the sydromes H(yg i T for i = 1... s util a i is foud such that the weight of this vector is t or less. Now look at the iformatio symbols i yg i ad obtai the codeword c that has these iformatio symbols. Decode y as cg 1 i. Note that this is valid sice permutatios of the coordiate positios correspod to liear trasformatios of F so that if y = x + e where x C the yg = xg + eg for ay g S ad if g Aut(C the xg C. 3 The codes ad PD-sets We describe first briefly how the codes are defied from graphs ad desigs. Let be ay iteger ad Ω a set of size ; to avoid degeerate cases we take 7. Takig the set Ω {3} to be the set of all 3-elemet subsets of Ω we defie three o-trivial udirected graphs with vertex set P = Ω {3} ad deote these graphs by A i ( where i = The edges of the graph A i ( are defied by the rule that two vertices are adjacet i A i ( if as 3-elemet subsets they have exactly i elemets of Ω i commo. For each i = we defie from A i ( a 1-desig D i ( o the poit set P by defiig for each poit P = {a b c} P a block {a b c} i by {a b c} i = {{x y z} {x y z} {a b c} = i }. Deote by B i ( the block set of D i ( so that each of these is a symmetric 1-desig o ( 3 poits with block size respectively: ( 3 3 for D0 (; 3 ( 3 2 for D1 (; 3( 3 for D 2 (.
5 3 THE CODES AND PD-SETS 5 The icidece vector of the block {a b c} i for i = respectively is the v {abc} 0 = v {xyz} ; (1 xyz Ω v {abc} 1 = v {axy} + v {bxy} + v {cxy} ; (2 xy Ω xy Ω xy Ω v {abc} 2 = v {abx} + v {acx} + v {bcx} (3 x Ω x Ω x Ω where Ω = Ω \ {a b c} ad as usual with the otatio from [1] the icidece vector of the subset X P is deoted by v X. Sice our poits here are actually triples of elemets from Ω we emphasize that we are usig the otatio v {abc} istead of the more cumbersome v {{abc}} as metioed i [1]. I [5] we examied the biary codes of these desigs i.e. deotig the block set of D i ( by B i ( we took C i ( = C 2 (D i ( = v b b B i ( where the spa is take over F 2. Alteratively this ca be regarded as the row spa over F 2 of a adjacecy matrix of the relevat graph. We obtaied the followig: Result 1 Let Ω be a set of size where 7. Let P = Ω {3} the set of subsets of Ω of size 3 be the vertex set of the three graphs A i ( for i = with adjacecy defied by two vertices (as 3-sets beig adjacet if the 3-sets meet i zero oe or two elemets respectively. Let C i ( deote the code formed from the row spa over F 2 of a adjacecy matrix for A i (. The 1. 0 (mod 4: (a C 2 ( = F P 2 ; (b C 0 ( = C 1 ( is [ ( ( 3 3 4]2 ad C 0 ( is [ ( ( ]2 ; 2. 2 (mod 4: C i ( = F P 2 for i = 0 1 2; 3. 1 (mod 4: (a C 0 ( = C 1 ( C 2 (; (b C 0 ( is [ ( ( 3 ( 3 2 8]2 ad C 0 ( is [ ( ( 3 2 2]2 ; C 1 (9 is [ ] 2 ad C 1 (9 is [ ] 2 ; C 1 ( is [ ( ( ]2 ad C 1 ( is [ ( 3 1 ( 2( 3] 2 for > 9; C 2 ( is [ ( ( ]2 ad C 2 ( is [ ( ( ]2 ;
6 3 THE CODES AND PD-SETS (mod 4: (a C 1 ( = v P + j P P is [ ( ( ]2 ; (b C 0 ( = C 2 ( is [ ( ( ]2 ad C 2 ( is [ ( ( ] 2 ; For all 7i = C i ( C i ( = {0} ad the automorphism groups of these codes are S or S ( 3. Notice that the code C 2 ( for odd is always [ ( ( ]2 ad furthermore iformatio sets are give i [5]. We ow prove the theorem: Proof of Theorem 1: That the iformatio symbols ca be take as give above follows from Propositio 1 of [5] where we have replaced the poit { 2 1 } i the iformatio set by { 3 2 1} i order to be able to costruct a PD-set. Let I deote the iformatio positios ad C the check positios. Thus I = {{i j } 1 i < j < } {{ 3 2 1}} \ {{ 2 1 }}. Let P = { 3 2 1} I ad Q = { 2 1 } C. Notice that the code will correct t = 3 2 errors. Take a set T of t poits of P ad let T = {abc} T {a b c}. We eed to exhibit a elemet σ S such that T σ C. For this we eed to cosider the differet types of compositio of T so the proof goes through a umber of cases. Notice that if T C the the idetity automorphism which is i S will do. Thus suppose T C. Let z i deote the umber of elemets i Ω that occur i times i T. The t i=0 z i = ad t i=0 iz i = 3t. Thus t (2i 3z i + 9 = 3z 0 + z 1. (4 i=2 Case (I: T I. The at least t 1 members of T cotai. (i P T : the T 2t + 1 = 2 so there are at least two distict elemets a ad b i Ω ot equal to that are ot i T. If a 3 the σ = ( a will satisfy T σ C. If {a b} = { 2 1} the agai ( a will do. (ii P T : the T 2(t = 1 so there is at least oe elemet a Ω such that a T. Clearly a 4. If T = 1 the appear oly i P ad i o other elemet of T. Thus ( 3 will do. If T < 1 the there are at least two elemets a b T with a b 4. The T ( a( 1 b C.
7 3 THE CODES AND PD-SETS 7 Case (II: suppose T meets both I ad C o-trivially. (i Suppose first that z 0 0. The if a Ω a ad a T the traspositio τ = ( a will trasform T ito T τ which will ot cotai so that if we fid a elemet σ to take T τ ito C where σ S but fixes the τσ S will map T ito C. So assume that is abset from T. The P T ad the umber of poits of the form {i 2 3} with i 1 is 4 = 2t 1 so there is a elemet b 4 such that {b 2 3} T. The T ( a( 1 b C. (ii Now suppose that T = Ω ad thus z 0 = 0 ad z 1 9 from Equatio (4. For a Ω let x(a deote the umber of times a appears i poits i T. So 1 x(a t for each a Ω ad 3t = i=1 x(i = t i=1 iz i. For ay a Ω x(a = 3t b a x(b 3t ( 1 = t 2 ad so z i = 0 for i t 1. We will ow show that we ca fid a poit {a b c} T such that x(a = x(b = 1 a b 4 ad c. Suppose x( = m ad that 1 < m t 2. The 3t = z 1 + m + x(i z 1 + m + 2( 1 z 1 x(i 2i which simplifies to z 1 t+4+m. If m = 1 the this iequality still applies if we take z 1 to be the umber of elemets with x(a = 1 excludig. Suppose that as may pairs with x(a = 1 as possible occur as part of a triple with i T. This uses 2m elemets leavig z 1 2m t + 4 m elemets with x(a = 1 (always excludig from the cout. We wat to exclude which still leaves at least z 1 2m 3 t m+1 elemets. The umber of poits of T available is t m so we must have at least oe poit X = {a b c} with two elemets a ad b with x(a = x(b = 1 a b 4 ad c. Fially we show how this poit X = {a b c} ca be used to defie group elemets that will map T ito C. We eed to look at the various possibilities for c. 1. c 4: the σ = ( a( 1 b( 2 c will satisfy T σ C sice {d e }σ C {a b c}σ = { 1 2} C ad { 3 2 1}σ 1 = {b c 3} T sice x(b = 1 ad a c = 1: the σ = ( a(b 2 will work as above otig that { 3 2 1}σ 1 = {b 1 3} T sice x(b = 1 ad a c = 2: the σ = ( a(b 1 will work as i the previous case.
8 4 CONCLUSION 8 4. c = 3: the {a b c} = {a b 3} ad take σ = ( a(b 1( 2 3. The {a b c}σ = { 1 2} C ad { 3 2 1}σ 1 = {b 2 3} T sice x(b = 1 ad a 2. We have show that every t-tuple ad hece every s-tuple for s t ca be moved by a elemet of S ito the error positios. Thus S is a PD-set for C 2 (. 4 Coclusio Note: 1. We expect that a similar sort of costructio ca be made for PD-sets for the other codes from these graphs but oe requires suitable iformatio sets. I particular takig the code C 0 ( for 1 (mod 4 ad 9 we have a [ ( ( 3 2 2]2 code that will correct 3 2 errors. From Lemma 10 of [5] we ca take as the ( 2 iformatio positios the poits {i j } for 1 i j 1 {i 2 1} for 1 i 3 ad two extra poits: { 4 3 1} ad { 4 3 2}. To costruct a PD-set we eed to switch oe of these poits with a poit from the check positios ad it is easy to verify that the followig will form a iformatio set: if I 1 = {{i j } 1 i < j 1} \ {{ 2 1 }}; I 2 = {{i 2 1} 1 i 3}; I 3 = {{ 4 3 2} { 4 3 1} { 5 4 3}} the I = I 1 I 2 I 3 is a iformatio set for C 0 ( for 1 (mod 4 ad 9. The set {( i( 1 j( 2 k( 3 l 1 i 1 j 1 1 k 2 1 l 3} where (i i deotes the idetity elemet of S ca be show to be a PD-set for the code the proof followig the lies of the proof for the code we have give but havig more cases to be dealt with separately. 2. The existece of a PD-set for a code is ot ivariat uder equivalece ad part of the problem of fidig PD-sets is to fid suitable iformatio sets: for example i the theorem the poits {1 2 } {1 3 }... { 2 1 } ca be take as iformatio symbols but if they are the code will ot have a PD-set to correct all the allowed errors sice for = 9 the [ ] 2 code corrects t = 3 errors but there is o elemet i S 9 that move the three poits {1 2 9} {3 4 5} {6 7 8}
9 REFERENCES 9 ito the check positios. However if {7 8 9} is placed i the check positios ad {6 7 8} i the iformatio positios the it ca be doe: i this example (6 9 will do it. 3. A boud foud i Gordo [2] (ad quoted ad derived i Huffma [3] for the smallest size a PD-set ca be whe compared with the order of the group of the code shows that for some well-kow codes from geometries PD-sets will ot exist beyod a certai code legth: see [4] for details. Refereces [1] E. F. Assmus Jr. ad J. D. Key. Desigs ad their Codes. Cambridge: Cambridge Uiversity Press Cambridge Tracts i Mathematics Vol. 103 (Secod pritig with correctios [2] D. M. Gordo. Miimal permutatio sets for decodig the biary Golay codes. IEEE Tras. Iform. Theory 28: [3] W. Cary Huffma. Codes ad groups. I V. S. Pless ad W. C. Huffma editors Hadbook of Codig Theory pages Amsterdam: Elsevier Volume 2 Part 2 Chapter 17. [4] J. D. Key T. P. McDoough ad V. C. Mavro. Partial permutatio decodig of codes from fiite plaes. To appear: Europea J. Combi. [5] J. D. Key J. Moori ad B. G. Rodrigues. Biary codes from graphs o triples. Discrete Math. To appear. [6] J. D. Key J. Moori ad B. G. Rodrigues. Permutatio decodig for biary codes from triagular graphs. Europea J. Combi. 25: [7] J. D. Key ad P. Seevirate. Permutatio decodig of biary codes from lattice graphs. Discrete Math. To appear. [8] F. J. MacWilliams. Permutatio decodig of systematic codes. Bell System Tech. J. 43: [9] F. J. MacWilliams ad N. J. A. Sloae. The Theory of Error-Correctig Codes. Amsterdam: North-Hollad 1983.
NEW SELF-DUAL [54, 27, 10] CODES EXTENDED FROM [52, 26, 10] CODES 1. v (denoted by wt( v ) ) is the number
NEW SELF-DUAL [54, 7, 10] CODES EXTENDED FROM [5, 6, 10] CODES 1 Nikolay I. Yakov ABSTRACT: Usig [5, 6, 10] biary self-dual codes, possesig a automorphism of order 3, we costruct ew [54, 7, 10] biary self-dual
More informationPermutation decoding for the binary codes from triangular graphs
Permutation decoding for the binary codes from triangular graphs J. D. Key J. Moori B. G. Rodrigues August 6, 2003 Abstract By finding explicit PD-sets we show that permutation decoding can be used for
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationA Note on Matrix Rigidity
A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationLecture 1: Basic problems of coding theory
Lecture 1: Basic problems of codig theory Error-Correctig Codes (Sprig 016) Rutgers Uiversity Swastik Kopparty Scribes: Abhishek Bhrushudi & Aditya Potukuchi Admiistrivia was discussed at the begiig of
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationAN INTRODUCTION TO SPECTRAL GRAPH THEORY
AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationThe inverse eigenvalue problem for symmetric doubly stochastic matrices
Liear Algebra ad its Applicatios 379 (004) 77 83 www.elsevier.com/locate/laa The iverse eigevalue problem for symmetric doubly stochastic matrices Suk-Geu Hwag a,,, Sug-Soo Pyo b, a Departmet of Mathematics
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationGroup divisible designs GDD(n, n, n, 1; λ 1,λ 2 )
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1) (2017), Pages 18 28 Group divisible desigs GDD(,,, 1; λ 1,λ 2 ) Atthakor Sakda Chariya Uiyyasathia Departmet of Mathematics ad Computer Sciece Faculty
More informationOn Net-Regular Signed Graphs
Iteratioal J.Math. Combi. Vol.1(2016), 57-64 O Net-Regular Siged Graphs Nuta G.Nayak Departmet of Mathematics ad Statistics S. S. Dempo College of Commerce ad Ecoomics, Goa, Idia E-mail: ayakuta@yahoo.com
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information24 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS
24 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS Corollary 2.30. Suppose that the semisimple decompositio of the G- module V is V = i S i. The i = χ V,χ i Proof. Sice χ V W = χ V + χ W, we have:
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationBinary codes from rectangular lattice graphs and permutation decoding
Binary codes from rectangular lattice graphs and permutation decoding J. D. Key a,,1 P. Seneviratne a a Department of Mathematical Sciences, Clemson University, Clemson SC 29634, U.S.A. Abstract We examine
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationOn the Linear Complexity of Feedback Registers
O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationPROBLEMS ON ABSTRACT ALGEBRA
PROBLEMS ON ABSTRACT ALGEBRA 1 (Putam 197 A). Let S be a set ad let be a biary operatio o S satisfyig the laws x (x y) = y for all x, y i S, (y x) x = y for all x, y i S. Show that is commutative but ot
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationA REMARK ON A PROBLEM OF KLEE
C O L L O Q U I U M M A T H E M A T I C U M VOL. 71 1996 NO. 1 A REMARK ON A PROBLEM OF KLEE BY N. J. K A L T O N (COLUMBIA, MISSOURI) AND N. T. P E C K (URBANA, ILLINOIS) This paper treats a property
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationAssignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.
PHYSICS 34 QUANTUM PHYSICS II (25) Assigmet 2 Solutios 1. With respect to a pair of orthoormal vectors ϕ 1 ad ϕ 2 that spa the Hilbert space H of a certai system, the operator  is defied by its actio
More informationAnother diametric theorem in Hamming spaces: optimal group anticodes
Aother diametric theorem i Hammig spaces: optimal group aticodes Rudolf Ahlswede Departmet of Mathematics Uiversity of Bielefeld POB 003, D-3350 Bielefeld, Germay Email: ahlswede@math.ui-bielefeld.de Abstract
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170
UC Berkeley CS 170: Efficiet Algorithms ad Itractable Problems Hadout 17 Lecturer: David Wager April 3, 2003 Notes 17 for CS 170 1 The Lempel-Ziv algorithm There is a sese i which the Huffma codig was
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationLINEAR ALGEBRAIC GROUPS: LECTURE 6
LINEAR ALGEBRAIC GROUPS: LECTURE 6 JOHN SIMANYI Grassmaias over Fiite Fields As see i the Fao plae, fiite fields create geometries that are uite differet from our more commo R or C based geometries These
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationGeneralized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
Geeralized Reed-Solomo Codes with Sparsest ad Balaced Geerator Matrices Wetu Sog ad Kui Cai Sigapore Uiversity of Techology ad Desig, Sigapore Email: {wetu sog, cai kui}@sutd.edu.sg arxiv:1801.02315v1
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More information(k) x n. n! tk = x a. (i) x p p! ti ) ( q 0. i 0. k A (i) n p
Math 880 Bigraded Classes & Stirlig Cycle Numbers Fall 206 Bigraded classes. Followig Flajolet-Sedgewic Ch. III, we defie a bigraded class A to be a set of combiatorial objects a A with two measures of
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationLemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.
15 Cubics, Quartics ad Polygos It is iterestig to chase through the argumets of 14 ad see how this affects solvig polyomial equatios i specific examples We make a global assumptio that the characteristic
More informationABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS
ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS EDUARD KONTOROVICH Abstract. I this work we uify ad geeralize some results about chaos ad sesitivity. Date: March 1, 005. 1 1. Symbolic Dyamics Defiitio
More informationMA 162B LECTURE NOTES: THURSDAY, JANUARY 15
MA 6B LECTURE NOTES: THURSDAY, JANUARY 5 Examples of Galois Represetatios: Complex Represetatios Regular Represetatio Cosider a complex represetatio ρ : Gal ( Q/Q ) GL d (C) with fiite image If we deote
More informationRegn. No. North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: ,
. Sectio-A cotais 30 Multiple Choice Questios (MCQ). Each questio has 4 choices (a), (b), (c) ad (d), for its aswer, out of which ONLY ONE is correct. From Q. to Q.0 carries Marks ad Q. to Q.30 carries
More informationCALCULATING FIBONACCI VECTORS
THE GENERALIZED BINET FORMULA FOR CALCULATING FIBONACCI VECTORS Stuart D Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithacaedu ad Dai Novak Departmet
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationMATH10212 Linear Algebra B Proof Problems
MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationMinimal surface area position of a convex body is not always an M-position
Miimal surface area positio of a covex body is ot always a M-positio Christos Saroglou Abstract Milma proved that there exists a absolute costat C > 0 such that, for every covex body i R there exists a
More informationChimica Inorganica 3
himica Iorgaica Irreducible Represetatios ad haracter Tables Rather tha usig geometrical operatios, it is ofte much more coveiet to employ a ew set of group elemets which are matrices ad to make the rule
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationLecture 23 Rearrangement Inequality
Lecture 23 Rearragemet Iequality Holde Lee 6/4/ The Iequalities We start with a example Suppose there are four boxes cotaiig $0, $20, $50 ad $00 bills, respectively You may take 2 bills from oe box, 3
More informationChain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1
CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More information5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.
40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationgcd(n, k) = 1 Kwang Ho Kim 1 and Sihem Mesnager 2 Pyongyang, Democratic People s Republic of Korea
Solvig x 2k + + x + a = 0 i F 2 gcd, k = with Kwag Ho Kim ad Sihem Mesager 2 Istitute of Mathematics, State Academy of Scieces ad PGItech Corp., Pyogyag, Democratic People s Republic of Korea khk.cryptech@gmail.com
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee
More informationU8L1: Sec Equations of Lines in R 2
MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie
More informationShannon s noiseless coding theorem
18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio
More informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
More informationNumber of Spanning Trees of Circulant Graphs C 6n and their Applications
Joural of Mathematics ad Statistics 8 (): 4-3, 0 ISSN 549-3644 0 Sciece Publicatios Number of Spaig Trees of Circulat Graphs C ad their Applicatios Daoud, S.N. Departmet of Mathematics, Faculty of Sciece,
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationWeakly Connected Closed Geodetic Numbers of Graphs
Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationVector Spaces and Vector Subspaces. Remarks. Euclidean Space
Vector Spaces ad Vector Subspaces Remarks Let be a iteger. A -dimesioal vector is a colum of umbers eclosed i brackets. The umbers are called the compoets of the vector. u u u u Euclidea Space I Euclidea
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 9 Set partitios ad permutatios It could be said that the mai objects of iterest i combiatorics are subsets, partitios ad permutatios of a fiite set. We have spet some time coutig
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationThe value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng
The value of Baach limits o a certai sequece of all ratioal umbers i the iterval 0, Bao Qi Feg Departmet of Mathematical Scieces, Ket State Uiversity, Tuscarawas, 330 Uiversity Dr. NE, New Philadelphia,
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More information