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

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

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.     

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.     

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.     

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.     

On the regularity of scalar <Emphasis Type="Italic">p</Emphasis>-Harmonic functions in <Emphasis Type="Italic">n</Emphasis> dimensions with 2 ≤ <Emphasis Type="Italic">p</Emphasis> < <Emphasis Type="Italic">n</Emphasis>

Using Tilli’s technique [Cal Var 25(3):395–401, 2006], we shall give a new proof of the regularity of the local minima of the functional

$J\left( u\right) =\int\limits_{\Omega } \left\vert \partial u\right\vert^{p}\,dx$

with Ω a domain of class C ^{0, 1} in \({\mathbb{R}^{n}}\) and 2 ≤ p < n.

     

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.     

Derivatives for smooth representations of <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℝ) and <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℂ)

The notion of derivatives for smooth representations of GL(n, ? _p ) was defined in [BZ77]. In the archimedean case, an analog of the highest derivative was defined for irreducible unitary representations in [Sah89] and called the “adduced” representation. In this paper we define derivatives of all orders for smooth admissible Fréchet representations of moderate growth. The real case is more problematic than the p-adic case; for example, arbitrary derivatives need not be admissible. However, the highest derivative continues being admissible, and for irreducible unitarizable representations coincides with the space of smooth vectors of the adduced representation.In the companion paper [AGS] we prove exactness of the highest derivative functor, and compute highest derivatives of all monomial representations.We apply those results to finish the computation of adduced representations for all irreducible unitary representations and to prove uniqueness of degenerate Whittaker models for unitary representations, thus completing the results of [Sah89, Sah90, SaSt90, GS13a].     

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.     

The discrete fundamental group of the order complex of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is equivalent to computing the discrete homotopy group of the 1-skeleton of the permutahedron. To compute this group we introduce combinatorial techniques that we believe will be helpful in computing discrete fundamental groups of other polytopes. More precisely, we use the language of words, over the alphabet of simple transpositions, to obtain conditions that are necessary and sufficient to characterize the equivalence classes of cycles. The proof requires only simple combinatorial arguments. As a corollary, we also obtain a combinatorial proof of the fact that the first Betti number of the complement of the 3-equal arrangement is equal to 2 ^n?3(n ²?5n+8)?1. This formula was originally obtained by Björner and Welker in 1995.     

Loop subgroups of <Emphasis Type="Italic">F</Emphasis><Subscript><Emphasis Type="Italic">r</Emphasis></Subscript> and the image of their stabilizer subgroups in GL<Subscript><Emphasis Type="Italic">r</Emphasis></Subscript>(ℤ)

For a representative class of subgroups of F _r , the image of their stabilizer subgroup under the action of Aut(F _r ) in GL _r (ℤ) is calculated.     

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})\).     

Optimal boundary control by a displacement in <Emphasis Type="Italic">W</Emphasis>′<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> of a string with free end

We consider an optimal boundary control of a string with free end by a displacement of the other end in W′ _p (Q, T). For p ≠ 2, we prove that the optimal control depends on the initial and terminal conditions nonlinearly.     

Factorization properties of (<Emphasis Type="Italic">n</Emphasis> × <Emphasis Type="Italic">n</Emphasis>) Boolean matrices

It is proved that every (n × n) Boolean matrix can be expressed as a product of primes and elementary matrices in the semigroup of Boolean matrices.     

On common values of <Emphasis Type="Italic">φ</Emphasis>(<Emphasis Type="Italic">n</Emphasis>) and <Emphasis Type="Italic">σ</Emphasis>(<Emphasis Type="Italic">m</Emphasis>). I

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x)^1+o(1) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.     

Bishop’s theorem and differentiability of a subspace of <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">b</Emphasis></Subscript>(<Emphasis Type="Italic">K</Emphasis>)

Let K be a Hausdorff space and C _b (K) be the Banach algebra of all complex bounded continuous functions on K. We study the Gateaux and Fréchet differentiability of subspaces of C _b (K). Using this, we show that the set of all strong peak functions in a nontrivial separating separable subspace H of C _b (K) is a dense G _δ subset of H, if K is compact. This gives a generalized Bishop’s theorem, which says that the closure of the set of all strong peak points for H is the smallest closed norming subset of H. The classical Bishop’s theorem was proved for a separating subalgebra H and a metrizable compact space K.     

Arithmetical characterization of class groups of the form ℤ/<Emphasis Type="Italic">n</Emphasis>ℤ<Emphasis Type="Italic">⊕</Emphasis>ℤ/<Emphasis Type="Italic">n</Emphasis>ℤ via the system of sets of lengths

Let H be a Krull monoid with finite class group such that each class contains a prime divisor (e.g., the multiplicative monoid of the ring of algebraic integers of some number field). It is shown that it can be determined whether the class group is of the form ℤ/nℤ⊕ℤ/nℤ, for n≥3, just by considering the system of sets of lengths of H. Supported by the Austrian Science Fund FWF (Project P18779-N13).     

On the heritability of the property <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">π</Emphasis></Subscript> by subgroups

We consider the so-called Jordan-Pochhammer systems, a special class of linear Pfaffian systems of Fuchsian type on complex linear (or projective) spaces. These systems appeared as systems of differential equations for hypergeometric type integrals in which the integrand is a product of powers of linear functions. These systems also arise in some reductions of the Knizhnik-Zamolodchikov equations. The main advantage of these systems is the possibility of presenting a basis in the solution space of such systems in an explicit integral form and, as a consequence, of describing their monodromy representation. The main focus in the paper is placed on the applications of Jordan-Pochhammer systems. We describe the relationship of Jordan-Pochhammer systems to isomonodromic deformations of Fuchsian systems that are described by the Schlesinger equations, as well as to the linearization of the dynamical system of bending spatial polygons. We also describe the application of Jordan-Pochhammer systems to constructing Kohno systems on the Manin-Schechtman configuration spaces.