Equitable total coloring of <Emphasis Type="Italic">F</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> ⋁ <Emphasis Type="Italic">W</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ _t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ _et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order. Supported by the National Natural Science Foundation of China (No. 10771091).     

Parabolic twists for the linear algebras <Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>−1</Subscript>

New solutions of twist equations for the universal enveloping algebras U (A_n−1) are found. These solutions can be represented as products of full chains of extended Jordanian twists Abelian factors (“rotations”) , and sets of quasi-Jordanian twists . The latter are generalizations of Jordanian twists (with carrier b²) for special deformed extensions of the Hopf algebra U (b²). The carrier subalgebra for the composition is a nonminimal parabolic subalgebra in A _n−1 such that . The parabolic twisting elements are obtained in an explicit form. Details of the construction are illustrated by considering the examples n = 4 and n = 11. Bibliography: 21 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 347, 2007, pp. 187–213.     

Regular<Emphasis Type="Italic">n</Emphasis>-simplices in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> with vertices in ℤ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

In this paper theI andII regularn-simplices are introduced. We prove that the sufficient and necessary conditions for existence of anI regularn-simplex in ℝ ⁿ are that ifn is even thenn = 4m(m + 1), and ifn is odd thenn = 4m + 1 with thatn + 1 can be expressed as a sum of two integral squares orn = 4m - 1, and that the sufficient and necessary condition for existence of aII regularn-simplex in ℝ ⁿ isn = 2m ² - 1 orn = 4m(m + 1)(m ∈ ℕ). The connection between regularn-simplex in ℝ ⁿ and combinational design is given.     

On the Crossing Number of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> □ <Emphasis Type="Italic">P</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(K_m □ P_n), the crossing number of the Cartesian product K_m □ P_n. We prove that for m ≥ 3,n ≥ 1 and cr(K_m □ P_n)≥ (n − 1)cr(K_m+2 − e) + 2cr(K_m+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K₆ □ P_n) = 15n + 3. Research supported by NFSC (60373096, 60573022).     

Distortion theorem for Bloch mappings on the unit ball <Emphasis Type="Italic">ℬ</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

In this paper, we obtain a version of subordination lemma for hyperbolic disk relative to hyperbolic geometry on the unit disk D. This subordination lemma yields the distortion theorem for Bloch mappings f ∈ H（B^n） satisfying ｜｜f｜｜0 = 1 and det f＇（0） = α ∈ （0, 1], where｜｜f｜｜0 = sup{（1 - ｜z｜^2 ）n＋1/2n det（f＇（z））[1/n ： z ∈ B^n}. Here we establish the distortion theorem from a unified perspective and generalize some known results. This distortion theorem enables us to obtain a lower bound for the radius of the largest univalent ball in the image of f centered at f（0）. When a = 1, the lower bound reduces to that of Bloch constant found by Liu. When n = 1, our distortion theorem coincides with that of Bonk, Minda and Yanagihara.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

Difference sets with <Emphasis Type="Italic">n</Emphasis> = 5<Emphasis Type="Italic"> p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>

Let D be a (v, k, λ)-difference set in an abelian group G, and (v, 31) = 1. If n = 5p ^r with p a prime not dividing v and r a positive integer, then p is a multiplier of D. In the case 31|v, we get restrictions on the parameters of such difference sets D for which p may not be a multiplier.      

An efficient calculation of the Clausen functions Cl<Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(<Emphasis Type="Italic">θ</Emphasis>)(<Emphasis Type="Italic">n</Emphasis>≥2)

The Clausen functions appear in many problems, such as in the computation of singular integrals, quantum field theory, and so on. In this paper, we consider the Clausen functions Cl _n (θ) with n≥2. An efficient algorithm for evaluating them is suggested and the corresponding convergence analysis is established. Finally, some numerical examples are presented to show the efficiency of our algorithm.     

Free involutions on <Emphasis Type="Italic">S</Emphasis><Superscript>1</Superscript> × <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Topological free involutions on S ¹ × S ⁿ are classified up to conjugation. We prove that this is the same as classifying quotient manifolds up to homeomorphism. There are exactly four possible homotopy types of such quotients, and surgery theory is used to classify all manifolds within each homotopy type.     

The crossing number of <Emphasis Type="Italic">G</Emphasis> ▭ <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> for the graph <Emphasis Type="Italic">G</Emphasis> on six vertices

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G□C _n for some graphs G on five and six vertices and the cycle C _n are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product G □ C _n , where G is a specific graph on six vertices.     

Optimum super-simple mixed covering arrays of type <Emphasis Type="Italic">a</Emphasis><Superscript>1</Superscript><Emphasis Type="Italic">b</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis>−1</Superscript>

A mixed covering array (MCA) of type (_v 1, v ₂,..., v _k ), denoted by MCA_λ (N; t, k, (v ₁, v ₂,..., v _k )), is an N × k array with entries in the i-th column from a set _{V i} of v _i symbols and has the property that each N × t sub-array covers all the t-tuples at least λ times, where 1 ≤ i ≤ k. An MCA _λ (N; t, k, (_v 1, v ₂,..., v _k )) is said to be super-simple, if each of its N × (t + 1) sub-arrays contains each (t + 1)-tuple at most once. Recently, it was proved by Tang, Yin and the author that an optimum super-simple MCA of type (a, b, b,..., b) is equivalent to a mixed detecting array (DTA) of type (a, b, b,..., b) with optimum size. Such DTAs can be used to generate test suites to identify and determine the interaction faults between the factors in a component-based system. In this paper, some combinatorial constructions of optimum super-simple MCAs of type (a, b, b,..., b) are provided. By employing these constructions, some optimum super-simple MCAs are then obtained. In particular, the spectrum across which optimum super-simple MCA₂(2b ²; 2, 4, (a, b, b, b))′s exist, is completely determined, where 2 ≤ a ≤ b.     

Asymptotic purity for very general hypersurfaces of ℙ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> × ℙ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> of bidegree (<Emphasis Type="Italic">k,k</Emphasis>)

For a complex irreducible projective variety, the volume function and the higher asymptotic cohomological functions have proven to be useful in understanding the positivity of divisors as well as other geometric properties of the variety. In this paper, we study the vanishing properties of these functions on hypersurfaces of ℙ ⁿ × ℙ ⁿ . In particular, we show that very general hypersurfaces of bidegree (k, k) obey a very strong vanishing property, which we define as asymptotic purity: at most one asymptotic cohomological function is nonzero for each divisor. This provides evidence for the truth of a conjecture of Bogomolov and also suggests some general conditions for asymptotic purity.     

On 2 – (<Emphasis Type="Italic">n</Emphasis><Superscript>2</Superscript>, 2<Emphasis Type="Italic">n</Emphasis>, 2<Emphasis Type="Italic">n</Emphasis>–1) designs with three intersection numbers

The simple incidence structure , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane of order n > 4, is a 2 – (n ²,2n,2n–1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ≥ 5 is an odd integer. Supported by M.I.U.R., Università di Palermo.     

The smooth structure set of <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> × <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>

We calculate \({\mathcal{S}^{{\it Diff}}(S^p \times S^q)}\), the smooth structure set of S ^p × S ^q , for p, q ≥ 2 and p + q ≥ 5. As a consequence we show that in general \({\mathcal{S}^{Diff}(S^{4j-1}\times S^{4k})}\) cannot admit a group structure such that the smooth surgery exact sequence is a long exact sequence of groups. We also show that the image of the forgetful map \({\mathcal{S}^{Diff}(S^{4j}\times S^{4k}) \rightarrow \mathcal{S}^{Top}(S^{4j}\times S^{4k})}\) is not in general a subgroup of the topological structure set.     

On the Spectrum of the Sizes of Maximal Partial Line Spreads in <Emphasis Type="Italic">PG</Emphasis>(2<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">q</Emphasis>), <Emphasis Type="Italic">n</Emphasis> ≥ 3

A lot of research has been done on the spectrum of the sizes of maximal partial spreads in PG(3,q) [P. Govaerts and L. Storme, Designs Codes and Cryptography, Vol. 28 (2003) pp. 51–63; O. Heden, Discrete Mathematics, Vol. 120 (1993) pp. 75–91; O. Heden, Discrete Mathematics, Vol. 142 (1995) pp. 97–106; O. Heden, Discrete Mathematics, Vol. 243 (2002) pp. 135–150]. In [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129], results on the spectrum of the sizes of maximal partial line spreads in PG(N,q), N 5, are given. In PG(2n,q), n 3, the largest possible size for a partial line spread is q^2n-1+q^2n-3+...+q³+1. The largest size for the maximal partial line spreads constructed in [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129] is (q²ⁿ⁺¹–q)/(q²–1)–q³+q²–2q+2. This shows that there is a non-empty interval of values of k for which it is still not known whether there exists a maximal partial line spread of size k in PG(2n,q). We now show that there indeed exists a maximal partial line spread of size k for every value of k in that interval when q 9.J. Eisfeld: Supported by the FWO Research Network WO.011.96NP. Sziklai: The research of this author was partially supported by OTKA D32817, F030737, F043772, FKFP 0063/2001 and Magyary Zoltan grants. The third author is grateful for the hospitality of Ghent University.     

<Emphasis Type="Italic">C</Emphasis><Superscript>1+<Emphasis Type="Italic">α</Emphasis></Superscript>-Regularity for Two-Dimensional Almost-Minimal Sets in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We give a new proof and a partial generalization of Jean Taylor’s result (Ann. Math. (2) 103(3), 489–539, 1976) that says that Almgren almost-minimal sets of dimension 2 in ℝ³ are locally C ^1+α -equivalent to minimal cones. The proof is rather elementary, but uses a local separation result proved in Ann. Fac. Sci. Toulouse 18(1), 65–246, 2009 and an extension of Reifenberg’s parameterization theorem (David et al. in Geom. Funct. Anal. 18, 1168–1235, 2008). The key idea is still that if X is the cone over an arc of small Lipschitz graph in the unit sphere, but X is not contained in a disk, we can use the graph of a harmonic function to deform X and substantially diminish its area. The local separation result is used to reduce to unions of cones over arcs of Lipschitz graphs. A good part of the proof extends to minimal sets of dimension 2 in ℝ ⁿ , but in this setting our final regularity result on E may depend on the list of minimal cones obtained as blow-up limits of E at a point.     

<Emphasis Type="Italic">C</Emphasis><Superscript>∞</Superscript> regularity of solutions of the Levi equation in<Emphasis Type="Italic">R</Emphasis><Superscript><Emphasis Type="Italic">2n+1</Emphasis></Superscript>

We study the regularity of the solutions of the Levi equation in ?²ⁿ⁺¹. It is a second order quasilinear equation whose characteristic matrix is positive semidefinite and has vanishing determinant at every point and for every functionu∈C ². We show that the operator associated to the equation can be represented as a sum of squares of non linear vector fields. Then, by using a freezing method, we prove theC ^∞ regularity of the solutions.     

The fractional Hausdorff operators on the Hardy spaces <Emphasis Type="Italic">H</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

In this paper, we study the high-dimensional fractional Hausdorff operators and establish their boundedness on the real Hardy spaces H ^p (? ⁿ ) for 0 < p < 1.     

Restriction of Representations of GL (<Emphasis Type="Italic">n</Emphasis> + 1, <Emphasis Type="Italic">ℂ</Emphasis>) to GL (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">ℂ</Emphasis>) and Action of the Lie Overalgebra

Consider a restriction of an irreducible finite dimensional holomorphic representation of \(\text {GL}(n + 1,\mathbb {C})\) to the subgroup \(\text {GL}(n,\mathbb {C})\). We write explicitly formulas for generators of the Lie algebra \(\mathfrak {g}\mathfrak {l}(n + 1)\) in the direct sum of representations of \(\text {GL}(n,\mathbb {C})\). Nontrivial generators act as differential-difference operators, the differential part has order n ??1, the difference part acts on the space of parameters (highest weights) of representations. We also formulate a conjecture about unitary principal series of \(\text {GL}(n,\mathbb {C})\).