Báo cáo toán học: "A Combinatorial Proof of a Symmetric q-Pfaff-Saalsch¨ tz Identity u" pps

... acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Could petroleum biodegradation be a joint achievement of aerobic and anaerobic microrganisms in deep sea ... lifecycles. A comparative biodegradation of terpanes, hopanes and steranes under aerobic and anaerobic conditions, Table 3, indicate that some of...

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

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

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

... a strongly rpp semigroup. Again by Lemma 3.7 and the definition of a strongly right (left) adequate semigroup, we can formulate our main theorem. Theorem 3.8. (i) The translational hull of a strongly ... the translational hull of a strongly right (left) adequate semigroup is still the same type. Thus, the result obtained by Fountain and Lawson in...

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

... Hopf algebras in the graded case. In order to study tame basic Hopf algebras or generally tame Hopf algebras, we need more examples of tame Hopf algebras. The Andruskiewitsch-Schneider algebra is ... modules for the quantum double of a special Taft algebra in [3]. From this, we can deduce immediately that the quantum double of this special Taft algebra is ta...

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

... pp.15-33. The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements Elias M. Hagos emhagos@hotmail.com Submitted: ... vertex-deleted subgraphs of G is known as its deck. The characteristic polynomial of G is the characteristic polynomial o...

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

... Handbook of Mathematical Functions,NationalBureauof Standards, Washington DC, 1972. 2. P. Erd˝os and P. Tur´an, On some problems of a statistical group theory, III,, Acta Math. Acad. Sci. Hungar. ... greater than √ n sincewemayalwaystakep = q) we may halve the distance from m to n by one application of this inequality. After at most log 2 n applications of the above inequality we ob...

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

... Mon- terey, California, 1986. the electronic journal of combinatorics 8 (2001), #N7 5 The polynomial part of a restricted partition function related to the Frobenius problem Matthias Beck Department of ... of Mathematical Sciences State University of New York Binghamton, NY 13902–6000, USA matthias@math.binghamton.edu Ira M. Gessel ∗ Department of Mathemat...

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

... 05C83 Abstract The arc-representation of a graph is a mapping from the set of vertices to the arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The ... width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The arc-width( aw) of a graph is the minimum wid...

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

... ∈ >0 . In this paper we investigate an additional property of the class of heap games for general s, t ∈ >0 : the subword complexity of the characteristic function of A. Forfixed s, t ∈ >0 , ... question of whether A has a similar property when s ≥ 2. Perhaps associated with some of the A sequences for s ≥ 2 is an integer m ≥ 2 such that for all i, j, k, | (A k...

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

... conclude that any petal graph G, other than P ∗ , must be Class 1. the electronic journal of combinatorics 10 (2003), #R6 6 Colouring the petals of a graph David Cariolaro ∗ Department of Mathematics University ... Mathematics University of Reading RG6 6AX U.K. davidcariolaro@hotmail.com Gianfranco Cariolaro Dipartimento di Ingegneria dell’ Informazione Universit`adiPadova 35...

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

... journal of combinatorics 10 (2003), #R39 6 2.1 An Invariant of Szemer´edi’s Regularity Lemma Let G =(U ∪ V, E) be a bipartite graph. For an integer t, we define a t-equitable partition V (G) as a ... state, up front, that we always assume m is a sufficiently large integer. Our proof of Theorem 1.5 uses a well-known invariant formulation of Szemer´edi’s Regularity Lemma....

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

... Distributive lattices, a ne semigroup rings and algebras with straightening laws, in “Commutative Algebra and Combinatorics” (M. Nagata and H. Matsumura, Eds.), Advanced Studies in Pure Math., Volume ... Mathematics Faculty of Science Rikkyo University Toshima, Tokyo 171-8501, Japan ohsugi@rkmath.rikkyo.ac.jp Takayuki Hibi Department of Pure and Applied Mathematics Graduate School of I...

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

... journal of combinatorics 13 (2006), #N16 2 On the Proof of a Theorem of P´alfy Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, ... = 1, then y is conjugate to x in x, y. Proof. As x and y are abelian, and a transitive abelian subgroup is regular [3, Theorem 4. 2A (v)], we have that fix x (B)...

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

... research in random graph theory is the component structure of the random graph G n,m (a graph drawn uniformly at random from all graphs ∗ A preliminary version of this paper appeared in the proceedings ... into an initially empty graph. Then the theorem states that a. a.s. a linear-sized giant component’ emerges quite precisely at the point where the avera...

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

... A proof of the Kahn-Lov´asz theorem The entropy proof of the Kahn-Lov´asz theorem is complicated by the fact that there can be edges of the graph (and a fixed matching) amongst the neighbors of ...  E is independent of the event {x  V y}. Proof. For any permutation of the edges of m, there is a permutation of V (G) inducing it. Therefore, the unif...

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