Estimates of anisotropic Sobolev spaces with mixed norms for the Stokes system in a half-space

We are concerned with the non-stationary Stokes system with non-homogeneous external force and non-zero initial data in \({\mathbb {R}}^n_+ \times (0,T)\). We obtain new estimates of solutions including pressure in terms of mixed anisotropic Sobolev spaces. As an application, some anisotropic Sobolev estimates are presented for weak solutions of the Navier–Stokes equations in a half-space in dimension three.     

Comparing predator–prey models with hidden and explicit resources

In this paper two mathematical models are proposed and analyzed to elucidate the influence on a generalist predator of its hidden and explicit resources. Boundedness of the system’s trajectories, feasibility, local and global stability of the equilibria for both models are established, as well as possible local bifurcations. The findings indicate that the relevant behaviour of the system, including switching of stability, extinction and persistence of the involved populations, depends mainly on the reproduction rate of the favorite prey. To achieve full ecosystem survival some balance between the respective grazing pressures exerted by the predator on the prey populations needs to be maintained, while higher grazing pressure just on one species always leads to its extinction.     

Approximation theorems for a family of multivariate neural network operators in Orlicz-type spaces

In this paper, we study the theory of a Kantorovich version of the multivariate neural network operators. Such operators, are activated by suitable kernels generated by sigmoidal functions. In particular, the main result here proved is a modular convergence theorem in Orlicz spaces. As special cases, convergence theorem in \(L^p\)-spaces, interpolation spaces, and exponential-type spaces can be deduced. In general, multivariate approximations by constructive neural network algorithms are useful for applications to neurocomputing processes involving high dimensional data. At the end of the paper, several examples of activation functions of sigmoidal-type for which the above theory holds have been described.     

Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm

Blackbox optimization problems are often contaminated with numerical noise, and direct search methods such as the Mesh Adaptive Direct Search (MADS) algorithm may get stuck at solutions artificially created by the noise. We propose a way to smooth out the objective function of an unconstrained problem using previously evaluated function evaluations, rather than resampling points. The new algorithm, called Robust-MADS is applied to a collection of noisy analytical problems from the literature and on an optimization problem to tune the parameters of a trust-region method.     

Optimization model for a production,inventory, distribution and routing problem in small furniture companies

Production and distribution are two key decisions in supply chain planning. In order to achieve an effective operational performance, it is important for these two decisions to be integrated, especially in supply chains with low inventory levels. In this paper, we propose a mixed integer programming model to integrate production, inventory, distribution and routing decisions in a single framework. The model was inspired by small Brazilian furniture companies and focuses on production and distribution decisions at an operational level. In particular, we consider a scenario in which only one production line and one vehicle, which makes multiple trips over the planning horizon, are available to produce items and deliver final products, respectively. We also take into account some features rarely considered in the literature, but commonly found in real-world applications, such as producing and stocking multiple items, distribution routes extending over one or more periods, multiple time windows and customers’ due dates. Computational tests on a set of randomly generated instances were carried out using a well-known optimization software and six relax-and-fix heuristics, which explore different criteria for partitioning and fixing variables. We also implemented two hybrid heuristics in which an initial solution is first constructed and then fed into the optimization software to improve it. The results showed that one relax-and-fix and the two hybrid heuristics performed better than the solver on the largest instances.     

Optimal control approach to stability criteria on Hill’s equations

This paper gives a tutorial on how to prove Lyapunov type criteria by optimal control methods. Firstly, we consider stability criteria on Hill's equations with nonnegative potential. By optimal control methods developed in 1990s, we obtain several stability criteria including Lyapunov's criterion, Neǐgauz and Lidskiǐ's criterion. Secondly, we present stability criteria on Hill's equations with sign-changing potential in which Brog's criterion and Krein's criterion are included.     

Asian option as a fixed-point

We characterize the price of an Asian option, a financial contract, as a fixed-point of a non-linear operator. In recent years, there has been interest in incorporating changes of regime into the parameters describing the evolution of the underlying asset price, namely the interest rate and the volatility, to model sudden exogenous events in the economy. Asian options are particularly interesting because the payoff depends on the integrated asset price. We study the case of both floating- and fixed-strike Asian call options with arithmetic averaging when the asset follows a regime-switching geometric Brownian motion with coefficients that depend on a Markov chain. The typical approach to finding the value of a financial option is to solve an associated system of coupled partial differential equations. Alternatively, we propose an iterative procedure that converges to the value of this contract with geometric rate using a classical fixed-point theorem.     

Periods and nonvanishing of central <Emphasis Type="Italic">L</Emphasis>-values for GL(2<Emphasis Type="Italic">n</Emphasis>)

Let π be a cuspidal automorphic representation of PGL(2n) over a number field F, and η the quadratic idèle class character attached to a quadratic extension E/F. Guo and Jacquet conjectured a relation between the nonvanishing of L(1/2, π)L(1/2, π ? η) for π of symplectic type and the nonvanishing of certain GL(n,E) periods. When n = 1, this specializes to a well-known result of Waldspurger. We prove this conjecture, and related global results, under some local hypotheses using a simple relative trace formula.We then apply these global results to obtain local results on distinguished supercuspidal representations, which partially establish a conjecture of Prasad and Takloo-Bighash.     

Uniformly recurrent subgroups of simple locally finite groups

It is shown that for the conjugation action of the symmetric group Sn, when n = 6 or n ≥ 8, all S _n -irreducibles appear as constituents of a single conjugacy class, namely, one indexed by a partition λ of n with at least two parts, whose parts are all distinct and taken from the set of odd primes and 1. A simple characterisation of conjugacy classes containing all irreducibles is proved.     

The Elekes–Szabó Theorem in four dimensions

Let F ∈ C[x, y, s, t] be an irreducible constant-degree polynomial, and let A,B,C,D ? C be finite sets of size n. We show that F vanishes on at most O(n^8/3) points of the Cartesian product A × B × C × D, unless F has a special group-related form. A similar statement holds for A,B,C,D of unequal sizes, with a suitably modified bound on the number of zeros. This is a four-dimensional extension of our recent improved analysis of the original Elekes–Szabó theorem in three dimensions. We give three applications: an expansion bound for three-variable real polynomials that do not have a special form, a bound on the number of coplanar quadruples on a space curve that is neither planar nor quartic, and a bound on the number of four-point circles on a plane curve that has degree at least five.