Geometric Constructibility of Polygons Lying on a Circular Arc

For a positive integer n, an n-sided polygon lying on a circular arc or, shortly, an n-fan is a sequence of \(n+1\) points on a circle going counterclockwise such that the “total rotation” \(\delta \) from the first point to the last one is at most \(2\pi \). We prove that for \(n\ge 3\), the n-fan cannot be constructed with straightedge and compass in general from its central angle \(\delta \) and its central distances, which are the distances of the edges from the center of the circle. Also, we prove that for each fixed \(\delta \) in the interval \((0, 2\pi ]\) and for every \(n\ge 5\), there exists a concrete n-fan with central angle \(\delta \) that is not constructible from its central distances and \(\delta \). The present paper generalizes some earlier results published by the second author and Á. Kunos on the particular cases \(\delta =2\pi \) and \(\delta =\pi \).     

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

On the Diophantine equation $$X^{2N}+2^{2\alpha }5^{2\beta }{p}^{2\gamma } = Z^5$$

We prove that for each prime p, positive integer \(\alpha \), and non-negative integers \(\beta \) and \(\gamma \), the Diophantine equation \(X^{2N} + 2^{2\alpha }5^{2\beta }{p}^{2\gamma } = Z^5\) has no solution with N, X, \(Z\in \mathbb {Z}^+\), \(N > 1\), and \(\gcd (X,Z) = 1\).     

A characterization of the desarguesian and the Figueroa planes of order $$q^{3}$$

Let \(\Pi \) be a plane of order \(q^{3}\), \(q>2\), admitting \(G\cong PGL(3,q)\) as a collineation group. By Dempwolff (Geometriae Dedicata 18:101–112, 1985) the plane \(\Pi \) contains a G-invariant subplane \(\pi _{0}\) isomorphic to PG(2, q) on which G acts 2-transitively. In this paper it is shown that, if the homologies of \(\pi _{0}\) contained in G extend to \(\Pi \) then \(\Pi \) is either the desarguesian or the Figueroa plane.     

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.     

Sums of powers of primes

Let \(k>-1\). The sum of the kth powers of the primes less than x is asymptotic to \(\pi (x^{k+1})\). We show that the sum is less than \(\pi (x^{k+1})\) for arbitrarily large x, and the reverse inequality also holds for arbitrarily large x. When \(k>0\), there is a bias toward the first inequality, and we explain why this should be true and why the reverse bias holds when \(-1<k<0\).     

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

On determination of positive-definiteness for an anisotropic operator

We study the positive-definiteness of a family of \(L^2(\mathbb {R})\) integral operators with kernel \(K_{t, a} (x, y) = \pi ^{-1} (1 + (x - y)^2+ a(x^2 + y^2)^t)^{-1}\), for \(t > 0\) and \(a > 0\). For \(0 < t \le 1\) and \(a > 0\), the known theory of positive-definite kernels and conditionally negative-definite kernels confirms positive-definiteness. For \(t > 1\) and a sufficiently large, the integral operator is not positive-definite. For t not an integer, but with integer odd part, the integral operator is not positive-definite.     

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

Monochromatic Solutions for Multi-Term Unknowns

Given integers \(k\ge 2\), \(n \ge 2\), \(m \ge 2\) and \( a_1,a_2,\ldots ,a_m \in {\mathbb {Z}}{\backslash }{\{0\}}\), and let \(f(z)= \sum _{j=0}^{n}c_jz^j\) be a polynomial of integer coefficients with \(c_n>0\) and \((\sum _{i=1}^ma_i)|f(z)\) for some integer z. For a k-coloring of \([N]=\{1,2,\ldots ,N\}\), we say that there is a monochromatic solution of the equation \(a_1x_1+a_2x_2+\cdots +a_mx_m=f(z)\) if there exist pairwise distinct \(x_1,x_2,\ldots ,x_m\in [N]\) all of the same color such that the equation holds for some \(z\in \mathbb {Z}\). Problems of this type are often referred to as Ramsey-type problems. In this paper, it is shown that if \(a_i>0\) for \(1\le i\le m\), then there exists an integer \(N_0=N(k,m,n)\) such that for \(N\ge N_0\), each k-coloring of [N] contains a monochromatic solution \(x_1,x_2,\ldots ,x_m\) of the equation \(a_1x_1+a_2x_2+ \cdots +a_mx_m= f(z)\). Moreover, if n is odd and there are \(a_i\) and \(a_j\) such that \(a_ia_j<0\) for some \(1 \le i\ne j\le m\), then the assertion holds similarly.     

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.     

A note on amicable numbers and their variations

For any positive integer n, let \(\sigma (\mathrm{n})\) and p(n) denote the sum of divisors and the least prime divisor of n respectively. Let a, b be positive integers. In this paper we prove the following two results: (i) If 4 | a and \(\gcd (a, b)=1\), then a and b do not satisfy \(\sigma (a)= \sigma (b)=a+b\). (ii) If \(a>10^{8}\) and \(p(a)>2\log _{2}a+1\), where \(\log _{2}{a}\) is the logarithm of a with base 2, then a and b do not satisfy \(\sigma (a)=\sigma (b)=a+b+\lambda \), where \(\lambda \in \{0,\pm 1\}\).     

Rotational Surfaces in $$S^{3}$$ with Constant Mean Curvature

There is a two-parametric family of rotational symmetric CMC surfaces; more precisely, for every real number H and every \(C\ge 2(H+\sqrt{1+H^2})\) there is a rotational symmetry surface \(\Sigma _{H,C}\) with mean curvature H. Perdomo (Asian J Math 14:73–108, 2010) showed that for every H between \(\cot \left( \frac{\pi }{m}\right) \) and \(\frac{m^2-2}{2\sqrt{m^2-1}}\) there exists an embedded rotational symmetric example with non-constant principal curvatures that is invariant under the cyclic group \(Z_m\). Recently Andrews and Li (J Differ Geom 99:169–189, 2015) showed that these embedded CMC tori are the only embedded genus 1 surfaces with CMC on the sphere. In this paper we complete the study of this family of CMC surfaces and we show that for every integer \(m>2\), there is a properly immersed example in this family that contains a great circle and is invariant under the cyclic group \(Z_m\). We will say that these examples contain the axis of symmetry. We also show that every non-isoparametric surface \(\Sigma _{H,C}\) is either properly immersed and invariant under the cyclic group \(Z_m\) for some integer \(m>1\) or it is dense in the region bounded by two isoparametric tori if the surface \(\Sigma _{H,C}\) does not contain the axis of symmetry or it is dense in the region bounded by a totally umbilical surface if the surface \(\Sigma _{H,C}\) contains the axis of symmetry.     

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

     

Packing Chromatic Number of Base-3 Sierpiński Graphs

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least \(i+1\). Let \(S^n\) be the base-3 Sierpiński graph of dimension n. It is proved that \(\chi _{\rho }(S^1) = 3\), \(\chi _{\rho }(S^2) = 5\), \(\chi _{\rho }(S^3) = \chi _{\rho }(S^4) = 7\), and that \(8\le \chi _\rho (S^n) \le 9\) holds for any \(n\ge 5\).     

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.     

Polynomially peripheral range-preserving maps between Banach algebras

Let A and B be two Banach function algebras and p a two variable polynomial \(p(z,w)=zw+az+bw+c\), (\(a,b,c\in {\mathbb {C}}\)). We characterize the general form of a surjection \(T: A \longrightarrow B\) which satisfies \(\mathrm{Ran}_\pi (p(Tf,Tg))\cap \mathrm{Ran}_\pi (p(f,g))\ne \emptyset , (f,g\in A\) and \(c\ne ab)\), where \(\mathrm{Ran}_\pi (f)\) is the peripheral range of f.     

Rotations by roots of unity and Diophantine approximation

For a fixed integer n, we study the question whether at least one of the numbers \(\mathfrak {R}X\omega ^k\), \(1\le k\le n\), is \(\varepsilon \)-close to an integer, for any possible value of \(X\in \mathbb {C}\), where \(\omega \) is a primitive nth root of unity. It turns out that there is always an X for which the above numbers are concentrated around \(1/2\,\mathrm{mod}\,1\). The shortest possible interval centered at 1 / 2 containing the fractional parts of all numbers \(\mathfrak {R}X\omega ^k\) depends only on the prime factors of n, rather than its magnitude. This is directly related to the so–called “pyjama” problem which was solved recently.     

Subgroups of cyclic groups and values of the Riemann zeta function

Let k be a positive integer, x a large real number, and let \(C_n\) be the cyclic group of order n. For \(k\le n\le x\) we determine the mean average order of the subgroups of \(C_n\) generated by k distinct elements and we give asymptotic results of related averaging functions of the orders of subgroups of cyclic groups. The average order is expressed in terms of Jordan’s totient functions and Stirling numbers of the second kind. We have the following consequence. Let k and x be as above. For \(k\le n\le x\), the mean average proportion of \(C_n\) generated by k distinct elements approaches \(\zeta (k+2)/\zeta (k+1)\) as x grows, where \(\zeta (s)\) is the Riemann zeta function.     

The Terwilliger algebra of the incidence graph of the Hamming graph

Let \(\varGamma \) be a distance-semiregular graph on Y, and let \(D^Y\) be the diameter of \(\varGamma \) on Y. Let \(\varDelta \) be the halved graph of \(\varGamma \) on Y. Fix \(x \in Y\). Let T and \(T'\) be the Terwilliger algebras of \(\varGamma \) and \(\varDelta \) with respect to x, respectively. Assume, for an integer i with \(1 \le 2i \le D^Y\) and for \(y,z \in \varGamma _{2i}(x)\) with \(\partial _{\varGamma }(y,z)=2\), the numbers \(|\varGamma _{2i-1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) and \(|\varGamma _{2i+1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) depend only on i and do not depend on the choice of y, z. The first goal in this paper is to show the relations between T-modules of \(\varGamma \) and \(T'\)-modules of \(\varDelta \). Assume \(\varGamma \) is the incidence graph of the Hamming graph H(D, n) on the vertex set Y and the set \({\mathcal {C}}\) of all maximal cliques. Then, \(\varGamma \) satisfies above assumption and \(\varDelta \) is isomorphic to H(D, n). The second goal is to determine the irreducible T-modules of \(\varGamma \). For each irreducible T-module W, we give a basis for W the action of the adjacency matrix on this basis and we calculate the multiplicity of W.