Báo cáo toán học: "Strongly maximal matchings in infinite weighted graphs" pdf

... acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Protection of primary users in dynamically varying radio environment: practical solutions and challenges EURASIP ... investigate suitable methods for reducing the PAPR of NC-OFDM transceivers with the 3 3.2 Windowing Windowing (W) is usually applied to the OFDM symbol time-d...

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

... because the content design of the textbooks of the Chinese language is principally based on the HKCEE grading criteria. Virtually, some Hong Kong people hold the point that training in the use of ... the development of Cantonese teaching will not go in the opposite direction. The Position of Cantonese in the Current Education Policy Cantonese ha...

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

... article as: Nikitin: On the interchannel interference in digital communication systems, its impulsive nature, and its mitigation. EURASIP Journal on Advances in Signal Processing 2011 2011:137. Submit ... originate at the ‘ smoothest ’,mostlinear parts of the modulating signal. The next section clarifies the origins of this impulsive nature of the out...

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

...

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

... class="bi x1 y0 w2 h 1" alt =""

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

... class="bi x0 y0 w1 h 1" alt =""

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

... class="bi x0 y4 w1 h 8" alt =""

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

... 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 ... is efficient w.r.t. C in the sense of (2), while A has no efficient point w.r.t. C in the sense of (1). The set of efficient points of A w.r.t. C is called efficient set and denoted by...

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

... 76 (1984) 236–240. 21. S. Nanda, Strongly almost summable and strongly almost convergent sequences, Acta Math. Hung. 49 (1987) 7176. 22. E. ă Oztăurk and T. Bilgin, Strongly summable sequence spaces ... 1970. Strongly Almost Summable Difference Sequences 339 19. E. Malkowsky and E. Savas, Some λ− sequence spaces defined by a modulus, Arch. Math. 36 (2000) 219–228. 20. S....

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

... The transversals of V are in one-to-one correspondence with the matchings in G covering the part N; and a local replacement in this language corresponds to changing a single edge in the matching. Let ... V n of n-tuples of elements of M forms the Hamming graph; two n-tuples being adjacent whenever they differ in only one coordinate. Ev- ery matroid structure on M determin...

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

... W∈P of the associated partition P can be expressed as a sum of a linearly independent set consisting of other cycles in W and shorter cycles. The motivation for introducing P originated in the ... set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum o...

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

... generate random matchings rather than merely count them, then, given a random bit, a random matching in the before graph is readily transformed into a random matching in the after graph, and conversely, ... v 1 and v 2 of G are connected by an edge, and that f is a face bounded by this edge. The height difference between the diagonal from v 1 to f and the diagonal from v 2 to f is dete...

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

... finite and both its endpoints do not belong to supp(M). It is said to be in nitely improving (or in nitely M-improving) if it is in nite, has one endpoint, and this endpoint does not belong to ... finite K-indifferent path). (ii) For every in nite element R of G  (i.e. for every in nitely K-improving path in G) incident with Q, let k = k(R) be the last edge on R that lies in K and is i...

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

... characteristic map to translate the character theory of the finite unitary grou ps into the language of symmetric functions, we study degenerate Gelfand–Graev characters of the finite unitary group from a ... the proof of Theorem 5.2. Therefore, Q is exactly the battery tableau obtained in the proof of Theorem 5.2, and so we have χ λ , Γ (k,ν)  = 1. Not...

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

... words. 1 Words with intervening neighbours Let G be the Coxeter graph of a Coxeter group with generators S. Consider a word w in the alphabet S. Definition 1.1. A word has the intervening neighbours property ... groups. the electronic journal of combinatorics 17 (2010), #N9 3 Words with intervening neighbours in infinite Coxeter groups are reduced Henrik Eri...

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