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.     

Appell polynomial sequences with respect to some differential operators

We present a study of a specific kind of lowering operator, herein called \(\Lambda \), which is defined as a finite sum of lowering operators and might be presented by various configurations. We characterize the polynomial sequences fulfilling an Appell relation with respect to \(\Lambda \), and considering a concrete cubic decomposition of a simple Appell sequence, we prove that the polynomial component sequences are \(\Lambda \)-Appell, with \(\Lambda \) defined as previously, although by a three term sum. Ultimately, we prove the non-existence of orthogonal polynomial sequences which are also \(\Lambda \)-Appell, when \(\Lambda \) is the lowering operator \(\Lambda =a_{0}D+a_{1}DxD+a_{2}\left( Dx\right) ^2D\), where \(a_{0}\), \(a_{1}\) and \(a_{2}\) are constants and \(a_{2} \ne 0\). The case where \(a_{2}=0\) and \(a_{1} \ne 0\) is also naturally recaptured.     

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.     

Unique representation bi-basis for rational numbers field

For \(A\subseteq {\mathbb {Q}}\), \(\alpha \in {\mathbb {Q}}\), let \(r_{A}(\alpha )=\#\{(a_{1}, a_{2})\in A^{2}: \alpha =a_{1}+a_{2}, a_{1}\le a_{2}\},\) \(\delta _{A}(\alpha )=\#\{(a_{1}, a_{2})\in A^{2}: \alpha =a_{1}-a_{2} \}.\) In this paper, we construct a set \(A\subset {\mathbb {Q}}\) such that \(r_{A}(\alpha )=1\) for all \(\alpha \in {\mathbb {Q}}\) and \(\delta _{A}(\alpha )=1\) for all \(\alpha \in {\mathbb {Q}}\setminus \{{0}\}\).     

Continued fractions and irrational rotations

Let \(\alpha \in (0, 1)\) be an irrational number with continued fraction expansion \(\alpha =[0; a_1, a_2, \ldots ]\) and let \(p_n/q_n= [0; a_1, \ldots , a_n]\) be the nth convergent to \(\alpha \). We prove a formula for \(p_nq_k-q_np_k\) \((k<n)\) in terms of a Fibonacci type sequence \(Q_n\) defined in terms of the \(a_n\) and use it to provide an exact formula for \(\{n\alpha \}\) for all n.     

Computing the Permanent of (Some) Complex Matrices

We present a deterministic algorithm, which, for any given \(0< \epsilon < 1\) and an \(n \times n\) real or complex matrix \(A=\left( a_{ij}\right) \) such that \(\left| a_{ij}-1 \right| \le 0.19\) for all \(i, j\) computes the permanent of \(A\) within relative error \(\epsilon \) in \(n^{O\left( \ln n -\ln \epsilon \right) }\) time. The method can be extended to computing hafnians and multidimensional permanents.     

Contributions to a conjecture of Mueller and Schmidt on Thue inequalities

Let \(F(X,Y)=\sum \nolimits _{i=0}^sa_iX^{r_i}Y^{r-r_i}\in {\mathbb {Z}}[X,Y]\) be a form of degree \(r=r_s\ge 3\), irreducible over \({\mathbb {Q}}\) and having at most \(s+1\) non-zero coefficients. Mueller and Schmidt showed that the number of solutions of the Thue inequality

$$\begin{aligned} |F(X,Y)|\le h \end{aligned}$$

is \(\ll s^2h^{2/r}(1+\log h^{1/r})\). They conjectured that \(s^2\) may be replaced by s. Let

$$\begin{aligned} \Psi = \max _{0\le i\le s} \max \left( \sum _{w=0}^{i-1} \frac{1}{r_i-r_w},\sum _{w= i+1}^{s}\frac{1}{r_w-r_i}\right) . \end{aligned}$$

Then we show that \(s^2\) may be replaced by \(\max (s\log ^3s, se^{\Psi })\). We also show that if \(|a_0|=|a_s|\) and \(|a_i|\le |a_0|\) for \(1\le i\le s-1\), then \(s^2\) may be replaced by \(s\log ^{3/2}s\). In particular, this is true if \(a_i\in \{-1,1\}\).

     

On the Extremal Theory of Continued Fractions

Letting \(x=[a_1(x), a_2(x), \ldots ]\) denote the continued fraction expansion of an irrational number \(x\in (0, 1)\), Khinchin proved that \(S_n(x)=\sum \nolimits _{k=1}^n a_k(x) \sim \frac{1}{\log 2}n\log n\) in measure, but not for almost every \(x\). Diamond and Vaaler showed that, removing the largest term from \(S_n(x)\), the previous asymptotics will hold almost everywhere, this shows the crucial influence of the extreme terms of \(S_n (x)\) on the sum. In this paper we determine, for \(d_n\rightarrow \infty \) and \(d_n/n\rightarrow 0\), the precise asymptotics of the sum of the \(d_n\) largest terms of \(S_n(x)\) and show that the sum of the remaining terms has an asymptotically Gaussian distribution.     

Study of LG-Holling type III predator–prey model with disease in predator

Let \(\mathbb F_{q}\) be a finite field with \(q=p^{m}\) elements, where p is an odd prime and m is a positive integer. In this paper, let \(D=\{(x_{1},x_{2},\ldots ,x_{n})\in \mathbb F_{q}^{n}\backslash \{(0,0,\ldots )\}: Tr(x_{1}^{p^{k_{1}}+1}+x_{2}^{p^{k_{2}}+1}+\cdots +x_{n}^{p^{k_{n}}+1})=c\}\), where \(c\in \mathbb F_p\), Tr is the trace function from \(\mathbb F_{q}\) to \(\mathbb F_{p}\) and each \(m/(m,k_{i})\) ( \(1\le i\le n\) ) is odd. we define a p-ary linear code \(C_{D}=\{c(a_{1},a_{2},\ldots ,a_{n}):(a_{1},a_{2},\ldots ,a_{n})\in \mathbb F_{q}^{n}\}\), where \(c(a_{1},a_{2},\ldots ,a_{n})=(Tr(a_{1}x_{1}+a_{2}x_{2}+\cdots +a_{n}x_{n}))_{(x_{1},x_{2},\ldots ,x_{n})\in D}\). We present the weight distributions of the classes of linear codes which have at most three weights.     

Diagonalization of the Finite Hilbert Transform on Two Adjacent Intervals

We continue the study of stability of solving the interior problem of tomography. The starting point is the Gelfand–Graev formula, which converts the tomographic data into the finite Hilbert transform (FHT) of an unknown function f along a collection of lines. Pick one such line, call it the x-axis, and assume that the function to be reconstructed depends on a one-dimensional argument by restricting f to the x-axis. Let \(I_1\) be the interval where f is supported, and \(I_2\) be the interval where the Hilbert transform of f can be computed using the Gelfand–Graev formula. The equation to be solved is \(\left. {\mathcal {H}}_1 f=g\right| _{I_2}\), where \({\mathcal {H}}_1\) is the FHT that integrates over \(I_1\) and gives the result on \(I_2\), i.e. \({\mathcal {H}}_1: L^2(I_1)\rightarrow L^2(I_2)\). In the case of complete data, \(I_1\subset I_2\), and the classical FHT inversion formula reconstructs f in a stable fashion. In the case of interior problem (i.e., when the tomographic data are truncated), \(I_1\) is no longer a subset of \(I_2\), and the inversion problems becomes severely unstable. By using a differential operator L that commutes with \({\mathcal {H}}_1\), one can obtain the singular value decomposition of \({\mathcal {H}}_1\). Then the rate of decay of singular values of \({\mathcal {H}}_1\) is the measure of instability of finding f. Depending on the available tomographic data, different relative positions of the intervals \(I_{1,2}\) are possible. The cases when \(I_1\) and \(I_2\) are at a positive distance from each other or when they overlap have been investigated already. It was shown that in both cases the spectrum of the operator \({\mathcal {H}}_1^*{\mathcal {H}}_1\) is discrete, and the asymptotics of its eigenvalues \(\sigma _n\) as \(n\rightarrow \infty \) has been obtained. In this paper we consider the case when the intervals \(I_1=(a_1,0)\) and \(I_2=(0,a_2)\) are adjacent. Here \(a_1 < 0 < a_2\). Using recent developments in the Titchmarsh–Weyl theory, we show that the operator L corresponding to two touching intervals has only continuous spectrum and obtain two isometric transformations \(U_1\), \(U_2\), such that \(U_2{\mathcal {H}}_1 U_1^*\) is the multiplication operator with the function \(\sigma (\lambda )\), \(\lambda \ge (a_1^2+a_2^2)/8\). Here \(\lambda \) is the spectral parameter. Then we show that \(\sigma (\lambda )\rightarrow 0\) as \(\lambda \rightarrow \infty \) exponentially fast. This implies that the problem of finding f is severely ill-posed. We also obtain the leading asymptotic behavior of the kernels involved in the integral operators \(U_1\), \(U_2\) as \(\lambda \rightarrow \infty \). When the intervals are symmetric, i.e. \(-a_1=a_2\), the operators \(U_1\), \(U_2\) are obtained explicitly in terms of hypergeometric functions.     

Structural Properties of Word Representable Graphs

Given a word \(w=w_1w_2\cdots w_n\) of length n over an ordered alphabet \(\Sigma _k\), we construct a graph \(G(w)=(V(w), E(w))\) such that V(w) has n vertices labeled \(1, 2,\ldots , n\) and for \(i, j \in V(w)\), \((i, j) \in E(w)\) if and only if \(w_iw_j\) is a scattered subword of w of the form \(a_{t}a_{t+1}\), \(a_t \in \Sigma _k\), for some \(1 \le t \le k-1\) with the ordering \(a_t<a_{t+1}\). A graph is said to be Parikh word representable if there exists a word w over \(\Sigma _k\) such that \(G=G(w)\). In this paper we characterize all Parikh word representable graphs over the binary alphabet in terms of chordal bipartite graphs. It is well known that the graph isomorphism (GI) problem for chordal bipartite graph is GI complete. The GI problem for a subclass of (6, 2) chordal bipartite graphs has been addressed. The notion of graph powers is a well studied topic in graph theory and its applications. We also investigate a bipartite analogue of graph powers of Parikh word representable graphs. In fact we show that for G(w), \(G(w)^{[3]}\) is a complete bipartite graph, for any word w over binary alphabet.     

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.     

Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes

It has become common knowledge that constructing q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\) is significantly more difficult than constructing those with minimum distance less than or equal to \(q/2+1\). Despite of various constructions of q-ary quantum MDS codes, all known q-ary quantum MDS codes have minimum distance bounded by \(q/2+1\) except for some lengths. The purpose of the current paper is to provide some new q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\). In this paper, we provide several classes of quantum MDS codes with minimum distance bigger than \(q/2+1\). For instance, some examples in these classes include q-ary \([n,n-2k, k+1]\)-quantum MDS codes for cases: (i) \(q\equiv -1\bmod {5}, n=(q^2+4)/5\) and \(1\le k\le (3q-2)/5\); (ii) \(q\equiv -1\bmod {7}, n=(q^2+6)/7\) and \(1\le k\le (4q-3)/7\); (iii) \(2|q, q\equiv -1\bmod {3}, n=2(q^2-1)/3\) and \(1\le k\le (2q-1)/3\); and (iv) \(2|q, q\equiv -1\bmod {5}, n=2(q^2-1)/5\) and \(1\le k\le (3q-2)/5\).     

On the restricted partition function

For a vector \(\mathbf a = (a_1,\ldots ,a_r)\) of positive integers, we prove formulas for the restricted partition function \(p_{\mathbf a}(n): = \) the number of integer solutions \((x_1,\dots ,x_r)\) to \(\sum _{j=1}^r a_jx_j=n\) with \(x_1\ge 0, \ldots , x_r\ge 0\) and its polynomial part.     

On $$(\ell,m)$$-regular partitions with distinct parts

Let \(a_{\ell ,m}(n)\) denote the number of \((\ell ,m)\)-regular partitions of a positive integer n into distinct parts, where \(\ell \) and m are relatively primes. In this paper, we establish several infinite families of congruences modulo 2 for \(a_{3,5}(n)\). For example,

$$\begin{aligned} a_{3, 5}\left(2^{6\alpha +4}5^{2\beta }n+\frac{ 2^{6\alpha +3}5^{2\beta +1}-1}{3}\right) \equiv 0 , \end{aligned}$$

where \(\alpha , \beta \ge 0\).

     

Upper and lower fast Khintchine spectra in continued fractions

For an irrational number \(x\in [0,1)\), let \(x=[a_1(x), a_2(x),\ldots ]\) be its continued fraction expansion. Let \(\psi : \mathbb {N} \rightarrow \mathbb {N}\) be a function with \(\psi (n)/n\rightarrow \infty \) as \(n\rightarrow \infty \). The (upper, lower) fast Khintchine spectrum for \(\psi \) is defined as the Hausdorff dimension of the set of numbers \(x\in (0,1)\) for which the (upper, lower) limit of \(\frac{1}{\psi (n)}\sum _{j=1}^n\log a_j(x)\) is equal to 1. The fast Khintchine spectrum was determined by Fan, Liao, Wang, and Wu. We calculate the upper and lower fast Khintchine spectra. These three spectra can be different.     

Some results on generalized strong external difference families

A generalized strong external difference family (briefly \((v, m; k_1,\dots ,k_m; \lambda _1,\dots ,\lambda _m)\)-GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we give some nonexistence results for GSEDFs. In particular, we prove that a \((v, 3;k_1,k_2,k_3; \lambda _1,\lambda _2,\lambda _3)\)-GSEDF does not exist when \(k_1+k_2+k_3< v\). We also give a first recursive construction for GSEDFs and prove that if there is a \((v,2;2\lambda ,\frac{v-1}{2};\lambda ,\lambda )\)-GSEDF, then there is a \((vt,2;4\lambda ,\frac{vt-1}{2};2\lambda ,2\lambda )\)-GSEDF with \(v>1\), \(t>1\) and \(v\equiv t\equiv 1\pmod 2\). Then we use it to obtain some new GSEDFs for \(m=2\). In particular, for any prime power q with \(q\equiv 1\pmod 4\), we show that there exists a \((qt, 2;(q-1)2^{n-1},\frac{qt-1}{2};(q-1)2^{n-2},(q-1)2^{n-2})\)-GSEDF, where \(t=p_1p_2\dots p_n\), \(p_i>1\), \(1\le i\le n\), \(p_1, p_2,\dots ,p_n\) are odd integers.     

Relative Difference Sets and Hadamard Matrices from Perfect Quaternionic Arrays

Let \(G=\mathbf{C}_{n_1}\times \cdots \times \mathbf{C}_{n_m}\) be an abelian group of order \(n=n_1\dots n_m\), where each \(\mathbf{C}_{n_t}\) is cyclic of order \(n_t\). We present a correspondence between the (4n, 2, 4n, 2n)-relative difference sets in \(G\times Q_8\) relative to the centre \(Z(Q_8)\) and the perfect arrays of size \(n_1\times \dots \times n_m\) over the quaternionic alphabet \(Q_8\cup qQ_8\), where \(q=(1+i+j+k)/2\). In view of this connection, for \(m=2\) we introduce new families of relative difference sets in \(G\times Q_8\), as well as new families of Williamson and Ito Hadamard matrices with G-invariant components.     

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

Spectrality of infinite convolutions with three-element digit sets

Let \(0< \rho <1\) and let \(\{a_n, b_n\}_{n=1}^\infty \) be a sequence of integers with bounded from upper and lower. Associated with them there exists a unique Borel probability measure \(\mu _{\rho , \{0, a_n, b_n\}}\) generated by the following infinite convolution product

$$\begin{aligned} \mu _{\rho , \{0, a_n, b_n\}}=\delta _{\rho \{0, a_1, b_1\}} *\delta _{\rho ^2 \{0, a_2, b_2\}} *\delta _{\rho ^3 \{0, a_3, b_3\}} *\cdots \end{aligned}$$

in the weak convergence, where \(\delta _E=\frac{1}{\# E}\sum _{e \in E} \delta _e\) and \(\hbox {gcd}(a_n, b_n)=1\) for all \(n \in {{\mathbb {N}}}\). In this paper, we show that \(L^2(\mu _{\rho , \{0, a_n, b_n\}})\) admits an exponential orthonormal basis if and only if \(\rho ^{-1} \in 3{{\mathbb {N}}}\) and  \(\{a_n, b_n\} \equiv \{1, 2\} \ (\mathrm {mod} \ 3)\) for all \(n \in {{\mathbb {N}}}\).