O2@@@@@6K? ?O2@@@@@@@@@@@6K @@@@@@@@@@@@@@@@6K V@@@?@@@@@@@@@@@@@6X ?W2@@@@@@@XI'@@@@@@@@@@)X? W&@@@@@@@@)XV'@@@@@@@@@@)X ?W&@@@@@@@@@@1?V'@@@@@@@@@@1 W&@@@@@@@@@@@@eN@@@@@@@@@@@L? 7@@@@@@@@@@@@@e?@@@@@@@@@@@1? @@@@@@@@@@@@@@e?3@@@@@@@@@@@L ?J@@@@@@@@@@@@@@e?N@@@@@@@@@@@1 ?7@@@@@@@@@@@@@@f@@@@@@@@@@@@ ?@@@@@@@@@@@@@@5e?J@@@@@@@@@@@@ ?@@@@@@@@@@@@@(Ye?7@@@@@@@@@@@@ ?@@@@@@@@@@@@0Y?e?3@@@@@@@@@@@...

The question of scaling of 2MpWI and v W2 as a function of w is discussed. Scaling is verified for a large kinematic range. Also, a new scaling variable which reduces to w in the Bjorken limit is introduced which extends the scaling region. The behavior of crT and us are also discussed as a function of v and q2a Various weighted sum rules of v W2 are evaluated. (Submitted to Phys. Rev. Letters....

Landau-Ginzburg mirror symmetry studies isomorphisms between Aand B-models, which are graded Frobenius algebras that are constructed using a weighted homogeneous polynomial W and a related symmetry group G. Given two polynomials W1, W2 with the same weights and same group G, the corresponding A-models built with (W1,G) and (W2,G) are isomorphic. Though the same result cannot hold in full genera...

© 2014, Springer-Verlag Berlin Heidelberg. In this paper we study local properties of cost and potential functions in optimal transportation. We prove that in a proper normalization process, the cost function is uniformly smooth and converges locally smoothly to a quadratic cost x · y, while the potential function converges to a quadratic function. As applications we obtain the interior W2, p e...

W develop a new local search algorithm for binary optimization problems, whose complexity and performance are explicitly controlled by a parameter Q, measuring the depth of the local search neighborhood. We show that the algorithm is pseudo-polynomial for general cost vector c, and achieves a w2/42w−15 approximation guarantee for set packing problems with exactly w ones in each column of the co...

In this paper, we present a new lower bound on the size of separating hash families of type {wq−1 1 , w2} where w1 < w2. Our result extends the paper by Guo, Stinson and Tran on binary frameproof codes [Des. Codes Crypto. 77 (2015), 301–319]. This bound compares well against known general bounds, and is especially useful when trying to bound the size of strong separating hash families. We also ...

Let cn = 1 n + 1 ( 2n n ) be the nth Catalan number. In this paper, we look at some of the arithmetic properties of cn. For example, we show that w2(cn) ! log log n for all n ! 3 provided that cn is odd, where w2(m) is the Hamming weight (or the binary sum of digits) of the positive integer m. We also determine all instances in which cn is a base 2 palindrome, and prove that the first k odd Cat...

Throughout, w, Γ, and∧ denote the classes of all, entire, and analytic scalar-valued single sequences, respectively. We write w2 for the set of all complex sequences (xmn), where m,n ∈ N is the set of positive integers. Then, w2 is a linear space under the coordinatewise addition and scalar multiplication. Some initial works on double sequence spaces are found in Bromwich [1]. Later on, they we...

By δ and wk denote the minimum degree and minimum degree-sum (weight) of a k-vertex path in a given graph, respectively. For every 3-polytope, w2 6 13 (Kotzig, 1955) and w3 6 21 (Ando, Iwasaki, Kaneko, 1993), where both bounds are sharp. For every 3-polytope with δ > 4, we have sharp bounds w2 6 11 (Lebesgue, 1940) and w3 6 17 (Borodin, 1997). Madaras (2000) proved that every triangulated 3-pol...