On the eigenvalues and spectral radius of starlike trees

Let \(k\ge 1\) and \(n_1,\ldots ,n_k\ge 1\) be some integers. Let \(S(n_1,\ldots ,n_k)\) be a tree T such that T has a vertex v of degree k and \(T{\setminus } v\) is the disjoint union of the paths \(P_{n_1},\ldots ,P_{n_k}\), that is \(T{\setminus } v\cong P_{n_1}\cup \cdots \cup P_{n_k}\) so that every neighbor of v in T has degree one or two. The tree \(S(n_1,\ldots ,n_k)\) is called starlike tree, a tree with exactly one vertex of degree greater than two, if \(k\ge 3\). In this paper we obtain the eigenvalues of starlike trees. We find some bounds for the largest eigenvalue (for the spectral radius) of starlike trees. In particular we prove that if \(k\ge 4\) and \(n_1,\ldots ,n_k\ge 2\), then \(\frac{k-1}{\sqrt{k-2}}<\lambda _1(S(n_1,\ldots ,n_k))<\frac{k}{\sqrt{k-1}}\), where \(\lambda _1(T)\) is the largest eigenvalue of T. Finally we characterize all starlike trees that all of whose eigenvalues are in the interval \((-2,2)\).     

Central Limit Theorem and Diophantine Approximations

Let \(F_n\) denote the distribution function of the normalized sum \(Z_n = (X_1 + \cdots + X_n)/(\sigma \sqrt{n})\) of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of \(F_n\) to the normal law with respect to the Kolmogorov distance, as well as polynomial approximations of \(F_n\) by the Edgeworth corrections (modulo logarithmically growing factors in n), are given in terms of the characteristic function of \(X_1\). Particular cases of the problem are discussed in connection with Diophantine approximations.     

Distance Magic Labeling in Complete 4-partite Graphs

Let G be a complete k-partite simple undirected graph with parts of sizes \(p_1\le p_2\cdots \le p_k\). Let \(P_j=\sum _{i=1}^jp_i\) for \(j=1,\ldots ,k\). It is conjectured that G has distance magic labeling if and only if \(\sum _{i=1}^{P_j} (n-i+1)\ge j{{n+1}\atopwithdelims (){2}}/k\) for all \(j=1,\ldots ,k\). The conjecture is proved for \(k=4\), extending earlier results for \(k=2,3\).     

An <Emphasis Type="Italic">A</Emphasis>-invariant subspace for bipartite distance-regular graphs with exactly two irreducible <Emphasis Type="Italic">T</Emphasis>-modules with endpoint 2, both thin

Let \(\Gamma \) denote a bipartite distance-regular graph with vertex set X, diameter \(D \ge 4\), and valency \(k \ge 3\). Let \({{\mathbb {C}}}^X\) denote the vector space over \({{\mathbb {C}}}\) consisting of column vectors with entries in \({{\mathbb {C}}}\) and rows indexed by X. For \(z \in X\), let \({{\widehat{z}}}\) denote the vector in \({{\mathbb {C}}}^X\) with a 1 in the z-coordinate, and 0 in all other coordinates. Fix a vertex x of \(\Gamma \) and let \(T = T(x)\) denote the corresponding Terwilliger algebra. Assume that up to isomorphism there exist exactly two irreducible T-modules with endpoint 2, and they both are thin. Fix \(y \in X\) such that \(\partial (x,y)=2\), where \(\partial \) denotes path-length distance. For \(0 \le i,j \le D\) define \(w_{ij}=\sum {{\widehat{z}}}\), where the sum is over all \(z \in X\) such that \(\partial (x,z)=i\) and \(\partial (y,z)=j\). We define \(W=\mathrm{span}\{w_{ij} \mid 0 \le i,j \le D\}\). In this paper we consider the space \(MW=\mathrm{span}\{mw \mid m \in M, w \in W\}\), where M is the Bose–Mesner algebra of \(\Gamma \). We observe that MW is the minimal A-invariant subspace of \({{\mathbb {C}}}^X\) which contains W, where A is the adjacency matrix of \(\Gamma \). We show that \(4D-6 \le \mathrm{dim}(MW) \le 4D-2\). We display a basis for MW for each of these five cases, and we give the action of A on these bases.     

On the sumsets of exceptional units in $$\mathbb {Z}_n$$

Let R be a commutative ring with \(1\in R\) and \(R^{*}\) be the multiplicative group of its units. In 1969, Nagell introduced the concept of an exceptional unit, namely a unit u such that \(1-u\) is also a unit. Let \({\mathbb {Z}}_n\) be the ring of residue classes modulo n. In this paper, given an integer \(k\ge 2\), we obtain an exact formula for the number of ways to represent each element of \( \mathbb {Z}_n\) as the sum of k exceptional units. This generalizes a recent result of J. W. Sander for the case \(k=2\).     

Brownian Paths Homogeneously Distributed in Space: Percolation Phase Transition and Uniqueness of the Unbounded Cluster

We consider a continuum percolation model on \(\mathbb {R}^d\), \(d\ge 1\). For \(t,\lambda \in (0,\infty )\) and \(d\in \{1,2,3\}\), the occupied set is given by the union of independent Brownian paths running up to time t whose initial points form a Poisson point process with intensity \(\lambda >0\). When \(d\ge 4\), the Brownian paths are replaced by Wiener sausages with radius \(r>0\). We establish that, for \(d=1\) and all choices of t, no percolation occurs, whereas for \(d\ge 2\), there is a non-trivial percolation transition in t, provided \(\lambda \) and r are chosen properly. The last statement means that \(\lambda \) has to be chosen to be strictly smaller than the critical percolation parameter for the occupied set at time zero (which is infinite when \(d\in \{2,3\}\), but finite and dependent on r when \(d\ge 4\)). We further show that for all \(d\ge 2\), the unbounded cluster in the supercritical phase is unique. Along the way a finite box criterion for non-percolation in the Boolean model is extended to radius distributions with an exponential tail. This may be of independent interest. The present paper settles the basic properties of the model and should be viewed as a springboard for finer results.     

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

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

Standard Jordan partitions with three parameters

We extend previous work on standard two-parameter Jordan partitions by Barry (Commun Algebra 43:4231–4246, 2015) to three parameters. Let \(J_r\) denote an \(r \times r\) matrix with minimal polynomial \((t-1)^r\) over a field F of characteristic p. For positive integers \(n_1\), \(n_2\), and \(n_3\) satisfying \(n_1 \le n_2 \le n_3\), the Jordan canonical form of the \(n_1 n_2 n_3 \times n_1 n_2 n_3\) matrix \(J_{n_1} \otimes J_{n_2} \otimes J_{n_3}\) has the form \(J_{\lambda _1} \oplus J_{\lambda _2} \oplus \cdots \oplus J_{\lambda _m}\) where \(\lambda _1 \ge \lambda _2 \ge \cdots \ge \lambda _m>0\) and \(\sum _{i=1}^m \lambda _i=n_1 n_2 n_3\). The partition \(\lambda (n_1,n_2,n_3:p)=(\lambda _1, \lambda _2,\ldots , \lambda _m)\) of \(n_1 n_2 n_3\), which depends on \(n_1\), \(n_2\), \(n_3\), and p, will be called a Jordan partition. We will define what we mean by a standard Jordan partition and give necessary and sufficient conditions for its existence.     

Partial permutation decoding for binary linear and $$Z_4$$-linear Hadamard codes

In this paper, s-\({\text {PD}}\)-sets of minimum size \(s+1\) for partial permutation decoding for the binary linear Hadamard code \(H_m\) of length \(2^m\), for all \(m\ge 4\) and \(2 \le s \le \lfloor {\frac{2^m}{1+m}}\rfloor -1\), are constructed. Moreover, recursive constructions to obtain s-\({\text {PD}}\)-sets of size \(l\ge s+1\) for \(H_{m+1}\) of length \(2^{m+1}\), from an s-\({\text {PD}}\)-set of the same size for \(H_m\), are also described. These results are generalized to find s-\({\text {PD}}\)-sets for the \({\mathbb {Z}}_4\)-linear Hadamard codes \(H_{\gamma , \delta }\) of length \(2^m\), \(m=\gamma +2\delta -1\), which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type \(2^\gamma 4^\delta \). Specifically, s-PD-sets of minimum size \(s+1\) for \(H_{\gamma , \delta }\), for all \(\delta \ge 3\) and \(2\le s \le \lfloor {\frac{2^{2\delta -2}}{\delta }}\rfloor -1\), are constructed and recursive constructions are described.     

Strong extensions for q-summing o perators acting in p-convex Banach function s paces for $$1 \le p \le q$$1≤ p≤ q

Let \(1\le p\le q<\infty \) and let X be a p-convex Banach function space over a \(\sigma \)-finite measure \(\mu \). We combine the structure of the spaces \(L^p(\mu )\) and \(L^q(\xi )\) for constructing the new space \(S_{X_p}^{\,q}(\xi )\), where \(\xi \) is a probability Radon measure on a certain compact set associated to X. We show some of its properties, and the relevant fact that every q-summing operator T defined on X can be continuously (strongly) extended to \(S_{X_p}^{\,q}(\xi )\). Our arguments lead to a mixture of the Pietsch and Maurey-Rosenthal factorization theorems, which provided the known (strong) factorizations for q-summing operators through \(L^q\)-spaces when \(1 \le q \le p\). Thus, our result completes the picture, showing what happens in the complementary case \(1\le p\le q\).     

Approximation of entire functions of exponential type by exponential sums<Superscript>*</Superscript>

Let K be a compact set in \( {{\mathbb R}^n} \). For \( 1 \leqslant p \leqslant \infty \), the Bernstein space \( B_K^p \) is the Banach space of all functions \( f \in {L^p}\left( {{{\mathbb R}^n}} \right) \)such that their Fourier transform in a distributional sense is supported on K. If \( f \in B_K^p \), then f is continuous on \( {{\mathbb R}^n} \) and has an extension onto the complex space \( {{\mathbb C}^n} \) to an entire function of exponential type K. We study the approximation of functions in \( B_K^p \) by finite τ -periodic exponential sums of the form

$ \sum\limits_m {{c_m}{e^{2\pi {\text{i}}\left( {x,m} \right)/\tau }}} $

in the \( {L^p}\left( {\tau {{\left[ { - 1/2,1/2} \right]}^n}} \right) \)-norm as τ → ∞ when K is a polytope in \( {{\mathbb R}^n} \).

     

Toy Teichmüller spaces of real dimension 2: the pentagon and the punctured triangle

Let \(f: S\longrightarrow B\) be a non-trivial fibration from a complex projective smooth surface S to a smooth curve B of genus b. Let \(c_f\) the Clifford index of the general fibre F of f. In Barja et al. (Journal für die reine und angewandte Mathematik, 2016) it is proved that the relative irregularity of f, \(q_f=h^{1,0}(S)-b\) is less or equal than or equal to \(g(F)-c_f\). In particular this proves the (modified) Xiao’s conjecture: \(q_f\le \frac{g(F)}{2} +1\) for fibrations of general Clifford index. In this short note we assume that the general fiber of f is a plane curve of degree \(d\ge 5\) and we prove that \(q_f\le g(F)-c_f-1\). In particular we obtain the conjecture for families of quintic plane curves. This theorem is implied for the following result on infinitesimal deformations: let F a smooth plane curve of degree \(d\ge 5\) and let \(\xi \) be an infinitesimal deformation of F preserving the planarity of the curve. Then the rank of the cup-product map \(H^0(F,\omega _F) {\overset{ \cdot \xi }{\longrightarrow }} H^1(F,O_F)\) is at least \(d-3\). We also show that this bound is sharp.     

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs

Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph \(K_n\) that has no rainbow spanning subgraph with diameter at most t. We prove \(s(n,t)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+1\) for \(n,t\ge 3\), while \(s(n,2)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+\left\lfloor {\frac{n-1}{2}}\right\rfloor \) for \(n\ne 4\) (and \(s(4,2)=2\)).     

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

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.     

Beatty sequences and prime numbers with restrictions on strongly <Emphasis Type="Italic">q</Emphasis>-additive functions

We estimate exponential sums over a non-homogenous Beatty sequence with restriction on strongly q-additive functions. We then apply our result in a few special cases to obtain an asymptotic formula for the number of primes \(p=\lfloor \alpha n +\beta \rfloor \) and \(f(p)\equiv a (\mathrm{mod\,}b)\), with \(n\ge N \), where \(\alpha \), \(\beta \) are real numbers and f is a strongly q-additive function (for example, the sum of digits function in base q is a strongly q-additive function). We also prove that for any fixed integer \(k\ge 3 \), all sufficiently large \(N\equiv k (\mathrm{mod\,}2) \) could be represented as a sum of k prime numbers from a Beatty sequence with restriction on strongly q-additive functions.     

Tightness and Convergence of Trimmed Lévy Processes to Normality at Small Times

For nonnegative integers r, s, let \(^{(r,s)}X_t\) be the Lévy process \(X_t\) with the r largest positive jumps and the s smallest negative jumps up till time t deleted, and let \(^{(r)}\widetilde{X}_t\) be \(X_t\) with the r largest jumps in modulus up till time t deleted. Let \(a_t \in \mathbb {R}\) and \(b_t>0\) be non-stochastic functions in t. We show that the tightness of \(({}^{(r,s)}X_t - a_t)/b_t\) or \(({}^{(r)}{\widetilde{X}}_t - a_t)/b_t\) as \(t\downarrow 0\) implies the tightness of all normed ordered jumps, and hence the tightness of the untrimmed process \((X_t -a_t)/b_t\) at 0. We use this to deduce that the trimmed process \(({}^{(r,s)}X_t - a_t)/b_t\) or \(({}^{(r)}{\widetilde{X}}_t - a_t)/b_t\) converges to N(0, 1) or to a degenerate distribution as \(t\downarrow 0\) if and only if \((X_t-a_t)/b_t \) converges to N(0, 1) or to the same degenerate distribution, as \(t \downarrow 0\).     

Random Walks in the Hyperbolic Plane and the Minkowski Question Mark Function

Consider \(G=SL_2(\mathbb {Z})/\{\pm I\}\) acting on the complex upper half plane H by \(h_M(z)=\frac{az\,+\,b}{cz\,+\,d}\) for \(M \in G\). Let \(D=\{z \in H: |z|\ge 1, |\mathfrak {R}(z)|\le 1/2\}\). We consider the set \({\mathcal {E}} \subset G\) with the nine elements M, different from the identity, such that \(\mathrm{tr\,}(MM^T)\le 3\). We equip the tiling of H defined by \(\mathbb {D}=\{h_M(D){:}\, M \in G\}\) with a graph structure where the neighbours are defined by \(h_M(D) \cap h_{M'}(D) \ne \emptyset \), equivalently \(M^{-1}M' \in {\mathcal {E}}\). The present paper studies several Markov chains related to the above structure. We show that the simple random walk on the above graph converges a.s. to a point X of the real line with the same distribution of \(S_2 W^{S_1}\), where \(S_1,S_2,W\) are independent with \(\Pr (S_i=\pm 1)=1/2\) and where W is valued in (0, 1) with distribution \(\Pr (W<w)=\mathbf ? (w)\). Here \(\mathbf ? \) is the Minkowski function. If \(K_1, K_2, \ldots \) are i.i.d with distribution \(\Pr (K_i=n)= 1/2^n\) for \(n=1,2,\ldots \), then \(W= \frac{1}{K_1+\frac{1}{K_2+\ldots }}\): this known result (Isola in Appl Math 5:1067–1090, 2014) is derived again here.