The multisubset sum problem for finite abelian groups
|
|
- Jack Howard
- 5 years ago
- Views:
Transcription
1 Alo available a hp://amc-journal.eu ISSN (prined edn.), ISSN (elecronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) The muliube um problem for finie abelian group Amela Muraović-Ribić Univeriy of Sarajevo, Deparmen of Mahemaic, Zmaja od Bone 33-35, Sarajevo, Bonia and Herzegovina Qiang Wang School of Mahemaic and Saiic, Carleon Univeriy, 1125 Colonel By Drive, Oawa, Onario, K1S 5B6, Canada Received 28 Ocober 2013, acceped 29 Augu 2014, publihed online 11 June 2015 Abrac We ue a imilar echique a in [2] o derive a formula for he number of muliube of a finie abelian group G wih any given ize and any given mulipliciy uch ha he um i equal o a given elemen g G. Thi alo give he number of pariion of g ino a given number of par over a finie abelian group. Keyword: Compoiion, pariion, ube um, polynomial, finie field, characer, finie abelian group. Mah. Subj. Cla.: 11B30, 05A15, 20K01, 11T06 1 Inroducion Le G be a finie abelian group of ize n and D be a ube of G. The well nown ube um problem in combinaoric i o decide wheher here exi a ube S of D which um o a given elemen in G. Thi problem i an imporan problem in complexiy heory and crypography and i i NP-complee (ee for example [3]). For any g G and i a poiive ineger, we le he number of ube S of D of ize i which um up o g be denoed by N(D, i, g) = #{S D : #S = i, S = g}. Reearch i parially uppored by NSERC of Canada. addree: amela@pmf.una.ba (Amela Muraović-Ribić), wang@mah.carleon.ca (Qiang Wang) cb Thi wor i licened under hp://creaivecommon.org/licene/by/3.0/
2 418 Ar Mah. Conemp. 8 (2015) When D ha more rucure, Li and Wan made ome imporan progre in couning hee ube um by a ieve echnique [3, 4]. Recenly Koer [2] give a horer proof of he formula obained by Li and Wan earlier, uing characer heory. N(G, i, g) = 1 n ( 1) i+ d gcd(e(g),) µ(/d)#g[d], where exp(g) i he exponen of G, e(g) = max{d : d exp(g), g dg}, µ i he More generally, we conider a muliube M of D. The number of ime an elemen belong o M i he mulipliciy of ha member. We define he mulipliciy of a muliube M i he large mulipliciy among all he member in M. We denoe M(D, i, j, g) = #{muliube M of D : mulipliciy(m) j, #M = i, M = g}. I i an inereing queion by i own o coun M(D, i, j, g), he number of muliube of D of cardinaliy i which um o g where every elemen i repeaed a mo j ime. If j = 1, hen M(D, i, j, g) = N(D, i, g). If j i, hi problem i alo equivalen o couning pariion of g wih a mo i par over D, which i M(D, i, i, g). In hi cae we ue a impler noaion M(D, i, g) becaue he econd i doe no give any rericion. Anoher moivaion o udy he enumeraion of muliube um i due o a recen udy of polynomial of precribed range over a finie field. Indeed, hrough he udy of enumeraion of muliube um over finie field [5], we were able o diprove a conjecure of polynomial of precribed range ove a finie field propoed in [1]. Le F q be a finie field of q elemen and F q be he cyclic muliplicaive group. When D i F q (he addiive group) or F q, couning he muliube um problem i he ame a couning pariion over finie field, which ha been udied earlier in [6]. In hi noe, we ue he imilar mehod a in [2] o obain M(D, i, j, g) when D = G. However, we wor in a power erie ring inead of a polynomial ring. Theorem 1. Le G be a finie abelian group of ize n and le g G, i, j Z wih i 0 and j 1. For any n, we define Then we have C(n, i, j, ) = M(G, i, j, g) = 1 n 0,0 n gcd(,j+1), + lcm(,j+1)=i ( 1) ( n/ + 1 C(n, i, j, ) )( n gcd(,j+1) ). µ(/d)#g[d]. where exp(g) i he exponen of G, e(g) = max{d : d exp(g), g dg}, µ i he A a corollary, we obain he main heorem in [2] when j = 1.
3 A. Muraović-Ribić, Q. Wang: The muliube um problem for Corollary 1. (Theorem 1.1 in [2]) Le G be a finie abelian group of ize n and le g G and i Z. Then we have N(G, i, g) = 1 ( 1) i+ µ(/d)#g[d]. n where exp(g) i he exponen of G, e(g) = max{d : d exp(g), g dg}, µ i he Moreover, when j i, he formula give he number of pariion of g wih a mo i par over a finie abelian group. To avoid confuion he mulie coniing of a 1,..., a n i denoed by {{a 1,..., a n }}, wih poibly repeaed elemen, and by {a 1,..., a n } he uual e. We define a pariion of he elemen g G wih exacly i par in D a a mulie {{a 1, a 2,..., a i }} uch ha all a are nonzero elemen in D and a 1 + a a i = g. Then he number of hee pariion i denoed by P D (i, g), i.e., {. P D (i, g) = {{a 1, a 2,..., a i }} D : a 1 + a a i = g, a 1,..., a i 0} I urn ou M(D, i, g) = i =0 P D(, g) i he number of pariion of g G wih a mo i par in D. Corollary 2. Le G be a finie abelian group of ize n and le g G. Then he number of pariion of g over G wih a mo i par i 1 ( ) n/ + 1 µ(/d)#g[d]. n where exp(g) i he exponen of G, e(g) = max{d : d exp(g), g dg}, µ i he Proof. The number i M(G, i, j, g) when j i 0. If j i, hen he linear Diophanine equaion + lcm(, j + 1) = i reduce o = i and = 0. The re of proof follow immediaely. In Secion 2, we prove our main heorem and derive Corollary 1 a a conequence. In Secion 3, we exend our udy o a ube of a finie abelian group and mae a few remar on how o obain he number of pariion over any ube of a finie abelian group. 2 Proof of Theorem 1 To mae hi paper elf-conained, we recall he following lemma (ee Lemma in [2]). Le G be a finie abelian group of ize n. Le C be he field of complex number and Ĝ = Hom(G, C ) be he group of characer of G. Le χ Ĝ and χ be he conjugae characer which aifie χ(g) = χ(g) = χ( g) for all g G. We noe ha a characer χ can be naurally exended o a C-algebra morphim χ : C[G] C on he group ring C[G]. Lemma 1. Le α = g G α gg C[G]. Then we have α g = 1 n χ Ĝ χ(g)χ(α).
4 420 Ar Mah. Conemp. 8 (2015) Lemma 2. Le m be a poiive ineger and g G. Then χ(g) = δ g mg #G[m], χ Ĝ,χm =1 where δ g mg i 1 if g mg and i i zero oherwie. Lemma 3. Le χ Ĝ be a characer and m be i order. Then we have (1 χ(σ)y ) = (1 Y m ) n/m. σ G Lemma 4. Le g G. The number e(g) i equal o lcm{d : d exp(g), g dg}. For d exp(g) we have g dg if and only if d e(g). Le u preen he proof of Theorem 1. We ue he muliplicaive noaion for he group. Proof. Fix j 1. Woring in he power erie ring C[G][[X]] over he group ring, he generaing funcion of g G M(G, i, j, g)g i g GM(G, i, j, g)gx i = σ G(1+σX+ +σ j X j ) = σ G 1 σ j+1 X j+1 1 σx C[G][[X]]. Uing Lemma 1, we wrie M(G, i, j, g)x i = 1 χ(g) n σ G χ Ĝ Separaing he fir um on he righ hand ide, we obain 1 χ j+1 (σ)x j+1 1 χ(σ)x. M(G, i, j, g)x i = 1 n χ(g) exp(g) χ Ĝ,ord(χ)= σ G 1 χ j+1 (σ)x j+1 1 χ(σ)x. For each fixed χ of he order, we now ha χ j+1 ha he order gcd(,j+1). Therefore by Lemma 3, we implify he above a follow: M(G, i, j, g)x i = 1 n Noe ha χ(g) exp(g) χ Ĝ,ord(χ)= χ Ĝ,χ =1 χ(g) = d ( 1 X lcm(,j+1) ) n gcd(,j+1) (1 X ) n/. (2.1) χ Ĝ,ord(χ)=d χ(g). By Lemma 2 and he Möbiu inverion formula, we obain χ(g) = µ(/d) χ(g) = µ(/d)δ g dg #G[d]. χ Ĝ,ord(χ)= d d χ Ĝ, χd =1
5 A. Muraović-Ribić, Q. Wang: The muliube um problem for Becaue d exp(g), by Lemma 4, g dg if and only if d e(g). Hence χ(g) = µ(/d)δ g dg #G[d] = µ(/d)#g[d]. χ Ĝ,ord(χ)= d Plugging hi ino Equaion (2.1), we ge M(G, i, j, g)x i = 1 n exp(g) µ(/d)#g[d] ( 1 X lcm(,j+1) ) n gcd(,j+1) (1 X ) n/. By applying he binomial heorem o he righ hand ide and comparing coefficien of X i in boh ide, we ingle ou M(G, i, j, g) and obain M(G, i, j, g) = 1 n exp(g) µ(/d)#g[d]c(n, i, j, ). Afer bringing C(n, i, j, ) ou of he inner um we complee he proof. Finally we remar ha we can derive Corollary 1 uing N(G, i, g) = M(G, i, 1, g). When j = 1, le u conider + lcm(, j + 1) = + lcm(, 2) = i. If i even, we obain + = i and hu + =. Noe ha we have he following power erie expanion and 1 (1 x) = n/ =0 =0 ( n/ + 1 ) x, 2n/ ( ) 2n/ (1 x) 2n/ = ( 1) x, n/ (1 x) n/ = ( 1) j x j. j j=0 Now we compare he coefficien of he erm x in boh ide of 1 (1 x ) n/ (1 x ) 2n/ = (1 x ) n/, afer expanding hee power erie. Hence we obain C(n, i, 1, ) = += 0,0 2n/ ( 1) ( n/ + 1 )( ) 2n/ = ( 1). Moreover, C(n, i, 1, ) = ( 1) i+( n/ ) becaue i i even. Similarly, if i odd, we obain + 2 = i and hu + 2 =. Moreover, i + i even. Uing (1 x 2 ) n/ 1 (1 x ) n/ = (1 + x ) n/,
6 422 Ar Mah. Conemp. 8 (2015) we obain C(n, i, 1, ) = 3 A few remar +2= 0,0 n/ ( 1) ( n/ + 1 ) = ( 1) i+. In hi ecion we udy M(D, i, j, g) where j i and D i a ube of G. We recall ha in hi cae we ue he noaion M(D, i, g) becaue j doe no really pu any rericion. Fir of all, we noe ha M(G \ {0}, i, g)gx i = g G By Corollary 2, we obain M(G \ {0}, i, g) = 1 n gcd(exp(g),i 1) σ G,σ 0 ( ) n/ σx = (1 X) ( ) n/ + (i 1)/ 1 (i 1)/ M(G, i, g)gx i. g G µ(/d)#g[d] µ(/d)#g[d]. We noe M(G \ {0}, i, g) = P G (i, g). Therefore we obain an explici formula for he number of pariion of g ino i par over G. More generally, le D = G \ S, where S = {u 1, u 2,..., u S } =. Denoe by M S (G, i, g) he number of muliube of G of ize i ha conain a lea one elemen from S. Then he number of muliube of D = G \ S wih i par which um up o g i equal o M(G \ S, i, g) = M(G, i, g) M S (G, i, g). Noe ha M(G, 0, 0) = 1 and M(G, 0, ) = 0 for any G \ {0}. The principle of incluion-excluion immediaely implie ha M S (G, i, g) i given in he following formula. We noe ha he formula i quie ueful when he ize of S i mall in order o compue M(G \ S, i, g). Propoiion 1. For all i = 1, 2,... and g G we have +( 1) 1 +( 1) i 2 ( 1) i 1 M S (G, i, g) = u S M(G, i 1, g u)... {u 1,u 2,...,u } S {u 1,u 2,...,u i 1} S {u 1,u 2,...,u i} S M(G, i, g (u 1 + u u )) +... M(G, 1, g (u 1 + u u i 1 ))+ M(G, 1, g (u 1 + u u i )).
7 A. Muraović-Ribić, Q. Wang: The muliube um problem for Proof. Fix an elemen g G. Denoe by A u he family of all he muliube of G wih i par which um up o g and each muliube alo conain he elemen u. The principle of he incluion-excluion implie ha u S A u = A u A u1 A u (3.1) u S {u 1,u 2} S I i obviou o ee A u1 A u2 = M(G, i 2, g (u 1 + u 2 )) ec. by definiion and he reul follow direcly. Acnowledgemen We han anonymou referee for heir helpful uggeion. Reference [1] A. Gác, T. Héger, Z. L. Nagy, D. Pálvölgyi, Permuaion, hyperplane and polynomial over finie field, Finie Field Appl. 16 (2010), [2] M. Koer, The ube problem for finie abelian group, J. Combin. Theory Ser. A 120 (2013), [3] J. Li and D. Wan, On he ube um problem over finie field, Finie Field Appl. 14 (2008), [4] J. Li and D. Wan, Couning ube um of finie abelian group, J. Combin. Theory Ser. A 119 (2012), no. 1, [5] A. Muraović-Ribić and Q. Wang, On a conjecure of polynomial wih precribed range, Finie Field Appl. 18 (2012), no. 4, [6] A. Muraović-Ribić and Q. Wang, Pariion and compoiion over finie field, Elecron. J. Combin. 20 (2013), no. 1, P34, 1-14.
FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER
#A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:
More informationFIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL EQUATIONS WITH VARIABLE DELAYS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 3, March 28, Page 99 918 S 2-9939(7)989-2 Aricle elecronically publihed on November 3, 27 FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationBernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016
UNIVERSITÁ DEGLI STUDI DI PADOVA, DIPARTIMENTO DI MATEMATICA TULLIO LEVI-CIVITA Bernoulli numbers Francesco Chiai, Maeo Pinonello December 5, 206 During las lessons we have proved he Las Ferma Theorem
More informationExplicit form of global solution to stochastic logistic differential equation and related topics
SAISICS, OPIMIZAION AND INFOMAION COMPUING Sa., Opim. Inf. Compu., Vol. 5, March 17, pp 58 64. Publihed online in Inernaional Academic Pre (www.iapre.org) Explici form of global oluion o ochaic logiic
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
More informationMath-Net.Ru All Russian mathematical portal
Mah-NeRu All Russian mahemaical poral Roman Popovych, On elemens of high order in general finie fields, Algebra Discree Mah, 204, Volume 8, Issue 2, 295 300 Use of he all-russian mahemaical poral Mah-NeRu
More informationLower and Upper Approximation of Fuzzy Ideals in a Semiring
nernaional Journal of Scienific & Engineering eearch, Volume 3, ue, January-0 SSN 9-558 Lower and Upper Approximaion of Fuzzy deal in a Semiring G Senhil Kumar, V Selvan Abrac n hi paper, we inroduce he
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationResearch Article On Double Summability of Double Conjugate Fourier Series
Inernaional Journal of Mahemaic and Mahemaical Science Volume 22, Aricle ID 4592, 5 page doi:.55/22/4592 Reearch Aricle On Double Summabiliy of Double Conjugae Fourier Serie H. K. Nigam and Kuum Sharma
More information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More informationINDEPENDENT SETS IN GRAPHS WITH GIVEN MINIMUM DEGREE
INDEPENDENT SETS IN GRAPHS WITH GIVEN MINIMUM DEGREE JAMES ALEXANDER, JONATHAN CUTLER, AND TIM MINK Absrac The enumeraion of independen ses in graphs wih various resricions has been a opic of much ineres
More informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp
More informationChapter 2. First Order Scalar Equations
Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.
More informationSyntactic Complexity of Suffix-Free Languages. Marek Szykuła
Inroducion Upper Bound on Synacic Complexiy of Suffix-Free Language Univeriy of Wrocław, Poland Join work wih Januz Brzozowki Univeriy of Waerloo, Canada DCFS, 25.06.2015 Abrac Inroducion Sae and ynacic
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationThe Miki-type identity for the Apostol-Bernoulli numbers
Annales Mahemaicae e Informaicae 46 6 pp. 97 4 hp://ami.ef.hu The Mii-ype ideniy for he Aposol-Bernoulli numbers Orli Herscovici, Toufi Mansour Deparmen of Mahemaics, Universiy of Haifa, 3498838 Haifa,
More informationT-Rough Fuzzy Subgroups of Groups
Journal of mahemaic and compuer cience 12 (2014), 186-195 T-Rough Fuzzy Subgroup of Group Ehagh Hoeinpour Deparmen of Mahemaic, Sari Branch, Ilamic Azad Univeriy, Sari, Iran. hoienpor_a51@yahoo.com Aricle
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationFinish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!
MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his
More informationGLOBAL ANALYTIC REGULARITY FOR NON-LINEAR SECOND ORDER OPERATORS ON THE TORUS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 131, Number 12, Page 3783 3793 S 0002-9939(03)06940-5 Aricle elecronically publihed on February 28, 2003 GLOBAL ANALYTIC REGULARITY FOR NON-LINEAR
More informationOptimal State-Feedback Control Under Sparsity and Delay Constraints
Opimal Sae-Feedback Conrol Under Spariy and Delay Conrain Andrew Lamperki Lauren Leard 2 3 rd IFAC Workhop on Diribued Eimaion and Conrol in Neworked Syem NecSy pp. 24 29, 22 Abrac Thi paper preen he oluion
More informationChapter 6. Laplace Transforms
Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of
More informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationFUZZY n-inner PRODUCT SPACE
Bull. Korean Mah. Soc. 43 (2007), No. 3, pp. 447 459 FUZZY n-inner PRODUCT SPACE Srinivaan Vijayabalaji and Naean Thillaigovindan Reprined from he Bullein of he Korean Mahemaical Sociey Vol. 43, No. 3,
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationOn the Exponential Operator Functions on Time Scales
dvance in Dynamical Syem pplicaion ISSN 973-5321, Volume 7, Number 1, pp. 57 8 (212) hp://campu.m.edu/ada On he Exponenial Operaor Funcion on Time Scale laa E. Hamza Cairo Univeriy Deparmen of Mahemaic
More informationBBP-type formulas, in general bases, for arctangents of real numbers
Noes on Number Theory and Discree Mahemaics Vol. 19, 13, No. 3, 33 54 BBP-ype formulas, in general bases, for arcangens of real numbers Kunle Adegoke 1 and Olawanle Layeni 2 1 Deparmen of Physics, Obafemi
More informationToday: Max Flow Proofs
Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationChapter 7: Inverse-Response Systems
Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem
More informationGCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS
GCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS D. D. ANDERSON, SHUZO IZUMI, YASUO OHNO, AND MANABU OZAKI Absrac. Le A 1,..., A n n 2 be ideals of a commuaive ring R. Le Gk resp., Lk denoe
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More information23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes
Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion
More informationResearch Article An Upper Bound on the Critical Value β Involved in the Blasius Problem
Hindawi Publihing Corporaion Journal of Inequaliie and Applicaion Volume 2010, Aricle ID 960365, 6 page doi:10.1155/2010/960365 Reearch Aricle An Upper Bound on he Criical Value Involved in he Blaiu Problem
More information18.03SC Unit 3 Practice Exam and Solutions
Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care
More informationMATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence
MATH 433/533, Fourier Analysis Secion 6, Proof of Fourier s Theorem for Poinwise Convergence Firs, some commens abou inegraing periodic funcions. If g is a periodic funcion, g(x + ) g(x) for all real x,
More informationMaximum Flow and Minimum Cut
// Sovie Rail Nework, Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nework Flow Flow nework.
More informationNECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY
NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen
More informationFamilies with no matchings of size s
Families wih no machings of size s Peer Franl Andrey Kupavsii Absrac Le 2, s 2 be posiive inegers. Le be an n-elemen se, n s. Subses of 2 are called families. If F ( ), hen i is called - uniform. Wha is
More informationREMARK ON THE PAPER ON PRODUCTS OF FOURIER COEFFICIENTS OF CUSP FORMS 1. INTRODUCTION
REMARK ON THE PAPER ON PRODUCTS OF FOURIER COEFFICIENTS OF CUSP FORMS YUK-KAM LAU, YINGNAN WANG, DEYU ZHANG ABSTRACT. Le a(n) be he Fourier coefficien of a holomorphic cusp form on some discree subgroup
More informationSELBERG S CENTRAL LIMIT THEOREM ON THE CRITICAL LINE AND THE LERCH ZETA-FUNCTION. II
SELBERG S CENRAL LIMI HEOREM ON HE CRIICAL LINE AND HE LERCH ZEA-FUNCION. II ANDRIUS GRIGUIS Deparmen of Mahemaics Informaics Vilnius Universiy, Naugarduko 4 035 Vilnius, Lihuania rius.griguis@mif.vu.l
More informationMax Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.
Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph
More informationCHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition.
CHAPTER 8 Forced Equaion and Syem 8 The aplace Tranform and I Invere Tranform from he Definiion 5 5 = b b {} 5 = 5e d = lim5 e = ( ) b {} = e d = lim e + e d b = (inegraion by par) = = = = b b ( ) ( )
More informationA NOTE ON PRE-J-GROUP RINGS
Qaar Univ. Sci. J. (1991), 11: 27-31 A NOTE ON PRE-J-GROUP RINGS By W. B. VASANTHA Deparmen of Mahemaic, Indian Iniue of Technology Madra - 600 036, India. ABSTRACT Given an aociaive ring R aifying amb
More information1 Adjusted Parameters
1 Adjued Parameer Here, we li he exac calculaion we made o arrive a our adjued parameer Thee adjumen are made for each ieraion of he Gibb ampler, for each chain of he MCMC The regional memberhip of each
More informationOn the Benney Lin and Kawahara Equations
JOURNAL OF MATEMATICAL ANALYSIS AND APPLICATIONS 11, 13115 1997 ARTICLE NO AY975438 On he BenneyLin and Kawahara Equaion A Biagioni* Deparmen of Mahemaic, UNICAMP, 1381-97, Campina, Brazil and F Linare
More informationMapping Properties Of The General Integral Operator On The Classes R k (ρ, b) And V k (ρ, b)
Applied Mahemaics E-Noes, 15(215), 14-21 c ISSN 167-251 Available free a mirror sies of hp://www.mah.nhu.edu.w/ amen/ Mapping Properies Of The General Inegral Operaor On The Classes R k (ρ, b) And V k
More informationMath 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:
Mah 4 Eam Review Problems Problem. Calculae he 3rd Taylor polynomial for arcsin a =. Soluion. Le f() = arcsin. For his problem, we use he formula f() + f () + f ()! + f () 3! for he 3rd Taylor polynomial
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationSoviet Rail Network, 1955
7.1 Nework Flow Sovie Rail Nework, 19 Reerence: On he hiory o he ranporaion and maximum low problem. lexander Schrijver in Mah Programming, 91: 3, 00. (See Exernal Link ) Maximum Flow and Minimum Cu Max
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
More informationA problem related to Bárány Grünbaum conjecture
Filoma 27:1 (2013), 109 113 DOI 10.2298/FIL1301109B Published by Faculy of Sciences and Mahemaics, Universiy of Niš, Serbia Available a: hp://www.pmf.ni.ac.rs/filoma A problem relaed o Bárány Grünbaum
More informationExistence of positive solution for a third-order three-point BVP with sign-changing Green s function
Elecronic Journal of Qualiaive Theory of Differenial Equaions 13, No. 3, 1-11; hp://www.mah.u-szeged.hu/ejqde/ Exisence of posiive soluion for a hird-order hree-poin BVP wih sign-changing Green s funcion
More informationESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS
Elec. Comm. in Probab. 3 (998) 65 74 ELECTRONIC COMMUNICATIONS in PROBABILITY ESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS L.A. RINCON Deparmen of Mahemaic Univeriy of Wale Swanea Singleon Par
More informationWe just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n
Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.
More informationChapter 6. Laplace Transforms
6- Chaper 6. Laplace Tranform 6.4 Shor Impule. Dirac Dela Funcion. Parial Fracion 6.5 Convoluion. Inegral Equaion 6.6 Differeniaion and Inegraion of Tranform 6.7 Syem of ODE 6.4 Shor Impule. Dirac Dela
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationResearch Article Existence and Uniqueness of Solutions for a Class of Nonlinear Stochastic Differential Equations
Hindawi Publihing Corporaion Abrac and Applied Analyi Volume 03, Aricle ID 56809, 7 page hp://dx.doi.org/0.55/03/56809 Reearch Aricle Exience and Uniquene of Soluion for a Cla of Nonlinear Sochaic Differenial
More informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More informationHedgehogs are not colour blind
Hedgehogs are no colour blind David Conlon Jacob Fox Vojěch Rödl Absrac We exhibi a family of 3-uniform hypergraphs wih he propery ha heir 2-colour Ramsey numbers grow polynomially in he number of verices,
More informationMathematische Annalen
Mah. Ann. 39, 33 339 (997) Mahemaiche Annalen c Springer-Verlag 997 Inegraion by par in loop pace Elon P. Hu Deparmen of Mahemaic, Norhweern Univeriy, Evanon, IL 628, USA (e-mail: elon@@mah.nwu.edu) Received:
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationA Note on Goldbach Partitions of Large Even Integers
arxiv:47.4688v3 [mah.nt] Jan 25 A Noe on Goldbach Pariions of Large Even Inegers Ljuben Muafchiev American Universiy in Bulgaria, 27 Blagoevgrad, Bulgaria and Insiue of Mahemaics and Informaics of he Bulgarian
More informationCONTROL SYSTEMS. Chapter 10 : State Space Response
CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),
More informationConvergence of the Neumann series in higher norms
Convergence of he Neumann series in higher norms Charles L. Epsein Deparmen of Mahemaics, Universiy of Pennsylvania Version 1.0 Augus 1, 003 Absrac Naural condiions on an operaor A are given so ha he Neumann
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationNotes on cointegration of real interest rates and real exchange rates. ρ (2)
Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))
More informationSUBSPACES OF MATRICES WITH SPECIAL RANK PROPERTIES
SUBSPACES OF MATRICES WITH SPECIAL RANK PROPERTIES JEAN-GUILLAUME DUMAS, ROD GOW, GARY MCGUIRE, AND JOHN SHEEKEY Absrac. Le K be a field and le V be a vecor space of finie dimension n over K. We invesigae
More informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More informationAdditional Methods for Solving DSGE Models
Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of
More informationOn Two Integrability Methods of Improper Integrals
Inernaional Journal of Mahemaics and Compuer Science, 13(218), no. 1, 45 5 M CS On Two Inegrabiliy Mehods of Improper Inegrals H. N. ÖZGEN Mahemaics Deparmen Faculy of Educaion Mersin Universiy, TR-33169
More informationProperties Of Solutions To A Generalized Liénard Equation With Forcing Term
Applied Mahemaics E-Noes, 8(28), 4-44 c ISSN 67-25 Available free a mirror sies of hp://www.mah.nhu.edu.w/ amen/ Properies Of Soluions To A Generalized Liénard Equaion Wih Forcing Term Allan Kroopnick
More informationClassification of 3-Dimensional Complex Diassociative Algebras
Malayian Journal of Mahemaical Science 4 () 41-54 (010) Claificaion of -Dimenional Complex Diaociaive Algebra 1 Irom M. Rihiboev, Iamiddin S. Rahimov and Wiriany Bari 1,, Iniue for Mahemaical Reearch,,
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationOn certain subclasses of close-to-convex and quasi-convex functions with respect to k-symmetric points
J. Mah. Anal. Appl. 322 26) 97 6 www.elevier.com/locae/jmaa On cerain ubclae o cloe-o-convex and quai-convex uncion wih repec o -ymmeric poin Zhi-Gang Wang, Chun-Yi Gao, Shao-Mou Yuan College o Mahemaic
More informationarxiv: v1 [math.fa] 9 Dec 2018
AN INVERSE FUNCTION THEOREM CONVERSE arxiv:1812.03561v1 [mah.fa] 9 Dec 2018 JIMMIE LAWSON Absrac. We esablish he following converse of he well-known inverse funcion heorem. Le g : U V and f : V U be inverse
More informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More informationSoviet Rail Network, 1955
Sovie Rail Nework, 1 Reference: On he hiory of he ranporaion and maximum flow problem. Alexander Schrijver in Mah Programming, 1: 3,. Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic
More informationTHE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.
THE BERNOULLI NUMBERS The Bernoulli numbers are defined here by he exponenial generaing funcion ( e The firs one is easy o compue: (2 and (3 B 0 lim 0 e lim, 0 e ( d B lim 0 d e +e e lim 0 (e 2 lim 0 2(e
More information13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13.
Chaper 3 The Laplace Tranform in Circui Analyi 3. Circui Elemen in he Domain 3.-3 Circui Analyi in he Domain 3.4-5 The Tranfer Funcion and Naural Repone 3.6 The Tranfer Funcion and he Convoluion Inegral
More informationImproved Approximate Solutions for Nonlinear Evolutions Equations in Mathematical Physics Using the Reduced Differential Transform Method
Journal of Applied Mahemaics & Bioinformaics, vol., no., 01, 1-14 ISSN: 179-660 (prin), 179-699 (online) Scienpress Ld, 01 Improved Approimae Soluions for Nonlinear Evoluions Equaions in Mahemaical Physics
More informationSection 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients
Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous
More informationTHE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX
J Korean Mah Soc 45 008, No, pp 479 49 THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX Gwang-yeon Lee and Seong-Hoon Cho Reprined from he Journal of he
More informationFractional Method of Characteristics for Fractional Partial Differential Equations
Fracional Mehod of Characerisics for Fracional Parial Differenial Equaions Guo-cheng Wu* Modern Teile Insiue, Donghua Universiy, 188 Yan-an ilu Road, Shanghai 51, PR China Absrac The mehod of characerisics
More informationMath 10B: Mock Mid II. April 13, 2016
Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.
More informationStability in Distribution for Backward Uncertain Differential Equation
Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn
More information