Privileged Regions in Critical Strips of Non-lattice Dirichlet Polynomials

This paper shows, by means of Kronecker’s theorem, the existence of infinitely many privileged regions called $r$ -rectangles (rectangles with two semicircles of small radius $r$ ) in the critical strip of each function $L_{n}(z)\!:=\!$ $1-\sum _{k=2}^{n}k^{z}$ , $n\!\ge \!2$ , containing exactly $\left[ \dfrac{T\log n}{2\pi }\right] +1$ zeros of $L_{n}(z)$ , where $T$ is the height of the $r$ -rectangle and $\left[\cdot \right]$ represents the integer part.     

Epimorphic images of the [5,3,5] Coxeter group

We classify the normal subgroups of the Coxeter group $\varGamma =[5,3,5]$ , and of its even subgroup $\varGamma ^+$ , with quotient isomorphic to a finite simple group $L_2(q)$ . There are infinitely many such normal subgroups of $\varGamma ^+$ , each uniformising a compact orientable hyperbolic $3$ -manifold tessellated by dodecahedra; we determine the isometry groups of these manifolds and the symmetry groups of their tessellations. By contrast there is a single such normal subgroup of $\varGamma $ , uniformising a compact non-orientable $3$ -orbifold with isometry group $PGL_2(19)$ .     

Multiple P-invariant closed characteristics on partially symmetric compact convex hypersurfaces in {\varvec{R}}^{2n}

In this paper, let $n$ be a positive integer and $P=diag(-I_{n-\kappa },I_\kappa ,-I_{n-\kappa },I_\kappa )$ for some integer $\kappa \in [0, n]$ , we prove that for any compact convex hypersurface $\Sigma $ in $\mathbf{R}^{2n}$ with $n\ge 2$ there exist at least two geometrically distinct P-invariant closed characteristics on $\Sigma $ , provided that $\Sigma $ is P-symmetric, i.e., $x\in \Sigma $ implies $Px\in \Sigma $ . This work is shown to extend and unify several earlier works on this subject.     

On characterizations of real hypersurface in complex space form with Codazzi type structure Lie operator

In this paper, we prove that if $(\nabla _{X} L_{\xi })Y= (\nabla _{Y} L_{\xi })X$ holds on $M$ , then $M$ is a Hopf hypersurface, where $L_\xi $ denote the induced operator from the Lie derivative with respect to the structure vector field $\xi $ . We characterize such Hopf hypersurfaces of $M_n(c)$ .     

The convex hull of the lattice points inside a curve

Let $C$ be a smooth convex closed plane curve. The $C$ -ovals $C(R,u,v)$ are formed by expanding by a factor  $R$ , then translating by  $(u,v)$ . The number of vertices $V(R,u,v)$ of the convex hull of the integer points within or on  $C(R,u,v)$ has order  $R^{2/3}$ (Balog and Bárány) and has average size $BR^{2/3}$ as $R$ varies (Balog and Deshouillers). We find the space average of  $V(R,u,v)$ over vectors  $(u,v)$ to be  $BR^{2/3}$ with an explicit coefficient  $B$ , and show that the average over  $R$ has the same  $B$ . The proof involves counting edges and finding the domain $D(q,a)$ of an integer vector, the set of  $(u,v)$ for which the convex hull has a directed edge parallel to  $(q,a)$ . The resulting sum over bases of the integer lattice is approximated by a triple integral.     

Nonlinear centralizers in homology

It is shown that every nonlinear centralizer from $L_p$ to $L_q$ is trivial unless $q=p$ . This means that if $q\ne p$ , the only exact sequence of quasi-Banach $L_\infty $ -modules and homomorphisms $0\rightarrow L_q\rightarrow Z\rightarrow L_p\rightarrow 0$ is the trivial one where $Z=L_q\oplus L_p$ . From this it follows that the space of centralizers on $L_p$ is essentially independent on $p\in (0,\infty )$ , which confirms a conjecture by Kalton.     

On constrained and regularized high-dimensional regression

High-dimensional feature selection has become increasingly crucial for seeking parsimonious models in estimation. For selection consistency, we derive one necessary and sufficient condition formulated on the notion of degree of separation. The minimal degree of separation is necessary for any method to be selection consistent. At a level slightly higher than the minimal degree of separation, selection consistency is achieved by a constrained $L_0$ -method and its computational surrogate—the constrained truncated $L_1$ -method. This permits up to exponentially many features in the sample size. In other words, these methods are optimal in feature selection against any selection method. In contrast, their regularization counterparts—the $L_0$ -regularization and truncated $L_1$ -regularization methods enable so under slightly stronger assumptions. More importantly, sharper parameter estimation/prediction is realized through such selection, leading to minimax parameter estimation. This, otherwise, is impossible in the absence of a good selection method for high-dimensional analysis.     

Characterization of some simple groups by the multiplicity pattern

Let $G$ be a finite group and let ${\mathrm{Irr}}(G)$ denote the set of all complex irreducible characters of $G.$ Let ${\mathrm{cd}}(G)$ be the set of all character degrees of $G.$ For each positive integer $d,$ the multiplicity of $d$ in $G$ is defined to be the number of irreducible characters of $G$ having the same degree $d.$ The multiplicity pattern ${\mathrm{mp}}(G)$ is the vector whose first coordinate is $|G:G^{\prime }|$ and for $i\ge 1,$ the $(i+1)$ th-coordinate of ${\mathrm{mp}}(G)$ is the multiplicity of the $i$ th-smallest nontrivial character degree of $G.$ In this paper, we show that every nonabelian simple group with at most $7$ distinct character degrees is uniquely determined by the multiplicity pattern.     

On the Bloch–Kato conjecture for elliptic modular forms of square-free level

Let $\kappa \ge 6$ be an even integer, $M$ an odd square-free integer, and $f \in S_{2\kappa -2}(\Gamma _0(M))$ a newform. We prove that under some reasonable assumptions that half of the $\lambda $ -part of the Bloch–Kato conjecture for the near central critical value $L(\kappa ,f)$ is true. We do this by bounding the $\ell $ -valuation of the order of the appropriate Bloch–Kato Selmer group below by the $\ell $ -valuation of algebraic part of $L(\kappa ,f)$ . We prove this by constructing a congruence between the Saito–Kurokawa lift of $f$ and a cuspidal Siegel modular form.     

Complexity of unconstrained L_2-L_p minimization

We consider the unconstrained $L_q$ - $L_p$ minimization: find a minimizer of $\Vert Ax-b\Vert ^q_q+\lambda \Vert x\Vert ^p_p$ for given $A \in R^{m\times n}$ , $b\in R^m$ and parameters $\lambda >0$ , $p\in [0, 1)$ and $q\ge 1$ . This problem has been studied extensively in many areas. Especially, for the case when $q=2$ , this problem is known as the $L_2-L_p$ minimization problem and has found its applications in variable selection problems and sparse least squares fitting for high dimensional data. Theoretical results show that the minimizers of the $L_q$ - $L_p$ problem have various attractive features due to the concavity and non-Lipschitzian property of the regularization function $\Vert \cdot \Vert ^p_p$ . In this paper, we show that the $L_q$ - $L_p$ minimization problem is strongly NP-hard for any $p\in [0,1)$ and $q\ge 1$ , including its smoothed version. On the other hand, we show that, by choosing parameters $(p,\lambda )$ carefully, a minimizer, global or local, will have certain desired sparsity. We believe that these results provide new theoretical insights to the studies and applications of the concave regularized optimization problems.     

Discontinuous Galerkin method for hyperbolic equations involving \delta -singularities: negative-order norm error estimates and applications

In this paper, we develop and analyze discontinuous Galerkin (DG) methods to solve hyperbolic equations involving $\delta $ -singularities. Negative-order norm error estimates for the accuracy of DG approximations to $\delta $ -singularities are investigated. We first consider linear hyperbolic conservation laws in one space dimension with singular initial data. We prove that, by using piecewise $k$ th degree polynomials, at time $t$ , the error in the $H^{-(k+2)}$ norm over the whole domain is $(k+1/2)$ th order, and the error in the $H^{-(k+1)}(\mathbb R \backslash \mathcal R _t)$ norm is $(2k+1)$ th order, where $\mathcal R _t$ is the pollution region due to the initial singularity with the width of order $\mathcal O (h^{1/2} \log (1/h))$ and $h$ is the maximum cell length. As an application of the negative-order norm error estimates, we convolve the numerical solution with a suitable kernel which is a linear combination of B-splines, to obtain $L^2$ error estimate of $(2k+1)$ th order for the post-processed solution. Moreover, we also obtain high order superconvergence error estimates for linear hyperbolic conservation laws with singular source terms by applying Duhamel’s principle. Numerical examples including an acoustic equation and the nonlinear rendez-vous algorithms are given to demonstrate the good performance of DG methods for solving hyperbolic equations involving $\delta $ -singularities.     

The homotopy of the K(2)-local Moore spectrum at the prime 3 revisited

In this paper we use the approach introduced in (Goerss et al., Ann Math 162(2):777–822, 2005) in order to analyze the homotopy groups of $L_{K(2)}V(0)$ , the mod- $3$ Moore spectrum $V(0)$ localized with respect to Morava $K$ -theory $K(2)$ . These homotopy groups have already been calculated by Shimomura (J Math Soc Japan 52(1): 65–90, 2000). The results are very complicated so that an independent verification via an alternative approach is of interest. In fact, we end up with a result which is more precise and also differs in some of its details from that of Shimomura (J Math Soc Japan 52(1): 65–90, 2000). An additional bonus of our approach is that it breaks up the result into smaller and more digestible chunks which are related to the $K(2)$ -localization of the spectrum $TMF$ of topological modular forms and related spectra. Even more, the Adams–Novikov differentials for $L_{K(2)}V(0)$ can be read off from those for $TMF$ .     

Solving inverse cone-constrained eigenvalue problems

We compare various algorithms for constructing a matrix of order $n$ whose Pareto spectrum contains a prescribed set $\Lambda =\{\lambda _1,\ldots , \lambda _p\}$ of reals. In order to avoid overdetermination one assumes that $p$ does not exceed $n^2.$ The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spectra and solving inverse Lorentz eigenvalue problems.     

Nuclear multilinear operators with respect to a partition

We introduce the notion of multilinear nuclear operator with respect to a partition and extend Grothendieck??s characterizations of nuclear linear operators into $l_{1},$ resp. $L_{1}( \mu ),$ in this new setting. We give the necessary and sufficient conditions for a natural operator to be nuclear with respect to a partition.     

Computable representations for convex hulls of low-dimensional quadratic forms

Let ${\mathcal{C}}$ be the convex hull of points ${{\{{1 \choose x}{1 \choose x}^T \,|\, x\in \mathcal{F}\subset \Re^n\}}}$ . Representing or approximating ${\mathcal{C}}$ is a fundamental problem for global optimization algorithms based on convex relaxations of products of variables. We show that if n ≤ 4 and ${\mathcal{F}}$ is a simplex, then ${\mathcal{C}}$ has a computable representation in terms of matrices X that are doubly nonnegative (positive semidefinite and componentwise nonnegative). We also prove that if n = 2 and ${\mathcal{F}}$ is a box, then ${\mathcal{C}}$ has a representation that combines semidefiniteness with constraints on product terms obtained from the reformulation-linearization technique (RLT). The simplex result generalizes known representations for the convex hull of ${{\{(x_1, x_2, x_1x_2)\,|\, x\in\mathcal{F}\}}}$ when ${\mathcal{F}\subset\Re^2}$ is a triangle, while the result for box constraints generalizes the well-known fact that in this case the RLT constraints generate the convex hull of ${{\{(x_1, x_2, x_1x_2)\,|\, x\in\mathcal{F}\}}}$ . When n = 3 and ${\mathcal{F}}$ is a box, we show that a representation for ${\mathcal{C}}$ can be obtained by utilizing the simplex result for n = 4 in conjunction with a triangulation of the 3-cube.     

On convex relaxations for quadratically constrained quadratic programming

We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let $\mathcal{F }$ denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on $\mathcal{F }$ is dominated by an alternative methodology based on convexifying the range of the quadratic form $\genfrac(){0.0pt}{}{1}{x}\genfrac(){0.0pt}{}{1}{x}^T$ for $x\in \mathcal{F }$ . We next show that the use of ?? $\alpha $ BB?? underestimators as computable estimates of convex lower envelopes is dominated by a relaxation of the convex hull of the quadratic form that imposes semidefiniteness and linear constraints on diagonal terms. Finally, we show that the use of a large class of D.C. (??difference of convex??) underestimators is dominated by a relaxation that combines semidefiniteness with RLT constraints.     

A functional model associated with a generalized Nevanlinna pair

Let $ \mathcal{L} $ be a Hilbert space, and let $ \mathcal{H} $ be a Pontryagin space. For every self-adjoint linear relation $ \tilde{A} $ in $ \mathcal{H} \oplus \mathcal{L} $ , the pair $ \{ I + \lambda \psi (\lambda ),\,\psi (\lambda )\} $ where $ \psi (\lambda ) $ is the compressed resolvent of $ \tilde{A} $ , is a normalized generalized Nevanlinna pair. Conversely, every normalized generalized Nevanlinna pair is shown to be associated with some self-adjoint linear relation $ \tilde{A} $ in the above sense. A functional model for this selfadjoint linear relation $ \tilde{A} $ is constructed.     

On unitals in PG(2,q^2) stabilized by a homology group

The linear collineation group of a classical unital of $\mathrm{PG}(2,q^2)$ contains a group of homologies of order $q+1$ . In this paper we prove that if $\mathcal{U }$ is a unital of PG $(2,q^2)$ stabilized by a homology group of order $q+1$ and $q$ is a prime number, then $\mathcal{U }$ is classical.     

Pfaffian representations of cubic surfaces

Let $\mathbb{K }$ be a field of characteristic zero. We describe an algorithm which requires a homogeneous polynomial $F$ of degree three in $\mathbb{K }[x_{0},x_1,x_{2},x_{3}]$ and a zero ${\mathbf{a }}$ of $F$ in $\mathbb{P }^{3}_{\mathbb{K }}$ and ensures a linear Pfaffian representation of $\text{ V}(F)$ with entries in $\mathbb{K }[x_{0},x_{1},x_{2},x_{3}]$ , under mild assumptions on $F$ and ${\mathbf{a }}$ . We use this result to give an explicit construction of (and to prove the existence of) a linear Pfaffian representation of $\text{ V}(F)$ , with entries in $\mathbb{K }^{\prime }[x_{0},x_{1},x_{2},x_{3}]$ , being $\mathbb{K }^{\prime }$ an algebraic extension of $\mathbb{K }$ of degree at most six. An explicit example of such a construction is given.     

Integer-valued polynomials over matrices and divided differences

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided differences. A necessary and sufficient condition on $f\in K[X]$ to be integer-valued over $M_n(D)$ is that, for each $k$ less than $n$ , the $k$ th divided difference of $f$ is integral-valued on every subset of the roots of any monic polynomial over $D$ of degree $n$ . If in addition $D$ has zero Jacobson radical then it is sufficient to check the above conditions on subsets of the roots of monic irreducible polynomials of degree $n$ , that is, conjugate integral elements of degree $n$ over $D$ .