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.     

On Reachable Families of the Loewner Differential Equation in Several Complex Variables

Graham, Hamada, Kohr and Kohr studied the normalized time \(T\) reachable families \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\) of the Loewner differential equation, which are generated by the Carathéodory mappings with values in a subfamily \(\Omega \) of the Carathéodory family \({\mathcal {N}}_A\) for the Euclidean unit ball \({\mathbb {B}}^n\), where \(A\) is a linear operator with \(k_+(A)<2m(A)\) (\(k_+(A)\) is the Lyapunov index of \(A\) and \(m(A)=\min \{\mathfrak {R}\left\langle Az,z\right\rangle \big |z\in {\mathbb {C}}^n,\Vert z\Vert =1\}\)). They obtained some compactness and density results, as generalizations of related results due to Roth, and conjectured that if \(\Omega \) is compact and convex, then \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\) is compact and \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},ex\,\Omega )\) is dense in \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\), where \(ex\,\Omega \) denotes the corresponding set of extreme points and \(T\in [0,\infty ]\). We confirm this, by embedding the Carathéodory mappings in a suitable Bochner space.     

The Gray images of $$$$ constacyclic codes over $$F_{2^m}[u]/\langle u^{k} \rangle $$F2m[u]/⟨uk⟩

Let \(R_{k}\) denote the polynomial residue ring \(F_{2^m}[u]/\langle u^{k} \rangle \), where \(2^{j-1}+1\le k\le 2^{j}\) for some positive integer \(j\). Motivated by the work in [1], we introduce a new Gray map from \(R_{k}\) to \(F_{2^m}^{2^{j}}\). It is proved that the Gray image of a linear \((1+u)\) constacyclic code of an arbitrary length \(N\) over \(R_{k}\) is a distance invariant linear cyclic code of length \(2^{j}N\) over \(F_{2^m}\). Moreover, the generator polynomial of the Gray image of such a constacyclic code is determined, and some optimal linear cyclic codes over \(F_{2}\) and \(F_{4}\) are constructed under this Gray map.     

On Locally Gabriel Geometric Graphs

Let \(P\) be a set of \(n\) points in the plane. A geometric graph \(G\) on \(P\) is said to be locally Gabriel if for every edge \((u,v)\) in \(G\), the Euclidean disk with the segment joining \(u\) and \(v\) as diameter does not contain any points of \(P\) that are neighbors of \(u\) or \(v\) in \(G\). A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any \(n\), there exists LGG with \(\Omega (n^{5/4})\) edges. This improves upon the previous best bound of \(\Omega (n^{1+\frac{1}{\log \log n}})\). (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any \(n\) point set, there exists an independent set of size \(\Omega (\sqrt{n}\log n)\).     

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.     

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

Elimination of extremal index zeroes from generic paths of closed $$$$-forms

Let \( \alpha \) be a Morse closed \( 1 \)-form of a smooth \( n \)-dimensional manifold \( M \). The zeroes of \( \alpha \) of index \( 0 \) or \( n \) are called centers. It is known that every non-vanishing de Rham cohomology class \( u \) contains a Morse representative without centers. The result of this paper is the one-parameter analogue of the last statement: every generic path \( (\alpha _t)_{ t\in [0,1] }\) of closed \( 1 \)-forms in a fixed class \( u\ne 0 \) such that \( \alpha _0,\alpha _1 \) have no centers, can be modified relatively to its extremities to another such path \( (\beta _t)_{t \in [0,1]} \) having no center at all.     

Extremal eigenvalues and eigenvectors of deformed Wigner matrices

We consider random matrices of the form \(H = W + \lambda V, \lambda \in {\mathbb {R}}^+\), where \(W\) is a real symmetric or complex Hermitian Wigner matrix of size \(N\) and \(V\) is a real bounded diagonal random matrix of size \(N\) with i.i.d. entries that are independent of \(W\). We assume subexponential decay of the distribution of the matrix entries of \(W\) and we choose \(\lambda \sim 1\), so that the eigenvalues of \(W\) and \(\lambda V\) are typically of the same order. Further, we assume that the density of the entries of \(V\) is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is \(\lambda _+\in {\mathbb {R}}^+\) such that the largest eigenvalues of \(H\) are in the limit of large \(N\) determined by the order statistics of \(V\) for \(\lambda >\lambda _+\). In particular, the largest eigenvalue of \(H\) has a Weibull distribution in the limit \(N\rightarrow \infty \) if \(\lambda >\lambda _+\). Moreover, for \(N\) sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for \(\lambda >\lambda _+\), while they are completely delocalized for \(\lambda <\lambda _+\). Similar results hold for the lowest eigenvalues.     

Sampling and Cubature on Sparse Grids Based on a B-spline Quasi-Interpolation

Let \(X_n = \{x^j\}_{j=1}^n\) be a set of n points in the d-cube \({\mathbb {I}}^d:=[0,1]^d\), and \(\Phi _n = \{\varphi _j\}_{j =1}^n\) a family of n functions on \({\mathbb {I}}^d\). We consider the approximate recovery of functions f on \({{\mathbb {I}}}^d\) from the sampled values \(f(x^1), \ldots , f(x^n)\), by the linear sampling algorithm \( L_n(X_n,\Phi _n,f) := \sum _{j=1}^n f(x^j)\varphi _j. \) The error of sampling recovery is measured in the norm of the space \(L_q({\mathbb {I}}^d)\)-norm or the energy quasi-norm of the isotropic Sobolev space \(W^\gamma _q({\mathbb {I}}^d)\) for \(1 < q < \infty \) and \(\gamma > 0\). Functions f to be recovered are from the unit ball in Besov-type spaces of an anisotropic smoothness, in particular, spaces \(B^{\alpha ,\beta }_{p,\theta }\) of a “hybrid” of mixed smoothness \(\alpha > 0\) and isotropic smoothness \(\beta \in {\mathbb {R}}\), and spaces \(B^a_{p,\theta }\) of a nonuniform mixed smoothness \(a \in {\mathbb {R}}^d_+\). We constructed asymptotically optimal linear sampling algorithms \(L_n(X_n^*,\Phi _n^*,\cdot )\) on special sparse grids \(X_n^*\) and a family \(\Phi _n^*\) of linear combinations of integer or half integer translated dilations of tensor products of B-splines. We computed the asymptotic order of the error of the optimal recovery. This construction is based on B-spline quasi-interpolation representations of functions in \(B^{\alpha ,\beta }_{p,\theta }\) and \(B^a_{p,\theta }\). As consequences, we obtained the asymptotic order of optimal cubature formulas for numerical integration of functions from the unit ball of these Besov-type spaces.     

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.     

Weighted Harmonic Bloch Spaces on the Ball

We study the family of weighted harmonic Bloch spaces \(b_\alpha , \alpha \in {\mathbb {R}}\), on the unit ball of \({\mathbb {R}}^n\). We provide characterizations in terms of partial and radial derivatives and certain radial differential operators that are more compatible with reproducing kernels of harmonic Bergman–Besov spaces. We consider a class of integral operators related to harmonic Bergman projection and determine precisely when they are bounded on \(L^\infty _\alpha \). We define projections from \(L^\infty _\alpha \) to \(b_\alpha \) and as a consequence obtain integral representations. We solve the Gleason problem and provide atomic decomposition for all \(b_\alpha , \alpha \in {\mathbb {R}}\). Finally we give an oscillatory characterization of \(b_\alpha \) when \(\alpha >-1\).     

A new theorem on the prime-counting function

For \(x>0\), let \(\pi (x)\) denote the number of primes not exceeding x. For integers a and \(m>0\), we determine when there is an integer \(n>1\) with \(\pi (n)=(n+a)/m\). In particular, we show that, for any integers \(m>2\) and \(a\leqslant \lceil e^{m-1}/(m-1)\rceil \), there is an integer \(n>1\) with \(\pi (n)=(n+a)/m\). Consequently, for any integer \(m>4\), there is a positive integer n with \(\pi (mn)=m+n\). We also pose several conjectures for further research; for example, we conjecture that, for each \(m=1,2,3,\ldots \), there is a positive integer n such that \(m+n\) divides \(p_m+p_n\), where \(p_k\) denotes the k-th prime.     

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.     

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

Linear sets in the projective line over the endomorphism ring of a finite field

Let \({{\mathrm{{PG}}}}(1,E)\) be the projective line over the endomorphism ring \( E={{\mathrm{End}}}_q({\mathbb F}_{q^t})\) of the \({\mathbb F}_q\)-vector space \({\mathbb F}_{q^t}\). As is well known, there is a bijection \(\varPsi :{{\mathrm{{PG}}}}(1,E)\rightarrow {\mathcal G}_{2t,t,q}\) with the Grassmannian of the \((t-1)\)-subspaces in \({{\mathrm{{PG}}}}(2t-1,q)\). In this paper along with any \({\mathbb F}_q\)-linear set L of rank t in \({{\mathrm{{PG}}}}(1,q^t)\), determined by a \((t-1)\)-dimensional subspace \(T^\varPsi \) of \({{\mathrm{{PG}}}}(2t-1,q)\), a subset \(L_T\) of \({{\mathrm{{PG}}}}(1,E)\) is investigated. Some properties of linear sets are expressed in terms of the projective line over the ring E. In particular, the attention is focused on the relationship between \(L_T\) and the set \(L'_T\), corresponding via \(\varPsi \) to a collection of pairwise skew \((t-1)\)-dimensional subspaces, with \(T\in L'_T\), each of which determine L. This leads among other things to a characterization of the linear sets of pseudoregulus type. It is proved that a scattered linear set L related to \(T\in {{\mathrm{{PG}}}}(1,E)\) is of pseudoregulus type if and only if there exists a projectivity \(\varphi \) of \({{\mathrm{{PG}}}}(1,E)\) such that \(L_T^\varphi =L'_T\).     

Left annihilator of generalized derivations on Lie ideals in prime rings

Let \(R\) be a prime ring, \(L\) a noncentral Lie ideal of \(R\), \(F\) a generalized derivation with associated nonzero derivation \(d\) of \(R\). If \(a\in R\) such that \(a(d(u)^{l_1} F(u)^{l_2} d(u)^{l_3} F(u)^{l_4} \ldots F(u)^{l_k})^{n}=0\) for all \(u\in L\), where \(l_1,l_2,\ldots ,l_k\) are fixed non negative integers not all are zero and \(n\) is a fixed integer, then either \(a=0\) or \(R\) satisfies \(s_4\), the standard identity in four variables.     

Oscillation of holomorphic Bergman–Besov kernels on the ball

We estimate the oscillation of holomorphic Bergman–Besov reproducing kernels on the unit ball of \(\mathbb {C}^n\). As an application of this estimate we characterize holomorphic Bergman–Besov spaces \(A_\alpha ^p\,(\alpha \in \mathbb {R})\) in terms of double integrals of the fractions \(|f(z)-f(w)|/|z-w|\) and \(|f(z)-f(w)|/|1-\langle z,w \rangle |\) and complete the earlier works done on this subject. Our results provide, when \(\alpha \le -1\), a derivative-free characterization of \(A_\alpha ^p\).     

Disjunctive programming and relaxations of polyhedra

Given a polyhedron \(L\) with \(h\) facets, whose interior contains no integral points, and a polyhedron \(P\), recent work in integer programming has focused on characterizing the convex hull of \(P\) minus the interior of \(L\). We show that to obtain such a characterization it suffices to consider all relaxations of \(P\) defined by at most \(n(h-1)\) among the inequalities defining \(P\). This extends a result by Andersen, Cornuéjols, and Li.     

Polynomially linked additive functions—II

We continue the study of additive functions \(f_k:R\rightarrow F \;(1\le k\le n)\) linked by an equation of the form \(\sum _{k=1}^n p_k(x)f_k(q_k(x))=0\), where the \(p_k\) and \(q_k\) are polynomials, R is an integral domain of characteristic 0, and F is the fraction field of R. A method is presented for solving all such equations. We also consider the special case \(\sum _{k=1}^n x^{m_k}f_k(x^{j_k})=0\) in which the \(p_k\) and \(q_k\) are monomials. In this case we show that if there is no duplication, i.e. if \((m_k,j_k)\ne (m_p,j_p)\) for \(k\ne p\), then each \(f_k\) is the sum of a linear function and a derivation of order at most \(n-1\). Furthermore, if this functional equation is not homogeneous then the maximal orders of the derivations are reduced in a specified way.