Báo cáo toán học: "The Zeta Function of a Hypergraph" potx

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

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

... 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 ... the translational hull of a strongly right (left) adequate semigroup is still the same type. Thus, the result obtained by Fountain and Lawson in...

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

... Hopf algebras in the graded case. In order to study tame basic Hopf algebras or generally tame Hopf algebras, we need more examples of tame Hopf algebras. The Andruskiewitsch-Schneider algebra is ... modules for the quantum double of a special Taft algebra in [3]. From this, we can deduce immediately that the quantum double of this special Taft algebra is ta...

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

... pp.15-33. The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements Elias M. Hagos emhagos@hotmail.com Submitted: ... vertex-deleted subgraphs of G is known as its deck. The characteristic polynomial of G is the characteristic polynomial o...

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

... 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. Hungar. ... greater than √ n sincewemayalwaystakep = q) we may halve the distance from m to n by one application of this inequality. After at most log 2 n applications of the above inequality we ob...

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

... Mon- terey, California, 1986. the electronic journal of combinatorics 8 (2001), #N7 5 The polynomial part of a restricted partition function related to the Frobenius problem Matthias Beck Department of ... of Mathematical Sciences State University of New York Binghamton, NY 13902–6000, USA matthias@math.binghamton.edu Ira M. Gessel ∗ Department of Mathemat...

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

... 05C83 Abstract The arc-representation of a graph is a mapping from the set of vertices to the arcs of a circle such that adjacent vertices are mapped to intersecting arcs. The width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The ... width ofsucharepresentationisthemaximumnumberofarcshavingapointincommon. The arc-width( aw) of a graph is the minimum wid...

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

... ∈ >0 . In this paper we investigate an additional property of the class of heap games for general s, t ∈ >0 : the subword complexity of the characteristic function of A. Forfixed s, t ∈ >0 , ... 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 such that for all i, j, k, | (A k...

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

... Distributive lattices, a ne semigroup rings and algebras with straightening laws, in “Commutative Algebra and Combinatorics” (M. Nagata and H. Matsumura, Eds.), Advanced Studies in Pure Math., Volume ... Mathematics Faculty of Science Rikkyo University Toshima, Tokyo 171-8501, Japan ohsugi@rkmath.rikkyo.ac.jp Takayuki Hibi Department of Pure and Applied Mathematics Graduate School of I...

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

... recoverable using any algorithm designed to compute the product of an adjacency matrix of the graph and an arbitrary vector. The linear complexity of a graph may therefore be seen as a measure of ... adjacency matrices of graphs, and a working knowledge of the linear complexity of a linear transformation. An excellent reference for linear complexity, and al...

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

... proof of this symmetry will induce a bijective proof of N(i, j)=N(j, i), and then a bijective proof of Lemma 6.4. Proof of Theorem 6.3. Let G(m, n)bethenumberofK-paths starting at (−2m, −2m) and ... negative, and the verification of the recurrence is straightforward. (We will give another proof of (48) in Example 9.2.) This completes the proof of (7). For equation (8), we n...

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

... Theorem 10 makes it clear that the problem of factoring the generalized zeta function is really a problem of factoring the zeta function of a bipartite graph. Fortunately, in [11], Hashimoto deals with this ... instead. 3.1. Consequences of the Factorization Our first observation is that the zeta function of a hypergraph is a non-trivial gener- alization of the...

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

... 8 The crossing number of a projective graph is quadratic in the face–width I. Gitler ∗ Departamento de Matem´aticas, CINVESTAV M´exico DF, Mexico P. Hlinˇen´y † Faculty of Informatics, Masaryk ... Suppose that G is a graph with maximum degree ∆ that embeds in the projective plane with face–width r. Then the crossing number of G in the plane (an...

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

... we consider a new zeta function of a graph G, and present another proof of Smilansky’s formula for some determinant on the bond scattering matrix of a graph by means of the Laplacian of G. Furthermore, ... The Scattering Matrix of a Graph Hirobumi Mizuno Iond University, Tokyo, Japan Iwao Sato Oyama National College of Technology, Oyama, Tochigi 323-0806, Japan i...

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

... -dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of the isometric and lattice dimension, provide a combinatorial characterization of the Fibonacci dimension ... University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia; Faculty of Natural Sciences and Mathematics, University of Maribor, Koroˇska 160, 2000 Maribor, Slov...

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