Lower Bounds for the Smoothed Number of Pareto optimal Solutions
|
|
- Alisha Edwards
- 6 years ago
- Views:
Transcription
1 Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany Abstract. In 2009, Röglin an Teng showe that the smoothe number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially boune in the number n of variables an the maximum ensity of the semi-ranom input moel for any fixe number of objective functions. Their boun is, however, not very practical because the exponents grow exponentially in the number + 1 of objective functions. In a recent breakthrough, Moitra an O Donnell improve this boun significantly to O n 2 +1/2. An intriguing problem, which Moitra an O Donnell formulate in their paper, is how much further this boun can be improve. The previous lower bouns o not exclue the possibility of a polynomial upper boun whose egree oes not epen on. In this paper we resolve this question by constructing a class of instances with Ωn log1 Θ1/ Pareto optimal solutions in expectation. For the bi-criteria case we present a higher lower boun of Ωn 2 1 Θ1/, which almost matches the known upper boun of On 2. 1 Introuction In multi-criteria optimization problems we are given several objectives an aim at fining a solution that is simultaneously optimal in all of them. In most cases the objectives are conflicting an no such solution exists. The most popular way to eal with this problem is to just concentrate on the relevant solutions. If a solution is ominate by another solution, i.e., it is worse than the other solution in at least one objective an not better in the others, then this solution oes not have to be consiere for our optimization problem. All solutions that are not ominate by any other solution are calle Pareto optimal an form the so-calle Pareto set. For a general introuction to multi-criteria optimization problems, we refer the reaer to the book of Matthias Ehrgott [Ehr05]. Smoothe Analysis For many multi-criteria optimization problems the worstcase size of the Pareto set is exponential. However, worst-case analysis is often too pessimistic, whereas average-case analysis assumes a certain istribution A part of this work was one at Maastricht University an was supporte by a Veni grant from the Netherlans Organisation for Scientific Research.
2 on the input universe. Usually it is har if not impossible to fin a istribution resembling practical instances. Smoothe analysis, introuce by Spielman an Teng [ST04] to explain the efficiency of the simplex algorithm in practice espite its exponential worst-case running time, is a combination of both approaches an has been successfully applie to a variety of fiels like machine learning, numerical analysis, iscrete mathematics, an combinatorial optimization in the past ecae see [ST09] for a survey. Like in a worst-case analysis the moel of smoothe analysis still consiers averserial instances. In contrast to the worst-case moel, however, these instances are subsequently slightly perturbe at ranom, for example by Gaussian noise. This assumption is mae to moel that often the input an algorithm gets is subject to imprecise measurements, rouning errors, or numerical imprecision. In a more general moel of smoothe analysis, introuce by Beier an Vöcking [BV04], the aversary is even allowe to specify the probability istribution of the ranom noise. The influence he can exert is escribe by a parameter enoting the maximum ensity of the noise. Optimization Problems an Smoothe Input Moel Beier an Vöcking [BV04] have initiate the stuy of binary bi-criteria optimization problems. In their moel, which has been extene to multi-criteria problems by Röglin an Teng [RT09], one consiers optimization problems that can be specifie in the following form. There are an arbitrary set S {0, 1} n of solutions an + 1 objective functions w j : S R, j = 0,...,, given. While w 0 can be an arbitrary function, which is to be minimize, the functions w 1,..., w, which are to be maximize, are linear of the form w j s = w j 1 s wns j n for s = s 1,..., s n S. Formally, the problem can be escribe as follows: minimize w 0 s, an maximize w j s for all j = 1,..., subject to s in the feasible region S. As there are no restrictions on the set S of solutions, this moel is quite general an can encoe many well-stuie problems like, e.g., the multi-criteria knapsack, shortest path, or spanning tree problem. Let us remark that the choice which objective functions are to be maximize an minimize is arbitrary an just chosen for ease of presentation. All results also hol for other combinations of objective functions. In the framework of smoothe analysis the coefficients w j 1,..., wj n of the linear functions w j are rawn accoring to aversarial probability ensity functions f i,j : [ 1, 1] R that are boune by the maximum ensity parameter, i.e., f i,j for i = 1,..., n an j = 1,...,. The aversary coul, for example, choose for each coefficient an interval of length 1/ from which it is chosen uniformly at ranom. Hence, the parameter etermines how powerful the aversary is. For large he can specify the coefficients very precisely, an for the smoothe analysis becomes a worst-case analysis. The coefficients are restricte to the interval [ 1, 1] because otherwise, the aversary coul iminish the effect of the perturbation by choosing large coefficients.
3 Previous Work Beier an Vöcking [BV04] showe that for = 1 the expecte size of the Pareto set of the optimization problem above is On 4 regarless of how the set S, the objective function w 0 an the ensities f i,j are chosen. Later, Beier, Röglin, an Vöcking [BRV07] improve this boun to On 2 by analyzing the so-calle loser gap. Röglin an Teng [RT09] generalize the notion of this gap to higher imensions, i.e., 2, an gave the first polynomial boun in n an for the smoothe number of Pareto optimal solutions. Furthermore, they were able to boun higher moments. The egree of the polynomial, however, was Θ. Recently, Moitra an O Donnell [MO10] showe a boun of On 2 +1/2, which is the first polynomial boun for the expecte size of the Pareto set with egree polynomial in. An intriguing problem with which Moitra an O Donnell conclue their paper is whether their upper boun coul be significantly improve, for example to f, n 2. Moitra an O Donnell suspect that for constant there shoul be a lower boun of Ω n. In this paper we resolve this question almost completely. Our Contribution For the bi-criteria case, i.e., = 1, we prove a lower boun of Ω min { n 2 1 Θ1/, 2 Θn}. This is the first boun with epenence on n an an it nearly matches the upper boun Omin { n 2, 2 n}. For 2 we prove a lower boun of Ω min { n log1 Θ1/, 2 Θn}. Note that throughout the paper log enotes the binary logarithm. This is the first boun for the general multi-criteria case. Still, there is a significant gap between this lower boun an the upper boun of Omin { n 2 +1/2, 2 n}, but the exponent of n is nearly log. Hence our lower boun is close to the lower boun of Ω n conjecture by Moitra an O Donnell. Restricte Knapsack Problem To prove the lower bouns state above we consier a variant of the knapsack problem where we have n objects a 1,..., a n, each with a weight w i an a profit vector p i [0, 1] for a positive integer. By a vector s {0, 1} n we escribe which objects to put into the knapsack. In contrast to the unrestricte variant not all combinations of objects are allowe. Instea, all vali combinations are escribe by a set S {0, 1}. We want to simultaneously minimize the total weight an maximize all total profits of a solution s. Thus, the restricte knapsack problem, enote by K S {a 1,..., a n }, can be written as minimize n w i s i, an maximize n p i j s i for all j = 1,..., subject to s in the feasible region S. For S = {0, 1} n we just write K{a 1,..., a n } instea of K S {a 1,..., a n }. Note that the instances of the restricte knapsack problem that we use to prove the lower bouns are not necessarily interesting on its own because they have a somewhat artificial structure. However, they are interesting as they show that the known upper bouns in the general moel cannot be significantly improve.
4 2 The Bi-criteria Case In this section we present a lower boun for the expecte number of Pareto optimal solutions in bi-criteria optimization problems that shows that the upper boun of Beier, Röglin, an Vöcking [BRV07] cannot be significantly improve. Theorem 1. There is a class of instances for the restricte bi-criteria knapsack problem for which the expecte number of Pareto-optimal solutions is lower boune by { Ω min n 2 1 Θ1/, 2 Θn}, where n is the number of objects an is the maximum ensity of the profits probability istributions. Note that the exponents of n an in this boun are asymptotically the same as the exponents in the upper boun Omin { n 2, 2 n} prove by Beier, Röglin, an Vöcking [BRV07]. For our construction we use the following boun from Beier an Vöcking. Theorem 2 [BV04]. Let a 1,..., a n be objects with weights 2 1,..., 2 n an profits p 1,..., p n that are inepenently an uniformly istribute in [0, 1]. Then, the expecte number of Pareto optimal solutions of K{a 1,..., a n } is Ω n 2. Note that scaling all profits oes not change the Pareto set an hence Theorem 2 remains true if the profits are chosen uniformly from [0, a] for an arbitrary a > 0. We will exploit this observation later in our construction. The iea how to create a large Pareto set is what we call the copy step. Let us consier an aitional object b with weight 2 n+1 an fixe profit q. In Figure 1 all solutions are represente by a weight-profit pair in the weight-profit space. The set of solutions using object b can be consiere as the set of solutions that o not use object b, but shifte by 2 n+1, q. If the profit q is chosen sufficiently large, i.e., larger than the sum of the profits of the objects a 1,..., a n, then there is no omination between solutions from ifferent copies an hence the Pareto optimal solutions of K{a 1,..., a n, b} are just the copies of the Pareto optimal solutions of K{a 1,..., a n }. Lemma 3 formalizes this observation. Lemma 3. Let a 1,..., a n be objects with weights 2 1,..., 2 n an non-negative profits p 1,..., p n an let b be an object with weight 2 n+1 an profit q > n p i. Furthermore, let P enote the Pareto set of K{a 1,..., a n } an let P enote the Pareto set of K{a 1,..., a n, b}. Then, P is the isjoint union of P 0 := {s, 0 : s P} an P 1 := {s, 1 : s P} an thus P = 2 P. Now we use the copy iea to construct a large Pareto set. Let a 1,..., a np be objects with weights 2 1,..., 2 np an with profits p 1,..., p np P := [0, 1/] where > 1, an let b 1,..., b nq be objects with weights 2 np+1,..., 2 np+nq an with profits q i Q i := m i m i /, m i ], where m i = n p + 1/ 1 2 1/ 1 i 1. The choice of the intervals Q i is ue to the fact that we have to ensure q i > n p j=1 p j + i 1 j=1 q j to apply Lemma 3 successively for the objects
5 profit 2q n 2i P 1 q 0 P 0 2 n+1 2 n+2 n p i weight Fig. 1. The copy step. The Pareto set P consist of two copies of the Pareto set P. b 1,..., b nq. We will prove this inequality in Lemma 4. More interesting is the fact that the size of an interval Q i is m i / which might be larger than 1/. To explain this consier the case m i > 1 for some inex i. For this inex the interval Q i is not a subset of [ 1, 1] as require for our moel. Instea of avoiing such large values m i by choosing n q small enough, we will split Q i into m i intervals of equal size which must be at least 1/. This so-calle split step will be explaine later. Lemma 4. Let p 1,..., p np for all i = 1,..., n q. P an let q i Q i. Then, q i > n p j=1 p j + i 1 j=1 q j Note that with Lemma 4 we implicitely show that the lower bounaries of the intervals Q i are non-negative. Proof. Using the efinition of m i, we get On the other han we have n p i 1 p j + q j j=1 q i > m i m i m i m i + 1 = 1 = n i 1 p j=1 n p j=1 i j=1 = n p + n p = n p + n p + 1 m j = n i 1 p + j=1 i n p i m i 1 j = n p i 1 1.
6 Combining Theorem 2, Lemma 3 an Lemma 4, we immeiately get a lower boun for the knapsack problem using the objects a 1,..., a np with profits chosen from P an Q i, respectively. an b 1,..., b nq Corollary 5. Let a 1,..., a np an b 1,..., b nq be as above, but the profits p i are chosen uniformly from P an the profits q i are arbitrarily chosen from Q i. Then, the expecte number of Pareto optimal solutions of K{a 1,..., a np, b 1,..., b nq } is Ω n 2 p 2 nq. Proof. Because of Lemma 4, we can apply Lemma 3 for each realization of the profits p 1,..., p np an q 1,..., q nq. This implies that the expecte number of Pareto optimal solutions is 2 nq times the expecte size of the Pareto set of K{a 1,..., a np } which is Ω np 2 accoring to Theorem 2. The profits of the objects b i grow exponentially an leave the interval [0, 1]. As mentione earlier, we resolve this problem by splitting each object b i into k i := m i objects b 1 i,..., b ki i with the same total weight an the same total profit, i.e., each with weight 2 np+i /k i an profit q l i Q i /k i := m i /k i 1/, m i /k i ]. As the intervals Q i are subsets of R +, the intervals Q i /k i are subsets of [0, 1]. It remains to ensure that for any fixe inex i all objects b l i are treate as a group. This can be one by restricting the set S of solutions. Let S i = {0,..., 0, 1,..., 1} {0, 1} ki. Then, the set S of solutions is efine as S := {0, 1} np n q S i. By choosing the set of solutions that way, the objects b 1 i,..., b ki i can be viewe as substitute for object b i. Thus, a irect consequence of Corollary 5 is the following. Corollary 6. Let S, a 1,..., a np an b l i be as above, let the profits p 1,..., p np be chosen uniformly from P an let the profits q 1 i,..., q ki i be chosen uniformly from Q i /k i. Then, the expecte number of Pareto optimal solutions of K S {a 1,..., a np } {b l i : i = 1,..., n q, l = 1,..., k i } is Ω n 2 p 2 nq. The remainer contains just some technical etails. First, we give an upper boun for the number of objects b l i. Lemma 7. The number of objects b l i Proof. The number of objects b l i n q m i = n p = n p + 1 Now we are able to prove Theorem 1. is upper boune by n q + np nq. 1 is n q k i = n q m i n q + n q m i, an nq n q i n p nq
7 Proof Theorem 1. Without loss of generality let n 4 an For the moment let us assume n 1 3. This is the interesting case leaing to the first term in the minimum in Theorem 1. We set ˆn q := log log2 1/ 1 [1, n 1 3 ] an ˆn p := n 1 ˆnq 2 n All inequalities hol because of the bouns on n an. We obtain the numbers n p an n q by rouning, i.e., n p := ˆn p 1 an n q := ˆn q 1. Now we consier objects a 1,..., a np with weights 2 i an profits chosen uniformly from P, an objects b l i, i = 1,..., n q, l = 1,..., k i, with weights 2 np+i /k i an profits chosen uniformly from Q i /k i. Observe that P an all Q i /k i have length 1/ an thus the ensities of all profits are boune by. Let N be the number of all these objects. By Lemma 7, this number is boune by N n p + n q + n p + 1 = ˆn p + ˆn q + ˆn p nq ˆn p + ˆn q + ˆn p + 1 = 2ˆn p + ˆn q + 1 = n. ˆnq Hence, the number N of objects we actually use is at most n, as require. As set of solutions we consier S := {0, 1} np n q S i. Due to Corollary 6, the expecte size of the Pareto set of K S {a 1,..., a np } {b l i : i = 1,..., n q, l = 1,..., k i } is Ω n 2 p 2 nq = Ω ˆn 2 p 2ˆnq = Ω = Ω n 2 1 Θ1/, ˆn 2 p 2 where the last step hols because 1 log 1 + c1 2 2c 2 = 1 log 2 + c1 c 2 log 2 + c1 c 2 log log c Θ 1 = 1 Θ 1 = Ω n 2 2 2c 2 1 log = 1 Θ 1 for any constants c 1, c 2 > 0. We formulate this calculation slightly more general than necessary as we will use it again in the multi-criteria case. For > n 1 3 we construct the same instance as above, but for maximum ensity > 1 where = n 1 3. Since n 4, exists, is unique [ an ,. This yiels ˆn p = ˆn q = n 1 3 an, as above, the expecte size of the Pareto set is Ω ˆn p 2 2ˆn q = Ω n 2 2 Θn = Ω 2 Θn. 3 The Multi-criteria Case In this section we present a lower boun for the expecte number of Pareto optimal solutions in multi-criteria optimization problems. We concentrate our attention to 2 as we iscusse the case = 1 in the previous section.
8 Theorem 8. For any fixe integer 2 there is a class of instances for the restricte + 1-imensional knapsack problem for which the expecte number of Pareto-optimal solutions is lower boune by { Ω min n log1 Θ1/, 2 Θn}, where n is the number of objects an is the maximum ensity of the profit s probability istributions. Unfortunately, Theorem 8 oes not generalize Theorem 1. This is ue to the fact that, though we know an explicit formula for the expecte number of Pareto optimal solutions if all profits are uniformly chosen from [0, 1], we were not able to fin a simple non-trivial lower boun for it. Hence, in the general multi-criteria case, we concentrate on analyzing the copy an split steps. In the bi-criteria case we use an aitional object b to copy the Pareto set see Figure 1. For that we ha to ensure that every solution using this object has higher weight than all solutions without b. The same ha to hol for the profit. Since all profits are in [0, 1], the profit of every solution must be in [0, n]. As the Pareto set of the first n p n/2 objects has profits in [0, n/2], we coul fit n q = Θ log copies of this initial Pareto set into the interval [0, n]. In the multi-criteria case, every solution has a profit in [0, n]. In our construction, the initial Pareto set consists only of a single solution, but we benefit from the fact that the number of mutually non-ominating copies of the initial Pareto set that we can fit into the hypercube [0, n] grows quickly with. Let us consier the case that we have some Pareto set P whose profits lie in some hypercube [0, a]. We will create h copies of this Pareto set; one for every vector x {0, 1} with exactly h = /2 ones. Let x {0, 1} be such a vector. Then we generate the corresponing copy C x of the Pareto set P by shifting it by a + ε in every imension i with x i = 1. If all solutions in these copies have higher weights than the solutions in the initial Pareto set P, then the initial Pareto set stays Pareto optimal. Furthermore, for each pair of copies C x an C y, there is one inex i with x i = 1 an y i = 0. Hence, solutions from C y cannot ominate solutions from C x. Similarly, one can argue that no solution in the initial copy can ominate any solution from C x. This shows that all solutions in copy C x are Pareto optimal. All the copies incluing the initial one have profits in [0, 2a + ε] an together P 1 + h P 2 / solutions. We start with an initial Pareto set of a single solution with profit in [0, 1/], an hence we can make Θ log n copy steps before the hypercube [0, n] is fille. In each of these steps the number of Pareto optimal solutions increases by a factor of at least 2 /, yieling a total number of at least 2 / Θlogn = n Θ log Pareto optimal solutions. In the following, we escribe how these copy steps can be realize in the restricte knapsack problem. Again, we have to make a split step because the profit of every object must be in [0, 1]. Due to such technicalities, the actual boun we prove looks slightly ifferent than the one above. It turns out that we
9 nee before splitting new objects b 1,..., b for each copy step in contrast to the bi-criteria case, where before splitting a single object b was enough. Let n q 1 be an arbitrary positive integer an let 2 be a real. We consier objects b i,j with weights 2 i / h an profit vectors q i,j Q i,j := j 1 k=1 [ 0, m ] i m i m i, m i ] k=j+1 [ 0, m ] i, where m i is recursively efine as m 0 := 0 an m i := 1 i 1 m l + +, i = 1,..., n q. 1 l=0 The explicit formula for this recurrence is m i = + i 2 1, i = 1,..., n q. The -imensional interval Q i,j is of the form that the j th profit of object b i,j is large an all the other profits are small. By using object b i,j the copy of the Pareto set is shifte in irection of the j th unit vector. As mentione in the motivation we will choose exactly h such objects to create aitional copies. To give a better intuition for the form of the single intervals the -imensional interval Q i,j is constructe of we refer the reaer to the explanation in the bicriteria case. Let Hx be the Hamming weight of a 0-1-vector x, i.e., the number of ones in x, an let Ŝ := {x {0, 1} : Hx {0, h }} enote the set of all 0-1-vectors of length with 0 or h ones. As set S of solutions we consier S := Ŝnq. Lemma 9. Let the set S of solutions an the objects b i,j be as above. Then, each solution s S is Pareto optimal for K S {b i,j : i = 1,..., n q, j = 1,..., }. Proof. We show the statement by inuction over n q an iscuss the base case an the inuctive step simultaneously because of similar arguments. Let S := Ŝnq 1 an let s, s nq S Ŝ be an arbitrary solution from S. Note that for n q = 1 we get s = λ, the 0-1-vector of length 0. First we show that there is no omination within one copy, i.e., there is no solution of type s, s nq S that ominates s, s nq. For n q = 1 this is obviously true. For n q 2 the existence of such a solution woul imply that s ominates s in the knapsack problem K S {b i,j : i = 1,..., n q 1, j = 1,..., }. This contraicts the inuctive hypothesis. Now we prove that there is no omination between solutions from ifferent copies, i.e., there is no solution of type s, s n q S with s n q s nq that ominates s, s nq. If s nq = 0, then the total weight of the solution s, s nq is at most n q 1 2 i < 2 nq. The right sie of this inequality is a lower boun for the weight of solution s, s n q because s n q s nq. Hence, s, s n q oes not ominate s, s nq. Finally, let us consier the case s nq 0. There must be an inex j []
10 where s nq j = 1 an s n q j = 0. We show that the j th total profit of s, s nq is higher than the j th profit of s, s n q. The former one is strictly boune from below by m nq m nq /, whereas the latter one is boune from above by n q 1 h 1 m { } i + max mi, m mnq i + h. Solution s, s n q can use at most h objects of each group b i,1,..., b i,. Each of them, except one, can contribute at most mi can contribute either at most mi the n th q by s n q to the j th total profit. One or at most m i. This argument also hols for group, but by the choice of inex j we know that each object chosen contributes at most mi to the j th total profit. It is easy to see that m i / m i because of > 1. Hence, our boun simplifies to n q 1 h 1 m i + m mnq i + h n q 1 mi + 1 nq 1 = 1 = 1 + m i + 1 mn q + 1 m i m nq + 1 nq 1 m i m nq i=0 = 1 m n q + m nq m n q + 1 mnq m nq. This implies that s, s n q oes not ominate s, s nq. m n q + 1 m n q m 0 = 0 Equ. 1 Immeiately, we get a statement about the expecte number of Pareto optimal solutions if we ranomize. Corollary 10. Let S an b i,j be as above, but the profit vectors q i,j are arbitrarily rawn from Q i,j. Then, the expecte number of Pareto optimal solutions for K S {b i,j : i = 1,..., n q, j = 1,..., } is at least 2 / nq. Proof. This result follows from Lemma 9 an Ŝ = 1 + h = 1 + max,..., i 1 + i / = / 2 /.
11 As in the bi-criteria case we now split each object b i,j into k i := m i objects b 1 i,j,..., bki i,j with weights 2 i /k i h an with profit vectors q l i,j Q i,j/k i := j 1 k=1 [ 0, 1 ] mi 1 k i, m ] i k i k=j+1 [ 0, 1 ]. Then, we aapt our set S of solutions such that for any fixe inices i an j either all objects b 1 i,j,..., bki i,j are put into the knapsack or none of them. Corollary 10 yiels the following result. Corollary 11. Let S an b l i,j be as escribe above, but let the profit vectors p 1 i,j,..., pki i,j be chosen uniformly from Q i,j /k i. Then, the expecte number of Pareto optimal solutions of K S {b l i,j : i = 1,..., n q, j = 1,...,, l = 1,..., k i } is at least 2 / nq. Still, the lower boun is expresse in n q an not in the number of objects use. So the next step is to analyze the number of objects. Lemma 12. The number of objects b l i,j is upper boune by n q nq. Proof. The number of objects b l i,j is n q k i = n q m i n q + nq m i, an n q m i + n q 2 Now we can prove Theorem 8. i 2 + nq nq 2 = 2 1 nq. 2 Proof. Without loss of generality let n 16 an 2. For the moment let us n assume 42 n 2 2. This is the interesting case leaing to the first term in the minimum in Theorem 8. We set ˆn q := log n 4 log 2 2 [ 1, n 2] an obtain n q := ˆn q 1 by rouning. All inequalities hol because of the bouns on n an. Now we consier objects b l i,j, i = 1,..., n q, j = 1,...,, l = 1,..., k i, with weights 2 i /k i an profit vectors q i,j chosen uniformly from Q i,j /k i. All these intervals have length 1/ an hence all ensities are boune by. Let N be the number of objects. By Lemma 12, this number is boune by N n q + ˆn q + 22 nq ˆnq 2 ˆn q n 4 2 n.
12 Hence, the number N of objects we actually use is at most n, as require. As set S of solutions we use the set escribe above, encoing the copy step an the split step. Due to Corollary 11, for fixe 2 the expecte number of Pareto optimal solutions of K S {b l i,j : i = 1,..., n q, j = 1,...,, l = 1,..., k i } is 2 nq 2 ˆnq log n 4 2 log 2 2 Ω = Ω = Ω n = Ω 4 2 log 2 log 2 = Ω n log1 Θ1/, = Ω n log log 2 where the last step hols because of the same reason as in the proof of Theorem 1. 2 n 2 In the case > 42 n we construct the same instance above, but n for a maximum ensity > where = Since n 16, n the value exists, is unique an [65,. Futhermore, we get ˆn q = n 2. As above, the expecte size of the Pareto set is Ω 2 /ˆnq = Ω 2 / n/2 = Ω 2 Θn. References [BRV07] René Beier, Heiko Röglin, an Berthol Vöcking. The smoothe number of Pareto optimal solutions in bicriteria integer optimization. In Proc. of the 12th Conference on Integer Programming an Combinatorial Optimization IPCO, pages 53 67, [BV04] René Beier an Berthol Vöcking. Ranom knapsack in expecte polynomial time. Journal of Computer an System Sciences, 693: , [Ehr05] Matthias Ehrgott. Multicriteria Optimization. Springer-Verlag, secon eition, [MO10] Ankur Moitra an Ryan O Donnell. Pareto optimal solutions for smoothe analysts. Technical report, CoRR abs/ , To appear in Proc. of the 43r Annual ACM Symposium on Theory of Computing STOC, [RT09] [ST04] [ST09] Heiko Röglin an Shang-Hua Teng. Smoothe analysis of multiobjective optimization. In Proc. of the 50th Ann. IEEE Symp. on Founations of Computer Science FOCS, pages , Daniel A. Spielman an Shang-Hua Teng. Smoothe analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 513: , Daniel A. Spielman an Shang-Hua Teng. Smoothe analysis: an attempt to explain the behavior of algorithms in practice. Communications of the ACM, 5210:76 84, 2009.
Discrete Mathematics
Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationTractability results for weighted Banach spaces of smooth functions
Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationLecture 22. Lecturer: Michel X. Goemans Scribe: Alantha Newman (2004), Ankur Moitra (2009)
8.438 Avance Combinatorial Optimization Lecture Lecturer: Michel X. Goemans Scribe: Alantha Newman (004), Ankur Moitra (009) MultiFlows an Disjoint Paths Here we will survey a number of variants of isjoint
More informationGeneralized Tractability for Multivariate Problems
Generalize Tractability for Multivariate Problems Part II: Linear Tensor Prouct Problems, Linear Information, an Unrestricte Tractability Michael Gnewuch Department of Computer Science, University of Kiel,
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationarxiv: v4 [cs.ds] 7 Mar 2014
Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationCS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves
CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves Tim Roughgarden November 5, 2014 1 Pareto Curves and a Knapsack Algorithm Our next application of smoothed analysis is
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationLower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Lower Bouns for Local Monotonicity Reconstruction from Transitive-Closure Spanners Arnab Bhattacharyya Elena Grigorescu Mahav Jha Kyomin Jung Sofya Raskhonikova Davi P. Wooruff Abstract Given a irecte
More informationCS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms
CS264: Beyond Worst-Case Analysis Lecture #18: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden March 9, 2017 1 Preamble Our first lecture on smoothed analysis sought a better theoretical
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationBIRS Ron Peled (Tel Aviv University) Portions joint with Ohad N. Feldheim (Tel Aviv University)
2.6.2011 BIRS Ron Pele (Tel Aviv University) Portions joint with Oha N. Felheim (Tel Aviv University) Surface: f : Λ Hamiltonian: H(f) DGFF: V f(x) f(y) x~y V(x) x 2. R or for f a Λ a box Ranom surface:
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationProof of SPNs as Mixture of Trees
A Proof of SPNs as Mixture of Trees Theorem 1. If T is an inuce SPN from a complete an ecomposable SPN S, then T is a tree that is complete an ecomposable. Proof. Argue by contraiction that T is not a
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationModelling and simulation of dependence structures in nonlife insurance with Bernstein copulas
Moelling an simulation of epenence structures in nonlife insurance with Bernstein copulas Prof. Dr. Dietmar Pfeifer Dept. of Mathematics, University of Olenburg an AON Benfiel, Hamburg Dr. Doreen Straßburger
More informationSharp Thresholds. Zachary Hamaker. March 15, 2010
Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationA FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS
A FURTHER REFINEMENT OF MORDELL S BOUND ON EXPONENTIAL SUMS TODD COCHRANE, JEREMY COFFELT, AND CHRISTOPHER PINNER 1. Introuction For a prime p, integer Laurent polynomial (1.1) f(x) = a 1 x k 1 + + a r
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationChromatic number for a generalization of Cartesian product graphs
Chromatic number for a generalization of Cartesian prouct graphs Daniel Král Douglas B. West Abstract Let G be a class of graphs. The -fol gri over G, enote G, is the family of graphs obtaine from -imensional
More informationQuantum Search on the Spatial Grid
Quantum Search on the Spatial Gri Matthew D. Falk MIT 2012, 550 Memorial Drive, Cambrige, MA 02139 (Date: December 11, 2012) This paper explores Quantum Search on the two imensional spatial gri. Recent
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationLogarithmic spurious regressions
Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate
More informationBalancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling
Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationLarge Triangles in the d-dimensional Unit-Cube (Extended Abstract)
Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany lefmann@informatik.tu-chemnitz.e Abstract. We consier a variant
More informationApproximate Constraint Satisfaction Requires Large LP Relaxations
Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi
More informationUpper and Lower Bounds on ε-approximate Degree of AND n and OR n Using Chebyshev Polynomials
Upper an Lower Bouns on ε-approximate Degree of AND n an OR n Using Chebyshev Polynomials Mrinalkanti Ghosh, Rachit Nimavat December 11, 016 1 Introuction The notion of approximate egree was first introuce
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationMonte Carlo Methods with Reduced Error
Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for
More informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More informationSome Examples. Uniform motion. Poisson processes on the real line
Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]
More informationGeneralization of the persistent random walk to dimensions greater than 1
PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationResistant Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
Resistant Polynomials an Stronger Lower Bouns for Depth-Three Arithmetical Formulas Maurice J. Jansen University at Buffalo Kenneth W.Regan University at Buffalo Abstract We erive quaratic lower bouns
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationCounting Lattice Points in Polytopes: The Ehrhart Theory
3 Counting Lattice Points in Polytopes: The Ehrhart Theory Ubi materia, ibi geometria. Johannes Kepler (1571 1630) Given the profusion of examples that gave rise to the polynomial behavior of the integer-point
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationMonotonicity for excited random walk in high dimensions
Monotonicity for excite ranom walk in high imensions Remco van er Hofsta Mark Holmes March, 2009 Abstract We prove that the rift θ, β) for excite ranom walk in imension is monotone in the excitement parameter
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationON THE OPTIMAL CONVERGENCE RATE OF UNIVERSAL AND NON-UNIVERSAL ALGORITHMS FOR MULTIVARIATE INTEGRATION AND APPROXIMATION
ON THE OPTIMAL CONVERGENCE RATE OF UNIVERSAL AN NON-UNIVERSAL ALGORITHMS FOR MULTIVARIATE INTEGRATION AN APPROXIMATION MICHAEL GRIEBEL AN HENRYK WOŹNIAKOWSKI Abstract. We stuy the optimal rate of convergence
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationTechnion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.
Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion
More informationCS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms
CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms Tim Roughgarden November 5, 2014 1 Preamble Previous lectures on smoothed analysis sought a better
More informationOn a limit theorem for non-stationary branching processes.
On a limit theorem for non-stationary branching processes. TETSUYA HATTORI an HIROSHI WATANABE 0. Introuction. The purpose of this paper is to give a limit theorem for a certain class of iscrete-time multi-type
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More informationOn combinatorial approaches to compressed sensing
On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationarxiv: v2 [cond-mat.stat-mech] 11 Nov 2016
Noname manuscript No. (will be inserte by the eitor) Scaling properties of the number of ranom sequential asorption iterations neee to generate saturate ranom packing arxiv:607.06668v2 [con-mat.stat-mech]
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationHow to Minimize Maximum Regret in Repeated Decision-Making
How to Minimize Maximum Regret in Repeate Decision-Making Karl H. Schlag July 3 2003 Economics Department, European University Institute, Via ella Piazzuola 43, 033 Florence, Italy, Tel: 0039-0-4689, email:
More informationPhase transitions related to the pigeonhole principle
Phase transitions relate to the pigeonhole principle Michiel De Smet an Anreas Weiermann Smisestraat 92 B 9000 Ghent Belgium ms@michielesmet.eu 2 Department of Mathematics Ghent University Builing S22
More informationConservation Laws. Chapter Conservation of Energy
20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action
More informationExpected Value of Partial Perfect Information
Expecte Value of Partial Perfect Information Mike Giles 1, Takashi Goa 2, Howar Thom 3 Wei Fang 1, Zhenru Wang 1 1 Mathematical Institute, University of Oxfor 2 School of Engineering, University of Tokyo
More informationA LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM
Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationWitt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationStopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Codes
Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC Coes Kaiann Fu an Achilleas Anastasopoulos Electrical Engineering an Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationSolution to the exam in TFY4230 STATISTICAL PHYSICS Wednesday december 1, 2010
NTNU Page of 6 Institutt for fysikk Fakultet for fysikk, informatikk og matematikk This solution consists of 6 pages. Solution to the exam in TFY423 STATISTICAL PHYSICS Wenesay ecember, 2 Problem. Particles
More informationd-dimensional Arrangement Revisited
-Dimensional Arrangement Revisite Daniel Rotter Jens Vygen Research Institute for Discrete Mathematics University of Bonn Revise version: April 5, 013 Abstract We revisit the -imensional arrangement problem
More informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
More informationNew bounds on Simonyi s conjecture
New bouns on Simonyi s conjecture Daniel Soltész soltesz@math.bme.hu Department of Computer Science an Information Theory, Buapest University of Technology an Economics arxiv:1510.07597v1 [math.co] 6 Oct
More informationMultiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials
Multiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials Lutz Kämmerer June 23, 2015 We present a new sampling metho that allows the unique reconstruction of (sparse) multivariate
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More informationAsymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs
Asymptotic etermination of ege-banwith of multiimensional gris an Hamming graphs Reza Akhtar Tao Jiang Zevi Miller. Revise on May 7, 007 Abstract The ege-banwith B (G) of a graph G is the banwith of the
More informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationthere is no special reason why the value of y should be fixed at y = 0.3. Any y such that
25. More on bivariate functions: partial erivatives integrals Although we sai that the graph of photosynthesis versus temperature in Lecture 16 is like a hill, in the real worl hills are three-imensional
More information