Báo cáo toán học: "hape-Wilf-Ordering on Permutations of Length 3" pptx

... for the nonlinear deflection analysis of an infinite beam resting on a nonlinear elastic foundation under localized external loads. Although their method app ears powerful as a mathematical procedure ... eam resting on a both non-uniform and nonlinear elastic foundation by means of Banach fixed point theorem. In fact, this restriction on the candidate space...

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

... alt =""

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

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

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

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

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

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

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

... years after the publication of A Handbook of Integer Sequences, a greatly expanded version of this collection can now be accessed by electronic mail. 1. The on-line version A Handbook of Integer ... if the sequence is not in the table), and furthermore will apply a series of transfor- mations to a given sequence and then look up the transformed sequences in the...

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

... order on the set of Young diagrams as follows: à if and only if there exists a sequence ν 1 ,ν 2 , ,ν k of Young diagrams such that LONGEST INCREASING SUBSEQUENCES OF RANDOM COLORED PERMUTATIONS Alexei ... the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for...

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

... for two-stack- sortable permutations is algebraic of degree 20. 1Introduction The aim of this paper is twofold. Our first intention is to draw attention on the factorization of two-stack- sortable ... introduced in the proof of Proposition 2.1. We obtain the number of two-stack- sortable permutations of length n having m right-to- left maxima, as given in [8]. the electro...

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

... electronic journal of combinatorics 9(2) (2002), #R1 10 The packing density of other layered permutations Peter A. Hăastăo Department of Mathematics, P. O. Box 4, 00014 University of Helsinki, Finland peter.hasto@helsinki.fi Submitted: ... Specifically, the density is found for layered permutations of type [m 1 , ,m r ]whenlog(r +1) ≤ min{m i }.Itisalso shown how to der...

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

... monotone subsequences of length 3 in L, R are also such subsequences of S.There are no monotone subsequences of S containing both 0 and n − 1. There are no monotone subsequences of S of the form a, ... up of k monotone descending subsequences, each of length n/k or n/k; clearly it has no monotone ascending subsequences of length k +1, and any monotone descendin...

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

... Subject Classifications: 0 5A0 5, 0 5A1 5 To Richard Stanley, who introduced me to the area of log-concave sequences. Abstract We provide a combinatorial proof for the fact that for any fixed n, the sequence {i(n, ... A Combinatorial Proof of the Log-concavity of a famous sequence counting permutations Mikl´os B´ona ∗ Submitted: Nov 24, 2004; Accepted: Jan...

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

... Proof of Proposition 1 In this section we present a modified and extended version of the original proof of Babson- West to address our new setting of shape-Wilf ordering. Let the permutation matrices ... orders these permutations by employing all Young diagrams. This opens up the question of whether shape- Wilf-ordering of permutations, or some generalization of it, is not the...

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

... proof of Theorem 1, and discussed three different zeta functions of any graph. Various proofs of Bass’ theorem were known. Kotani and Sunada [15] proved Bass’ theorem by using the property of ... Ihara zeta function of a fractal graph, and gave a determinant expression of it. We define the Bartholdi zeta function of a fractal graph, and present its determinant expressi...

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

... maximized when G = K n . Some improvements of (1) for 1/ ( n − 2) < λ < 3, λ = 1 are given in Sections 4 and 5. 3 Maximal flat antichains of minimum si ze In this section we show that the ... inequality implies  x∈V d(x) 2 ≥ 4|E| 2 n , the electronic journal of combinatorics 16 (2009), #R69 17 Maximal at antichains of minimum weight Martin Grăuttmăuller Hochschule...

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

... about χ D (G) based on the automorphism group of G. Since the publication of [4], the topic of the electronic journal of combinatorics 16 (2009), #R88 2 Bounds on the Distinguishing Chromatic Number Karen ... distinguish them? The subject has received considerable attention since then (e.g., see [1, 2, 9, 14]). In the definition of the distinguishing number, there...

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