Báo cáo toán học: " New Graphs of Finite Mutation Type" docx

... Provisional PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. New proofs of Schur-concavity for a class of symmetric ... 0, and then h  (t) ≤ 0, so f (t) is concave on (0, 1). NEW PROOFS OF SCHUR-CONCAVITY FOR A CLASS OF SYMMETRIC FUNCTIONS HUAN-NAN SHI ∗ , JIAN Z...

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

... 2011:86 http://www.journalofinequalitiesandapplications.com/content/2011/1/86 Page 2 of 11 RESEARCH Open Access New inequalities of hermite-hadamard type for convex functions with applications Havva ... Department of Mathematics, 25240, Campus, Erzurum, Turkey Abstract In this paper, some new inequalities of the Hermite-Hadamard type for functions whose mo...

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

... some generalized invex monotonicity which are also discussed in [13], mentioned as generalized invariant monotonicity. The purpose of this paper is to introduce new classes of generalized invex ... the new class of generalized invex monotone plus mappings, and generalized invex cocoercive mappings respectively. We analyze the differential property of these new gene...

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

Ngày tải lên: 05/08/2014, 09:46

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

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

... class="bi x0 y2 w4 h 1" alt =""

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

... class="bi x0 y2 w2 h 2" alt =""

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

... Sim, The normality of Cayley graphs of finite abelian groups with Valency 5, System Science and Mathematical Science 13 (2000) 420–431. Cayley Graphs of Abelian Groups Which Are Not Normal Edge-Transitive ... non- normal Cayley graphs of an abelian group are as follows. (1) G = Z 4 ,S = G\{1}, =K 4 . (2) G = Z 4 ì Z 2 = aìb,S = {a, a −1 ,b}, Γ=Q 3 the cube....

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

... ,A k denote the bridges of the endpoints of e;thereare only finitely many of them, since G is locally finite. Then k ≥ 3 and one of the A i is the edge e itself. If A i consists of more than a single ... Invariance of T e Proposition 1 Let G be a locally finite 2-connected graph, and let e be an edge of G.IfT is any 3-block tree for G, then T = T e . Proof: We will show that th...

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

... such that at least one pair of the configuration will contain a point from each of T 1 u ,T v , and at least one pair will contain a point from each of T 2 u ,T v , with probability at least 1 ... Molloy. A gap between the appearances of a k-core and a (k+1)-chromatic graph. Random Structures and Algorithms, 8 (1996), 159 - 160. [21] M. Molloy and B. Reed. A critical poin...

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

... simple proof of a nice formula for the means and covari- ances of the diagonal sums of a uniformly random boxed plane parition. An a ì b ì c boxed plane partition is an a ì b grid of integers ... combinatorics 8 (2001), #N1 3 Diagonal Sums of Boxed Plane Partitions David B. Wilson Microsoft Research One Microsoft Way Redmond, WA 98052 dbwilson@microsoft.com Submitte...

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

... points at distance 2 from c in M, or else there are equilateral triangles inside. It follows that the electronic journal of combinatorics 11 (2004), #R18 10 Equilateral Triangles in Finite Metric ... In the following we will talk about metric spaces with distances in sets not containing 0: this slight abuse of language is only meant to simplify the discourse, since while 0...

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

... particular, the A-strict episturmian sequences correspond to the Arnoux-Rauzy sequences (see [3]). 3 Balanced episturmian sequences In this section, we give a characterization of the balanced episturmian ... is ultimately periodic. Proof. It is a direct consequence of Theorem 3.10. Corollary 3.13. None of the Arnoux-Rauzy sequences (A-strict episturmian sequences) are bal...

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

... Section 4, together with several other ideas, to complete the proof of Theorem 1.1. In the proof, we also give a more precise description of the error term. Throughout this article, we use the notation ... (K k ) ∩ M = ∅}. the electronic journal of combinatorics 14 (2007), #R67 8 4 Proof of Theorem 1.1 We now turn to the proof of the lower bound in Theorem 1.1. Fix a...

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

... New Graphs of Finite Mutation Type Harm Derksen ∗ Department of Mathematics University of Michigan hderksen@umich.edu Theodore Owen Department of Mathematics Iowa State ... constructed mutation- finite graphs from triangulations of ori- ented bordered surfaces with marked points. We will call such graphs of geometric type”. Besides graphs with 2 vertices, and graphs...

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