Permutations that Decompose in Cycles of Length 2 and are Given by Monomials

Similar documents
= y and Normed Linear Spaces

The Linear Probability Density Function of Continuous Random Variables in the Real Number Field and Its Existence Proof

On EPr Bimatrices II. ON EP BIMATRICES A1 A Hence x. is said to be EP if it satisfies the condition ABx

Exponential Generating Functions - J. T. Butler

Professor Wei Zhu. 1. Sampling from the Normal Population

Fairing of Parametric Quintic Splines

XII. Addition of many identical spins

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi

RECAPITULATION & CONDITIONAL PROBABILITY. Number of favourable events n E Total number of elementary events n S

FULLY RIGHT PURE GROUP RINGS (Gelanggang Kumpulan Tulen Kanan Penuh)

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1

FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-PELL, K-PELL-LUCAS AND MODIFIED K-PELL SEQUENCES

ON THE CONVERGENCE THEOREMS OF THE McSHANE INTEGRAL FOR RIESZ-SPACES-VALUED FUNCTIONS DEFINED ON REAL LINE

Images of Linear Block Codes over Fq ufq vfq uvfq

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

By the end of this section you will be able to prove the Chinese Remainder Theorem apply this theorem to solve simultaneous linear congruences

The Geometric Proof of the Hecke Conjecture

SOME REMARKS ON HORIZONTAL, SLANT, PARABOLIC AND POLYNOMIAL ASYMPTOTE

MATH 247/Winter Notes on the adjoint and on normal operators.

Minimizing spherical aberrations Exploiting the existence of conjugate points in spherical lenses

χ be any function of X and Y then

Chapter Linear Regression

Trace of Positive Integer Power of Adjacency Matrix

Objectives. Learning Outcome. 7.1 Centre of Gravity (C.G.) 7. Statics. Determine the C.G of a lamina (Experimental method)

Possibilistic Modeling for Loss Distribution and Premium Calculation

QT codes. Some good (optimal or suboptimal) linear codes over F. are obtained from these types of one generator (1 u)-

On Bilinear Equations, Bell Polynomials and Linear Superposition Principle

Technical Appendix for Inventory Management for an Assembly System with Product or Component Returns, DeCroix and Zipkin, Management Science 2005.

SOME ARITHMETIC PROPERTIES OF OVERPARTITION K -TUPLES

University of Pavia, Pavia, Italy. North Andover MA 01845, USA

MATH Midterm Solutions

Harmonic Curvatures in Lorentzian Space

On The Circulant K Fibonacci Matrices

Range Symmetric Matrices in Minkowski Space

Abstract. 1. Introduction

On ARMA(1,q) models with bounded and periodically correlated solutions

Lecture 10: Condensed matter systems

Iterative Algorithm for a Split Equilibrium Problem and Fixed Problem for Finite Asymptotically Nonexpansive Mappings in Hilbert Space

ˆ SSE SSE q SST R SST R q R R q R R q

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

Landé interval rule (assignment!) l examples

X ε ) = 0, or equivalently, lim

VECTOR MECHANICS FOR ENGINEERS: Vector Mechanics for Engineers: Dynamics. In the current chapter, you will study the motion of systems of particles.

A note on random minimum length spanning trees

Non-axial symmetric loading on axial symmetric. Final Report of AFEM

GREEN S FUNCTION FOR HEAT CONDUCTION PROBLEMS IN A MULTI-LAYERED HOLLOW CYLINDER

Lecture 24: Observability and Constructibility

Consumer theory. A. The preference ordering B. The feasible set C. The consumption decision. A. The preference ordering. Consumption bundle

Recent Advances in Computers, Communications, Applied Social Science and Mathematics

Using Difference Equations to Generalize Results for Periodic Nested Radicals

Difference Sets of Null Density Subsets of

are positive, and the pair A, B is controllable. The uncertainty in is introduced to model control failures.

The Lucas and Babbage congruences

Exercises for Square-Congruence Modulo n ver 11

Chapter 2: Descriptive Statistics

MA 524 Homework 6 Solutions

Lecture 9 Multiple Class Models

Quasi-Rational Canonical Forms of a Matrix over a Number Field

Solutions for HW4. x k n+1. k! n(n + 1) (n + k 1) =.

Generalizations and analogues of the Nesbitt s inequality

Inequalities for Dual Orlicz Mixed Quermassintegrals.

A stopping criterion for Richardson s extrapolation scheme. under finite digit arithmetic.

SOLVING SYSTEMS OF EQUATIONS, DIRECT METHODS

PART ONE. Solutions to Exercises

An Unconstrained Q - G Programming Problem and its Application

Introduction Common Divisors. Discrete Mathematics Andrei Bulatov

Mu Sequences/Series Solutions National Convention 2014

9.1 The multiplicative group of a finite field. Theorem 9.1. The multiplicative group F of a finite field is cyclic.

SUBSEQUENCE CHARACTERIZAT ION OF UNIFORM STATISTICAL CONVERGENCE OF DOUBLE SEQUENCE

Some Integral Mean Estimates for Polynomials

The Exponentiated Lomax Distribution: Different Estimation Methods

RANDOM SYSTEMS WITH COMPLETE CONNECTIONS AND THE GAUSS PROBLEM FOR THE REGULAR CONTINUED FRACTIONS

Spectral Continuity: (p, r) - Α P And (p, k) - Q

Council for Innovative Research

Theorem on the differentiation of a composite function with a vector argument

CISC 203: Discrete Mathematics for Computing II Lecture 2, Winter 2019 Page 9

The Mathematical Appendix

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

1 Onto functions and bijections Applications to Counting

Counting Functions and Subsets

SATELLITE IMAGE FUSION WITH WAVELET DECOMPOSITION

Auchmuty High School Mathematics Department Sequences & Series Notes Teacher Version

Ideal multigrades with trigonometric coefficients

Best Linear Unbiased Estimators of the Three Parameter Gamma Distribution using doubly Type-II censoring

#A42 INTEGERS 16 (2016) THE SUM OF BINOMIAL COEFFICIENTS AND INTEGER FACTORIZATION

2. Sample Space: The set of all possible outcomes of a random experiment is called the sample space. It is usually denoted by S or Ω.

UNIT10 PLANE OF REGRESSION

Chapter 5 Properties of a Random Sample

INDEX BOUNDS FOR VALUE SETS OF POLYNOMIALS OVER FINITE FIELDS

Method for Approximating Irrational Numbers

A NOTE ON DOMINATION PARAMETERS IN RANDOM GRAPHS

CHAPTER 4 RADICAL EXPRESSIONS

Counting pairs of lattice paths by intersections

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

An Expanded Method to Robustly Practically. Output Tracking Control. for Uncertain Nonlinear Systems

BINOMIAL THEOREM An expression consisting of two terms, connected by + or sign is called a

Sandwich Theorems for Mcshane Integration

BINOMIAL THEOREM NCERT An expression consisting of two terms, connected by + or sign is called a

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

Transcription:

Poceedgs of The Natoa Cofeece O Udegaduate Reseach (NCUR) 00 The Uvesty of Noth Caoa at Asheve Asheve, Noth Caoa Ap -, 00 Pemutatos that Decompose Cyces of Legth ad ae Gve y Moomas Lous J Cuz Depatmet of Mathematcs Uvesty of Pueto Rco at Humacao Humacao, Pueto Rco Facuty Advso: D Ivesse Ruo F Astact I ths pape pemutatos of fte feds gve y moomas ax ae studed I patcua, the ecessay ad suffcet codtos the coeffcet a ad the expoet to ota pemutatos that decompose to cyces of egth ae studed Keywods: Pemutatos, Cyces, Fte Feds Itoducto A pemutato s a eodeg of the eemets a set Ou pcpa teest s to fd pemutatos of fte feds that decompose cyces of egth We study pemutatos of F, = p, p pme, that ae gve y moomas of the fom ax ad decompose cyces of egth Hee we peset some pata esuts o the ecessay ad suffcet codtos o the coeffcet a ad the expoet to ota ths type of pemutatos Pemutatos ca e used fo the costucto of teeaves fo eo coto codes Eo coto codes ae used commucatos systems to potect the fomato of eos that ca occu dug tasmsso Pemutatos that decompose cyces of egth ae patcuay usefu ecause they ae the ow vese ad hece the same techoogy ca e used fo ecodg ad decodg Pemaes We eg y pesetg the ecessay ackgoud fo the est of the pape Fte feds We ae teested pemutatos of fte feds used the est of the pape Let F e a o-empty set wth two opeatos ( ) Fo a a,, c, F oe must have, F The foowg cocepts ad esuts aout fte feds w e +, We say that F s a fed f t satsfes the foowg popetes

a a + ) If F ad F, the F ) a + ( + c) = ( a + ) + c ) a + = + a ) Thee s a eemet 0F F such that a + 0 = a = 0 a fo evey a F F F + a a + x = 0 F a a a ( c) = ( a ) c a = a a, a F = a = F a fo a a 0 F a x = F a ( + c) = a + a c ( a + ) c = a c + c ) Fo each F, the euato has a souto F ) If F ad F, the F ) ) fo a F ) Thee exst a eemet such that F 0 F 0) Fo each, the euato has a souto F ), ad a F A fte fed s a fed wth a fte ume of eemets It s we kow that evey fte fed has = eemets, whee p s a pme ume The oe-zeo eemets of a fte fed, F : = sge eemet caed a pmtve oot Moe fomay, F p \{0}, ca e geeated y a Defto Let F We say that s a pmtve oot of F f ad oy f geeates a the eemets of Exampe I F, s a pmtve oot Note that, Z 0, F = \{0} Ths s, F = {,,, } 0 =, =, =, =, =, =, =, =, =, =, 0 = 0, = It s kow that evey fte fed F has a pmtve oot ad t s easy to see that = The ext poposto foows easy fom ths fact Poposto Let F The, = Defto Let Z ad gcd (, ) = We say that j s the ode of Z ad wte f j s the j = od (a) j smaest postve tege such that ( mod ) Smay, we say that j s the ode of F f j s the smaest postve tege such that j (mod ) Note that, Exampe, the smaest postve tege j such that j (mod ) s Ths s ot a cocdece; fact, the ode of a pmtve oot s aways - F Pemutatos A pemutato π of a set A s a jecto π : A A Let e the fte fed wth eemets It s we kow that a mooma ax a F gves a pemutatos of F f ad oy f gcd(, -)= We ca ths type of, moomas pemutato moomas F

Exampe Let A = Z ad defe π : Z Z y π ( x ) = x Sce gcd(,0) =, π (x) s a pemutato Z mooma of Ths pemutato ca e epeseted the foowg way, whee a the eemets of the doma ae the fst ow ad the secod ow s the mage: 0 0 0 0 Aothe way to epeset pemutatos s wth ts decomposto cyces To epeset the pemutatos ths way oe takes a ta vaue ad pace t the egg of a cyce () The take the vaue that we otaed whe evauatg π (x) ad pace t to the sde of Now takeπ () ad evauate t aga the same fucto If whe dog ths oe otas the ta vaue, the the cyce fshes ad the cyce s ( π () ) If ot, oe epeats the evauato wth the pevous esut ut the ta vaue s otaed Note that the eemets the cyce ae the esut of composg the fucto wth tsef ad evauatg t The cyce fshes whe oe otas the ta vaue Each cyce w have the fom, ( π ( ) π ( π ( )) π ( ) = ) whee π () meas π composed wth tsef tmes ad evauated, ad s the smae vaue so that π ( ) = If π ( ) =, the s caed a fxed pot ad oe does ot wte the cyce Cotug wth the pevous exampe, the cycc decomposto of the pemutato of s: ( ) ( ) Z gve y π ( x ) = x We ae teested pemutatos of F gve y moomas ax that decompose cyces of egth Fo exampe, the pemutato of gve y π ( x ) = x decomposes cyces of egth The pemutato s: Z 0 0 0 0 The cycc decomposto of ths pemutato s: Pemutato Moomas ( ) ( ) ( ) ( ) (0 ) ( ) A pemutato mooma A s a mooma such that whe t s evauated the eemets of A poduces a pemutato of A Cosde F, the fte fed wth eemets It s we kow that the fucto π : F F defed y π x) = ax, a F, poduces a pemutato of F f ad oy f gcd(, -)= We ae teested ( pemutatos of F that decompose cyces of egth ad ae otaed usg moomas ax Pemutato moomas x Theoem [] gves the ecessay ad suffcet codtos to ota pemutato moomas x that decompose cyces of the same egth The foowg poposto s a cooay to Theoem ad gves the ecessay ad suffcet codtos o the expoet to ota pemutatos that decompose cyces of egth ad ae gve y moomas x

k k k Poposto Let = p p p, k Z, k The pemutato of gve y x decomposes cyces of the egth f ad oy f oe of the foowgs hods fo each = k p ) (mod ) ) = od ( ) k p F Exampe Cosde Z Tae ustates Poposto Tae cycc decomposto of pemutatos gve y x ad the ode of mod Cycc decomposto od ( ) ( ) ( 0 ) ( ) ( ) ( ) ( ) ( ) ( 0 ) ( ) ( ) ( ) ( ) ( 0 ) ( ) ( ) ( ) ( ) ( ) ( ) ( 0 ) ( ) ( 0 ) ( ) ( ) ( ) ( ) ( ) ( 0 ) ( ) ( ) ( ) ( ) ( ) ( ) ( 0 ) ( ) F Aso [], Theoem gves a fomua fo coutg the ume of moomas x that poduce pemutatos of that decompose cyces of the same egth j The foowg poposto s a cooay to ths theoem ad couts the ume of moomas x that decompose cyces of egth k Poposto Let = p p, k, k Z, k 0, k The ume of pemutatos x of F that decompose cyces of egth s: k k + + f f f k = 0, k = k Note that ths poposto pedcts that thee ae moomas that poduce pemutatos of Z that decompose cyces of egth ad ths s exacty what we saw Exampe x The pevous esuts appy to case of moomas of the fom x The pupose of ths wok s to geeaze these esuts We wat to fd esuts fo moomas ax whee a F, a We foud that, some cases, ax decompose cyces of egth fo a a a F, othes, we eed addtoa codtos to ota cyces of egth fo Hee we peset some pata esuts of whe the pemutatos gve y ax decompose cyces of egth

Ou fst esut pesets a case whee the pemutatos gve y a F ax decompose cyces of egth fo a ( Theoem Let π x) = ax, a F The π gves a pemutato of that decomposes cyces of egth fo a a F Poof: We fst pove that ax s a pemutato mooma of F We have to see that gcd(-, -)= Suppose that d s the geatest commo dvso of - ad - The -=dk ad -=d whee k, Z Ths mpes that d=-=-+=dk+ ad d=dk+ Theefoe d(-k)= ad ths mpes that d dvdes Sce d s a postve tege, d= Hece ax s a pemutato mooma of F To costuct the cyces of the pemutato of gve y ax, a eemet F s evauated the fucto π ( x) = ax F ad the esut s evauated aga the same fucto to ota: F ( a a( a ) ) To have cyces of the egth, we must have, a( a ) = Now, a( a ) + ( )( ) + = a = a = a ( ) Usg Poposto, we have that a ( ) = ad theefoe the cyces have egth Befoe, we metoed that the moomas ax ae pemutatos moomas of F f ad oy f gcd(-,) = The ext emma gves the codto fo the moomas ax Lemma Let = p, p The ax s a pemutato mooma of f ad oy f (-) F Poof: ( ) Suppose that (-) The -=k To see that ax gves pemutato of, we must pove that gcd, = F Sce =, epacg - y k, we ota: gcd, = f ad oy f gcd(k, k-)= k = =k- Theefoe Suppose that d s the geatest commo dvso of k ad k- The, k=d ad k-=dm fo some,m Z Now mutpyg k- y, we ota k-=dm But fom the fst euato we have that k-=d- Hece, d- =dm Ths mpes that =d(-m) ad d dvdes Sce d s a postve tege, ths meas that that d= o d=

Sce d dvde k-, d must e Theefoe, gcd s a pemutato mooma of F, = gcd(k, k-)= Ths mpes that ax ( ) Suppose that ax s a pemutato mooma of F The gcd, = Aso p ad = p mpy that (-) Now gcd, = mpes that does ot dvde Theefoe, =k+,k Z Now sovg fo, we ota that =k++ Ths mpes that -=(k+) ad hece, (- ) It s kow that the pemutatos gve y x decompose cyces of egth (see [] ), ut whe the coeffcet of ax s ot euas to ot a the pemutatos decompose cyces of egth The ext theoem gves the ecessay ad suffcet codtos such that ax gves a pemutatos of that decompose cyces of egth F Theoem Let = p, p ad et e a pmtve oot of F The k that decompose cyces of egth f ad oy f a =, k Z ad (-) ax gves a pemutato of F Poof: ( ) k Suppose that (-) ad a = The, y the pevous emma, ax s pemutato mooma of F To costuct the cyces of the pemutato of k x π ( x) = ad the esut s evauated aga the same fucto F gve y ax, a eemet F s evauated the fucto k = k k k k To have cyces of egth, oe must have that, k k = = = = Now, k k + k ( )( ) + + k k ( ) ( ),

( ) k whee = = Z ecause (-) Usg Poposto, we have that ( ) =, ad theefoe the cyces have egth ( ) Sce π ( x) = ax s pemutato of, Lemma mpes that (-) Now, et a = ad F We have two cases: ) s a cyce of egth, o ) F s a fxed pot Case ): Suppose that F s a cyce of egth The, + + = Now we smpfy + ad ota = = Now we ewte as ( ) + = ( ) =, whee = ( ) ad s a tege By Poposto we have that ( ) = + Ths mpes that = = Ths mpes that = ad hece 0 mod ( ) Theefoe k = ( ) k, k Z Theefoe, =k k Z ad a = Case ): Suppose ow that s a fxed pot Ths meas that = Hece, = = Sce - =k, k Z, j = =k-, =k-,aso, sce s a pmtve oot F, = fo some j Z j j Theefoe, ( ) ( ) h = = Ths mpes that = h, some h Z ad hece a = Cocusos ad wok pogess The esuts peseted o ths pape ae patas esuts We foud ecessaes ad suffcet codtos the coeffcet a, of some moomas ax, to ota pemutatos that decompose cyces of egth We ae st wokg o the foowg poems Gve ay expoet such that x decomposes cyces of egth, fd the ecessay ad suffcet codtos o the coeffcet a such that ax aso decompose cyces of egth Ae thee pemutatos gve y ax that decompose cyces of egth eve f the pemutato gve y does ot decompose cyces of egth? Is thee aothe expoet such that ax decompose cyces of egth fo a? Ackowedgmets a F Ths wok has ee suppoted pat y the Natoa Secuty Agecy, Gat Nume H0-0-C-0; ad the Natoa Scece Foudato CSEMS Pogam at the UPRH, Gat Nume 0 x

Refeeces Books Rudof Ld ad Haad Neddeete, Ecycopeda of Mathematcs ad ts Appcatos Vo 0, Fte d Feds, ed (Uted Kgdom: Camdge Uvesty Pess, ) I Ruo ad C Coada-Bavo, Cycc Decomposto of Pemutatos of Fte Feds Otaed usg Moomas ad Appcatos to Tuo Codes, Fte Feds ad Appcatos, LNCS, ed Mue, Po, Stchteoth (New Yok: Spge, 00), d Thomas Hugefod, Astac Agea: A Itoducto, ed (Foda: Saudes, ) Jouas Yaa B Lus ad Lus O Péez, Pemutatos of, costucted usg sevea mooma odegs, Poceedgs of the 00 NCUR (Ap, 00) Z p