Complexities of normal bases constructed from Gauss periods

Let q be a power of a prime p, and let \(r=nk+1\) be a prime such that \(r\not \mid q\), where n and k are positive integers. Under a simple condition on q, r and k, a Gauss period of type (n, k) is a normal element of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\); the complexity of the resulting normal basis of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\) is denoted by C(n, k; p). Recent works determined C(n, k; p) for \(k\le 7\) and all qualified n and q. In this paper, we show that for any given \(k>0\), C(n, k; p) is given by an explicit formula except for finitely many primes \(r=nk+1\) and the exceptional primes are easily determined. Moreover, we describe an algorithm that allows one to compute C(n, k; p) for the exceptional primes \(r=nk+1\). Our numerical results cover C(n, k; p) for \(k\le 20\) and all qualified n and q.     

2-Domination number of generalized Petersen graphs

Let \(G=(V,E)\) be a graph. A subset \(S\subseteq V\) is a k-dominating set of G if each vertex in \(V-S\) is adjacent to at least k vertices in S. The k-domination number of G is the cardinality of the smallest k-dominating set of G. In this paper, we shall prove that the 2-domination number of generalized Petersen graphs \(P(5k+1, 2)\) and \(P(5k+2, 2)\), for \(k>0\), is \(4k+2\) and \(4k+3\), respectively. This proves two conjectures due to Cheng (Ph.D. thesis, National Chiao Tung University, 2013). Moreover, we determine the exact 2-domination number of generalized Petersen graphs P(2k, k) and \(P(5k+4,3)\). Furthermore, we give a good lower and upper bounds on the 2-domination number of generalized Petersen graphs \(P(5k+1, 3), P(5k+2,3)\) and \(P(5k+3, 3).\)     

A group of continuous self-maps on a topological groupoid

The group of bisections of groupoids plays an important role in the study of Lie groupoids. In this paper another construction is introduced. Indeed, for a topological groupoid G, the set of all continuous self-maps f on G such that (x, f(x)) is a composable pair for every \(x\in G\), is denoted by \(S_G\). We show that \(S_G\) by a natural binary operation is a monoid. \(S_G(\alpha )\), the group of units in \(S_G\) precisely consists of those \(f\in S_G\) such that the map \(x\mapsto xf(x)\) is a bijection on G. Similar to the group of bisections, \(S_G(\alpha )\) acts on G from the right and on the space of continuous self-maps on G from the left. It is proved that \(S_G(\alpha )\) with the compact- open topology inherited from C(G, G) is a left topological group. For a compact Hausdorff groupoid G it is proved that the group of bisections of \(G^2\) is isomorphic to the group \(S_G(\alpha )\) and the group of transitive bisections of G, \(Bis_T(G)\), is embedded in \(S_G(\alpha )\), where \(G^2\) is the groupoid of all composable pairs.     

Coloring Complete and Complete Bipartite Graphs from Random Lists

Assign to each vertex v of the complete graph \(K_n\) on n vertices a list L(v) of colors by choosing each list independently and uniformly at random from all f(n)-subsets of a color set \([n] = \{1,\dots , n\}\), where f(n) is some integer-valued function of n. Such a list assignment L is called a random (f(n), [n])-list assignment. In this paper, we determine the asymptotic probability (as \(n \rightarrow \infty \)) of the existence of a proper coloring \(\varphi \) of \(K_n\), such that \(\varphi (v) \in L(v)\) for every vertex v of \(K_n\). We show that this property exhibits a sharp threshold at \(f(n) = \log n\). Additionally, we consider the corresponding problem for the line graph of a complete bipartite graph \(K_{m,n}\) with parts of size m and n, respectively. We show that if \(m = o(\sqrt{n})\), \(f(n) \ge 2 \log n\), and L is a random (f(n), [n])-list assignment for the line graph of \(K_{m,n}\), then with probability tending to 1, as \(n \rightarrow \infty \), there is a proper coloring of the line graph of \(K_{m,n}\) with colors from the lists.     

Coloring of the Square of Kneser Graph $$$$

The Kneser graph K(n, k) is the graph whose vertices are the k-element subsets of an n elements set, with two vertices adjacent if they are disjoint. The square \(G^2\) of a graph G is the graph defined on V(G) such that two vertices u and v are adjacent in \(G^2\) if the distance between u and v in G is at most 2. Determining the chromatic number of the square of the Kneser graph K(n, k) is an interesting graph coloring problem, and is also related with intersecting family problem. The square of K(2k, k) is a perfect matching and the square of K(n, k) is the complete graph when \(n \ge 3k-1\). Hence coloring of the square of \(K(2k +1, k)\) has been studied as the first nontrivial case. In this paper, we focus on the question of determining \(\chi (K^2(2k+r,k))\) for \(r \ge 2\). Recently, Kim and Park (Discrete Math 315:69–74, 2014) showed that \(\chi (K^2(2k+1,k)) \le 2k+2\) if \( 2k +1 = 2^t -1\) for some positive integer t. In this paper, we generalize the result by showing that for any integer r with \(1 \le r \le k -2\),

1. (a)
   \(\chi (K^2 (2k+r, k)) \le (2k+r)^r\),   if   \(2k + r = 2^t\) for some integer t, and
    
2. (b)
   \(\chi (K^2 (2k+r, k)) \le (2k+r+1)^r\),   if  \(2k + r = 2^t-1\) for some integer t.
    

On the other hand, it was shown in Kim and Park (Discrete Math 315:69–74, 2014) that \(\chi (K^2 (2k+r, k)) \le (r+2)(3k + \frac{3r+3}{2})^r\) for \(2 \le r \le k-2\). We improve these bounds by showing that for any integer r with \(2 \le r \le k -2\), we have \(\chi (K^2 (2k+r, k)) \le 2 \left( \frac{9}{4}k + \frac{9(r+3)}{8} \right) ^r\). Our approach is also related with injective coloring and coloring of Johnson graph.

     

Some results on a special case of a general continued fraction of Ramanujan

We derive a new special case C(q) of a general continued fraction recorded by Ramanujan in his Lost Notebook. We give a representation of the continued fraction C(q) as a quotient of Dedekind eta-function and then use it to prove modular identities connecting C(q) with each of the continued fractions \(C(-q)\), \(C(q^{2})\), \(C(q^{3})\), \(C(q^{5})\), \(C(q^{7})\), \(C(q^{11})\), \(C(q^{13})\) and \(C(q^{17})\). We also prove general theorems for the explicit evaluation of the continued fraction C(q) by using Ramanujan’s class invariants.     

Anti-Ramsey Numbers of Graphs with Small Connected Components

The anti-Ramsey number, AR(n, G), for a graph G and an integer \(n\ge |V(G)|\), is defined to be the minimal integer r such that in any edge-colouring of \(K_n\) by at least r colours there is a multicoloured copy of G, namely, a copy of G that each of its edges has a distinct colour. In this paper we determine, for large enough \(n,\, AR(n,L\cup tP_2)\) and \(AR(n,L\cup kP_3)\) for any large enough t and k, and a graph L satisfying some conditions. Consequently, we determine AR(n, G), for large enough n, where G is \(P_3\cup tP_2\) for any \(t\ge 3,\, P_4\cup tP_2\) and \(C_3\cup tP_2\) for any \(t\ge 2,\, kP_3\) for any \(k\ge 3,\, tP_2\cup kP_3\) for any \(t\ge 1,\, k\ge 2\), and \(P_{t+1}\cup kP_3\) for any \(t\ge 3,\, k\ge 1\). Furthermore, we obtain upper and lower bounds for AR(n, G), for large enough n, where G is \(P_{k+1}\cup tP_2\) and \(C_k\cup tP_2\) for any \(k\ge 4,\, t\ge 1\).     

Universal Cycle Packings and Coverings for <Emphasis Type="Italic">k</Emphasis>-Subsets of an <Emphasis Type="Italic">n</Emphasis>-Set

A cyclic sequence of elements of [n] is an (n, k)-Ucycle packing (respectively, (n, k)-Ucycle covering) if every k-subset of [n] appears in this sequence at most once (resp. at least once) as a subsequence of consecutive terms. Let \(p_{n,k}\) be the length of a longest (n, k)-Ucycle packing and \(c_{n,k}\) the length of a shortest (n, k)-Ucycle covering. We show that, for a fixed \(k,p_{n,k}={n\atopwithdelims ()k}-O(n^{\lfloor k/2\rfloor })\). Moreover, when k is not fixed, we prove that if \(k=k(n)\le n^{\alpha }\), where \(0<\alpha <1/3\), then \(p_{n,k}={n\atopwithdelims ()k}-o({n\atopwithdelims ()k}^\beta )\) and \(c_{n,k}={n\atopwithdelims ()k}+o({n\atopwithdelims ()k}^\beta )\), for some \(\beta <1\). Finally, we show that if \(k=o(n)\), then \(p_{n,k}={n\atopwithdelims ()k}(1-o(1))\).     

On the singular series for primes in arithmetic progressions<Superscript>*</Superscript>

Using \( \mathfrak{G} \)(d, k) to denote the singular series for primes in arithmetic progressions and using the word “tail” to denote the difference of \( \mathfrak{G} \)(d, k) and its partial sums, we establish some asymptotic formulas for weighted sums of the square of the tail and so give more information on the singular series \( \mathfrak{G} \)(d, k).     

A Completion of the Spectrum for the Overlarge Sets of Pure Mendelsohn Triple Systems

A pure Mendelsohn triple system of order v, denoted by PMTS(v), is a pair \((X,\mathcal {B})\) where X is a v-set and \(\mathcal {B}\) is a collection of cyclic triples on X such that every ordered pair of X belongs to exactly one triple of \(\mathcal {B}\) and if \(\langle a,b,c\rangle \in \mathcal {B}\) implies \(\langle c,b,a\rangle \notin \mathcal {B}\). An overlarge set of PMTS(v), denoted by OLPMTS(v), is a collection \(\{(Y{\setminus }\{y_i\},{\mathcal {A}}_i)\}_i\), where Y is a \((v+1)\)-set, \(y_i\in Y\), each \((Y{\setminus }\{y_i\},{\mathcal {A}}_i)\) is a PMTS(v) and these \({\mathcal {A}}_i\)s form a partition of all cyclic triples on Y. It is shown in [3] that there exists an OLPMTS(v) for \(v\equiv 1,3\) (mod 6), \(v>3\), or \(v \equiv 0,4\) (mod 12). In this paper, we shall discuss the existence problem of OLPMTS(v)s for \(v\equiv 6,10\) (mod 12) and get the following conclusion: there exists an OLPMTS(v) if and only if \(v\equiv 0,1\) (mod 3), \(v>3\) and \(v\ne 6\).     

Critical vertices in k-connected digraphs

It is proved that every non-complete, finite digraph of connectivity number k has a fragment F containing at most k critical vertices. The following result is a direct consequence: every k-connected, finite digraph D of minimum out- and indegree at least \(2k+ m- 1\) for positive integers k, m has a subdigraph H of minimum outdegree or minimum indegree at least \(m-1\) such that \(D - x\) is k-connected for all \(x \in V(H)\). For \(m = 1\), this implies immediately the existence of a vertex of indegree or outdegree less than 2k in a k-critical, finite digraph, which was proved in Mader (J Comb Theory (B) 53:260–272, 1991).     

Another proof of Grothendieck’s theorem on the splitting of vector bundles on the projective line

This note contains another proof of Grothendieck‘s theorem on the splitting of vector bundles on the projective line over a field k. Actually the proof is formulated entirely in the classical terms of a lattice \(\Lambda \cong k[T]^d\), discretely embedded into the vector space \(V \cong K_\infty ^d\), where \(K_\infty \cong k((1/T))\) is the completion of the field of rational functions k(T) at the place \(\infty \) with the usual valuation.     

Semidefinite bounds for nonbinary codes based on quadruples

For nonnegative integers q, n, d, let \(A_q(n,d)\) denote the maximum cardinality of a code of length n over an alphabet [q] with q letters and with minimum distance at least d. We consider the following upper bound on \(A_q(n,d)\). For any k, let \(\mathcal{C}_k\) be the collection of codes of cardinality at most k. Then \(A_q(n,d)\) is at most the maximum value of \(\sum _{v\in [q]^n}x(\{v\})\), where x is a function \(\mathcal{C}_4\rightarrow {\mathbb {R}}_+\) such that \(x(\emptyset )=1\) and \(x(C)=\!0\) if C has minimum distance less than d, and such that the \(\mathcal{C}_2\times \mathcal{C}_2\) matrix \((x(C\cup C'))_{C,C'\in \mathcal{C}_2}\) is positive semidefinite. By the symmetry of the problem, we can apply representation theory to reduce the problem to a semidefinite programming problem with order bounded by a polynomial in n. It yields the new upper bounds \(A_4(6,3)\le 176\), \(A_4(7,3)\le 596\), \(A_4(7,4)\le 155\), \(A_5(7,4)\le 489\), and \(A_5(7,5)\le 87\).     

The distortion dimension of $$\mathbb $$-rank 1 lattices

Let \(X=G/K\) be a symmetric space of noncompact type and rank \(k\ge 2\). We prove that horospheres in X are Lipschitz \((k-2)\)-connected if their centers are not contained in a proper join factor of the spherical building of X at infinity. As a consequence, the distortion dimension of an irreducible \(\mathbb {Q}\)-rank-1 lattice \(\Gamma \) in a linear, semisimple Lie group G of \(\mathbb R\)-rank k is \(k-1\). That is, given \(m< k-1\), a Lipschitz m-sphere S in (a polyhedral complex quasi-isometric to) \(\Gamma \), and a \((m+1)\)-ball B in X (or G) filling S, there is a \((m+1)\)-ball \(B'\) in \(\Gamma \) filling S such that \({{\mathrm{vol}}}B'\sim {{\mathrm{vol}}}B\). In particular, such arithmetic lattices satisfy Euclidean isoperimetric inequalities up to dimension \(k-1\).     

<Emphasis Type="Italic">b</Emphasis>-Generalized Skew Derivations on Lie Ideals

Let R be a non-commutative prime ring, Z(R) its center, Q its right Martindale quotient ring, C its extended centroid, \(F\ne 0\) an b-generalized skew derivation of R, L a non-central Lie ideal of R, \(0\ne a\in R\) and \(n\ge 1\) a fixed integer. In this paper, we prove the following two results:

1. 1.
   If R has characteristic different from 2 and 3 and \(a[F(x),x]^n=0\), for all \(x\in L\), then either there exists an element \(\lambda \in C\), such that \(F(x)=\lambda x\), for all \(x\in R\) or R satisfies \(s_4(x_1,\ldots ,x_4)\), the standard identity of degree 4, and there exist \(\lambda \in C\) and \(b\in Q\), such that \(F(x)=bx+xb+\lambda x\), for all \(x\in R\).
    
2. 2.
   If \(\mathrm{{char}}(R)=0\) or \(\mathrm{{char}}(R) > n\) and \(a[F(x),x]^n\in Z(R)\), for all \(x\in R\), then either there exists an element \(\lambda \in C\), such that \(F(x)=\lambda x\), for all \(x\in R\) or R satisfies \(s_4(x_1,\ldots ,x_4)\).
    

     

Forcing Posets with Large Dimension to Contain Large Standard Examples

The dimension of a poset P, denoted \(\dim (P)\), is the least positive integer d for which P is the intersection of d linear extensions of P. The maximum dimension of a poset P with \(|P|\le 2n+1\) is n, provided \(n\ge 2\), and this inequality is tight when P contains the standard example \(S_n\). However, there are posets with large dimension that do not contain the standard example \(S_2\). Moreover, for each fixed \(d\ge 2\), if P is a poset with \(|P|\le 2n+1\) and P does not contain the standard example \(S_d\), then \(\dim (P)=o(n)\). Also, for large n, there is a poset P with \(|P|=2n\) and \(\dim (P)\ge (1-o(1))n\) such that the largest d so that P contains the standard example \(S_d\) is o(n). In this paper, we will show that for every integer \(c\ge 1\), there is an integer \(f(c)=O(c^2)\) so that for large enough n, if P is a poset with \(|P|\le 2n+1\) and \(\dim (P)\ge n-c\), then P contains a standard example \(S_d\) with \(d\ge n-f(c)\). From below, we show that \(f(c)={\varOmega }(c^{4/3})\). On the other hand, we also prove an analogous result for fractional dimension, and in this setting f(c) is linear in c. Here the result is best possible up to the value of the multiplicative constant.     

Packing chromatic number versus chromatic and clique number

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into sets \(V_i\), \(i\in [k]\), where each \(V_i\) is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that \(\omega (G) = a\), \(\chi (G) = b\), and \(\chi _{\rho }(G) = c\). If so, we say that (a, b, c) is realizable. It is proved that \(b=c\ge 3\) implies \(a=b\), and that triples \((2,k,k+1)\) and \((2,k,k+2)\) are not realizable as soon as \(k\ge 4\). Some of the obtained results are deduced from the bounds proved on the packing chromatic number of the Mycielskian. Moreover, a formula for the independence number of the Mycielskian is given. A lower bound on \(\chi _{\rho }(G)\) in terms of \(\Delta (G)\) and \(\alpha (G)\) is also proved.     

Derivations Vanishing Identities Involving Generalized Derivations and Multilinear Polynomial in Prime Rings

Let R be a prime ring of characteristic different from 2 with Utumi quotient ring U and extended centroid C, \(f(x_1,\ldots ,x_n)\) be a multilinear polynomial over C, which is not central valued on R. Suppose that d is a non-zero derivation of R, F and G are two generalized derivations of R such that \(d\{F(u)u-uG^2(u)\}=0\) for all \(u\in f(R)\). Then one of the following holds:

1. (i)
   there exist \(a, b, p\in U\), \(\lambda \in C\) such that \(F(x)=\lambda x+bx+xa^2\), \(G(x)=ax\), \(d(x)=[p, x]\) for all \(x\in R\) with \([p, b]=0\) and \(f(x_1,\ldots , x_n)^2\) is central valued on R;
    
2. (ii)
   there exist \(a, b, p\in U\) such that \(F(x)=ax\), \(G(x)=xb\), \(d(x)=[p,x]\) for all \(x\in R\) and \(f(x_1,\ldots , x_n)^2\) is central valued on R with \([p, a-b^2]=0\);
    
3. (iii)
   there exist \(a\in U\) such that \(F(x)=xa^2\) and \(G(x)=ax\) for all \(x\in R\);
    
4. (iv)
   there exists \(a\in U\) such that \(F(x)=a^2x\) and \(G(x)=xa\) for all \(x\in R\) with \(a^2\in C\);
    
5. (v)
   there exist \(a, p\in U\), \(\lambda , \alpha , \mu \in C\) such that \(F(x)=\lambda x-a^2x\), \(G(x)=xa\) and \(d(x)=[p,x]\) for all \(x\in R\) with \(a^2=\mu -\alpha p\) and \(\alpha p^2+(\lambda -2\mu ) p\in C\);
    
6. (vi)
   there exist \(a\in U\), \(\lambda \in C\) such that R satisfies \(s_4\) and either \(F(x)=\lambda x+xa^2\), \(G(x)=ax\) or \(F(x)=\lambda x-a^2x\), \(G(x)=xa\) for all \(x\in R\).
    

     

A new theorem on the prime-counting function

For \(x>0\), let \(\pi (x)\) denote the number of primes not exceeding x. For integers a and \(m>0\), we determine when there is an integer \(n>1\) with \(\pi (n)=(n+a)/m\). In particular, we show that, for any integers \(m>2\) and \(a\leqslant \lceil e^{m-1}/(m-1)\rceil \), there is an integer \(n>1\) with \(\pi (n)=(n+a)/m\). Consequently, for any integer \(m>4\), there is a positive integer n with \(\pi (mn)=m+n\). We also pose several conjectures for further research; for example, we conjecture that, for each \(m=1,2,3,\ldots \), there is a positive integer n such that \(m+n\) divides \(p_m+p_n\), where \(p_k\) denotes the k-th prime.