Triviality of Iwasawa module associated to some abelian fields of prime conductors

Let p be an odd prime number and \(\ell \) an odd prime number dividing \(p-1\). We denote by \(F=F_{p,\ell }\) the real abelian field of conductor p and degree \(\ell \), and by \(h_F\) the class number of F. For a prime number \(r \ne p,\,\ell \), let \(F_{\infty }\) be the cyclotomic \(\mathbb {Z}_r\)-extension over F, and \(M_{\infty }/F_{\infty }\) the maximal pro-r abelian extension unramified outside r. We prove that \(M_{\infty }\) coincides with \(F_{\infty }\) and consequently \(h_F\) is not divisible by r when r is a primitive root modulo \(\ell \) and r is smaller than an explicit constant depending on p.     

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.     

Newly appointed editors

Let k be a field and \(k(x_0,\ldots ,x_{p-1})\) be the rational function field of p variables over k where p is a prime number. Suppose that \(G=\langle \sigma \rangle \simeq C_p\) acts on \(k(x_0,\ldots ,x_{p-1})\) by k-automorphisms defined as \(\sigma :x_0\mapsto x_1\mapsto \cdots \mapsto x_{p-1}\mapsto x_0\). Denote by P the set of all prime numbers and define \(P_0=\{p\in P:\mathbb {Q}(\zeta _{p-1})\) is of class number one\(\}\) where \(\zeta _n\) a primitive n-th root of unity in \(\mathbb {C}\) for a positive integer n; \(P_0\) is a finite set by Masley and Montgomery (J Reine Angew Math 286/287:248–256, 1976). Theorem. Let k be an algebraic number field and \(P_k=\{p\in P: p\) is ramified in \(k\}\). Then \(k(x_0,\ldots ,x_{p-1})^G\) is not stably rational over k for all \(p\in P\backslash (P_0\cup P_k)\).     

The non-abelian tensor square of residually finite groups

Let m, n be positive integers and p a prime. We denote by \(\nu (G)\) an extension of the non-abelian tensor square \(G \otimes G\) by \(G \times G\). We prove that if G is a residually finite group satisfying some non-trivial identity \(f \equiv ~1\) and for every \(x,y \in G\) there exists a p-power \(q=q(x,y)\) such that \([x,y^{\varphi }]^q = 1\), then the derived subgroup \(\nu (G)'\) is locally finite (Theorem A). Moreover, we show that if G is a residually finite group in which for every \(x,y \in G\) there exists a p-power \(q=q(x,y)\) dividing \(p^m\) such that \([x,y^{\varphi }]^q\) is left n-Engel, then the non-abelian tensor square \(G \otimes G\) is locally virtually nilpotent (Theorem B).     

Generalized Bernstein Operators on the Classical Polynomial Spaces

We study generalizations of the classical Bernstein operators on the polynomial spaces \(\mathbb {P}_{n}[a,b]\), where instead of fixing \(\mathbf {1}\) and x, we reproduce exactly \(\mathbf {1}\) and a polynomial \(f_1\), strictly increasing on [a, b]. We prove that for sufficiently large n, there always exist generalized Bernstein operators fixing \(\mathbf {1}\) and \(f_1\). These operators are defined by non-decreasing sequences of nodes precisely when \(f_1^\prime > 0\) on (a, b), but even if \(f_1^\prime \) vanishes somewhere inside (a, b), they converge to the identity.     

Skew <Emphasis Type="Italic">n</Emphasis>-derivation on prime and semi prime rings

Let \(n \ge 2\) be a fixed integer, R be a noncommutative n!-torsion free ring and I be any non zero ideal of R. In this paper we have proved the following results; (i) If R is a prime ring and there exists a symmetric skew n-derivation \(D: R^n \rightarrow R\) associated with the automorphism \(\sigma \) on R,  such that the trace function \(\delta : R \rightarrow R \) of D satisfies \([\delta (x), \sigma (x)] =0\), for all \(x\in I,\) then \(D=0;\,\)(ii) If R is a semi prime ring and the trace function \(\delta ,\) commuting on I,  satisfies \([\delta (x), \sigma (x)]\in Z\), for all \(x \in I,\) then \([\delta (x), \sigma (x)] = 0 \), for all \(x \in I.\) Moreover, we have proved some annihilating conditions for algebraic identity involving multiplicative(generalized) derivation.     

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

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.     

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.     

On the family of elliptic curves $$\varvec{y^2=x^3-m^2x+p^2}$$

In this paper, we study the torsion subgroup and rank of elliptic curves for the subfamilies of \(E_{m,p} : y^2=x^3-m^2x+p^2\), where m is a positive integer and p is a prime. We prove that for any prime p, the torsion subgroup of \(E_{m,p}(\mathbb {Q})\) is trivial for both the cases {\(m\ge 1\), \(m\not \equiv 0\pmod 3\)} and {\(m\ge 1\), \(m \equiv 0 \pmod 3\), with \(gcd(m,p)=1\)}. We also show that given any odd prime p and for any positive integer m with \(m\not \equiv 0\pmod 3\) and \(m\equiv 2\pmod {32}\), the lower bound for the rank of \(E_{m,p}(\mathbb {Q})\) is 2. Finally, we find curves of rank 9 in this family.     

On the estimates of the upper and lower bounds of Ramanujan primes

For \(n\ge 1\), the nth Ramanujan prime is defined as the least positive integer \(R_{n}\) such that for all \(x\ge R_{n}\), the interval \((\frac{x}{2}, x]\) has at least n primes. Let \(p_{i}\) be the ith prime and \(R_{n}=p_{s}\). Sondow, Laishram, and other scholars gave a series of upper bounds of s. In this paper we establish several results giving estimates of upper and lower bounds of Ramanujan primes. Using these estimates, we discuss a conjecture on Ramanujan primes of Sondow–Nicholson–Noe and prove that if \(n>10^{300}\), then \(\pi (R_{mn})\le m\pi (R_{n})\) for \(m\ge 1\).     

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.     

The Gray image of constacyclic codes over the finite chain ring $$F_{p^m}[u]/\langle u^k\rangle $$

Let \(\mathbb {F}_{p^m}\) be a finite field of cardinality \(p^m\), where p is a prime, and k, N be any positive integers. We denote \(R_k=F_{p^m}[u]/\langle u^k\rangle =F_{p^m}+uF_{p^m}+\cdots +u^{k-1}F_{p^m}\) (\(u^k=0\)) and \(\lambda =a_0+a_1u+\cdots +a_{k-1}u^{k-1}\) where \(a_0, a_1,\ldots , a_{k-1}\in F_{p^m}\) satisfying \(a_0\ne 0\) and \(a_1=1\). Let r be a positive integer satisfying \(p^{r-1}+1\le k\le p^r\). First we define a Gray map from \(R_k\) to \(F_{p^m}^{p^r}\), then prove that the Gray image of any linear \(\lambda \)-constacyclic code over \(R_k\) of length N is a distance preserving linear \(a_0^{p^r}\)-constacyclic code over \(F_{p^m}\) of length \(p^rN\). Furthermore, the generator polynomials for each linear \(\lambda \)-constacyclic code over \(R_k\) of length N and its Gray image are given respectively. Finally, some optimal constacyclic codes over \(F_{3}\) and \(F_{5}\) are constructed.     

On Star–Wheel Ramsey Numbers

For two given graphs \(G_1\) and \(G_2\), the Ramsey number \(R(G_1,G_2)\) is the least integer r such that for every graph G on r vertices, either G contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). In this note, we determined the Ramsey number \(R(K_{1,n},W_m)\) for even m with \(n+2\le m\le 2n-2\), where \(W_m\) is the wheel on \(m+1\) vertices, i.e., the graph obtained from a cycle \(C_m\) by adding a vertex v adjacent to all vertices of the \(C_m\).     

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

Prime Power Indices in Factorised Groups

Let the group \(G=AB\) be the product of the subgroups A and B. We determine some structural properties of G when the p-elements in \(A\cup B\) have prime power indices in G, for some prime p. More generally, we also consider the case that all prime power order elements in \(A\cup B\) have prime power indices in G. In particular, when \(G=A=B\), we obtain as a consequence some known results.     

Counterexamples to the B-spline Conjecture for Gabor Frames

The frame set conjecture for B-splines \(B_n\), \(n \ge 2\), states that the frame set is the maximal set that avoids the known obstructions. We show that any hyperbola of the form \(ab=r\), where r is a rational number smaller than one and a and b denote the sampling and modulation rates, respectively, has infinitely many pieces, located around \(b=2,3,\dots \), not belonging to the frame set of the nth order B-spline. This, in turn, disproves the frame set conjecture for B-splines. On the other hand, we uncover a new region belonging to the frame set for B-splines \(B_n\), \(n \ge 2\).     

The Best Mixing Time for Random Walks on Trees

We characterize the extremal structures for mixing walks on trees that start from the most advantageous vertex. Let \(G=(V,E)\) be a tree with stationary distribution \(\pi \). For a vertex \(v \in V\), let \(H(v,\pi )\) denote the expected length of an optimal stopping rule from v to \(\pi \). The best mixing time for G is \(\min _{v \in V} H(v,\pi )\). We show that among all trees with \(|V|=n\), the best mixing time is minimized uniquely by the star. For even n, the best mixing time is maximized by the uniquely path. Surprising, for odd n, the best mixing time is maximized uniquely by a path of length \(n-1\) with a single leaf adjacent to one central vertex.     

On the maximality of a set of mutually orthogonal Sudoku Latin Squares

The maximum number of mutually orthogonal Sudoku Latin squares (MOSLS) of order \(n=m^2\) is \(n-m\). In this paper, we construct for \(n=q^2\), q a prime power, a set of \(q^2-q-1\) MOSLS of order \(q^2\) that cannot be extended to a set of \(q^2-q\) MOSLS. This contrasts to the theory of ordinary Latin squares of order n, where each set of \(n-2\) mutually orthogonal Latin Squares (MOLS) can be extended to a set of \(n-1\) MOLS (which is best possible). For this proof, we construct a particular maximal partial spread of size \(q^2-q+1\) in \(\mathrm {PG}(3,q)\) and use a connection between Sudoku Latin squares and projective geometry, established by Bailey, Cameron and Connelly.     

Cyclic compositions and cycles of the hypercube

The partition graph of a positive integer n, \(P_n\), is the graph whose vertices are the cyclic compositions of n and two vertices are adjacent if one composition is obtained from the other one by replacing two cyclically consecutive parts by their sum. In this paper we introduce and investigate the notions of singular cyclic composition and singular edge of \(P_n\). We associate with every singular edge and every cycle of \(P_n\), whose vertices are aperiodic cyclic compositions of n, a cycle or a set of disjoint cycles of equal length of the hypercube \(Q_n\).