Báo cáo toán học: "Orthogonal systems in vector spaces over finite fields" pot

... Vu. Additive Combinatorics. Cambridge University Press, 2006. [15] Le Anh Vinh, On the number of orthogonal systems in vector spaces over finite fields, Electronic Journal of Combinatorics, 15(1) ... a set can be without containing orthogonal k-tuples for k > 2. the electronic journal of combinatorics 15 (2008), #R151 9 Orthogonal systems in vector spaces over finite...

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

... Orthogonal systems in vector spaces over finite fields, preprint (2008), arXiv:0807.0592. the electronic journal of combinatorics 15 (2008), #N32 4 On the number of orthogonal systems in vector spaces over ... the d-dimensional vector space over the finite field with q elements, contains many k-tuple of mutually orthogonal vectors. Using geometric and character sum...

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

... computation, a considerable gain in efficiency over methods which involve some form of post-retrieval filtering. We hope that these preliminary aspects will be initial gains in developing a concrete and effective system ... removing unwanted meanings directly fro m the orig- inal query in vector models, with the same vector negation operator as used in quan- tum logic. Irrelevance...

Ngày tải lên: 17/03/2014, 06:20

... with v 0 in the center and the indices of the spokes increasing as we travel clockwise around the perimeter. Each binomial factor in τ 1 is a radius minus the adjacent chord pointing in the clockwise ... > 2. When the slope variety is considered over F q , the points correspond to drawings, in F q 2 whose slopes are in F q . These drawings need not be in F 2 q . If q = 2, the...

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

... 167–182. 1, 1, 8 [4] , Coverings and Delta-coverings, in Proceedings of the 4th Confer- ence on Integer Programming and Combinatorial Optimization, Copen- hagen, 1995, Springer-Verlag, pp. 228–243. ... circuit contained in M + u. The element u is contained in C and u is supported by V i . Since V 1 separates the essential circuits of P , the support of C is contained in V i . Since th...

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

... function. Theorem 3 is proved by incorporating precise estimates on Stirling numbers of the first kind (as proved in section 3) into the proof of Theorem 1. In reviewing the liter- ature we found ... an upper bound in (4.5) (even adding in the B R,L (σ) terms) for terms with the electronic journal of combinatorics 13 (2006), #R107 18 by the inclusion-exclusion principle, since we must...

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

... on P (n, k), upon decomposing the canonical representations into non-increasing words (i.e., words which contain no rises) instead of decomposing t hem into non-decreasing words as before. Theorem ... then the number corresponding to the slot containing m + 1 must be a minimal element of π (for if not, then the numb er corresponding to the slot containing m would not be minimal as well, which...

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

... = L(S Θ ) = L(S) I , for some collineation I of G. Remark 2.2. If Ψ is an invertible semilinear map of V inducing a collineation in PG(V, F q n ) interchanging the reguli of the quadric Q, then ... where Ψ is an invertible semilinear map of V fixing the invertible elements of V. Now, noting that an invertible semilinear map of V preserves the dimension of the F q vector subspaces, t he res...

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

... metabolic networks. Integrated FBA (iFBA) extends rFBA by integrating kinetic information from ODE models (Covert et al. 2008). Integrated dynamic FBA (idFBA) aims to integrate signaling, regulatory ... Something from nothing – bridging the gap between constraint-based and kinetic modelling. FEBS J 274(21):5576–5585 Smallbone K, Simeonidis E, Swainston N, Mendes P (2010) Towards a genome-scal...

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

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