Báo cáo toán học: "Counting points of slope varieties over finite fields" pdf

... trees of a 5- wheel 3 A bijection between slope vectors and complement- reducible graphs In this section we count the points of S 2 (K n ), the slope variety of K n over F 2 . The points of F ( n 2 ) 2 have ... value the electronic journal of combinatorics 18 (2011), #P3 6 Counting points of slope varieties over finite fields Thomas Enkosky Department of Math...

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

... a systematic description of the prop- erties of related graphs. 1.2 Hyperplane discrepancy problem One of the key features of the proof of this result is the analysis of the following discrepancy problem. ... Anh Vinh, On the number of orthogonal systems in vector spaces over finite fields, Electronic Journal of Combinatorics, 15(1) (2008) N32. [16] T. Ziegler, An applicat...

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

... characteristic points and (a, b) ≤ (c, d). Then (a, b) = (c, d). Thus the set of characteristic points of the system forms an antichain under the partial ordering ≤. Proof. For the proof assume, in view of ... work of (1) determining the branch points (a, b i ) of the algebraic curves C i among the points in X i , and then (2) studying the Puiseux expansions of branches o...

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

... → u ′ then the hole of u ′ is contained in the hole of u, with the vertices of the former a subset of the vertices of the latter. Therefore, every triangulation of the hole of u ′ can be extended ... triangulation of the hole of u. Lemma 3.2. The number of i-vints (i ≥ 3) that charge a fixed 3-v i nt is at most C i−1 − C i−2 , and this bound is tight in the worst case. The...

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

... electronic journal of combinatorics 12 (2005) #R21 20 The combinatorics of orbital varieties closures of nilpotent order 2 in sl n Anna Melnikov* Department of Mathematics, University of Haifa, 31905 ... element of nilpotent order 2 or in other words X 2 =0. Thus, we get a complete combinatorial description of inclusion of orbital varieties closures of nilpotent order 2...

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

... West hands. At the risk of repeating some of the arguments, we mimic the proof of Theorem 6.1. The only essential difference between this proof and the electronic journal of combinatorics 12 (2005), ... the family of trick taking games includes a large variety of games for different numbers of players, among them the game of bridge, by many considered the most intellectually cha...

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

... there is no permutation binomial of degree m over F q . For each other value of m, the number of monic permutation binomials of degree m over F q is the sum of N 3,m and the corresponding entry ... number of monic permutation binomials of a given degree m less than q − 1overF q , in terms of N 1 , N 2 and N 3,m ,whereN 3,m is the number of permutation binomials of the...

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

... F q –linear set L(S) of P = P G(V, F q 3 ) o f rank 6 having a unique point P of weight 2 (and hence a unique p l ane π of P of weight 5) and each other point of weight 1. Moreover, if one of the following ... the semifields of Huang–Johnson, all t he others are not 2-dimensional over their left nucleus. In the literature the only infinite families of semifields of order q 6...

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

... simple zeros of ξ (j) ( 1 2 + it)with0<t<T M r (T )=  ρ (0) =β+iγ m(γ)=r 1 zeros of ξ(σ + it) of multiplicity r with 0 <t<T M ≤r (T )=  ρ (0) =β+iγ m(γ)≤r 1 zeros of ξ(σ + it) of multiplicity ... Theorem. Let N d (T ) be the number of distinct zeros of ξ(s) in the region 0 <t<T.Thatis, N d (T )= ∞  n=1 M n (T ) n . (1) It is conjectured that all of the zer...

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

... y)) a . Proof. Let G = G(x, y, a) and G ′ = G ′ (x, y, a) denote the generating functions for the number of words π of length n over the alphabet [a] according to the numb er of occurrences of τ = ... journal of combinatorics 17 (2010), #R19 21 where C ′ a is the generating function for the number of words π of length n over the alphabet [a − 1] a ccording to the number of...

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