Báo cáo toán học: "Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums" docx

... present in many different Proteobacteria. The endA gene encoding endonuclease I from the psychrophilic and mildly halophilic bacterium Vibrio salmonicida and from the mesophilic brackish water ... ssDNA and plasmid were analyzed using linearized pBAD ⁄ gIII plasmid, linea- rized and denatured plasmid and intact plasmid. The pBAD ⁄ gIII plasmid was linearized using SalI...

Ngày tải lên: 19/02/2014, 05:20

... accidental hypothermia with cardiac arrest for a long time using cardiopulmonary bypass – report of a case Keigo Sawamoto* 1 , Katsutoshi Tanno 1 , Yoshihiro Takeyama 1 , and Yasufumi Asai 1 ... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Successful treatment of severe accidental hypother...

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

... 2011:101 http://www.fixedpointtheoryandapplications.com/content/2011/1/101 Page 6 of 10 RESEARC H Open Access Hierarchical convergence of an implicit double- net algorithm for nonexpansive semigroups and variational inequality ... double-net algorithm for nonexpansive semigroups and variational inequality problems. Fixed Point Theory and Applications...

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

... of repeating patterns of dense (and presumably optimal) packings of n equal non-overlapping disks in- side an equilateral triangle (see Fig. 1.1 for and example). It is natural to investigate ... RepeatedPatternsofDensePackings of Equal Disks in a Square R. L. Graham, rlg@research.att.com B. D. Lubachevsky, bdl@research.att.com AT&T Bell Laboratories Murray Hill...

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

... (−1)–enumeration of self–complementary plane partitions in terms of SC(a, b, c), the ordinary enumeration of self–complementary plane partitions. Theorem 2. The enumeration of self–complementary plane partitions ... of self–complementary plane partitions is needed. It will also be used as a step in the proof of the (−1)–enumeration. Theorem 1 (Stanley [14]). The nu...

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

... journal of combinatorics 12 (2005), #R29 17 Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums E. Rodney Canfield ∗ Department of Computer Science University of ... 0-1 matrices with prescribed line sums, in Enumera- tion and Design, (Academic Press, 1984) 225–238. [14] B. D. McKay and X. Wang, Asymptotic enumerat...

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

... when p divides m − n, all permutation binomials occur in pairs over F 4p+ 1 where p and 4p +1 areprimes. Theorem 12 Let q = 4p + 1where p and q are primes. The following are paired permu- tation binomials ... (3) If 3p& lt;m< 4p then (mod 4) m ≡ 1 m ≡ 2 m ≡ 3 m ≡ 4 p ≡ 1 2 (p − 1) + N 1 + N 2 2N 1 2 (p − 1) + N 1 + N...

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

... the problem of enumeration of planar near -triangulations, solved by Tutte in [9] using the method of recursive decomposition. The same method, applied to the problem of enumeration of triangulations ... obtained hole with two edges of an additional triangle. This operation provides a bijection between the complete rooted triangulations with n edges, and triangulatio...

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

... the nonzero entries in the generating vector of C. Then, for k ≥ 1, kS is the set of positions of the non zero entries in the generating vector of C k . Proof. The proof is by induction on k. If ... constant number of nonzero entries in their generating vector. We also give matrices attaining such exponents. Solving this problem we also solve two equiva...

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

... of combinatorics 16 (2009), #R73 32 Graphs and Rules. We work with simple digraphs, which we represent as (M, V ) where M is a Boolean matrix for edges (the graph adjacency matrix) and V a Boolean ... Boolean complexes and relates operations on graphs with operations on Boolean complexes. Section 5 studies coherence of sequences of productions and Section 6 initial dig...

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

... #R149 2 The nonexistence of regular near octagons with parameters (s, t, t 2 , t 3 ) = (2, 24, 0, 8) Bart De Bruyn Department of Mathematics Ghent Un iversity, Gent, Belgium bdb@cage.ugent.be Submitted: ... generalized quadrangle of order 2. The regular near octagons with parameters (s, t 2 , t 3 , t) = (2, 0, 0, 4) are precisely th...

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

... electronic journal of combinatorics 17 (2010), #R160 16 The Enumeration of Sequences with Restrictions on their Partial Sums Stephen Suen Department of Mathematics and Statistics University of ... up one,” and each “−t” meaning “go right one, g o down t.” We study the number of paths with conditions on their part ia l sums, on their number of crossings, cr...

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

... code C (H(6, 3)) generated by the rows of H(6, 3) is a Hermitian self-dual code over GF (4) of length 18 and minimum weight at least 4. Let C be a Hermitian self-dual code of length 18 and minimum ... consider generalized Hadamard matrices over a group of order 3 in this paper. It is easy to verify that generalized Hadamard matrices H(1, 3) of ord...

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

... Asymptotic enumeration of labelled graphs by genus Edward A. Bender Department of Mathematics University of California at San Diego La Jolla, CA 92093-0112, USA ebender@ucsd.edu Zhicheng Gao ∗ School of ... number of labelled k-connected graphs of orientable genus g for k ≤ 3. 1 Introducti on The exact enumeration of various types of maps on the sphere (or, equiv...

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

... ···, 1 λ n i} for the skew-adjacency matrix of −→ T −1 is the inverse of the skew-adjacency matrix of −→ T and the negative of each eigenvalue of T is also an eigenvalue of T. Therefore Sp( −→ T −1 ) ... number of edges oriented in the direction of the routing. Otherwise C is oddly oriented. Let S = (s ij ) be skew-adjacency matrix of an oriented graph G σ . Note...

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