A Shape Optimization Problem on Planar Sets with Prescribed Topology

We consider shape optimization problems involving functionals depending on perimeter, torsional rigidity and Lebesgue measure. The scaling free cost functionals are of the form \(P(\Omega )T^q(\Omega )|\Omega |^{-2q-1/2}\), and the class of admissible domains consists of two-dimensional open sets \(\Omega \) satisfying the topological constraints of having a prescribed number k of bounded connected components of the complementary set. A relaxed procedure is needed to have a well-posed problem, and we show that when \(q<1/2\) an optimal relaxed domain exists. When \(q>1/2\), the problem is ill-posed, and for \(q=1/2\), the explicit value of the infimum is provided in the cases \(k=0\) and \(k=1\).

     

Analysis of a Free Boundary Problem Modeling the Growth of Spherically Symmetric Tumors with Angiogenesis

This paper is concerned with a free boundary problem modeling the growth of a spherically symmetric tumor with angiogenesis. The unknown nutrient concentration \(\sigma =\sigma (r,t)\) occupies the unknown tumor region \(r< R(t)\) and satisfies a nonlinear reaction diffusion equation, and the unknown tumor radius \(R=R(t)\) satisfies a nonlinear integro-differential equation. Unlike existing literatures on this topic where Dirichlet boundary condition for \(\sigma \) is imposed, in this paper the model uses the Robin boundary condition for \(\sigma \). We prove existence and uniqueness of a global in-time classical solution (\(\sigma (r,t),R(t)\)) for arbitrary \(c>0\) and establish asymptotic stability of the unique stationary solution (\(\sigma _{s}(r),R_{s}\)) for sufficiently small \(c\), where \(c\) is a positive constant reflecting the ratio between nutrient diffusion scale and the tumor cell-doubling scale.

     

A Global Geometric Decomposition of Vector Fields and Applications to Topological Conjugacy

We give a global geometric decomposition of continuously differentiable vector fields on \(\mathbb{R}^{n}\). More precisely, given a vector field of class \(\mathcal{C}^{1}\) on \(\mathbb{R}^{n}\), and a geometric structure on \(\mathbb{R}^{n}\), we provide a unique global decomposition of the vector field as the sum of a left (right) gradient-like vector field (naturally associated to the geometric structure) with potential function vanishing at the origin, and a vector field which is left (right) orthogonal to the Euler vector field, with respect to the geometric structure. As application, we provide a criterion to decide topological conjugacy of complete vector fields of class \(\mathcal{C} ^{1}\) on \(\mathbb{R}^{n}\) based on topological conjugacy of the corresponding parts given by the associated geometric decompositions.

     

Functional Matrix Multipliers for Parseval Gabor Multi-frame Generators

We consider the problem of characterizing the bounded linear operator multipliers on \(L^{2}(\mathbb{R})\) that map Gabor frame generators to Gabor frame generators. We prove that a functional matrix \(M(t)=[f_{ij}(t)]_{m \times m}\) (where \(f_{ij}\in L^{\infty}(\mathbb{R})\)) is a multiplier for Parseval Gabor multi-frame generators with parameters \(a, b >0\) if and only if \(M(t)\) is unitary and \(M^{*}(t)M(t+\frac{1}{b})= \lambda(t)I\) for some unimodular \(a\)-periodic function \(\lambda(t)\). As a special case (\(m =1\)) this recovers the characterization of functional multipliers for Parseval Gabor frames with single function generators.

     

Superlinear Elliptic Equations with Variable Exponent via Perturbation Method

We are concerned with the following \(p(x)\)-Laplacian equations in \(\mathbb{R}^{N}\)

$$ -\triangle _{p(x)} u+|u|^{p(x)-2}u= f(x,u)\quad \mbox{in } \mathbb{R} ^{N}. $$

The nonlinearity is superlinear but does not satisfy the Ambrosetti-Rabinowitz type condition. Our main difficulty is that the weak limit of (PS) sequence is not always the weak solution of this problem. To overcome this difficulty, by adding potential term and using mountain pass theorem, we get the weak solution \(u_{\lambda }\) of perturbation equations. First, we prove that \(u_{\lambda }\rightharpoonup u\) as \(\lambda \rightarrow 0\). Second, by using vanishing lemma, we get that \(u\) is a nontrivial solution of the original problem.

     

On the Fourier coefficients of certain Hilbert modular forms

We prove that given any \(\epsilon >0\), a non-zero adelic Hilbert cusp form \({\mathbf {f}}\) of weight \(k=(k_1,k_2,\ldots ,k_n)\in ({\mathbb {Z}}_+)^n\) and square-free level \(\mathfrak {n}\) with Fourier coefficients \(C_{{\mathbf {f}}}(\mathfrak {m})\), there exists a square-free integral ideal \(\mathfrak {m}\) with \(N(\mathfrak {m})\ll k_0^{3n+\epsilon }N(\mathfrak {n})^{\frac{6n^2+1}{2}+\epsilon }\) such that \(C_{{\mathbf {f}}}(\mathfrak {m})\ne 0\). The implied constant depends on \(\epsilon , F\).

     

Defining Relations for the Carpet Subgroups of Chevalley Groups over Fields

The carpet subgroups admitting a Bruhat decomposition and different from Chevalley groups are exhausted by the groups lying between the Chevalley groups of type \( B_{l} \), \( C_{l} \), \( F_{4} \), or \( G_{2} \) over various imperfect fields of exceptional characteristic 2 or 3, the larger of which is an algebraic extension of the smaller field. Moreover, as regards the types \( B_{l} \) and \( C_{l} \), these subgroups are parametrized by the pairs of additive subgroups one of which may fail to be a field and, for the type \( B_{2} \), even both additive subgroups may fail to be fields. In this paper for the carpet subgroups admitting a Bruhat decomposition we present the relations similar to those well known for Chevalley groups over fields.

     

A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms

We consider primal-dual pairs of semidefinite programs and assume that they are singular, i.e., both primal and dual are either weakly feasible or weakly infeasible. Under such circumstances, strong duality may break down and the primal and dual might have a nonzero duality gap. Nevertheless, there are arbitrary small perturbations to the problem data which would make them strongly feasible thus zeroing the duality gap. In this paper, we conduct an asymptotic analysis of the optimal value as the perturbation for regularization is driven to zero. Specifically, we fix two positive definite matrices, \(I_p\) and \(I_d\), say, (typically the identity matrices), and regularize the primal and dual problems by shifting their associated affine space by \(\eta I_p\) and \(\varepsilon I_d\), respectively, to recover interior feasibility of both problems, where \(\varepsilon \) and \(\eta \) are positive numbers. Then we analyze the behavior of the optimal value of the regularized problem when the perturbation is reduced to zero keeping the ratio between \(\eta \) and \(\varepsilon \) constant. A key feature of our analysis is that no further assumptions such as compactness or constraint qualifications are ever made. It will be shown that the optimal value of the perturbed problem converges to a value between the primal and dual optimal values of the original problems. Furthermore, the limiting optimal value changes “monotonically” from the primal optimal value to the dual optimal value as a function of \(\theta \), if we parametrize \((\varepsilon , \eta )\) as \((\varepsilon , \eta )=t(\cos \theta , \sin \theta )\) and let \(t\rightarrow 0\). Finally, the analysis leads us to the relatively surprising consequence that some representative infeasible interior-point algorithms for SDP generate sequences converging to a number between the primal and dual optimal values, even in the presence of a nonzero duality gap. Though this result is more of theoretical interest at this point, it might be of some value in the development of infeasible interior-point algorithms that can handle singular problems.

     

Bernstein Fractal Trigonometric Approximation

Fractal interpolation and approximation received a lot of attention in the last thirty years. The main aim of the current article is to study a fractal trigonometric approximants which converge to the given continuous function even if the magnitude of the scaling factors does not approach zero. In this paper, we first introduce a new class of fractal approximants, namely, Bernstein \(\alpha \)-fractal functions using the theory of fractal approximation and Bernstein polynomial. Using the proposed class of fractal approximants and imposing no condition on corresponding scaling factors, we establish that the set of Bernstein \(\alpha \)-fractal trigonometric functions is fundamental in the space of continuous periodic functions. Fractal version of Gauss formula of trigonometric interpolation is obtained by means of Bernstein trigonometric fractal polynomials. We study the Bernstein fractal Fourier series of a continuous periodic function \(f\) defined on \([-l,l]\). The Bernstein fractal Fourier series converges to \(f\) even if the magnitude of the scaling factors does not approach zero. Existence of the \(\mathcal{C}^{r}\)-Bernstein fractal functions is investigated, and Bernstein cubic spline fractal interpolation functions are proposed based on the theory of \(\mathcal{C}^{r}\)-Bernstein fractal functions.

     

Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification

For regularized optimization that minimizes the sum of a smooth term and a regularizer that promotes structured solutions, inexact proximal-Newton-type methods, or successive quadratic approximation (SQA) methods, are widely used for their superlinear convergence in terms of iterations. However, unlike the counter parts in smooth optimization, they suffer from lengthy running time in solving regularized subproblems because even approximate solutions cannot be computed easily, so their empirical time cost is not as impressive. In this work, we first show that for partly smooth regularizers, although general inexact solutions cannot identify the active manifold that makes the objective function smooth, approximate solutions generated by commonly-used subproblem solvers will identify this manifold, even with arbitrarily low solution precision. We then utilize this property to propose an improved SQA method, ISQA \(^{+}\), that switches to efficient smooth optimization methods after this manifold is identified. We show that for a wide class of degenerate solutions, ISQA \(^{+}\) possesses superlinear convergence not only in iterations, but also in running time because the cost per iteration is bounded. In particular, our superlinear convergence result holds on problems satisfying a sharpness condition that is more general than that in existing literature. We also prove iterate convergence under a sharpness condition for inexact SQA, which is novel for this family of methods that could easily violate the classical relative-error condition frequently used in proving convergence under similar conditions. Experiments on real-world problems support that ISQA \(^{+}\) improves running time over some modern solvers for regularized optimization.

     

On the Coincidence of the Classes of Finite Groups $ E_{\pi_{x}} $ and $ D_{\pi_{x}} $

Let \( \pi_{x} \) be the set of primes greater than \( x \). We prove that for all \( x\in{??} \) the classes of finite groups \( D_{\pi_{x}} \) and \( E_{\pi_{x}} \) coincide; i.e., a finite group \( G \) possesses a \( \pi_{x} \)-Hall subgroup if and only if \( G \) satisfies the complete analog of the Sylow Theorems for a \( \pi_{x} \)-subgroup.

     

On univariate slash distributions,continuous and discrete

In this article, I explore in a unified manner the structure of uniform slash and \(\alpha \)-slash distributions which, in the continuous case, are defined to be the distributions of Y / U and \( Y_\alpha /U^{1/\alpha }\) where Y and \(Y_\alpha \) follow any distribution on \(\mathbb {R}^+\) and, independently, U is uniform on (0, 1). The parallels with the monotone and \(\alpha \)-monotone distributions of \( Y \times U\) and \(Y_\alpha \times U^{1/\alpha }\), respectively, are striking. I also introduce discrete uniform slash and \(\alpha \)-slash distributions which arise from a notion of negative binomial thinning/fattening. Their specification, although apparently rather different from the continuous case, seems to be a good one because of the close way in which their properties mimic those of the continuous case.

     

Decay Estimates for Solutions of Porous Medium Equations with Advection

In this paper, we show that bounded weak solutions of the Cauchy problem for general degenerate parabolic equations of the form

$$ u_{t} + \operatorname{div}f(x,t,u) = \operatorname{div}\bigl( |u|^{\alpha } \nabla u\bigr), \quad x \in \mathbb{R}^{n} , \ t > 0, $$

where \(\alpha > 0 \) is constant, decrease to zero, under fairly broad conditions on the advection flux \(f\). Besides that, we derive a time decay rate for these solutions.

     

Existence of Continuous Eigenvalues for a Class of Parametric Problems Involving the $(p,2)$-Laplacian Operator

We discuss a parametric eigenvalue problem, where the differential operator is of \((p,2)\)-Laplacian type. We show that, when \(p\neq 2\), the spectrum of the operator is a half line, with the end point formulated in terms of the parameter and the principal eigenvalue of the Laplacian with zero Dirichlet boundary conditions. Two cases are considered corresponding to \(p>2\) and \(p<2\), and the methods that are applied are variational. In the former case, the direct method is applied, whereas in the latter case, the fibering method of Pohozaev is used. We will also discuss a priori bounds and regularity of the eigenfunctions. In particular, we will show that, when the eigenvalue tends towards the end point of the half line, the supremum norm of the corresponding eigenfunction tends to zero in the case of \(p>2\), and to infinity in the case of \(p < 2\).

     

Energy-Preserving Integrators Applied to Nonholonomic Systems

We introduce energy-preserving integrators for nonholonomic mechanical systems. We will see that the nonholonomic dynamics is completely determined by a triple \(({{\mathcal {D}}}^*, \varPi , \mathcal {H})\), where \({{\mathcal {D}}}^*\) is the dual of the vector bundle determined by the nonholonomic constraints, \(\varPi \) is an almost-Poisson bracket (the nonholonomic bracket) and \( \mathcal {H}: {{\mathcal {D}}}^*\rightarrow \mathbb {R}\) is a Hamiltonian function. For this triple, we can apply energy-preserving integrators, in particular, we show that discrete gradients can be used in the numerical integration of nonholonomic dynamics. By construction, we achieve preservation of the constraints and of the energy of the nonholonomic system. Moreover, to facilitate their applicability to complex systems which cannot be easily transformed into the aforementioned almost-Poisson form, we rewrite our integrators using just the initial information of the nonholonomic system. The derived procedures are tested on several examples: a chaotic quartic nonholonomic mechanical system, the Chaplygin sleigh system, the Suslov problem and a continuous gearbox driven by an asymmetric pendulum. Their performance is compared with other standard methods in nonholonomic dynamics, and their merits verified in practice.

     

An Arbitrary-Order Discrete de Rham Complex on Polyhedral Meshes: Exactness,Poincaré Inequalities,and Consistency

In this paper, we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in the Koszul complex. The DDR complex is fully discrete, meaning that both the spaces and discrete calculus operators are replaced by discrete counterparts, and satisfies suitable exactness properties depending on the topology of the domain. In conjunction with bespoke discrete counterparts of \(\text {L}^2\)-products, it can be used to design schemes for partial differential equations that benefit from the exactness of the sequence but, unlike classical (e.g., Raviart–Thomas–Nédélec) finite elements, are nonconforming. We prove a complete panel of results for the analysis of such schemes: exactness properties, uniform Poincaré inequalities, as well as primal and adjoint consistency. We also show how this DDR complex enables the design of a numerical scheme for a magnetostatics problem, and use the aforementioned results to prove stability and optimal error estimates for this scheme.

     

Existence and Multiplicity Solutions for the $p$-Fractional Schrödinger–Kirchhoff Equations with Electromagnetic Fields and Critical Nonlinearity

This paper is devoted to the study of the \(p\)-fractional Schrödinger–Kirchhoff equations with electromagnetic fields and critical nonlinearity. By using the variational methods, we obtain the existence of mountain pass solutions \(u_{\varepsilon }\) which tend to the trivial solutions as \(\varepsilon \rightarrow 0\). Moreover, we get \(m^{\ast }\) pairs of solutions for the problem in absence of magnetic effects under some extra assumptions.

     

On Neyman–Pearson minimax detection of Poisson process intensity

The problem of the minimax testing of the Poisson process intensity \({\mathbf{s}}\) is considered. For a given intensity \({\mathbf{p}}\) and a set \(\mathcal{Q}\), the minimax testing of the simple hypothesis \(H_{0}: {\mathbf{s}} = {\mathbf{p}}\) against the composite alternative \(H_{1}: {\mathbf{s}} = {\mathbf{q}},\,{\mathbf{q}} \in \mathcal{Q}\) is investigated. The case, when the 1-st kind error probability \(\alpha \) is fixed and we are interested in the minimal possible 2-nd kind error probability \(\beta ({\mathbf{p}},\mathcal{Q})\), is considered. What is the maximal set \(\mathcal{Q}\), which can be replaced by an intensity \({\mathbf{q}} \in \mathcal{Q}\) without any loss of testing performance? In the asymptotic case (\(T\rightarrow \infty \)) that maximal set \(\mathcal{Q}\) is described.

     

The Berry–Esseen bounds of the weighted estimator in a nonparametric regression model

Consider the following nonparametric model: \(Y_{ni}=g(x_{ni})+ \varepsilon _{ni},1\le i\le n,\) where \(x_{ni}\in {\mathbb {A}}\) are the nonrandom design points and \({\mathbb {A}}\) is a compact set of \({\mathbb {R}}^{m}\) for some \(m\ge 1\), \(g(\cdot )\) is a real valued function defined on \({\mathbb {A}}\), and \(\varepsilon _{n1},\ldots ,\varepsilon _{nn}\) are \(\rho ^{-}\)-mixing random errors with zero mean and finite variance. We obtain the Berry–Esseen bounds of the weighted estimator of \(g(\cdot )\). The rate can achieve nearly \(O(n^{-1/4})\) when the moment condition is appropriate. Moreover, we carry out some simulations to verify the validity of our results.

     

Approximation of Non-decaying Signals from Shift-Invariant Subspaces

In our recent work, the sampling and reconstruction of non-decaying signals, modeled as members of weighted-\(L_p\) spaces, were shown to be stable with an appropriate choice of the generating kernel for the shift-invariant reconstruction space. In this paper, we extend the Strang–Fix theory to show that, for d-dimensional signals whose derivatives up to order L are all in some weighted-\(L_p\) space, the weighted norm of the approximation error can be made to go down as \(O(h^L)\) when the sampling step h tends to 0. The sufficient condition for this decay rate is that the generating kernel belongs to a particular hybrid-norm space and satisfies the Strang–Fix conditions of order L. We show that the \(O(h^L)\) behavior of the error is attainable for both approximation schemes using projection (when the signal is prefiltered with the dual kernel) and interpolation (when a prefilter is unavailable). The requirement on the signal for the interpolation method, however, is slightly more stringent than that of the projection because we need to increase the smoothness of the signal by a margin of \(d/p+\varepsilon \), for arbitrary \(\varepsilon >0\). This extra amount of derivatives is used to make sure that the direct sampling is stable.