Báo cáo toán học: "A closed formula for the number of convex permutominoes" pot

... alt =""

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

... the union of any element of F 1 with any element of F 2 . It is easy to see that the product of two cancellative families is also a cancellative family ( (A 1 ,A 2 ) ∪(B 1 ,B 2 )= (A 1 ,A 2 ) ∪(C 1 ,C 2 ) ... ask how large cancellative families can be. We define f(n) to be the size of the largest possible cancellative family of subsets of a n-set and f(k,n)...

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

... A Plethysm Formula for p à (x) h (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 91125 doran@ cco.caltech.edu Submitted: ... ) are given in Table 1. So, p (2) (x) ◦ h (2,1) (x)= s (6) (x) − s (5,1) (x)+ 2s (4,2) (x) − 2s (3,3) (x) − s (4,1,1) (x)+ s (2,2,2) (x)+ s (3,1,...

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

... survey of frequency squares. A set of (n − 1) 2 /(m − 1) mutually orthogonal frequency squares (MOFS) of type F (n; λ)isacomplete set of type F (n; λ). We shall describe a construction for complete ... 2000. Abstract A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complet...

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

... referee for numerous comments and suggestions which have led to a substantially improved paper. An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions Lane Clark Department ... Eds., Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, Dover Publications, New York, 1966. [2] E .A. Bender, Central...

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

... v(G) denote the number of vertices, and (G) denote the number of edges. In this paper, we construct a graph G having no two cycles with the same length which leads to the following result. Theorem. ... Chunhui Lai, On the size of graphs with all cycle having distinct length, Discrete Math. 122(1993) 363-364. [6] Chunhui Lai, The edges in a graph...

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

... is the number of times the integer i occurs in the sequence T . Note that the sum of all b(i), 1 ≤ i ≤ n,isequaltol, the length of T . 3 A simple proof for the existence of exponentially balanced ... two, or are two successive powers of two. A proof for the existence of exponentially balanced Gray codes is derived. The proof is much sim- p...

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

... agree above row r and to the left of column c (and the definitions of r and c) we see that the only possibility for /à is (r, c), completing the proof of this case and the theorem. Acknowledgements. ... 308, 9 (2008), 1524–1530. the electronic journal of combinatorics 15 (2008), #N23 4 A sharp bound for the reconstruction of partitions Vincent Vatter Departme...

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

... interpretation of the closed formula (10) for the number of con- vex permutominoes. We remark that the expression of f n resembles the expression (1) for the number c n of convex polyominoes of semi-perimeter ... : the uppermost cell of the rightmost column of the polyomino has the maximal ordinate among all the cells of the polyomino; U2 :...

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

... b i in P [k] j,i . the electronic journal of combinatorics 16 (2009), #R70 18 A normalization formula for the Jack polynomials in superspace and an identity on partitions Luc Lapointe ∗ Instituto ... where σ j and ∂ j are respectively the interchang e and divided difference operators on the variables a j and a j+1 (see for instance [6]). The main st...

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

... Journal of Combinatorics 27 (2006) 193- 206.], that when the normalizer of Γ 0 (N) acts transitively on Q ∪ {∞}, any circuit in the suborbital graph G(∞, u/n) for the normalizer of Γ 0 (N), is of the ... Theorem3.1, C ∗ is of the form v → T (v) → T 2 (v) → T 3 (v) → · ·· → T k−1 (v) → v the electronic journal of combinatorics 16 (2009), #R116 13 On Suborbital...

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

... t). The basic idea of the proof of Theorem 3.1 is to show F à (q, t) and G à (q, t) satisfy the same recursion in the hook case. Proof. We first note the Garsia-Haiman recursion for the Hilbert series ... to the product of the weights of each of its entries, here the weight of entry s in T is taken to be the weight of the corner square containing s in...

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

... journal of combinatorics 17 (2010), #R107 20 A conjectured formula for Fully Packed Loop configurations in a triangle Paul Zinn-Justin ∗† LPTMS (CNRS, UMR 8626), Univ Paris-Sud 91405 Orsay Cedex, ... “MISGAM” and ANR program “GIMP” ANR- 05-BLAN-0029-01. † The author wants to thank R. Langer for her participa tio n in the early stages of this project, J. Thap- per for...

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

... if i = N, π i if i = N. the electronic journal of combinatorics 18 (2011), #P28 15 A Combinatorial Formula for Orthogonal Idempotents in the 0-Hecke Algebra of the Symmetric Group Tom Denton Submitted: ... automorphism of the un- derlying graph of a Dynkin diagram induces an auto morphism of the Hecke algebra. For the Dynkin diagram of S N , ther...

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

... a short proof for the result of Noonan [3] that the number of permutations of length n containing exactly one occurence of pattern 321 is 3 n  2n n−3  . (To be precise, Noonan considered permutations ... A short proof for the number of permutations containing pattern 321 exactly once Alexander Burstein Department of Mathematics Howard...

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