Volume Comparison of Conformally Compact Manifolds with Scalar Curvature <Emphasis Type="Italic">R</Emphasis> ≥ −<Emphasis Type="Italic">n</Emphasis> (<Emphasis Type="Italic">n</Emphasis> − 1)

In this paper, we use the normalized Ricci–DeTurk flow to prove a stability result for strictly stable conformally compact Einstein manifolds. As an application, we show a local volume comparison of conformally compact manifolds with scalar curvature R ≥ ?n (n ? 1) and also the rigidity result when certain relative volume is zero.     

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

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.     

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

On the Equicontinuity Region of Discrete Subgroups of <Emphasis Type="Italic">PU</Emphasis>(1,<Emphasis Type="Italic">n</Emphasis>)

Let G be a discrete subgroup of PU(1,n). Then G acts on ℙ_ℂ ⁿ preserving the unit ball ℍ_ℂ ⁿ , where it acts by isometries with respect to the Bergman metric. In this work we look at its action on all of ℙ_ℂ ⁿ and determine its equicontinuity region Eq(G). This turns out to be the complement of the union of all complex projective hyperplanes in ℙ_ℂ ⁿ which are tangent to ∂ℍ_ℂ ⁿ at points in the Chen-Greenberg limit set Λ(G), a closed G-invariant subset of ∂ℍ_ℂ ⁿ which is minimal for non-elementary groups. We also prove that the action on Eq(G) is discontinuous. Also , if the limit set is “sufficiently general” (i.e. it is not contained in any proper k -chain), then each connected component of Eq(G) is a holomorphy domain and it is a complete Kobayashi hyperbolic space.     

On coherent systems of type (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">d</Emphasis>, <Emphasis Type="Italic">n</Emphasis> + 1) on Petri curves

We study coherent systems of type (n, d, n + 1) on a Petri curve X of genus g ≥ 2. We describe the geometry of the moduli space of such coherent systems for large values of the parameter α. We determine the top critical value of α and show that the corresponding “flip” has positive codimension. We investigate also the non-emptiness of the moduli space for smaller values of α, proving in many cases that the condition for non-emptiness is the same as for large α. We give some detailed results for g ≤ 5 and applications to higher rank Brill–Noether theory and the stability of kernels of evaluation maps, thus proving Butler’s conjecture in some cases in which it was not previously known. The authors are members of the research group VBAC (Vector Bundles on Algebraic Curves). The first two authors were supported by EPSRC grant GR/T22988/01 for a visit to the University of Liverpool. The second author acknowledges the support of CONACYT grant 48263-F. The third author thanks CIMAT, Guanajuato, México and California State University Channel Islands, where a part of this paper was completed, and acknowledges support from the Academia Mexicana de Ciencias, under its exchange agreement with the Royal Society of London.     

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 Strong <Emphasis Type="Italic">n</Emphasis>-partite Tournaments with Exactly Two Cycles of Length <Emphasis Type="Italic">n</Emphasis> − 1

Gutin and Rafiey (Australas J. Combin. 34 (2006), 17-21) provided an example of an n-partite tournament with exactly n ? m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤ n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n ? m + 1 cycles of length m for two values of m? In the same paper, they showed that this question has a negative answer for two values n ? 1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n ? 1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n ? 1 and any l with 3 ≤ l ≤ n and l ≠ n ? 1.     

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.

     

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.     

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.     

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

A theorem of the alternatives for the equation |<Emphasis Type="Italic">Ax</Emphasis>| − |<Emphasis Type="Italic">B</Emphasis>||<Emphasis Type="Italic">x</Emphasis>| = <Emphasis Type="Italic">b</Emphasis>

A theorem of the alternatives for the equation \({|Ax|-|B||x|=b\ (A,B\in{\mathbb{R}}^{n\times n},\, b\in{\mathbb{R}}^n)}\) is proved and several consequences are drawn. In particular, a class of matrices A, B is identified for which the equation has exactly 2 ⁿ solutions for each positive right-hand side b.     

The structure of digraphs associated with the congruence <Emphasis Type="Italic">x</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript> ≡ <Emphasis Type="Italic">y</Emphasis> (mod <Emphasis Type="Italic">n</Emphasis>)

We assign to each pair of positive integers n and k ⩾ 2 a digraph G(n, k) whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a ^k ≡ b (mod n). We investigate the structure of G(n, k). In particular, upper bounds are given for the longest cycle in G(n, k). We find subdigraphs of G(n, k), called fundamental constituents of G(n, k), for which all trees attached to cycle vertices are isomorphic.     

The <Emphasis Type="Italic">ψ</Emphasis>-associate <Emphasis Type="Italic">X</Emphasis><Superscript>#</Superscript> of a flat <Emphasis Type="Italic">X</Emphasis> in PG(<Emphasis Type="Italic">n</Emphasis>, 2)

For a given hypersurface ψ in PG(n, 2), with equation Q(x) = 0, where Q is a polynomial of (reduced) degree d > 1, a definition is given of the ψ-associate X ^# of a flat X in PG(n, 2). The definition involves the fully polarized form of the polynomial Q; in the cubic case d = 3 it reads: X ^# = {z ∈ PG(n, 2) | T(x, y, z) = 0 for all x, y ∈ X}, where T(x, y, z) denotes the alternating trilinear form obtained by completely polarizing Q. Some general results, valid for any degree d and projective dimension n, are first expounded. Thereafter several choices of ψ are visited, but for each choice just a few aspects are highlighted. Despite the partial nature of the survey quite a variety of behaviours of the ψ-associate are uncovered. Many of the choices of ψ which are considered are of cubic hypersurfaces in PG(5, 2). If ψ is the Segre variety it is shown that the 48 planes external to fall into eight pairs of ordered triplets {(P ₁, R ₁, S ₁), (P ₂, R ₂, S ₂)} such that and . Further those lines L of PG(5, 2) which are singular, satisfying that is L ^# = PG(5.2), are in this case shown to form a complete spread of 21 lines. Another result of note arises in the case where ψ is the underlying 35-set of a non-maximal partial spread Σ₅ of five planes in PG(5, 2), where it is shown that one plane is singled out by the property that every line is singular.      

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.     

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.     

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

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