Báo cáo toán học: "On Descents in Standard Young Tableaux" ppsx

... called the superstandard of the shape λ in [GR], p. 219.) Every standard Young tableau also corresponds to a string of numbers formed by reading the numbering in the order determined by the tableau. ... of standard Young tableaux with descents at 1 less the number of standard Young tableaux with descent at 1 but without descent at 3. The latter number equals tableauxbeginnin...

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

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

... positive integer l ≤ cn. It would be interesting to determine here the best possible value of the constant c. Perhaps it is c = 1 6 . One may obtain this trivial upper bound for 6|n by taking all ... following lemma: Lemma 1. The number of integers 1 ≤ k ≤ n satisfying φ(k) k < 1 t is less than n exp(− exp c 4 t) (where exp z = e z ), uniformly in t>2. This lemma can be found in [5]...

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

... graph G containing F i and any dominating set D in G, the set D has at least 9 vertices in V (F i ). If D contains neither x i nor y i , then by Claim 1 D must contain 3 vertices in each of V ... bound was proved in [2] by exploiting Reed’s techniques in [9] and examining some of the cases in Reed’s proof more carefully and adding a dis- charging argument. However, exploting Reed’...

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

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

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

... Strings. To construct strings with distinct adjacent elements, an argument involving the principle of inclusion–exclusion can be applied. However, one can also consider signed sets asdescribedin[SW].Thesetofsigned ... generating series for the n tuple of tuples. To apply Θ w , or inverse Laplace transform, i. e. removal of labels marked by w, we form signed divided strings in the following...

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

... Crapo’s beta invariant. 1. Introduction Sums over partially ordered sets frequently occur in combinatorics and related fields. Each application of the principle of inclusion-exclusion, for instance, ... shown. 3. Principle of inclusion-exclusion The principle of inclusion-exclusion, which is also known as the sieve formula or the formula of Poincare or Sylvester, plays a significant role in...

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

... Component evolution in random intersection graphs Michael Behrisch ∗ Institut f¨ur Informatik, Humboldt-Universit¨at zu Berlin, 10099 Berlin, Germany behrisch@informatik.hu-berlin.de Submitted: ... exp(c(ρ − 1)) (5) in the interval (0, 1). Thus the main complication in the proof is to overcome the limitations of the branching process which deals with an essentially unbounded domain in...

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

... begin with some preliminaries, remarking that lemma 3 of these preliminaries is a very interesting result in it’s own right. Given a string, the waiting time for the first occurrence of the string ... τ 1 c 1 τ 2 cannot match c 1 against ¯c 1 , nor can ¯c 1 match against something in τ 1 , as τ 2 is the maximum length suffix of σ 1 matching against a prefix of σ 2 = τ 3 c 2 . Lemma 8 Strings...

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