Ngày tải lên: 05/08/2014, 15:20
... 97e:05058. Connects a problem on common covectors of two subspaces of R m ,andmore generally of a pair of oriented matroids, to the problem of sign-solvability of a matrix and the even-cycle problem for signed ... Cornu´ejols and Guenin (20xxa), Guenin (1998a), and Novick and Seb¨o (1995a) (qq.v.). (S(M), SG: M, G, I(Gen), O: Exp, Ref, Exr) G´erard Cornu´ejols and Bertra...
Ngày tải lên: 07/08/2014, 05:23
Báo cáo toán học: " ON THE NUMBER OF DESCENDANTS AND ASCENDANTS IN RANDOM SEARCH TREES" ppsx
... other random variables: the number of descendants D n and the number of ascendants A n of a randomly chosen internal node in a random search tree of size n. This corresponds to averaging D n,j and ... number of comparisons to sort a random permutation of size n,when the recursion stops in subfiles of size ≤ b and the pivots are selected as the median of samples of three...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: " On plethysm conjectures of Stanley and Foulkes: the 2 × n case" ppsx
... k<n,asubtableau of shape 2 × k of a vertical tableau ∆ of shape 2 × n is a subset of k columns of ∆. A partial tableau is a collection of k columns which is a subtableau of at least one vertical ... assumption that the combination of rows of K 2 × n is nontrivial. For a given horizontal tableau Γ, let a Γ and b Γ be the numbers of elements of {1, ,n} in the rows of...
Ngày tải lên: 07/08/2014, 08:22
Báo cáo toán học: "The Planarity Theorems of MacLane and Whitney for Graph-like Continua" pdf
... planar dual of G and let C be a cycle of G. Lemma 3.2 implies that the subgraphs of H on either s ide of C are connected and, therefore, the edges of H dual to the edges of C form a bond of H. To ... of a set X and a set I of subsets of X so that: 1. I = ∅; 2. if I ∈ I and J ⊆ I, then J ∈ I; 3. for each Y ⊆ X, there is a maximal element of I contained in Y ; and...
Ngày tải lên: 08/08/2014, 11:20
Báo cáo toán học: "On a Conjecture of Frankl and F¨redi u" doc
... be k-uniform and λ is small. 1 Introduction Let X be an n-element set, and let 2 X denote the family of all subsets of X. For 0 ≤ k ≤ n, let X k denote the family of all subsets of X of cardinality ... family of size m, then m ≤ k 2 + 1. We adapt Hall’s proof of Theorem 3.2 to prove Theorem 1.3. (For the reader’s con- venience, we first reproduce Hall’s proof of The...
Ngày tải lên: 08/08/2014, 14:22
Báo cáo toán học: "Topological direct integrals of left Hilbert algebras" docx
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "Are commuting systems of decomposable operators decomposable? " doc
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "Low Rank Co-Diagonal Matrices and Ramsey Graphs" doc
... the logarithmic order of magnitude of the Ramsey-graph of Frankl and Wilson [5], continuing the sequence of results on new explicit Ramsey graph constructions of Alon [1] and Grolmusz [6]. Our ... integer between 0 and 5, and s ≤ c √ k. Since the (u, v) entry of ¯ A is the value (5), and (5) can be written as the sum of monomials in (7), matrix ¯ A can be written as th...
Ngày tải lên: 07/08/2014, 06:20
Báo cáo toán học: "Matrix-free proof of a regularity characterization" doc
... that the proof of Theorem 2.1 takes an existing parition and refines it. As a result, clusters U i are subsets of U and clusters V j are subsets of V . 2.2 ε 0 -regular partitions and G 2 (δ) The ... electronic journal of combinatorics 10 (2003), #R39 8 2.3 Proof of Theorem 1.5 Before proceeding to the proof of Theorem 1.5, we begin by describing the constants involved, the...
Ngày tải lên: 07/08/2014, 08:20