Báo cáo toán học: "A Decomposition Algorithm for the Oriented Adjacency Graph of the Triangulations of a Bordered Surface with Marked Point" potx

... is a signed adjacency matrix associated to an ideal triangulation of a bordered surface with marked points (S, M), and G is a quiver. If B(G) = B, we say G is the oriented adjacency graph associated ... class of an adjacency matrix associated to a triangulation of a bordered surface with marked points is finite (Corollary 12.2 in [2]). It is also pro...

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

... = A + and S 2 (a) = {a} for all a ∈ A; h : A ∗ # → A ∗ , with h(#) = 1 and h (a) =a for all a ∈ A. Actually, the substitution S 1 is used to mark the occurrences of letters to be deleted from a word. ... 201 abab is a proper subword of the permutation abab 2 of a 2 b 3 ,wehaveY is not a supercode. For any set X we denote by P(X) the family of al...

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

... data in a particular space with other data in the same space. For example, we might wish to describe how of- ten a particular word appears with a particu- lar other word. The data therefore are ... LINK ¨ OPING Sweden gengo@ida.liu.se Abstract An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a...

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

... out the theoretical proof and drafted the manuscript. XH participated in the design and coordination. Both of the two authors read and approved the final manuscript. References [1] Liapunov, AM: ... to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Lyapunov-type inequalities for a class of even-orde...

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

... operator in Banach spaces and the concept of the generalized nonexpansive mapping in Banach spaces. Honda et al. [11], Kohsaka and Takahashi [12] also studied some properties for the gen- eralized ... Banach spaces. Taiwanese J Math. 14, 1023–1046 (2010) 12. Kohsaka, F, Takahashi, W: Generalized nonexpansive retractions and a proximal-type algorithm in Banach spaces. J Nonlinear...

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

... Eds., Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, Dover Publications, New York, 1966. [2] E .A. Bender, Central and Local Limit Theorems Applied to Asymptotic Enumeration, ... expansion of the integral. Among the consequences, we have a complete asymptotic expansion for b(n, k)/n!fora range of k including the maximum of the b(n, k)/n...

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

... face F of R is the intersection of the maximal faces containing it, and so F can be mapped to the intersection of the linear spans (in R d ) of these maximal faces, which is an element of L A . ... Coxeter arrangements. One can apply our results to these arrange- ments. The family of arrangements that interpolate between A n−2 and A n−1 are par- ticularly amenable...

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

... non -oriented graphs without loops and multiple edges. We call a p-clique of the graph G asetofp vertices, each two of which are adjacent. The largest positive integer p, such that the graph G ... ≥ max {a 1 , ,a r }. Folkman [3] proved that there exists a graph G such that G → (a 1 , ,a r )andcl(G)=max {a 1 , ,a r }. Therefore F (a 1 , ,a r ; q) exists if and onl...

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

... by r[max, i](σ) the set of all right-maximal indices of σ, and let r[max, v](σ) denote the set of all right-maximal values. Note that any right-maximal index is a descent index. In other words, for ... · 0  m n =0 x ¯m n y m n the electronic journal of combinatorics 17 (2010), #R34 10 MacMahon’s theorem for a set of permutations with given descent indices and right-...

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

... shown that the permutations with Boolean order ideals are exactly the ones that avoid the two patterns 321 and 3412. For more examples, a searchable database listing which classes of permutations avoid ... 2010 Mathematics S ubject Classification: 0 5A0 5 Abstract In this paper we stu dy pattern avoidance for a ne permutations. In particular, we show that for a given patte...

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