Báo cáo toán học: "Set-Systems with Restricted Multiple Intersections" ppsx

... Consider the plane PG(2, q) with q odd. A point with coordinates of the form (±1 : ±1 : 0), (0 : ±1 : ±1) o r (±1 : 0 : ±1) is an in terna l point of the conic C with equation X 2 + Y 2 + Z 2 = ... . Eventually this sequence starts to repeat, hence either the cycle has length 2n with i = (2na) + i (mod q + 1), or length 2n + 1 with i = 1 − (2na) − i (mod q + 1). The latter the elect...

Ngày tải lên: 08/08/2014, 12:22

... set-systems with restricted intersection-sizes. The famous Ray- Chaudhuri–Wilson [RCW75] and Frankl–Wilson [FW81] theorems give strong upper bounds for the size of set-systems with restricted ... pages 223–233, 1976. the electronic journal of combinatorics 9 (2002), #R8 10 Set-Systems with Restricted Multiple Intersections Vince Grolmusz Department of Computer Science E¨otv¨os U...

Ngày tải lên: 07/08/2014, 06:23

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... immersion with equal Wirtinger angle θ, then (cf. [7. 8]) PX,PY =cos 2 θX, Y ,X,Y∈ TM, with cos θ a locally Lipschitz function on M ,smoothontheopensetwhereit does not vanish. On an open set without ... generalized Wolfson’s theorem [18] to higher dimensions (i.e. n ≥ 2withequalK¨ahler angles). The author [15] generalized the theorem to submanifolds with parallel mean vector fields b...

Ngày tải lên: 06/08/2014, 05:20

... recall that we are working with the alphabet A = {A, B}. Throughout the rest of this paper we identify the letter A with the differential form dx/x and the letter B with the differential form dx/(1 ... continue our study of multiple zeta values (MZVs), sometimes also called Euler sums or Zagier sums, defined by ζ(s 1 , ,s k ):=  n 1 >n 2 > >n k >0 k  j=1 n −s j j with s j...

Ngày tải lên: 07/08/2014, 06:22

... creates the first 13 be B with top element b, the contents of the working stack just prior to this move be S with top element s, the remaining contents of the input stack be I with top element i, and ... obtained from the other by replacing one rise-fall subsequence with another (in the corresponding part of the operation sequence) without changing the output permutation. For example,...

Ngày tải lên: 07/08/2014, 07:21

...  d ) d , for some  d → 0. 3 Strings with maximally many distinct substrings We close with a solution to a simpler problem, choosing an n-long string A with a maxi- mum number of substrings ... within this section we will redefine the same notation we used before. A string B is a substring of A, B  A, if there is an offset i such that B =(a i+1 ,a i+2 , ,a i+m ). The empty string B ,wit...

Ngày tải lên: 07/08/2014, 08:20

... a recursive construction with base cases G 1 = K 1 and G 2 = P 4 .Lett ≥ 3 and G t−1 be a chordal graph with ω(G t−1 )=t − 1andχ s (G t−1 )=  t 2  .LetP be a path with vertices denoted u 1 , ... construct the gadget graph G (t) by replacing every edge uv of G with a separate copy of K 2,t in such a fashion that u and v are identified with the vertices in the part of size 2. Note th...

Ngày tải lên: 07/08/2014, 08:20

... function with h-blocks of sizes n 1 , ,n k and multitableau λ with tableaux of sizes s 1 , ,s  is equal to the number of zero-dimensional fillings corresponding to a Hessen- berg function with h-blocks ... filled with α is to the left of or directly below the box filled with β, • β is P α . 2. the number of pairs (α, β) in the filling of λ such that • α and β are in the same tableau, •...

Ngày tải lên: 07/08/2014, 13:21