On some constacyclic codes over $$\mathbb {Z}_{4}\left[ u\right] /\left\langle u^{2}-1\right\rangle $$, their $$\mathbb {Z}_4$$Z4 images,and new codes

In this paper, we study \(\lambda \)-constacyclic codes over the ring \(R=\mathbb {Z}_4+u\mathbb {Z}_4\) where \(u^{2}=1\), for \(\lambda =3+2u\) and \(2+3u\). Two new Gray maps from R to \(\mathbb {Z}_4^{3}\) are defined with the goal of obtaining new linear codes over \(\mathbb {Z}_4\). The Gray images of \(\lambda \)-constacyclic codes over R are determined. We then conducted a computer search and obtained many \(\lambda \)-constacyclic codes over R whose \(\mathbb {Z}_4\)-images have better parameters than currently best-known linear codes over \(\mathbb {Z}_4\).     

A characterization of $$\mathbb {Z}_{2}\mathbb {Z}_{2}[u]$$-linear codes

We prove that the class of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes is exactly the class of \(\mathbb {Z}_2\)-linear codes with automorphism group of even order. Using this characterization, we give examples of known codes, e.g. perfect codes, which have a nontrivial \(\mathbb {Z}_2\mathbb {Z}_2[u]\) structure. Moreover, we exhibit some examples of \(\mathbb {Z}_2\)-linear codes which are not \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear. Also, we state that the duality of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes is the same as the duality of \(\mathbb {Z}_2\)-linear codes. Finally, we prove that the class of \(\mathbb {Z}_2\mathbb {Z}_4\)-linear codes which are also \(\mathbb {Z}_2\)-linear is strictly contained in the class of \(\mathbb {Z}_2\mathbb {Z}_2[u]\)-linear codes.     

Extremal Problems for Mappings with Generalized Parametric Representation in $${{\mathbb {C}}}^{n}$$

In this paper we are concerned with the family \(\widetilde{S}^t_A(\mathbb {B}^n)\) (\(t\ge 0\)) of normalized biholomorphic mappings on the Euclidean unit ball \(\mathbb {B}^n\) in \({\mathbb {C}}^n\) that can be embedded in normal Loewner chains whose normalizations are given by time-dependent operators \(A\in \widetilde{\mathcal {A}}\), where \(\widetilde{\mathcal {A}}\) is a family of measurable mappings from \([0,\infty )\) into \(L({\mathbb {C}}^n)\) which satisfy certain natural assumptions. In particular, we consider extreme points and support points associated with the compact family \(\widetilde{S}^t_A(\mathbb {B}^n)\), where \(A\in \widetilde{\mathcal {A}}\). We prove that if \(f(z,t)=V(t)^{-1}z+\cdots \) is a normal Loewner chain such that \(V(s)f(\cdot ,s)\in \mathrm{ex}\,\widetilde{S}^s_A(\mathbb {B}^n)\) (resp. \(V(s)f(\cdot ,s)\in \mathrm{supp}\,\widetilde{S}^s_A(\mathbb {B}^n)\)), then \(V(t)f(\cdot ,t)\in \mathrm{ex}\, \widetilde{S}^t_A(\mathbb {B}^n)\), for all \(t\ge s\) (resp. \(V(t)f(\cdot ,t)\in \mathrm{supp}\,\widetilde{S}^t_A(\mathbb {B}^n)\), for all \(t\ge s\)), where V(t) is the unique solution on \([0,\infty )\) of the initial value problem: \(\frac{d V}{d t}(t)=-A(t)V(t)\), a.e. \(t\ge 0\), \(V(0)=I_n\). Also, we obtain an example of a bounded support point for the family \(\widetilde{S}_A^t(\mathbb {B}^2)\), where \(A\in \widetilde{\mathcal {A}}\) is a certain time-dependent operator. We also consider the notion of a reachable family with respect to time-dependent linear operators \(A\in \widetilde{\mathcal {A}}\), and obtain characterizations of extreme/support points associated with these families of bounded biholomorphic mappings on \(\mathbb {B}^n\). Useful examples and applications yield that the study of the family \(\widetilde{S}^t_A(\mathbb {B}^n)\) for time-dependent operators \(A\in \widetilde{\mathcal {A}}\) is basically different from that in the case of constant time-dependent linear operators.     

Zero varieties for the Nevanlinna class in weakly pseudoconvex domains of maximal type F in $$\mathbb {C}^2$$

Let \(\Omega \) be a bounded, uniformly totally pseudoconvex domain in \(\mathbb {C}^2\) with smooth boundary \(b\Omega \). Assume that \(\Omega \) is a domain admitting a maximal type F. Here, the condition maximal type F generalizes the condition of finite type in the sense of Range (Pac J Math 78(1):173–189, 1978; Scoula Norm Sup Pisa, pp 247–267, 1978) and includes many cases of infinite type. Let \(\alpha \) be a d-closed (1, 1)-form in \(\Omega \). We study the Poincaré–Lelong equation

$$\begin{aligned} i\partial \bar{\partial }u=\alpha \quad \text {on}\, \Omega \end{aligned}$$

in \(L^1(b\Omega )\) norm by applying the \(L^1(b\Omega )\) estimates for \(\bar{\partial }_b\)-equations in [11]. Then, we also obtain a prescribing zero set of Nevanlinna holomorphic functions in \(\Omega \).

     

Subconvexity for sup-norms of cusp forms on $$\mathrm{PGL}(n)$$

Let F be an \(L^2\)-normalized Hecke Maaß cusp form for \(\Gamma _0(N) \subseteq {\mathrm{SL}}_{n}({\mathbb {Z}})\) with Laplace eigenvalue \(\lambda _F\). If \(\Omega \) is a compact subset of \(\Gamma _0(N)\backslash {\mathrm{PGL}}_n/\mathrm{PO}_{n}\), we show the bound \(\Vert F|_{\Omega }\Vert _{\infty } \ll _{ \Omega } N^{\varepsilon } \lambda _F^{n(n-1)/8 - \delta }\) for some constant \(\delta = \delta _n> 0\) depending only on n.     

Some results on linear codes over the ring $$\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4$$

In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R.     

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

On two-weight $$\mathbb {Z}_{2^k}$$-codes

We determine the possible homogeneous weights of regular projective two-weight codes over \(\mathbb {Z}_{2^k}\) of length \(n>3\), with dual Krotov distance \(d^{\lozenge }\) at least four. The determination of the weights is based on parameter restrictions for strongly regular graphs applied to the coset graph of the dual code. When \(k=2\), we characterize the parameters of such codes as those of the inverse Gray images of \(\mathbb {Z}_4\)-linear Hadamard codes, which have been characterized by their types by several authors.     

Global $$C^{1,\al pha }$$ regularity and e xistence of multi ple solutions for singular p( x)-La placian equations

In this paper we study the following singular p(x)-Laplacian problem

$$\begin{aligned} \left\{ \begin{array}{l@{\quad }l} - \text{ div } \left( |\nabla u|^{p(x)-2} \nabla u\right) =\frac{ \lambda }{u^{\beta (x)}}+u^{q(x)}, &{} \text{ in }\quad \Omega , \\ u>0, &{} \text{ in }\quad \Omega , \\ u=0, &{} \text{ on }\quad \partial \Omega , \end{array}\right. \end{aligned}$$

where \(\Omega \) is a bounded domain in \(\mathbb {R}^N\), \(N\ge 2\), with smooth boundary \(\partial \Omega \), \(\beta \in C^1(\bar{\Omega })\) with \( 0< \beta (x) <1\), \(p\in C^1(\bar{\Omega })\), \(q \in C(\bar{\Omega })\) with \(p(x)>1\), \(p(x)< q(x) +1 <p^*(x)\) for \(x \in \bar{\Omega }\), where \( p^*(x)= \frac{Np(x)}{N-p(x)} \) for \(p(x) <N\) and \( p^*(x)= \infty \) for \( p(x) \ge N\). We establish \(C^{1,\alpha }\) regularity of weak solutions of the problem and strong comparison principle. Based on these two results, we prove the existence of multiple (at least two) positive solutions for a certain range of \(\lambda \).

     

The shape of $$ \mathbb {Z}/\ell \mathbb {Z}$$-number fields

Let \(\ell \) be a prime and let \(L/ \mathbb {Q}\) be a Galois number field with Galois group isomorphic to \( \mathbb {Z}/\ell \mathbb {Z}\). We show that the shape of L, see Definition 1.2, is either \(\frac{1}{2}\mathbb {A}_{\ell -1}\) or a fixed sub-lattice depending only on \(\ell \); such a dichotomy in the value of the shape only depends on the type of ramification of L. This work is motivated by a result of Bhargava and Shnidman, and a previous work of the first named author, on the shape of \( \mathbb {Z}/3 \mathbb {Z}\) number fields.     

Linear Independence of Time-Frequency Translates in $$\mathbb {R}^d$$

We establish the linear independence of time-frequency translates for functions \(f\) on \(\mathbb {R}^d\) having one-sided decay \(\lim _{x \in H,\ |x|\rightarrow \infty } |f(x)| e^{c|x| \log |x|} = 0\) for all \(c>0\), which do not vanish on an affine half-space \(H \subset \mathbb {R}^d\).     

On some classes of linear codes over $${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$$ and their covering radii

In this paper, we define the simplex and MacDonald codes of types \(\alpha \) and \(\beta \) over \({\mathbb {Z}}_{2}{\mathbb {Z}}_{4}\). We also examine the covering radii of these codes. Further, we study the binary images of these codes and prove that the binary image of the simplex codes of type \(\alpha \) meets the Gilbert bound.     

Computing Explicit Isomorphisms with Full Matrix Algebras over $$\mathbb {F}_q(x)$$

We propose a polynomial time f-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over \(\mathbb {F}_q\)) for computing an isomorphism (if there is any) of a finite-dimensional \(\mathbb {F}_q(x)\)-algebra \(\mathcal{A}\) given by structure constants with the algebra of n by n matrices with entries from \(\mathbb {F}_q(x)\). The method is based on computing a finite \(\mathbb {F}_q\)-subalgebra of \(\mathcal{A}\) which is the intersection of a maximal \(\mathbb {F}_q[x]\)-order and a maximal R-order, where R is the subring of \(\mathbb {F}_q(x)\) consisting of fractions of polynomials with denominator having degree not less than that of the numerator.     

Sharp geometric condition for null-controllability of the heat equation on $$\mathbb {R}^d$$ and consistent estimates on the control cost

In this note we study the control problem for the heat equation on \(\mathbb {R}^d\), \(d\ge 1\), with control set \(\omega \subset \mathbb {R}^d\). We provide a necessary and sufficient condition (called \((\gamma , a)\)-thickness) on \(\omega \) such that the heat equation is null-controllable in any positive time. We give an estimate of the control cost with explicit dependency on the characteristic geometric parameters of the control set. Finally, we derive a control cost estimate for the heat equation on cubes with periodic, Dirichlet, or Neumann boundary conditions, where the control sets are again assumed to be thick. We show that the control cost estimate is consistent with the \(\mathbb {R}^d\) case.     

On the Intersection of $$$$-Complete Open Subsets with $$\mathcal {C}^2$$C2 Boundary in $$\mathbb {C}^n$$Cn

We prove that in \(\mathbb {C}^n\), the intersection of finitely many open, relatively compact, \((n-1)\)-complete subsets with \(\mathcal {C}^2\) boundary for which every two boundaries intersect transversally, is cohomologically \((n-1)\)-complete.     

There is exactly one $${\mathbb {Z}}_2{\mathbb {Z}}_4$$-cyclic 1-perfect code

Let \(\mathcal{C}\) be a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive code of length \(n > 3\). We prove that if the binary Gray image of \(\mathcal{C}\) is a 1-perfect nonlinear code, then \(\mathcal{C}\) cannot be a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-cyclic code except for one case of length \(n=15\). Moreover, we give a parity check matrix for this cyclic code. Adding an even parity check coordinate to a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive 1-perfect code gives a \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-additive extended 1-perfect code. We also prove that such a code cannot be \({\mathbb {Z}}_2{\mathbb {Z}}_4\)-cyclic.     

Globally optimized packings of non-uniform size spheres in $$\mathbb {R}^{d}$$: a computational study

In this work we discuss the following general packing problem: given a finite collection of d-dimensional spheres with (in principle) arbitrarily chosen radii, find the smallest sphere in \(\mathbb {R}^{d}\) that contains the given d-spheres in a non-overlapping arrangement. Analytical (closed-form) solutions cannot be expected for this very general problem-type: therefore we propose a suitable combination of constrained nonlinear optimization methodology with specifically designed heuristic search strategies, in order to find high-quality numerical solutions in an efficient manner. We present optimized sphere configurations with up to \(n = 50\) spheres in dimensions \(d = 2, 3, 4, 5\). Our numerical results are on average within 1% of the entire set of best known results for a well-studied model-instance in \(\mathbb {R}^{2}\), with new (conjectured) packings for previously unexplored generalizations of the same model-class in \(\mathbb {R}^{d}\) with \(d= 3, 4, 5.\) Our results also enable the estimation of the optimized container sphere radii and of the packing fraction as functions of the model instance parameters n and 1 / n, respectively. These findings provide a general framework to define challenging packing problem-classes with conjectured numerical solution estimates.     

A characterization of cut locus for $$C^1$$ hypersurfaces

Let \(\Omega \) be an open set in \(\mathbb {R}^n\) with \(C^1\)-boundary and \(\Sigma \) be the skeleton of \(\Omega \), which consists of points where the distance function to \(\partial \Omega \) is not differentiable. This paper characterizes the cut locus (ridge) \(\overline{\Sigma }\), which is the closure of the skeleton, by introducing a generalized radius of curvature and its lower semicontinuous envelope. As an application we give a sufficient condition for vanishing of the Lebesgue measure of \(\overline{\Sigma }\).     

On codes over $$\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}$$

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring \(R=\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}\), where \(v^{3}=v\), for q odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over R. Further, we give bounds on the minimum distance of LCD codes over \(\mathbb {F}_q\) and extend these to codes over R.     

Complete negatively curved immersed ends in $$\mathbb {R}^3$$

This paper extends, in a sharp way, the famous Efimov’s Theorem to immersed ends in \(\mathbb {R}^3\). More precisely, let M be a non-compact connected surface with compact boundary. Then there is no complete isometric immersion of M into \(\mathbb {R}^3\) satisfying that \(\int _M |K|=+\infty \) and \(K\le -\kappa <0\), where \(\kappa \) is a positive constant and K is the Gaussian curvature of M. In particular Efimov’s Theorem holds for complete Hadamard immersed surfaces, whose Gaussian curvature K is bounded away from zero outside a compact set.