Báo cáo toán học: "The maximum size of a partial spread in H(4n + 1, q 2) is q 2n+1 + 1" docx

... 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

... bound on the order dimen- sion of the Bruhat (or strong) ordering of the affine Coxeter group ˜ A n .Wealso demonstrate that the order dimension of the Bruhat order is infinite for a large class of Coxeter ... the order dimension of the Bruhat order on A n . In [14], the order dimension of the Bruhat order on A n is determined...

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

... complete cap in PG(2,q) containing at most √ q(ln q) 10 points. A similar bound holds for the minimum size of a complete cap in AG(2,q) since we can obtain AG(2,q)fromPG(2,q) by removing a line ... any line in (Z/p 2 Z) 2 which contains p ∗x + p ∗(1,t) the electronic journal of combinatorics 13 (2006), #R58 12 The minimum size of complete caps in (Z/nZ) 2 Jack...

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

... square all-1 matrix. Proof of Theorem 1.1: The square of the number of perfect matchings of G counts ordered pairs of such matchings. We claim that this is the number of spanning 2-regular subgraphs ... Cuckler and J. Kahn, Entropy bounds for perfect matchings and Hamiltonian cycles, to appear. [3] S. Friedland, An upper bound for the number of perfect matching...

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

... f points in the polar space P is (q d+ 1+ + 1) (q d+1 − 1)/ (q − 1). The size of a spread in P is equal to q d+ 1+ + 1, which is of course, also an upper bound on the size of a partial spread. The ... showing that this construction does in fact yield a maximal partia l spread of size q 2n+1 + 1 in all spaces H(4n + 1,...

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