NIKOS FRANTZIKINAKIS. N n N where (Φ N) N N is any Følner sequence

Size: px
Start display at page:

Download "NIKOS FRANTZIKINAKIS. N n N where (Φ N) N N is any Følner sequence"

Transcription

1 SOME OPE PROBLEMS O MULTIPLE ERGODIC AVERAGES IKOS FRATZIKIAKIS. Probems reated to poynomia sequences In this section we give a ist of probems reated to the study of mutipe ergodic averages invoving iterates given by poynomia sequences, and reated appications to mutipe recurrence... Powers of a singe transformation. Let P := {p,..., p } be a famiy of integer poynomias that are essentiay distinct, meaning, a poynomias and their differences are nonconstant. First, we consider averages of the form () T p(n) f... T p(n) f, n= where (X, X, µ, T ) is an invertibe measure preserving system and f,..., f L (µ). We remark that a the mean convergence resuts stated in this section work equay we for averages of the form Φ n Φ in pace of the averages n where (Φ ) is any Føner sequence of subsets of. Before discussing some probems reated to the characteristic factors of the averages (), we state a resut of B. Host and B. Kra [32] and A. Leibman [35] that gives usefu information about their structure. Theorem. There exists d = d(p) such that the factor Z d,t is characteristic for mean convergence of the averages (). We emphasize that the vaue of d(p) in the previous statement does not depend on the system or the functions invoved. Given a famiy of poynomias P, we denote by d min (P) the minima vaue of d(p) that works in the previous theorem. This vaue is in genera hard to pin down and depends on the agebraic reations that the poynomias satisfy. For instance, we know that d min ({n, 2n,..., n}) = ([3, 45]), and d min (P) = when P consists of at east two rationay independent poynomias ([22, 24]). But it is not ony inear reations between the poynomias that matter, for instance, we know that d min ({n, 2n, n 2 }) = 2 whie d min ({n, 2n, n 3 }) = ([2, 36]). More exampes of famiies P where d min (P) has been computed can be found in [2, 36]. Furthermore, in [36] a (rather compicated) agorithm is given for computing this vaue. Despite such progress, the foowing is sti open (the probem is impicit in [] and was stated expicity in [36]): Probem. If P 2, show that d min (P) P. Date: March 20.

2 2 IKOS FRATZIKIAKIS The estimate is known when P = 2, 3 ([2]) and it is open for P = 4. The probem is even open when one is restricted to the cass of Wey systems, meaning, systems of the form (T d, B T d, m T d, T ) where T : T d T d is a unipotent affine transformation. We denote with d W min (P) the minimum vaue of d(p) such that the factor Z d(p),t is characteristic for mean convergence of the averages () for a Wey systems (properties of d W min (P) were studied in []). Specia Case of Probem. If P 2, show that d W min (P) P. This probem was first stated in [] (set W (P ) := d W min (P) + in the remark after Proposition 5.3). The estimate is known when P = 2, 3, 4 ([2, 40]) and it is open when P = 5. Interestingy, no exampe is known where d min (P) d W min (P), so it is natura to suspect that these two vaues are aways equa. Probem 2. Show that d min (P) = d W min (P). This probem was first stated in []. The identity is known when P = 3 ([2]) and is open when P = 4. Obviousy one has d W min (P) d min(p). Some bounds in the other direction are given in [36]. Mean convergence of the averages () was estabished after a ong series of intermediate resuts; the papers [26, 6, 7, 8, 28, 4, 30, 3, 45] deat with the important case of inear poynomias, and using the machinery introduced in [3], convergence for arbitrary poynomias was finay obtained by B. Host and B. Kra in [32] except for a few cases that were treated by A. Leibman in [35]. Theorem. Let (X, X, µ, T ) be an invertibe measure preserving system, f,..., f L (µ) be functions, and p,..., p be integer poynomias. Then the averages () converge in the mean as. Furthermore, expicit formuas for the imit can be given for specia famiies of poynomias [44, 22, 24, 2, 36], but no such formua is known for genera famiies of poynomias. In most cases, it is sti unknown whether mean convergence can be boosted to pointwise convergence. We mention two particuar cases that are open: Probem 3. Show that the averages f (T n x) f 2 (T 2n x) f 3 (T 3n x), n= converge pointwise. or the averages f (T n x) f 2 (T n2 x), Pointwise convergence of the averages () is known when = [2] and is aso known when = 2 and both poynomias are inear [3] (see aso [9] for an aternate proof). In a other cases the probem is open even for weak mixing systems. Partia resuts that dea with specia casses of transformations can be found in [, 2, 6, 7, 20, 34, 38, 39]..2. Commuting transformations. Throughout this section (X, X, µ) is a probabiity space, T,..., T : X X are commuting, invertibe measure preserving transformations, f,..., f L (µ) are functions, and p,..., p are poynomias with integer coefficients. We start with the foowing resut of V. Bergeson, B. Host, and B. Kra [9]: n=

3 SOME OPE PROBLEMS O MULTIPLE ERGODIC AVERAGES 3 Theorem. For ergodic systems one has the decomposition f 0 T n f... T n f dµ = (n) + e(n) where ((n)) is an -step nisequence and im n= e(n) = 0. A more genera resut that uses poynomia iterates in pace of the inear iterates was proved recenty in [37]. A key ingredient in the proof of the previous theorem is the fact that the factor Z,T is characteristic for convergence of the averages n= f 0 T n f... T n f dµ. When one uses commuting transformations in pace of powers of the same transformation an anaogous property fais, nevertheess, there are no known exampes of muticorreation sequences of commuting transformations that are genuiney different than nisequences. Probem 4. Is it true that one aways has the decomposition f 0 T n f... T n f dµ = (n) + e(n) where ((n)) is an -step nisequence and im n= e(n) = 0? The question is open even when = 2. otice that we make no ergodicity assumptions, so in particuar this probem is open even when = 2 and T 2 = T 2. We move to some probems reated to convergence properties of mutipe ergodic averages. A very natura probem (stated expicity in [8] but was advertised ong before 996 by H. Furstenberg and others) is to extend the mean convergence resut invoving poynomia iterates of a singe transformation to severa commuting transformations: Probem 5. Show that the averages (2) converge in the mean as. n= T p (n) f... T p (n) Mean convergence is known when the transformations T,..., T are powers of the same transformation ([32, 35]), when the poynomias are inear [42] (with aternate proofs given in [43, 3, 29]), and when the poynomias have distinct degrees [5]. Convergence is aso known for genera famiies of poynomias if one imposes very strong ergodicity assumptions on the transformations [33]. See aso [4, 5] where techniques from [3] have been refined and extended, aiming to eventuay hande the case of genera poynomia iterates. Despite such intense efforts, convergence is sti not known for some simpe famiies of poynomias, for instance, when = 2 and p (n) = p 2 (n) = n 2, or when p (n) = n 2, p 2 (n) = n 2 + n. As mentioned previousy, when a transformations are equa, and the poynomias are essentiay distinct, then characteristic factors of the averages (2) can be chosen to have very specia agebraic structure. For genera commuting transformations this is no onger the case; if one chooses p 2 = p = n, T = T 2, and f 2 = f, then the averages (2) do not converge to 0 uness f = f 2 = 0. The same probem persists when two of the poynomias are pairwise dependent, meaning, some non-trivia inear combination of two of the poynomias is constant. But in a other cases, there is no obvious obstruction to having simpe characteristic factors. f

4 4 IKOS FRATZIKIAKIS Probem 6. Suppose that the poynomias p,..., p Z[t] are pairwise independent. Show that there exists d such that the factors Z d,t,..., Z d,t are characteristic factors for the averages (2). This is known to be the case when the poynomias have distinct degrees [5]. But it is not known for some simpe famiies of integer poynomias, for instance, for the famiy {n 3, n 3 + n} or the famiy {n, n 2, n 2 + n}. Even for weak mixing transformations the probem is open: Specia Case of Probem 6. Suppose that the transformations T,..., T : X X are weak mixing and the poynomias p,..., p Z[t] are pairwise independent. Show that im n= T p (n) f... T p (n) f = f dµ... f dµ. When a transformations are equa and the poynomias are in genera position, characteristic factors for the averages (2) turn out to be extremey simpe [22, 24]: Theorem. Suppose that the poynomias p,..., p Z[t] are rationay independent. Then the rationa Kronecker factor K rat (T ) is a characteristic factor for the averages (). It is very ikey that this resut generaizes to the case of severa commuting transformations: Probem 7. Suppose that the poynomias p,..., p Z[t] are rationay independent. Show that the factors K rat (T ),..., K rat (T ) are characteristic factors for the averages (2). This was proved in [5] when = 2 and p (n) = n. In the same artice a somewhat weaker property was proved for a monomias with distinct degrees. We mention aso a cosey reated mutipe recurrence probem: Probem 8. Suppose that the poynomias p,..., p Z[t] are rationay independent and have zero constant term. Show that for every A X and every ε > 0, there exists n such that (3) µ(a T p (n) A T p (n) A) µ(a) + ε. In fact, the set of integers n for which (3) hods is expected to have bounded gaps. The ower bounds are known when a transformations are equa [23] and they are aso known for genera commuting transformations when the poynomias are monomias with distinct degrees [5]. The resut fais if the poynomias are distinct and pairwise dependent; in this case no fixed power of µ(a) works as a ower bound in (3) for every system and set [9]. On the other hand, the assumption that the poynomias are rationay independent is not necessary, for instance, the resut is expected to work for the famiy of poynomias {n, n 2, n 2 + n} (this is known to be the case when a transformations are equa [2]). We remark that Probem 7 is soved, then the conjectured ower bounds of Probem 8 wi foow rather easiy. Regarding pointwise convergence of mutipe ergodic averages of commuting transformations, progress has been extremey scarce. Even when one uses two commuting transformations and inear iterates convergence is not known in genera. The foowing is a we known open probem: Given a measure preserving system (X, X, µ, T ) we define Krat (T ) = d I T d.

5 SOME OPE PROBLEMS O MULTIPLE ERGODIC AVERAGES 5 Probem 9. Let (X, X, µ) be a probabiity space, T, S : X X be commuting invertibe measure preserving transformations, and f, g L (µ) be functions. Show that the averages converge pointwise. f(t n x) g(s n x) n= For a ist of partia resuts that appy to specia casses of transformations see the ist after Probem ot necessariy commuting transformations. A probems in the previous sections were stated for famiies of transformations that commute. It is very ikey that a positive resuts extend to the case where the transformations generate a nipotent group. For instance, we mention a probem from [0]: Probem 0. Let (X, X, µ) be a probabiity space, T,..., T : X X be invertibe measure preserving transformations that generate a nipotent group, and f,..., f L (µ) be functions. Show that the averages converge in L 2 (µ). T n f... T n f n= Convergence is known when = 2 [0] and is open for = 3. The interested reader shoud ook in [0] for a ist of other cosey reated open probems. See aso [?] for a reated mutipe recurrence resut. When one works with arbitrary famiies of invertibe measure preserving transformations the next resut shows that one cannot expect to have simiar convergence resuts: Theorem. Let a, b: Z \ {0} be sequences. Then there exist invertibe Bernoui measure preserving transformations T and S acting on the same probabiity space (X, X, µ) such that for some f, g L (µ) the averages n= T a(n) f S b(n) g dµ diverge; for some A X with µ(a) > 0 we have T a(n) A S b(n) A = for every n. To construct such exampes it suffices to modify exampes of D. Berend (see Ex 7. in [6]) and H. Furstenberg (page 40 in [27]) that cover the case a(n) = b(n) = n (the detais wi appear in [25]). When a(n) = b(n), it is aso known that given any finitey generated sovabe group G of exponentia growth, there exist invertibe measure preserving transformations T, S, with < T, S > G, and such that and the concusion of the previous theorem hods for those T and S. It is interesting that despite such negative news, once one introduces an extra variabe, severa convergence (and very ikey recurrence) resuts can be extended to arbitrary famiies of measure preserving transformations. We mention an exampe from [4]:

6 6 IKOS FRATZIKIAKIS Theorem. Let (X, X, µ) be a probabiity space, T,..., T : X X be invertibe measure preserving transformations, f,..., f L (µ) be functions, p,..., p be essentiay distinct poynomias, and a (0, /d). Then the averages (4) +a converge pointwise as. f (T m+p(n) x)... f (T m+p (n) x) m, n a One can show that the assumption that the poynomias are essentiay distinct is necessary. It was aso shown in [4] that there exists d such that the factors Z d,t,..., Z d,t are characteristic for pointwise convergence of the averages (4). Interestingy, the corresponding mutipe recurrence resut (that woud generaize the poynomia Szemerédi theorem) remains open: Probem. Let (X, X, µ) be a probabiity space, T,..., T : X X be invertibe measure preserving transformations, and p,..., p be distinct poynomias with zero constant term. Show that for every A X with µ(a) > 0 we have for some m, n. 2 µ(a T m p (n) A T m p (n) A) > 0 The assumption that the poynomias are distinct is necessary since as mentioned before there exist (non-commuting) transformations T, S, acting on the same probabiity space (X, X, µ), and a set A X with µ(a) > 0 such that µ(t n A S n A) = 0 for every n. The mutipe recurrence property is known to hod when a the transformations are weak mixing [4], but for genera measure preserving systems even some of the simpest cases are open: Specia Case of Probem. Let (X, X, µ) be a probabiity space and T, S, R: X X be invertibe measure preserving transformations. Show that for every A X with µ(a) > 0 there exist m, n such that µ(a T m A S m n A R m 2n A) > 0. References [] I. Assani. Mutipe recurrence and amost sure convergence for weaky mixing dynamica systems. Israe J. Math. 03 (998), -24. [2] I. Assani. Pointwise convergence of nonconventiona averages. Cooq. Math. 02 (2005), no. 2, [3] T. Austin. On the norm convergence of nonconventiona ergodic averages. Ergodic Theory Dynam. Systems 30 (200), [4] T. Austin. Peasant extensions retaining agebraic structure, I. Preprint, arxiv: v4. [5] T. Austin. Peasant extensions retaining agebraic structure, II. Preprint, arxiv: v3. [6] B. Berend. Joint ergodicity and mixing. J. Anayse Math. 45 (985), [7] B. Berend. Mutipe ergodic theorems. J. Anayse Math. 50 (988), [8] V. Bergeson. Ergodic Ramsey Theory an update, Ergodic Theory of Z d -actions (edited by M. Poicott and K. Schmidt). London Math. Soc. Lecture ote Series 228 (996), 6. 2 This woud impy that given a countabe amenabe group G and arbitrary eements a,..., a G, for every E G that has positive upper density with respect to some Føner sequence in G, there exist g M and m, n such that g, a m+p (n) g,..., a m+p (n) g E.

7 SOME OPE PROBLEMS O MULTIPLE ERGODIC AVERAGES 7 [9] V. Bergeson, B. Host, B. Kra, with an appendix by I. Ruzsa. Mutipe recurrence and nisequences. Inventiones Math. 60 (2005), no. 2, [0] V. Bergeson, A. Leibman. A nipotent Roth theorem. Inventiones Mathematicae 47 (2002), [] V. Bergeson, A. Leibman, E. Lesigne. Compexities of finite famiies of poynomias, Wey systems, and constructions in combinatoria number theory. J. Anayse Math. 03 (2007), [2] J. Bourgain. On the maxima ergodic theorem for certain subsets of the positive integers. Israe J. Math. 6 (988), [3] J. Bourgain. Doube recurrence and amost sure convergence. J. Reine Angew. Math. 404 (990), [4] Q. Chu,. Franzikinakis. Pointwise convergence for cubic and poynomia ergodic averages of noncommuting transformations. To appear in Ergodic Theory Dynam. Systems, arxiv: [5] Q. Chu,. Franzikinakis, B. Host. Ergodic averages of commuting transformations with distinct degree poynomia iterates. To appear in Proc. Lond. Math. Soc., arxiv: [6] J-P. Conze, E. Lesigne. Théorèmes ergodiques pour des mesures diagonaes. Bu. Soc. Math. France 2 (984), no. 2, [7] J-P. Conze, E. Lesigne. Sur un théorème ergodique pour des mesures diagonaes. Probabiités, Pub. Inst. Rech. Math. Rennes, 987-, Univ. Rennes I, Rennes, (988), 3. [8] J-P. Conze, E. Lesigne. Sur un théorème ergodique pour des mesures diagonaes. C. R. Acad. Sci. Paris, Série I 306 (988), [9] C. Demeter. Pointwise convergence of the ergodic biinear Hibert transform. Iinois J. Math. 5 (2007), no. 4, [20] J-M. Derrien, E. Lesigne. Un théorème ergodique poynomia ponctue pour es endomorphismes exacts et es K-systèmes. Ann. Inst. H. Poincaré Probab. Statist. 32 (996), no. 6, [2]. Frantzikinakis. Mutipe ergodic averages for three poynomias and appications. Trans. Amer. Math. Soc. 360 (2008), no. 0, [22]. Frantzikinakis, B. Kra. Poynomia averages converge to the product of integras. Isr. J. Math. 48 (2005), [23]. Frantzikinakis, B. Kra. Convergence of mutipe ergodic averages for some commuting transformations. Ergodic Theory Dynam. Systems 25 (2005), no. 3, [24]. Frantzikinakis, B. Kra. Ergodic averages for independent poynomias and appications. J. London Math. Soc. 74 (2006), no., [25]. Frantzikinakis, E. Lesigne, M. Wierd. Random sequences and pointwise convergence of mutipe ergodic averages. Preprint, arxiv: [26] H. Furstenberg. Ergodic behavior of diagona measures and a theorem of Szemerédi on arithmetic progressions. J. Anayse Math. 3 (977), [27] H. Furstenberg. Recurrence in ergodic theory and combinatoria number theory. Princeton University Press, Princeton, 98. [28] H. Furstenberg, B. Weiss. A mean ergodic theorem for (/) n= f(t n x) g(t n2 x). Convergence in ergodic theory and probabiity (Coumbus, OH, 993), Ohio State Univ. Math. Res. Inst. Pub., 5, de Gruyter, Berin, (996), [29] B. Host. Ergodic seminorms for commuting transformations and appications. S tudia Math. 95 () (2009), [30] B. Host, B. Kra. Convergence of Conze-Lesigne averages. Ergodic Theory Dynam. Systems 2 (200), no. 2, [3] B. Host, B. Kra. on-conventiona ergodic averages and nimanifods. Annas Math. 6 (2005), [32] B. Host, B. Kra. Convergence of poynomia ergodic averages. Isr. J. Math. 49 (2005), 9. [33] M. Johnson. Convergence of poynomia ergodic averages for some commuting transformations. Iinois J. Math. 53 (2009), no. 3, [34] A. Leibman. Pointwise convergence of ergodic averages for poynomia sequences of rotations of a nimanifod. Ergodic Theory Dynam. Systems 25 (2005), no., [35] A. Leibman. Convergence of mutipe ergodic averages aong poynomias of severa variabes. Isr. J. Math. 46 (2005), [36] A. Leibman. Orbit of the diagona in the power of a nimanifod. Trans. Amer. Math. Soc. 362 (200),

8 8 IKOS FRATZIKIAKIS [37] A. Leibman. Mutipe poynomia sequences and nisequences. To appear in Ergodic Theory Dynam. Systems. [38] E. Lesigne. Équations fonctionnees, coupages de produits gauches et théorèmes ergodiques pour mesures diagonaes. Bu. Soc. Math. France 2 (993), no. 3, [39] E. Lesigne, B. Rittaud, T. de a Rue. Weak disjointness of measure preserving dynamica systems. Ergodic Theory Dynam. Systems 23 (2003), [40] D. McCendon. On the maxima Wey compexity of famiies of four poynomias. Preprint, Avaiabe at dmm/papers/fourpoynomias.pdf [4] D. Rudoph. Eigenfunctions of T S and the Conze-Lesigne agebra. Ergodic theory and its connections with harmonic anaysis (Aexandria, 993). London Math. Soc. Lecture ote Ser., 205, Cambridge Univ. Press, Cambridge, (995), [42] T. Tao. orm convergence of mutipe ergodic averages for commuting transformations. Ergodic Theory Dynam. Systems 28 (2008), no. 2, [43] H. Towsner. Convergence of diagona ergodic averages. Ergodic Theory Dynam. Systems 29 (2009), [44] T. Zieger. A nonconventiona ergodic theorem for a nisystem. Ergodic Theory Dynam. Systems 25 (2005), no. 4, [45] T. Zieger. Universa characteristic factors and Furstenberg averages. J. Amer. Math. Soc. 20 (2007), (ikos Frantzikinakis) University of Crete, Department of mathematics, Knossos Avenue, Herakion 7409, Greece E-mai address: frantzikinakis@gmai.com

POINCARÉ RECURRENCE AND NUMBER THEORY: THIRTY YEARS LATER

POINCARÉ RECURRENCE AND NUMBER THEORY: THIRTY YEARS LATER POINCARÉ RECURRENCE AND NUMBER THEORY: THIRTY YEARS LATER BRYNA KRA Hillel Furstenberg s 1981 article in the Bulletin gives an elegant introduction to the interplay between dynamics and number theory,

More information

A Brief Introduction to Markov Chains and Hidden Markov Models

A Brief Introduction to Markov Chains and Hidden Markov Models A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,

More information

(f) is called a nearly holomorphic modular form of weight k + 2r as in [5].

(f) is called a nearly holomorphic modular form of weight k + 2r as in [5]. PRODUCTS OF NEARLY HOLOMORPHIC EIGENFORMS JEFFREY BEYERL, KEVIN JAMES, CATHERINE TRENTACOSTE, AND HUI XUE Abstract. We prove that the product of two neary hoomorphic Hece eigenforms is again a Hece eigenform

More information

XSAT of linear CNF formulas

XSAT of linear CNF formulas XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open

More information

Restricted weak type on maximal linear and multilinear integral maps.

Restricted weak type on maximal linear and multilinear integral maps. Restricted weak type on maxima inear and mutiinear integra maps. Oscar Basco Abstract It is shown that mutiinear operators of the form T (f 1,..., f k )(x) = R K(x, y n 1,..., y k )f 1 (y 1 )...f k (y

More information

Homogeneity properties of subadditive functions

Homogeneity properties of subadditive functions Annaes Mathematicae et Informaticae 32 2005 pp. 89 20. Homogeneity properties of subadditive functions Pá Burai and Árpád Száz Institute of Mathematics, University of Debrecen e-mai: buraip@math.kte.hu

More information

CS229 Lecture notes. Andrew Ng

CS229 Lecture notes. Andrew Ng CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view

More information

C. Fourier Sine Series Overview

C. Fourier Sine Series Overview 12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a

More information

From combinatorics to ergodic theory and back again

From combinatorics to ergodic theory and back again From combinatorics to ergodic theory and back again Bryna Kra Abstract. Multiple ergodic averages, such as the average of expressions like f 1(T n x) f 2(T 2n x)... f k (T kn x), were first studied in

More information

Separation of Variables and a Spherical Shell with Surface Charge

Separation of Variables and a Spherical Shell with Surface Charge Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation

More information

MIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI

MIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI MIXING AUTOMORPHISMS OF COMPACT GROUPS AND A THEOREM OF SCHLICKEWEI KLAUS SCHMIDT AND TOM WARD Abstract. We prove that every mixing Z d -action by automorphisms of a compact, connected, abeian group is

More information

Integrating Factor Methods as Exponential Integrators

Integrating Factor Methods as Exponential Integrators Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been

More information

THE PARTITION FUNCTION AND HECKE OPERATORS

THE PARTITION FUNCTION AND HECKE OPERATORS THE PARTITION FUNCTION AND HECKE OPERATORS KEN ONO Abstract. The theory of congruences for the partition function p(n depends heaviy on the properties of haf-integra weight Hecke operators. The subject

More information

2M2. Fourier Series Prof Bill Lionheart

2M2. Fourier Series Prof Bill Lionheart M. Fourier Series Prof Bi Lionheart 1. The Fourier series of the periodic function f(x) with period has the form f(x) = a 0 + ( a n cos πnx + b n sin πnx ). Here the rea numbers a n, b n are caed the Fourier

More information

The EM Algorithm applied to determining new limit points of Mahler measures

The EM Algorithm applied to determining new limit points of Mahler measures Contro and Cybernetics vo. 39 (2010) No. 4 The EM Agorithm appied to determining new imit points of Maher measures by Souad E Otmani, Georges Rhin and Jean-Marc Sac-Épée Université Pau Veraine-Metz, LMAM,

More information

Transcendence of stammering continued fractions. Yann BUGEAUD

Transcendence of stammering continued fractions. Yann BUGEAUD Transcendence of stammering continued fractions Yann BUGEAUD To the memory of Af van der Poorten Abstract. Let θ = [0; a 1, a 2,...] be an agebraic number of degree at east three. Recenty, we have estabished

More information

Selmer groups and Euler systems

Selmer groups and Euler systems Semer groups and Euer systems S. M.-C. 21 February 2018 1 Introduction Semer groups are a construction in Gaois cohomoogy that are cosey reated to many objects of arithmetic importance, such as cass groups

More information

arxiv: v1 [math.nt] 12 Feb 2019

arxiv: v1 [math.nt] 12 Feb 2019 Degenerate centra factoria numbers of the second ind Taeyun Kim, Dae San Kim arxiv:90.04360v [math.nt] Feb 09 In this paper, we introduce the degenerate centra factoria poynomias and numbers of the second

More information

Theory of Generalized k-difference Operator and Its Application in Number Theory

Theory of Generalized k-difference Operator and Its Application in Number Theory Internationa Journa of Mathematica Anaysis Vo. 9, 2015, no. 19, 955-964 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/10.12988/ijma.2015.5389 Theory of Generaized -Difference Operator and Its Appication

More information

Lecture Note 3: Stationary Iterative Methods

Lecture Note 3: Stationary Iterative Methods MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or

More information

CONVERGENCE OF MULTIPLE ERGODIC AVERAGES FOR SOME COMMUTING TRANSFORMATIONS

CONVERGENCE OF MULTIPLE ERGODIC AVERAGES FOR SOME COMMUTING TRANSFORMATIONS CONVERGENCE OF MULTIPLE ERGODIC AVERAGES FOR SOME COMMUTING TRANSFORMATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. We prove the L 2 convergence for the linear multiple ergodic averages of commuting

More information

Mat 1501 lecture notes, penultimate installment

Mat 1501 lecture notes, penultimate installment Mat 1501 ecture notes, penutimate instament 1. bounded variation: functions of a singe variabe optiona) I beieve that we wi not actuay use the materia in this section the point is mainy to motivate the

More information

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES

MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is

More information

Algorithms to solve massively under-defined systems of multivariate quadratic equations

Algorithms to solve massively under-defined systems of multivariate quadratic equations Agorithms to sove massivey under-defined systems of mutivariate quadratic equations Yasufumi Hashimoto Abstract It is we known that the probem to sove a set of randomy chosen mutivariate quadratic equations

More information

The Partition Function and Ramanujan Congruences

The Partition Function and Ramanujan Congruences The Partition Function and Ramanujan Congruences Eric Bucher Apri 7, 010 Chapter 1 Introduction The partition function, p(n), for a positive integer n is the number of non-increasing sequences of positive

More information

Consistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems

Consistent linguistic fuzzy preference relation with multi-granular uncertain linguistic information for solving decision making problems Consistent inguistic fuzzy preference reation with muti-granuar uncertain inguistic information for soving decision making probems Siti mnah Binti Mohd Ridzuan, and Daud Mohamad Citation: IP Conference

More information

ADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING. Ilwoo Cho

ADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING. Ilwoo Cho Opuscua Math. 38, no. 2 208, 39 85 https://doi.org/0.7494/opmath.208.38.2.39 Opuscua Mathematica ADELIC ANALYSIS AND FUNCTIONAL ANALYSIS ON THE FINITE ADELE RING Iwoo Cho Communicated by.a. Cojuhari Abstract.

More information

arxiv: v3 [math.ds] 16 Apr 2011

arxiv: v3 [math.ds] 16 Apr 2011 RADOM SEQUECES AD POITWISE COVERGECE OF MULTIPLE ERGODIC AVERAGES arxiv:02.30v3 [math.ds] 6 Apr 20. FRATZIKIAKIS, E. LESIGE, AD M. WIERDL Abstract. We prove pointwise convergence, as, for the multiple

More information

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons

Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Expectation-Maximization for Estimating Parameters for a Mixture of Poissons Brandon Maone Department of Computer Science University of Hesini February 18, 2014 Abstract This document derives, in excrutiating

More information

4 Separation of Variables

4 Separation of Variables 4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE

More information

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model

Appendix of the Paper The Role of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Model Appendix of the Paper The Roe of No-Arbitrage on Forecasting: Lessons from a Parametric Term Structure Mode Caio Ameida cameida@fgv.br José Vicente jose.vaentim@bcb.gov.br June 008 1 Introduction In this

More information

Volume 13, MAIN ARTICLES

Volume 13, MAIN ARTICLES Voume 13, 2009 1 MAIN ARTICLES THE BASIC BVPs OF THE THEORY OF ELASTIC BINARY MIXTURES FOR A HALF-PLANE WITH CURVILINEAR CUTS Bitsadze L. I. Vekua Institute of Appied Mathematics of Iv. Javakhishvii Tbiisi

More information

Reliability: Theory & Applications No.3, September 2006

Reliability: Theory & Applications No.3, September 2006 REDUNDANCY AND RENEWAL OF SERVERS IN OPENED QUEUING NETWORKS G. Sh. Tsitsiashvii M.A. Osipova Vadivosto, Russia 1 An opened queuing networ with a redundancy and a renewa of servers is considered. To cacuate

More information

K p q k(x) K n(x) x X p

K p q k(x) K n(x) x X p oc 5. Lecture 5 5.1. Quien s ocaization theorem and Boch s formua. Our next topic is a sketch of Quien s proof of Boch s formua, which is aso a a brief discussion of aspects of Quien s remarkabe paper

More information

Partial permutation decoding for MacDonald codes

Partial permutation decoding for MacDonald codes Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics

More information

The Group Structure on a Smooth Tropical Cubic

The Group Structure on a Smooth Tropical Cubic The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,

More information

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents

MARKOV CHAINS AND MARKOV DECISION THEORY. Contents MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After

More information

ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS

ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemerédi s Theorem states that a set of integers with positive upper density contains arbitrarily

More information

Co-degree density of hypergraphs

Co-degree density of hypergraphs Co-degree density of hypergraphs Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Iinois at Chicago Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics

More information

CONVERGENCE OF POLYNOMIAL ERGODIC AVERAGES

CONVERGENCE OF POLYNOMIAL ERGODIC AVERAGES CONVERGENCE OF POLYNOMIAL ERGODIC AVERAGES BERNARD HOST AND BRYNA KRA Abstract. We prove the L 2 convergence for an ergodic average of a product of functions evaluated along polynomial times in a totally

More information

Problem set 6 The Perron Frobenius theorem.

Problem set 6 The Perron Frobenius theorem. Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator

More information

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues

Smoothness equivalence properties of univariate subdivision schemes and their projection analogues Numerische Mathematik manuscript No. (wi be inserted by the editor) Smoothness equivaence properties of univariate subdivision schemes and their projection anaogues Phiipp Grohs TU Graz Institute of Geometry

More information

Nearly Optimal Constructions of PIR and Batch Codes

Nearly Optimal Constructions of PIR and Batch Codes arxiv:700706v [csit] 5 Jun 07 Neary Optima Constructions of PIR and Batch Codes Hia Asi Technion - Israe Institute of Technoogy Haifa 3000, Israe shea@cstechnionaci Abstract In this work we study two famiies

More information

A UNIVERSAL METRIC FOR THE CANONICAL BUNDLE OF A HOLOMORPHIC FAMILY OF PROJECTIVE ALGEBRAIC MANIFOLDS

A UNIVERSAL METRIC FOR THE CANONICAL BUNDLE OF A HOLOMORPHIC FAMILY OF PROJECTIVE ALGEBRAIC MANIFOLDS A UNIERSAL METRIC FOR THE CANONICAL BUNDLE OF A HOLOMORPHIC FAMILY OF PROJECTIE ALGEBRAIC MANIFOLDS DROR AROLIN Dedicated to M Saah Baouendi on the occasion of his 60th birthday 1 Introduction In his ceebrated

More information

From combinatorics to ergodic theory and back again

From combinatorics to ergodic theory and back again From combinatorics to ergodic theory and back again Bryna Kra Abstract. Multiple ergodic averages, such as the average of expressions like f (T n x) f 2 (T 2n x)...f k (T kn x), were first studied in the

More information

Formulas for Angular-Momentum Barrier Factors Version II

Formulas for Angular-Momentum Barrier Factors Version II BNL PREPRINT BNL-QGS-06-101 brfactor1.tex Formuas for Anguar-Momentum Barrier Factors Version II S. U. Chung Physics Department, Brookhaven Nationa Laboratory, Upton, NY 11973 March 19, 2015 abstract A

More information

Small generators of function fields

Small generators of function fields Journa de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Sma generators of function fieds par Martin Widmer Résumé. Soit K/k une extension finie d un corps goba, donc K contient un éément primitif

More information

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA

T.C. Banwell, S. Galli. {bct, Telcordia Technologies, Inc., 445 South Street, Morristown, NJ 07960, USA ON THE SYMMETRY OF THE POWER INE CHANNE T.C. Banwe, S. Gai {bct, sgai}@research.tecordia.com Tecordia Technoogies, Inc., 445 South Street, Morristown, NJ 07960, USA Abstract The indoor power ine network

More information

Generalized Bell polynomials and the combinatorics of Poisson central moments

Generalized Bell polynomials and the combinatorics of Poisson central moments Generaized Be poynomias and the combinatorics of Poisson centra moments Nicoas Privaut Division of Mathematica Sciences Schoo of Physica and Mathematica Sciences Nanyang Technoogica University SPMS-MAS-05-43,

More information

RESEARCH STATEMENT WENBO SUN

RESEARCH STATEMENT WENBO SUN RESEARCH STATEMENT WENBO SUN My research focus is on ergodic theory, especially on problems that are at the intersection of dynamics, combinatorics, harmonic analysis, and number theory. To be more precise,

More information

Cryptanalysis of PKP: A New Approach

Cryptanalysis of PKP: A New Approach Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in

More information

Statistical Learning Theory: A Primer

Statistical Learning Theory: A Primer Internationa Journa of Computer Vision 38(), 9 3, 2000 c 2000 uwer Academic Pubishers. Manufactured in The Netherands. Statistica Learning Theory: A Primer THEODOROS EVGENIOU, MASSIMILIANO PONTIL AND TOMASO

More information

An explicit Jordan Decomposition of Companion matrices

An explicit Jordan Decomposition of Companion matrices An expicit Jordan Decomposition of Companion matrices Fermín S V Bazán Departamento de Matemática CFM UFSC 88040-900 Forianópois SC E-mai: fermin@mtmufscbr S Gratton CERFACS 42 Av Gaspard Coriois 31057

More information

Explicit overall risk minimization transductive bound

Explicit overall risk minimization transductive bound 1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,

More information

221B Lecture Notes Notes on Spherical Bessel Functions

221B Lecture Notes Notes on Spherical Bessel Functions Definitions B Lecture Notes Notes on Spherica Besse Functions We woud ike to sove the free Schrödinger equation [ h d r R(r) = h k R(r). () m r dr r m R(r) is the radia wave function ψ( x) = R(r)Y m (θ,

More information

Week 6 Lectures, Math 6451, Tanveer

Week 6 Lectures, Math 6451, Tanveer Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n

More information

On the New q-extension of Frobenius-Euler Numbers and Polynomials Arising from Umbral Calculus

On the New q-extension of Frobenius-Euler Numbers and Polynomials Arising from Umbral Calculus Adv. Studies Theor. Phys., Vo. 7, 203, no. 20, 977-99 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/0.2988/astp.203.390 On the New -Extension of Frobenius-Euer Numbers and Poynomias Arising from Umbra

More information

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with?

Bayesian Learning. You hear a which which could equally be Thanks or Tanks, which would you go with? Bayesian Learning A powerfu and growing approach in machine earning We use it in our own decision making a the time You hear a which which coud equay be Thanks or Tanks, which woud you go with? Combine

More information

MONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES

MONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES MONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES ANDRZEJ DUDEK AND ANDRZEJ RUCIŃSKI Abstract. For positive integers k and, a k-uniform hypergraph is caed a oose path of ength, and denoted by

More information

14 Separation of Variables Method

14 Separation of Variables Method 14 Separation of Variabes Method Consider, for exampe, the Dirichet probem u t = Du xx < x u(x, ) = f(x) < x < u(, t) = = u(, t) t > Let u(x, t) = T (t)φ(x); now substitute into the equation: dt

More information

Establishment of Weak Conditions for Darboux- Goursat-Beudon Theorem

Establishment of Weak Conditions for Darboux- Goursat-Beudon Theorem Georgia Southern University Digita Commons@Georgia Southern Mathematica Sciences Facuty Pubications Department of Mathematica Sciences 2009 Estabishment of Weak Conditions for Darboux- Goursat-Beudon Theorem

More information

Research Article Numerical Range of Two Operators in Semi-Inner Product Spaces

Research Article Numerical Range of Two Operators in Semi-Inner Product Spaces Abstract and Appied Anaysis Voume 01, Artice ID 846396, 13 pages doi:10.1155/01/846396 Research Artice Numerica Range of Two Operators in Semi-Inner Product Spaces N. K. Sahu, 1 C. Nahak, 1 and S. Nanda

More information

4 1-D Boundary Value Problems Heat Equation

4 1-D Boundary Value Problems Heat Equation 4 -D Boundary Vaue Probems Heat Equation The main purpose of this chapter is to study boundary vaue probems for the heat equation on a finite rod a x b. u t (x, t = ku xx (x, t, a < x < b, t > u(x, = ϕ(x

More information

Some Measures for Asymmetry of Distributions

Some Measures for Asymmetry of Distributions Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester

More information

Powers of Ideals: Primary Decompositions, Artin-Rees Lemma and Regularity

Powers of Ideals: Primary Decompositions, Artin-Rees Lemma and Regularity Powers of Ideas: Primary Decompositions, Artin-Rees Lemma and Reguarity Irena Swanson Department of Mathematica Sciences, New Mexico State University, Las Cruces, NM 88003-8001 (e-mai: iswanson@nmsu.edu)

More information

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation

Applied Nuclear Physics (Fall 2006) Lecture 7 (10/2/06) Overview of Cross Section Calculation 22.101 Appied Nucear Physics (Fa 2006) Lecture 7 (10/2/06) Overview of Cross Section Cacuation References P. Roman, Advanced Quantum Theory (Addison-Wesey, Reading, 1965), Chap 3. A. Foderaro, The Eements

More information

Completion. is dense in H. If V is complete, then U(V) = H.

Completion. is dense in H. If V is complete, then U(V) = H. Competion Theorem 1 (Competion) If ( V V ) is any inner product space then there exists a Hibert space ( H H ) and a map U : V H such that (i) U is 1 1 (ii) U is inear (iii) UxUy H xy V for a xy V (iv)

More information

A SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS

A SIMPLIFIED DESIGN OF MULTIDIMENSIONAL TRANSFER FUNCTION MODELS A SIPLIFIED DESIGN OF ULTIDIENSIONAL TRANSFER FUNCTION ODELS Stefan Petrausch, Rudof Rabenstein utimedia Communications and Signa Procesg, University of Erangen-Nuremberg, Cauerstr. 7, 958 Erangen, GERANY

More information

$, (2.1) n="# #. (2.2)

$, (2.1) n=# #. (2.2) Chapter. Eectrostatic II Notes: Most of the materia presented in this chapter is taken from Jackson, Chap.,, and 4, and Di Bartoo, Chap... Mathematica Considerations.. The Fourier series and the Fourier

More information

SEMINAR 2. PENDULUMS. V = mgl cos θ. (2) L = T V = 1 2 ml2 θ2 + mgl cos θ, (3) d dt ml2 θ2 + mgl sin θ = 0, (4) θ + g l

SEMINAR 2. PENDULUMS. V = mgl cos θ. (2) L = T V = 1 2 ml2 θ2 + mgl cos θ, (3) d dt ml2 θ2 + mgl sin θ = 0, (4) θ + g l Probem 7. Simpe Penduum SEMINAR. PENDULUMS A simpe penduum means a mass m suspended by a string weightess rigid rod of ength so that it can swing in a pane. The y-axis is directed down, x-axis is directed

More information

Course 2BA1, Section 11: Periodic Functions and Fourier Series

Course 2BA1, Section 11: Periodic Functions and Fourier Series Course BA, 8 9 Section : Periodic Functions and Fourier Series David R. Wikins Copyright c David R. Wikins 9 Contents Periodic Functions and Fourier Series 74. Fourier Series of Even and Odd Functions...........

More information

17 Lecture 17: Recombination and Dark Matter Production

17 Lecture 17: Recombination and Dark Matter Production PYS 652: Astrophysics 88 17 Lecture 17: Recombination and Dark Matter Production New ideas pass through three periods: It can t be done. It probaby can be done, but it s not worth doing. I knew it was

More information

Lecture Notes 4: Fourier Series and PDE s

Lecture Notes 4: Fourier Series and PDE s Lecture Notes 4: Fourier Series and PDE s 1. Periodic Functions A function fx defined on R is caed a periodic function if there exists a number T > such that fx + T = fx, x R. 1.1 The smaest number T for

More information

Approximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation

Approximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation Approximation and Fast Cacuation of Non-oca Boundary Conditions for the Time-dependent Schrödinger Equation Anton Arnod, Matthias Ehrhardt 2, and Ivan Sofronov 3 Universität Münster, Institut für Numerische

More information

A natural differential calculus on Lie bialgebras with dual of triangular type

A natural differential calculus on Lie bialgebras with dual of triangular type Centrum voor Wiskunde en Informatica REPORTRAPPORT A natura differentia cacuus on Lie biagebras with dua of trianguar type N. van den Hijigenberg and R. Martini Department of Anaysis, Agebra and Geometry

More information

THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES

THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia

More information

8 Digifl'.11 Cth:uits and devices

8 Digifl'.11 Cth:uits and devices 8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,

More information

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg yi}@it.uu.se Abstract Deciding the feasibiity

More information

OPERATORS WITH COMMON HYPERCYCLIC SUBSPACES

OPERATORS WITH COMMON HYPERCYCLIC SUBSPACES OPERATORS WITH COMMON HYPERCYCLIC SUBSPACES R. ARON, J. BÈS, F. LEÓN AND A. PERIS Abstract. We provide a reasonabe sufficient condition for a famiy of operators to have a common hypercycic subspace. We

More information

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries

First-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische

More information

arxiv: v3 [math.ac] 7 Dec 2009

arxiv: v3 [math.ac] 7 Dec 2009 SUPERTROPICAL MATRIX ALGEBRA II: SOLVING TROPICAL EQUATIONS ZUR IZHAKIAN AND LOUIS ROWEN arxiv:0902.2159v3 [math.ac] 7 Dec 2009 Abstract. We continue the study of matrices over a supertropica agebra, proving

More information

arxiv: v1 [math.fa] 23 Aug 2018

arxiv: v1 [math.fa] 23 Aug 2018 An Exact Upper Bound on the L p Lebesgue Constant and The -Rényi Entropy Power Inequaity for Integer Vaued Random Variabes arxiv:808.0773v [math.fa] 3 Aug 08 Peng Xu, Mokshay Madiman, James Mebourne Abstract

More information

Higher dimensional PDEs and multidimensional eigenvalue problems

Higher dimensional PDEs and multidimensional eigenvalue problems Higher dimensiona PEs and mutidimensiona eigenvaue probems 1 Probems with three independent variabes Consider the prototypica equations u t = u (iffusion) u tt = u (W ave) u zz = u (Lapace) where u = u

More information

Binomial Transform and Dold Sequences

Binomial Transform and Dold Sequences 1 2 3 47 6 23 11 Journa of Integer Sequences, Vo. 18 (2015), Artice 15.1.1 Binomia Transform and Dod Sequences Kaudiusz Wójcik Department of Mathematics and Computer Science Jagieonian University Lojasiewicza

More information

Lemma 1. Suppose K S is a compact subset and I α is a covering of K. There is a finite subcollection {I j } such that

Lemma 1. Suppose K S is a compact subset and I α is a covering of K. There is a finite subcollection {I j } such that 2 Singuar Integras We start with a very usefu covering emma. Lemma. Suppose K S is a compact subset and I α is a covering of K. There is a finite subcoection {I j } such that. {I j } are disjoint. 2. The

More information

Math 124B January 17, 2012

Math 124B January 17, 2012 Math 124B January 17, 212 Viktor Grigoryan 3 Fu Fourier series We saw in previous ectures how the Dirichet and Neumann boundary conditions ead to respectivey sine and cosine Fourier series of the initia

More information

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection

FFTs in Graphics and Vision. Spherical Convolution and Axial Symmetry Detection FFTs in Graphics and Vision Spherica Convoution and Axia Symmetry Detection Outine Math Review Symmetry Genera Convoution Spherica Convoution Axia Symmetry Detection Math Review Symmetry: Given a unitary

More information

Interpolating function and Stokes Phenomena

Interpolating function and Stokes Phenomena Interpoating function and Stokes Phenomena Masazumi Honda and Dieep P. Jatkar arxiv:504.02276v3 [hep-th] 2 Ju 205 Harish-Chandra Research Institute Chhatnag Road, Jhunsi Aahabad 209, India Abstract When

More information

Legendre Polynomials - Lecture 8

Legendre Polynomials - Lecture 8 Legendre Poynomias - Lecture 8 Introduction In spherica coordinates the separation of variabes for the function of the poar ange resuts in Legendre s equation when the soution is independent of the azimutha

More information

On the estimation of multiple random integrals and U-statistics

On the estimation of multiple random integrals and U-statistics Péter Major On the estimation of mutipe random integras and U-statistics Lecture Note January 9, 2014 Springer Contents 1 Introduction................................................... 1 2 Motivation

More information

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997

Stochastic Automata Networks (SAN) - Modelling. and Evaluation. Paulo Fernandes 1. Brigitte Plateau 2. May 29, 1997 Stochastic utomata etworks (S) - Modeing and Evauation Pauo Fernandes rigitte Pateau 2 May 29, 997 Institut ationa Poytechnique de Grenobe { IPG Ecoe ationae Superieure d'informatique et de Mathematiques

More information

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch

Minimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch The Eighth Internationa Symposium on Operations Research and Its Appications (ISORA 09) Zhangiaie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 402 408 Minimizing Tota Weighted Competion

More information

STABLE GRAPHS BENJAMIN OYE

STABLE GRAPHS BENJAMIN OYE STABLE GRAPHS BENJAMIN OYE Abstract. In Reguarity Lemmas for Stabe Graphs [1] Maiaris and Sheah appy toos from mode theory to obtain stronger forms of Ramsey's theorem and Szemeredi's reguarity emma for

More information

( ) is just a function of x, with

( ) is just a function of x, with II. MULTIVARIATE CALCULUS The first ecture covered functions where a singe input goes in, and a singe output comes out. Most economic appications aren t so simpe. In most cases, a number of variabes infuence

More information

Supersaturation for Ramsey-Turán problems

Supersaturation for Ramsey-Turán problems Supersaturation for Ramsey-Turán probems Dhruv Mubayi Vojtĕch Röd Apri 8, 005 Abstract For an -graph G, the Turán number ex(n, G is the maximum number of edges in an n-vertex -graph H containing no copy

More information

arxiv: v1 [math.co] 12 May 2013

arxiv: v1 [math.co] 12 May 2013 EMBEDDING CYCLES IN FINITE PLANES FELIX LAZEBNIK, KEITH E. MELLINGER, AND SCAR VEGA arxiv:1305.2646v1 [math.c] 12 May 2013 Abstract. We define and study embeddings of cyces in finite affine and projective

More information

Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes

Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes Improved Decoding of Reed-Soomon and Agebraic-Geometric Codes Venkatesan Guruswami Madhu Sudan Abstract Given an error-correcting code over strings of ength n and an arbitrary input string aso of ength

More information

On the Goal Value of a Boolean Function

On the Goal Value of a Boolean Function On the Goa Vaue of a Booean Function Eric Bach Dept. of CS University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 Lisa Heerstein Dept of CSE NYU Schoo of Engineering 2 Metrotech Center, 10th Foor

More information

An Extension of Almost Sure Central Limit Theorem for Order Statistics

An Extension of Almost Sure Central Limit Theorem for Order Statistics An Extension of Amost Sure Centra Limit Theorem for Order Statistics T. Bin, P. Zuoxiang & S. Nadarajah First version: 6 December 2007 Research Report No. 9, 2007, Probabiity Statistics Group Schoo of

More information

On Some Basic Properties of Geometric Real Sequences

On Some Basic Properties of Geometric Real Sequences On Some Basic Properties of eometric Rea Sequences Khirod Boruah Research Schoar, Department of Mathematics, Rajiv andhi University Rono His, Doimukh-791112, Arunacha Pradesh, India Abstract Objective

More information