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.     

Non-triviality conditions for integer-valued polynomial rings on algebras

Let D be a commutative domain with field of fractions K and let A be a torsion-free D-algebra such that \(A \cap K = D\). The ring of integer-valued polynomials on A with coefficients in K is \( Int _K(A) = \{f \in K[X] \mid f(A) \subseteq A\}\), which generalizes the classic ring \( Int (D) = \{f \in K[X] \mid f(D) \subseteq D\}\) of integer-valued polynomials on D. The condition on \(A \cap K\) implies that \(D[X] \subseteq Int _K(A) \subseteq Int (D)\), and we say that \( Int _K(A)\) is nontrivial if \( Int _K(A) \ne D[X]\). For any integral domain D, we prove that if A is finitely generated as a D-module, then \( Int _K(A)\) is nontrivial if and only if \( Int (D)\) is nontrivial. When A is not necessarily finitely generated but D is Dedekind, we provide necessary and sufficient conditions for \( Int _K(A)\) to be nontrivial. These conditions also allow us to prove that, for D Dedekind, the domain \( Int _K(A)\) has Krull dimension 2.     

Hyers–Ulam Stability of Differential Operators on Reproducing Kernel Function Spaces

In this paper, we investigate the Hyers–Ulam stability of the differential operators \(T_\lambda \) and D on the weighted Hardy spaces \(H_\beta ^2\) with the reproducing property. We obtain a necessary and sufficient condition in order that D is stable on \(H_\beta ^2\), and construct an example concerning the stability of \(T_\lambda \) on \(H_\beta ^2\). Moreover, we also investigate the Hyers–Ulam stability of the partial differential operators \(D_i\) on the several variables reproducing kernel space \(H_f^2(\mathbb {B}_d)\).     

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.     

Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs

Given a connected simple graph \(G=(V(G),E(G))\), a set \(S\subseteq V(G)\) is said to be a 2-metric generator for G if and only if for any pair of different vertices \(u,v\in V(G)\), there exist at least two vertices \(w_1,w_2\in S\) such that \(d_G(u,w_i)\ne d_G(v,w_i)\), for every \(i\in \{1,2\}\), where \(d_G(x,y)\) is the length of a shortest path between x and y. The minimum cardinality of a 2-metric generator is the 2-metric dimension of G, denoted by \(\dim _2(G)\). The metric \(d_{G,2}: V(G)\times V(G)\longmapsto {\mathbb {N}}\cup \{0\}\) is defined as \(d_{G,2}(x,y)=\min \{d_G(x,y),2\}\). Now, a set \(S\subseteq V(G)\) is a 2-adjacency generator for G, if for every two vertices \(x,y\in V(G)\) there exist at least two vertices \(w_1,w_2\in S\), such that \(d_{G,2}(x,w_i)\ne d_{G,2}(y,w_i)\) for every \(i\in \{1,2\}\). The minimum cardinality of a 2-adjacency generator is the 2-adjacency dimension of G, denoted by \({\mathrm {adim}}_2(G)\). In this article, we obtain closed formulae for the 2-metric dimension of the lexicographic product \(G\circ H\) of two graphs G and H. Specifically, we show that \(\dim _2(G\circ H)=n\cdot {\mathrm {adim}}_2(H)+f(G,H),\) where \(f(G,H)\ge 0\), and determine all the possible values of f(G, H).     

Analytic sets and extension of holomorphic maps of positive codimension

Let D, \(D'\) be arbitrary domains in \({\mathbb C}^n\) and \({\mathbb C}^N\) respectively, \(1<n\le N\), both possibly unbounded and \(M \subseteq \partial D\), \(M'\subseteq \partial D'\) be open pieces of the boundaries. Suppose that \(\partial D\) is smooth real-analytic and minimal in an open neighborhood of \({\bar{M}}\) and \(\partial D'\) is smooth real-algebraic and minimal in an open neighborhood of \({\bar{M}'}\). Let \(f: D\rightarrow D'\) be a holomorphic mapping such that the cluster set \(\mathrm{cl}_{f}(M)\) does not intersect \(D'\). It is proved that if the cluster set \(\mathrm{cl}_{f}(p)\) of some point \(p\in M\) contains some point \(q\in M'\) and the graph of f extends as an analytic set to a neighborhood of \((p, q)\in {\mathbb {C}}^n \times {\mathbb C}^N\), then f extends as a holomorphic map to a dense subset of some neighborhood of p. If in addition, \(M =\partial D\), \(M'=\partial D'\) and \(M'\) is compact, then f extends holomorphically across an open dense subset of \(\partial D\).     

New nonbinary code bounds based on divisibility arguments

For \(q,n,d \in \mathbb {N}\), let \(A_q(n,d)\) be the maximum size of a code \(C \subseteq [q]^n\) with minimum distance at least d. We give a divisibility argument resulting in the new upper bounds \(A_5(8,6) \le 65\), \(A_4(11,8)\le 60\) and \(A_3(16,11) \le 29\). These in turn imply the new upper bounds \(A_5(9,6) \le 325\), \(A_5(10,6) \le 1625\), \(A_5(11,6) \le 8125\) and \(A_4(12,8) \le 240\). Furthermore, we prove that for \(\mu ,q \in \mathbb {N}\), there is a 1–1-correspondence between symmetric \((\mu ,q)\)-nets (which are certain designs) and codes \(C \subseteq [q]^{\mu q}\) of size \(\mu q^2\) with minimum distance at least \(\mu q - \mu \). We derive the new upper bounds \(A_4(9,6) \le 120\) and \(A_4(10,6) \le 480\) from these ‘symmetric net’ codes.     

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

     

On the gaps between non-zero Fourier coefficients of cusp forms of higher weight

We show that if a modular cuspidal eigenform f of weight 2k is 2-adically close to an elliptic curve \(E/\mathbb {Q}\), which has a cyclic rational 4-isogeny, then n-th Fourier coefficient of f is non-zero in the short interval \((X, X + cX^{\frac{1}{4}})\) for all \(X \gg 0\) and for some \(c > 0\). We use this fact to produce non-CM cuspidal eigenforms f of level \(N>1\) and weight \(k > 2\) such that \(i_f(n) \ll n^{\frac{1}{4}}\) for all \(n \gg 0\).     

Corona problem with data in ideal spaces of sequences

Let E be a Banach lattice on \({\mathbb {Z}}\) with order continuous norm. We show that for any function \(f = \{f_j\}_{j \in {\mathbb {Z}}}\) from the Hardy space \(\mathrm H_{\infty }\left( E \right) \) such that \(\delta \leqslant \Vert f (z)\Vert _E \leqslant 1\) for all z from the unit disk \({\mathbb {D}}\) there exists some solution \(g = \{g_j\}_{j \in {\mathbb {Z}}} \in \mathrm H_{\infty }\left( E' \right) \), \(\Vert g\Vert _{\mathrm H_{\infty }\left( E' \right) } \leqslant C_\delta \) of the Bézout equation \(\sum _j f_j g_j = 1\), also known as the vector-valued corona problem with data in \(\mathrm H_{\infty }\left( E \right) \).     

Fredholmness of fringe operators over the bidisk

Let M be an invariant subspace of \(H^2\) over the bidisk. Associated with M, we have the fringe operator \(F^M_z\) on \(M\ominus w M\). For \(A\subset H^2\), let [A] denote the smallest invariant subspace containing A. Assume that \(F^M_z\) is Fredholm. If h is a bounded analytic function on \(\mathbb {D}^2\) satisfying \(h(0,0)\not =0\), then \(F^{[h M]}_z\) is Fredholm and \(\mathrm{ind}\,F^{[h M]}_z=\mathrm{ind}\,F^M_z\).     

Upper Bounds for the Paired-Domination Numbers of Graphs

A set \(S\subseteq V\) is a paired-dominating set if every vertex in \(V{\setminus } S\) has at least one neighbor in S and the subgraph induced by S contains a perfect matching. The paired-domination number of a graph G, denoted by \(\gamma _{pr}(G)\), is the minimum cardinality of a paired-dominating set of G. A conjecture of Goddard and Henning says that if G is not the Petersen graph and is a connected graph of order n with minimum degree \(\delta (G)\ge 3\), then \(\gamma _{pr}(G)\le 4n/7\). In this paper, we confirm this conjecture for k-regular graphs with \(k\ge 4\).     

Heinz mean curvature estimates in warped product spaces $$M\times _{e^{\psi }}N$$

If a graph submanifold (x, f(x)) of a Riemannian warped product space \((M^m\times _{e^{\psi }}N^n,\tilde{g}=g+ e^{2\psi }h)\) is immersed with parallel mean curvature H, then we obtain a Heinz-type estimation of the mean curvature. Namely, on each compact domain D of M, \(m\Vert H\Vert \le \frac{A_{\psi }(\partial D)}{V_{\psi }(D)}\) holds, where \(A_{\psi }(\partial D)\) and \(V_{\psi }(D)\) are the \({\psi }\)-weighted area and volume, respectively. In particular, \(H=0\) if (M, g) has zero-weighted Cheeger constant, a concept recently introduced by Impera et al. (Height estimates for killing graphs. arXiv:1612.01257, 2016). This generalizes the known cases \(n=1\) or \(\psi =0\). We also conclude minimality using a closed calibration, assuming \((M,g_*)\) is complete where \(g_*=g+e^{2\psi }f^*h\), and for some constants \(\alpha \ge \delta \ge 0\), \(C_1>0\) and \(\beta \in [0,1)\), \(\Vert \nabla ^*\psi \Vert ^2_{g_*}\le \delta \), \(\mathrm {Ricci}_{\psi ,g_*}\ge \alpha \), and \({\mathrm{det}}_g(g_*)\le C_1 r^{2\beta }\) holds when \(r\rightarrow +\infty \), where r(x) is the distance function on \((M,g_*)\) from some fixed point. Both results rely on expressing the squared norm of the mean curvature as a weighted divergence of a suitable vector field.     

Eldan’s Stochastic Localization and Tubular Neighborhoods of Complex-Analytic Sets

Let \(f: \mathbb {C}^n \rightarrow \mathbb {C}^k\) be a holomorphic function and set \(Z = f^{-1}(0)\). Assume that Z is non-empty. We prove that for any \(r > 0\),

$$\begin{aligned} \gamma _n(Z + r) \ge \gamma _n(E + r), \end{aligned}$$

where \(Z + r\) is the Euclidean r-neighborhood of Z; \(\gamma _n\) is the standard Gaussian measure in \(\mathbb {C}^n\), and \(E \subseteq \mathbb {C}^n\) is an \((n-k)\)-dimensional, affine, complex subspace whose distance from the origin is the same as the distance of Z from the origin.

     

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.     

Generalizations of Marriage Theorem for Degree Factors

Let G be a bipartite graph with bipartition (A, B). We give new criteria for a bipartite graph to have an f -factor, a (g, f)-factor and other factors together with some applications of these criteria. These criteria can be considered as direct generalizations of Hall’s marriage theorem. Among some results, we prove that for a function \(h: A\cup B \rightarrow \{0,1,2, \ldots \}\), G has a factor F such that \(\deg _F(x)=h(x)\) for \(x\in A\) and \(\deg _H(y) \le h(y)\) for \(y\in B\) if and only if \(h(X) \le \sum _{x\in N_G(X)}\min \{h(x), e_G(x,X)\}\) for all \(X\subseteq A\).     

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

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.     

Asymptotic diophantine approximation: the multiplicative case

Let \(\alpha \) and \(\beta \) be irrational real numbers and \(0<\varepsilon <1/30\). We prove a precise estimate for the number of positive integers \(q\le Q\) that satisfy \(\Vert q\alpha \Vert \cdot \Vert q\beta \Vert <\varepsilon \). If we choose \(\varepsilon \) as a function of Q, we get asymptotics as Q gets large, provided \(\varepsilon Q\) grows quickly enough in terms of the (multiplicative) Diophantine type of \((\alpha ,\beta )\), e.g., if \((\alpha ,\beta )\) is a counterexample to Littlewood’s conjecture, then we only need that \(\varepsilon Q\) tends to infinity. Our result yields a new upper bound on sums of reciprocals of products of fractional parts and sheds some light on a recent question of Lê and Vaaler.     

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.