Global solvability and asymptotic stabilization in a three-dimensional Keller–Segel–Navier–Stokes system with indirect signal production

This paper deals with the Keller–Segel–Navier–Stokes model with indirect signal production in a three-dimensional (3D) bounded domain with smooth boundary. When the logistic-type degradation here is weaker than the usual quadratic case, it is proved that for any sufficiently regular initial data, the associated no-flux/no-flux/no-flux/Dirichlet problem possesses at least one globally defined solution in an appropriate generalized sense, and that this solution is uniformly bounded in [Formula: see text] with any [Formula: see text]. Moreover, under an explicit condition on the chemotactic sensitivity, these solutions are shown to stabilize toward the corresponding spatially homogeneous state in the sense of some suitable norms. We underline that the same results were established for the corresponding system with direct signal production in a well-known result if the degradation is quadratic. Our result rigorously confirms that the indirect signal production mechanism genuinely contributes to the global solvability of the 3D Keller–Segel–Navier–Stokes system.

Mean field approach to stochastic control with partial information

In our present article, we follow our way of developing mean field type control theory in our earlier works [4], by first introducing the Bellman and then master equations, the system of Hamilton-Jacobi-Bellman (HJB) and Fokker-Planck (FP) equations, and then tackling them by looking for the semi-explicit solution for the linear quadratic case, especially with an arbitrary initial distribution; such a problem, being left open for long, has not been specifically dealt with in the earlier literature, such as [3, 13], which only tackled the linear quadratic setting with Gaussian initial distributions. Thanks to the effective mean-field theory, we propose a solution to this long standing problem of the general non-Gaussian case. Besides, our problem considered here can be reduced to the model in [2], which is fundamentally different from our present proposed framework.

Characterization of stochastic equilibrium controls by the Malliavin calculus

We derive a characterization of equilibrium controls in continuous-time, time-inconsistent control (TIC) problems using the Malliavin calculus. For this, the classical duality analysis of adjoint BSDEs is replaced with the Malliavin integration by parts. This results into a necessary and sufficient maximum principle which is applied to a linear-quadratic TIC problem, recovering previous results obtained by duality analysis in the mean-variance case, and extending them to the linear-quadratic setting. We also show that our results apply beyond the linear-quadratic case by treating the generalized Merton problem.

On the number of unit solutions of cubic congruence modulo $ n $

<abstract><p>For any positive integer $ n $, let $ \mathbb Z_n: = \mathbb Z/n\mathbb Z = \{0, \ldots, n-1\} $ be the ring of residue classes module $ n $, and let $ \mathbb{Z}_n^{\times}: = \{x\in \mathbb Z_n|\gcd(x, n) = 1\} $. In 1926, for any fixed $ c\in\mathbb Z_n $, A. Brauer studied the linear congruence $ x_1+\cdots+x_m\equiv c\pmod n $ with $ x_1, \ldots, x_m\in\mathbb{Z}_n^{\times} $ and gave a formula of its number of incongruent solutions. Recently, Taki Eldin extended A. Brauer's result to the quadratic case. In this paper, for any positive integer $ n $, we give an explicit formula for the number of incongruent solutions of the following cubic congruence</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ x_1^3+\cdots +x_m^3\equiv 0\pmod n\ \ \ {\rm with} \ x_1, \ldots, x_m \in \mathbb{Z}_n^{\times}. $\end{document} </tex-math></disp-formula></p> </abstract>

Image encryption scheme in public key cryptography based on cubic pells quadratic case

Cryptography systems face new threats with the transformation of time and technology. Each innovation tries to contest challenges posed by the previous system by analyzing approaches that are able to provide impressive outcomes. The prime aim of this work is to urge ways in which the concept of Pell’s equation can be used in Public key Cryptography techniques.The main aim of this approach is secure and can be computed very fast. Using Cubic Pell’s equation defined in Quadratic Case, a secure public key technique for Key generation process is showcased. The paper highlights that a key generation time of proposed scheme using Pell’s Quadratic case equation is fast compared to existing methods.The strength and quality of the proposed method is proved and analyzed by obtaining the results of entropy, differential analysis, correlation analysis and avalanche effect. The superiority of the proposed method over the conventional AES and DES is confirmed by a 50% increase in the execution speed and shows that Standard diviation and Entropy analysis of proposed scheme gives immunity to guess the encryption key and also it is hard to deduce the private key from public key using Diffrential analysis.

Constraining Images of Quadratic Arboreal Representations

In this paper, we prove several results on finitely generated dynamical Galois groups attached to quadratic polynomials. First, we show that, over global fields, quadratic post-critically finite (PCF) polynomials are precisely those having an arboreal representation whose image is topologically finitely generated. To obtain this result, we also prove the quadratic case of Hindes’ conjecture on dynamical non-isotriviality. Next, we give two applications of this result. On the one hand, we prove that quadratic polynomials over global fields with abelian dynamical Galois group are necessarily PCF, and we combine our results with local class field theory to classify quadratic pairs over ${ {\mathbb{Q}}}$ with abelian dynamical Galois group, improving on recent results of Andrews and Petsche. On the other hand, we show that several infinite families of subgroups of the automorphism group of the infinite binary tree cannot appear as images of arboreal representations of quadratic polynomials over number fields, yielding unconditional evidence toward Jones’ finite index conjecture.

Global solvability and eventual smoothness in a chemotaxis-fluid system with weak logistic-type degradation

We consider the coupled chemotaxis–Navier–Stokes system with logistic source term [Formula: see text] in a bounded, smooth domain [Formula: see text], where [Formula: see text] and where [Formula: see text], [Formula: see text] and [Formula: see text] are given parameters. Although the degradation here is weaker than the usual quadratic case, it is proved that for any sufficiently regular initial data, the initial-value problem for this system under no-flux boundary conditions for [Formula: see text] and [Formula: see text] and homogeneous Dirichlet boundary condition for [Formula: see text] possesses at least one globally defined weak solution. And this weak solution becomes smooth after some waiting time provided [Formula: see text].

Integral bases of pure fields with square-free parameter

Let m ≠ 0, ±1 and n ≥ 2 be integers. The ring of algebraic integers of the pure fields of type is explicitly known for n = 2, 3,4. It is well known that for n = 2, an integral basis of the pure quadratic fields can be given parametrically, by using the remainder of the square-free part of m modulo 4. Such characterisation of an integral basis also exists for cubic and quartic pure fields, but for higher degree pure fields there are only results for special cases. In this paper we explicitly give an integral basis of the field , where m ≠ ±1 is square-free. Furthermore, we show that similarly to the quadratic case, an integral basis of is repeating periodically in m with period length depending on n.