Báo cáo toán học: " The Translational Hull of a Strongly Right or Left Adequate Semigroup" pdf

... a strongly rpp semigroup. Again by Lemma 3.7 and the definition of a strongly right (left) adequate semigroup, we can formulate our main theorem. Theorem 3.8. (i) The translational hull of a strongly ... of Theorem 3.8, we deduce the following corollary. Corollary 3.9. The translational hull of a C-rpp semigroup is still a C-rpp semigroup. Translati...

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

...

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

... algebra is a kind of generalization of gener- alized Taft algebra and of course Taft algebra. Therefore, it is natural to ask the following question: whether is the quantum double of dual Andruskiewitsch- Schneider ... similarly.  By [11], we know that the most typical examples of basic Hopf algebras of finite representation type are Taft algebras and the dual of A( n...

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

... subgraphs of G is known as its deck. The characteristic polynomial of G is the characteristic polynomial of its adjacency matrix A and is defined by P G (x)=det(xI − A) . We call the collection of the ... referee noted that the result from the title can be reformulated as follows: The eigenvalues and main angles of a graph can be uniquely reconstructed from the e...

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

... Stegun, Handbook of Mathematical Functions,NationalBureauof Standards, Washington DC, 1972. 2. P. Erd˝os and P. Tur´an, On some problems of a statistical group theory, III,, Acta Math. Acad. Sci. ... relate the b (n) m to the a m defined earlier. Unfortunately the sum above extends over only a short range of indices; we must first correct this imbalance. For any m ≤ n −q and a...

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

... (u i is nonzero for only finitely many negative values of i) then the residue of F (z)isresF (z)=u −1 . An elementary fact about formal Laurent series is the change of variables formula for residues: ... derive an explicit formula for the polynomial part of p A . Let A = {a 1 , ,a n } be a set of positive integers with gcd (a 1 , ,a n )=1. The classical Frobenius pr...

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

... arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The arc-width(aw) of a graph is the minimum ... thank the editor-in-chiefs and the referee for valuable suggestions. The first author is grateful for the hospitality of the Technical University of Den- mark, speci...

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

... complexity of the characteristic function of A. Forfixed s, t ∈ >0 , define the characteristic function of A as χ = χ (A) : >0 −→ {0, 1},where χ(x)=  1,x∈ A 0,x/∈ A. Awordw is a factor of y if there ... motivates the question of whether A has a similar property when s ≥ 2. Perhaps associated with some of the A sequences for s ≥ 2 is an integer m ≥ 2 suc...

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

... Japan ohsugi@rkmath.rikkyo.ac.jp Takayuki Hibi Department of Pure and Applied Mathematics Graduate School of Information Science and Technology Osaka University Toyonaka, Osaka 560-0043, Japan hibi@math.sci.osaka-u.ac.jp Submitted: ... is Gorenstein. Then the h-vector of K[P] is unimodal. References [1] C. A. Athanasiadis, Ehrhart polynomials, simplicial polytopes, magic squares and...

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

... define the linear complexity of a graph. Our approach requires only a basic familiarity with adjacency matrices of graphs, and a working knowledge of the linear complexity of a linear transformation. ... linear complexity of any one of its adjacency matrices. In other words, the linear complexity of a graph Γ is a measure of how hard it is to compute AX,whereA...

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