Báo cáo toán học: "On small dense sets in Galois planes" pptx

Báo cáo toán học: "On small dense sets in Galois planes" pptx

Báo cáo toán học: "On small dense sets in Galois planes" pptx

... saturating sets in small projective geome- tries, European J. Combin. 21 (2000), 563–570. [7] A.A. Davydov, S. Marcugini and F. Pambianco, On saturating sets in projective spaces, J. Combin. Theory ... As well as being a natural geometrical problem, the construction of small dense sets in P G(2, q) is relevant in other areas of Combinatorics, as dense sets are related...
Ngày tải lên : 07/08/2014, 15:23
  • 13
  • 303
  • 0
Báo cáo toán học: "On Efficient Sets in R" potx

Báo cáo toán học: "On Efficient Sets in R" potx

... different if the ordering cone C is not pointed. So one must be careful when applying results in [4] for efficient points in the sense of (1) (as done in [2, p. 291]). For instance, Corollary 3.11 ... intersection of On Efficient Sets in R 2 465 m halfspaces, which contains a line and is therefore not pointed, as long as m<n. For instance, consider for the special case n =2andm = 1 th...
Ngày tải lên : 06/08/2014, 05:20
  • 6
  • 396
  • 0
Báo cáo toán học: " On the interchannel interference in digital communication systems, its impulsive nature, and its mitigation" docx

Báo cáo toán học: " On the interchannel interference in digital communication systems, its impulsive nature, and its mitigation" docx

... online 7 High visibility within the fi eld 7 Retaining the copyright to your article Submit your next manuscript at 7 springeropen.com Nikitin EURASIP Journal on Advances in Signal Processing ... us reexamine the time domain traces of the illustrative measurement outlined in Figure 1. In Figure 3, these traces are expanded to include the first two time derivatives o f the modulating sig...
Ngày tải lên : 20/06/2014, 21:20
  • 10
  • 408
  • 0
Báo cáo toán học: "On a Class of Constant Weight Codes" pptx

Báo cáo toán học: "On a Class of Constant Weight Codes" pptx

... construct a certain non-linear binary code C(q, 2) having (q 2 − q)/2 codewords of length q and weight (q −1)/2 each, for which the Hamming distance between any two distinct codewords is in the range ... F q −rational points. One can view geometrically the equation (4) as a two-sheeted covering of P 1 , ramified in four finite places, corresponding to the 4 linear factors of P (X). The plac...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 348
  • 0
Báo cáo toán học: "On a conjecture concerning dyadic oriented matroids" pptx

Báo cáo toán học: "On a conjecture concerning dyadic oriented matroids" pptx

... disagreement in sign is 5 : 1 (note that this is a smallest matroid that could possibly have this property), and (iv) has a rank- 4 8-element minor where the ratio is 4 : 1 (again, this is a smallest ... of order k. Question 3 Is there an efficient combinatorial algorithm for determining the order of a dyadic oriented matroid? On a conjecture concerning dyadic oriented matroids Matt Scobee De...
Ngày tải lên : 07/08/2014, 06:20
  • 6
  • 215
  • 0
Báo cáo toán học: " On a Partition Function of Richard Stanley" pptx

Báo cáo toán học: " On a Partition Function of Richard Stanley" pptx

... a part of π. The parts of π  in non-increasing order are thus N  i=1 f i (π), N  i=2 f i (π), N  i=3 f i (π), , N  i=N f i (π). (11) Note that some of the entries in this sequence may well be ... z,y −1 ). (15) Proof. We shall in the following be dealing with partitions whose parts are all  some given N.Welet¯π be that partition made up of the parts of π that are <N. In light...
Ngày tải lên : 07/08/2014, 08:22
  • 10
  • 268
  • 0
Báo cáo toán học: "On self-complementary cyclic packing of forests" pptx

Báo cáo toán học: "On self-complementary cyclic packing of forests" pptx

... of putting vertices l, v, w, u are given in Fig. 21 (when x is in A(F 4p )) and Fig. 22 (when x is in B(F 4p )). Observe that when x is in A(F 4p ) we can change the place of x by putting it ... l 2 , v, u}. Details of putting vertices l 1 , l 2 , v, u are given in Fig. 17 (when w is in A(F 4p )) and in Fig. 18 (when w is in B(F 4p )). Observe that when w is in the set A(F 4...
Ngày tải lên : 07/08/2014, 15:23
  • 11
  • 171
  • 0
Báo cáo toán học: "Totally Greedy Coin Sets and Greedy Obstructions" pptx

Báo cáo toán học: "Totally Greedy Coin Sets and Greedy Obstructions" pptx

... coin sets. Finally, we ask about the asymptotics of the density of the set of totally greedy coin sets within the set of greedy coin sets. If G(k, R) denotes the set of all greedy coin sets with ... if a coin set is totally greedy. We begin to explore the theory of greedy obstructions– those coin sets that cannot be extended to greedy coin sets by the addition of coins in larger...
Ngày tải lên : 07/08/2014, 21:20
  • 13
  • 151
  • 0

Xem thêm