Search

A classical result of K. L. Chung and W. Feller deals with the partial sums S k S_k arising in a fair coin-tossing game. If N n N_n is the number of “positive” terms among S 1 S_1 , S 2 S_2 , …, S n S_n then the quantity P ( N 2 n = 2 r ) P(N_{2n} = 2r) takes an elegant form. We lift the restriction on an even number of tosses and give a simple expression for P ( N 2 n + 1 = r ) P(N_{2n+1} = r) , r = 0 r = 0 , 1 1 , 2 2 , …, 2 n + 1 2n+1 . We get to this ansatz by adaptating the Feynman–Kac methodology.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

This work is a contribution to the Project UIDB/04035/2020, funded by FCT - Fundacao para a Ciencia e a Tecnologia, Portugal.

We congratulate the authors Bertsimas, Pauphilet and van Parys (hereafter BPvP) and Hastie, Tibshirani and Tibshirani (hereafter HTT) for providing fresh and insightful views on the problem of variable selection and prediction in linear models. Their contributions at the fundamental level provide guidance for more complex models and procedures.

Inspired by the article “Anomalous relaxation model based on the fractional derivative with a Prabhakar-like kernel” (Z. Angew. Math. Phys. (2019) 70:42) whose authors Zhao and Sun studied the integro-differential equation with the kernel given by the Prabhakar function $$e^{-\gamma }_{\alpha , \beta }(t, \lambda )$$ , we provide the solution to this equation which is complementary to that obtained up to now. Our solution is valid for effective relaxation times whose admissible range extends the limits given in Zhao and Sun (Z Angew Math Phys 70:42, 2019, Theorem 3.1) to all positive values. For special choices of parameters entering the equation itself and/or characterizing the kernel, the solution comprises to known phenomenological relaxation patterns, e.g., to the Cole–Cole model (if $$\gamma = 1, \beta =1-\alpha $$ ) or to the standard Debye relaxation.

We complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

We show that a relative entropy condition recently shown by Leger and Vasseur to imply uniqueness and stable $L^2$ dependence on initial data of Lax 1- or $n$-shock solutions of an $n\times n$ system of hyperbolic conservation laws with convex entropy implies Lopatinski stability in the sense of Majda. This means in particular that Leger and Vasseur's relative entropy condition represents a considerable improvement over the standard entropy condition of decreasing shock strength and increasing entropy along forward Hugoniot curves, which, in a recent example exhibited by Barker, Freist\"uhler and Zumbrun, was shown to fail to imply Lopatinski stability, even for systems with convex entropy. This observation bears also on the parallel question of existence, at least for small $BV$ or $H^s$ perturbations, Comment: to appear in Proceedings of the AMS

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

In the paper (HA14), unfortunately, a computational error occurred in one estimate. Although the wrong estimate does not affect the main results, we want to present the necessary corrections. Essentially, Lemma 5.2 has to be corrected and, since it is used in the proof of Theorem 5.1, the proof of this theorem also requires an adaptation. (i) The corrected formulation of Lemma 5.2 is as follows. Lemma 5.2 For Lagrange finite elements with a shape-regular family of affine meshes { T n h } h>0 there is a constant C > 0 independent of q and h such that for all w ∈ Wh and q = 2m, m ∈N: CΛq−2 p (∇w,∇Ip h (wq−1))T ∫ T ‖∇w‖l2‖w‖ q−2 0,∞,T dx, ∀T ∈ T n h , (5.1) where Λp = ‖ ∑ndof i=1 |φi|‖0,∞,T is the Lebesgue constant.

The preeminent target of present study is to reveal the speed characteristic of ongoing outbreak COVID-19 due to novel coronavirus. On January 2020, the novel coronavirus infection (COVID-19) detected in India, and the total statistic of cases continuously increased to 7 128 268 cases including 109 285 deceases to October 2020, where 860 601 cases are active in India. In this study, we use the Hermite wavelets basis in order to solve the COVID-19 model with time- arbitrary Caputo derivative. The discussed framework is based upon Hermite wavelets. The operational matrix incorporated with the collocation scheme is used in order to transform arbitrary-order problem into algebraic equations. The corrector scheme is also used for solving the COVID-19 model for distinct value of arbitrary order. Also, authors have investigated the various behaviors of the arbitrary-order COVID-19 system and procured developments are matched with exiting developments by various techniques. The various illustrations of susceptible, exposed, infected, and recovered individuals are given for its behaviors at the various value of fractional order. In addition, the proposed model has been also supported by some numerical simulations and wavelet-based results.

Funder: John Simon Guggenheim Memorial Foundation; doi: https://doi.org/10.13039/100005851, Funder: Einstein Visiting Fellow Program, The Rayleigh–Bénard system with stress-free boundary conditions is shown to have a global attractor in each affine space where velocity has fixed spatial average. The physical problem is shown to be equivalent to one with periodic boundary conditions and certain symmetries. This enables a Gronwall estimate on enstrophy. That estimate is then used to bound the L 2 norm of the temperature gradient on the global attractor, which, in turn, is used to find a bounding region for the attractor in the enstrophy–palinstrophy plane. All final bounds are algebraic in the viscosity and thermal diffusivity, a significant improvement over previously established estimates. The sharpness of the bounds are tested with numerical simulations.

In the current article, we aim to study in detail a novel coronavirus (2019-nCoV or COVID-19) mathematical model for different aspects under Caputo fractional derivative. First, from analysis point of view, existence is necessary to be investigated for any applied problem. Therefore, we used fixed point theorem's due to Banach's and Schaefer's to establish some sufficient results regarding existence and uniqueness of the solution to the proposed model. On the other hand, stability is important in respect of approximate solution, so we have developed condition sufficient for the stability of Ulam-Hyers and their different types for the considered system. In addition, the model has also been considered for semianalytical solution via Laplace Adomian decomposition method (LADM). On Matlab, by taking some real data about Pakistan, we graph the obtained results. In the last of the manuscript, a detail discussion and brief conclusion are provided.

In this paper we develop new tensor methods for unconstrained convex optimization, which solve at each iteration an auxiliary problem of minimizing convex multivariate polynomial. We analyze the simplest scheme, based on minimization of a regularized local model of the objective function, and its accelerated version obtained in the framework of estimating sequences. Their rates of convergence are compared with the worst-case lower complexity bounds for corresponding problem classes. Finally, for the third-order methods, we suggest an efficient technique for solving the auxiliary problem, which is based on the recently developed relative smoothness condition (Bauschke et al. in Math Oper Res 42:330–348, 2017; Lu et al. in SIOPT 28(1):333–354, 2018). With this elaboration, the third-order methods become implementable and very fast. The rate of convergence in terms of the function value for the accelerated third-order scheme reaches the level $$O\left( {1 \over k^4}\right) $$ O 1 k 4 , where k is the number of iterations. This is very close to the lower bound of the order $$O\left( {1 \over k^5}\right) $$ O 1 k 5 , which is also justified in this paper. At the same time, in many important cases the computational cost of one iteration of this method remains on the level typical for the second-order methods.

The article deals with the analysis of the fractional COVID‐19 epidemic model (FCEM) with a convex incidence rate. Keeping in view the fading memory and crossover behavior found in many biological phenomena, we study the coronavirus disease by using the noninteger Caputo derivative (CD). Under the Caputo operator (CO), existence and uniqueness for the solutions of the FCEM have been analyzed using fixed point theorems. We study all the basic properties and results including local and global stability. We show the global stability of disease‐free equilibrium using the method of Castillo‐Chavez, while for disease endemic, we use the method of geometrical approach. Sensitivity analysis is carried out to highlight the most sensitive parameters corresponding to basic reproduction number. Simulations are performed via first‐order convergent numerical technique to determine how changes in parameters affect the dynamical behavior of the system.

Let G be an abelian group. The aim of this short paper is to describe a way to identify pure subgroups H of G by looking only at how the subgroup lattice $$\mathcal {L}(H)$$ L ( H ) embeds in $$\mathcal {L}(G)$$ L ( G ) . It is worth noticing that all results are carried out in a local nilpotent context for a general definition of purity.

The Award Committee – Peter Kritzer, Johannes Kepler University Linz, Austria and Jan Vybiral, Charles University, Czech Republic – determined that the following paper exhibits exceptional merit and therefore awarded the prize to: Bernd Carl, Aicke Hinrichs, and Philipp Rudolph for their paper ‘‘Entropy numbers of convex hulls in Banach spaces and applications’’, which appeared in October, 2014. Vol. 30, pp. 555–587. The $3000 prize will be divided between the winners. Each author will also receive a plaque.

Novel coronavirus (COVID-19), a global threat whose source is not correctly yet known, was firstly recognised in the city of Wuhan, China, in December 2019. Now, this disease has been spread out to many countries in all over the world. In this paper, we solved a time delay fractional COVID-19 SEIR epidemic model via Caputo fractional derivatives using a predictor-corrector method. We provided numerical simulations to show the nature of the diseases for different classes. We derived existence of unique global solutions to the given time delay fractional differential equations (DFDEs) under a mild Lipschitz condition using properties of a weighted norm, Mittag-Leffler functions and the Banach fixed point theorem. For the graphical simulations, we used real numerical data based on a case study of Wuhan, China, to show the nature of the projected model with respect to time variable. We performed various plots for different values of time delay and fractional order. We observed that the proposed scheme is highly emphatic and easy to implementation for the system of DFDEs.

The first symptomatic infected individuals of coronavirus (Covid-19) was confirmed in December 2020 in the city of Wuhan, China. In India, the first reported case of Covid-19 was confirmed on 30 January 2020. Today, coronavirus has been spread out all over the world. In this manuscript, we studied the coronavirus epidemic model with a true data of India by using Predictor-Corrector scheme. For the proposed model of Covid-19, the numerical and graphical simulations are performed in a framework of the new generalised Caputo sense non-integer order derivative. We analysed the existence and uniqueness of solution of the given fractional model by the definition of Chebyshev norm, Banach space, Schauder's second fixed point theorem, Arzel's-Ascoli theorem, uniform boundedness, equicontinuity and Weissinger's fixed point theorem. A new analysis of the given model with the true data is given to analyse the dynamics of the model in fractional sense. Graphical simulations show the structure of the given classes of the non-linear model with respect to the time variable. We investigated that the mentioned method is copiously strong and smooth to implement on the systems of non-linear fractional differential equation systems. The stability results for the projected algorithm is also performed with the applications of some important lemmas. The present study gives the applicability of this new generalised version of Caputo type non-integer operator in mathematical epidemiology. We compared that the fractional order results are more credible to the integer order results.

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

In this work we introduce the r-Hunter-Saxton equation, a generalisation of the Hunter-Saxton equation arising as extremals of an action principle posed in L_r. We characterise solutions to the Cauchy problem, quantifying the blow-up time and studying various symmetry reductions. We construct piecewise linear functions and show that they are weak solutions to the r-Hunter-Saxton equation., Revised after referee comments

We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter&rsquo, s value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime.

In this paper, we apply the calculus of variations to solve the elastica problem. We examine a more general elastica problem in which the material under consideration need not be uniformly rigid. Using, the Euler–Lagrange equations, we derive a system of nonlinear differential equations whose solutions are given by these generalized elastica curves. We consider certain simplifying cases in which we can solve the system of differential equations. Finally, we use novel numerical techniques to approach solutions to the problem in full generality.

Recently, Zou obtained the generalized results on the bounds for Tsallis relative operator entropy. In this short paper, we give precise bounds for Tsallis relative operator entropy. We also give precise bounds of relative operator entropy., To appear in Math. Ineq. Appl., 8 pages

In 1985, Odoni showed that in characteristic 0 0 the Galois group of the n n -th iterate of the generic polynomial with degree d d is as large as possible. That is, he showed that this Galois group is the n n -th wreath power of the symmetric group S d S_d . We generalize this result to positive characteristic, as well as to the generic rational function. These results can be applied to prove certain density results in number theory, two of which are presented here. This work was partially completed by the late R.W.K. Odoni in an unpublished paper.

This paper is devoted to the study of the qualitative properties of solutions to boundary-value problems for strongly elliptic differential-difference equations. Some results for these equations such as existence and smoothness of generalized solutions in certain subdomains of Q were obtained earlier. Nevertheless, the smoothness of generalized solutions of such problems can be violated near the boundary of these subdomains even for infinitely differentiable right-hand side. The subdomains are defined as connected components of the set that is obtained from the domain Q by throwing out all possible shifts of the boundary Q by vectors of a certain group generated by shifts occurring in the difference operators. For the one dimensional Neumann problem for differential-difference equations there were obtained conditions on the coefficients of difference operators, under which for any continuous right-hand side there is a classical solution of the problem that coincides with the generalized solution. 2 Also there was obtained the smoothness (in Sobolev spaces W k ) of generalized solutions of the second and the third boundary-value problems for strongly elliptic differential-difference equations in subdomains excluding -neighborhoods of certain points. However, the smoothness (in Ho lder spaces) of generalized solutions of the second boundary-value problem for strongly elliptic differential-difference equations on the boundary of adjacent subdomains was not considered. In this paper, we study this question in Ho lder spaces. We establish necessary and sufficient conditions for the coefficients of difference operators that guarantee smoothness of the generalized solution on the boundary of adjacent subdomains for any right-hand side from the Ho lder space.

Part of the work was done while the authors were visiting the South China University of Science and Technology (SUSTech), Shenzhen, in 2018, and we are grateful (in particular to Professor Cai Heng Li) for the hospitality that we received.The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no.EP/R014604/1), where further work on this paper was undertaken. In particular we acknowledge a Simons Fellowship (Cameron) and a Kirk Distinguished Visiting Fellowship (Praeger) during this programme. Schneider thanks the Centre for the Mathematics of Symmetry and Computation of The University of Western Australia and Australian Research Council Discovery Grant DP160102323 for hosting his visit in 2017 and acknowledges the support of the CNPq projects Produtividade em Pesquisa (project no.: 308212/2019-3) and Universal (project no.:421624/2018-3). Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our combinatorial axioms. However, for m≥3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group as the diagonal semilattice except in four small cases with m

The paper is devoted to the study of Gromov-Hausdorff convergence and stability of irreversible metric-measure spaces, both in the compact and noncompact cases. While the compact setting is mostly similar to the reversible case developed by J. Lott, K.-T. Sturm and C. Villani, the noncompact case provides various surprising phenomena. Since the reversibility of noncompact irreversible spaces might be infinite, it is motivated to introduce a suitable nondecreasing function that bounds the reversibility of larger and larger balls. By this approach, we are able to prove satisfactory convergence/stability results in a suitable – reversibility depending – Gromov-Hausdorff topology. A wide class of irreversible spaces is provided by Finsler manifolds, which serve to construct various model examples by pointing out genuine differences between the reversible and irreversible settings. We conclude the paper by proving various geometric and functional inequalities (as Brunn-Minkowski, Bishop-Gromov, log-Sobolev and Lichnerowicz inequalities) on irreversible structures.

The inconsistent or consistent general fuzzy matrix equation are studied in this paper. The aim of this paper is threefold. Firstly, general strong fuzzy matrix solutions of consistent general fuzzy matrix equation are derived, and an algorithm for obtaining general strong fuzzy solutions of general fuzzy matrix equation by Core-EP inverse is also established. Secondly, if inconsistent or consistent general fuzzy matrix equation satisfies $ X\in R(S^{k}) $, the unique solution or unique least squares solution of consistent or inconsistent general fuzzy matrix equation are given by Core-EP inverse. Thirdly, we present an algorithm for obtaining Core-EP inverse. Finally, we present some examples to illustrate the main results.

In this paper, we derive the explicit analytical solution of incommensurate fractional differential equation systems with fractional order $ 1 < \alpha, \beta < 2 $. The derivation is extended from a recently published paper by Huseynov et al. in [1], which is limited for incommensurate fractional order $ 0 < \alpha, \beta < 1 $. The incommensurate fractional differential equation systems were first converted to Volterra integral equations. Then, the Mittag-Leffler function and Picard's successive approximations were used to obtain the analytical solution of incommensurate fractional order systems with $ 1 < \alpha, \beta < 2 $. The solution will be simplified via some combinatorial concepts and bivariate Mittag-Leffler function. Some special cases will be discussed, while some examples will be given at the end of this paper.

Differential-algebraic equations (DAEs) are widely used for modeling of dynamical systems. In numerical analysis of DAEs, consistent initialization and index reduction are important preprocessing prior to numerical integration. Existing DAE solvers commonly adopt structural preprocessing methods based on combinatorial optimization. Unfortunately, the structural methods fail if the DAE has numerical or symbolic cancellations. For such DAEs, methods have been proposed to modify them to other DAEs to which the structural methods are applicable, based on the combinatorial relaxation technique. Existing modification methods, however, work only for a class of DAEs that are linear or close to linear. This paper presents two new modification methods for nonlinear DAEs: the substitution method and the augmentation method. Both methods are based on the combinatorial relaxation approach and are applicable to a large class of nonlinear DAEs. The substitution method symbolically solves equations for some derivatives based on the implicit function theorem and substitutes the solution back into the system. Instead of solving equations, the augmentation method modifies DAEs by appending new variables and equations. The augmentation method has advantages that the equation solving is not needed and the sparsity of DAEs is retained. It is shown in numerical experiments that both methods, especially the augmentation method, successfully modify high-index DAEs that the DAE solver in MATLAB cannot handle., Comment: A preliminary version of this paper is to appear in Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation (ISSAC 2019), Beijing, China, July 2019

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety coefficients less than 1 such that there is a covering of $B$ by translative homothets with these coefficients. $h_{\alpha}(B)$ is the minimal number of directions such that the boundary of $B$ can be illuminated by this number of directions except for a subset whose Hausdorff dimension is less than $\alpha$. In this paper, we prove that $g_{\alpha}(B)\leq h_{\alpha}(B)$, find upper and lower bounds for both numbers, and discuss several general conjectures. In particular, we show that $h_{\alpha} (B) > 2^{d-\alpha}$ for almost all $\alpha$ and $d$ when $B$ is the $d$-dimensional cube, thus disproving the conjecture from Research Problems in Discrete Geometry by Brass, Moser, and Pach.

Let $\Omega\subset\mathbb R^n$ be a $C^1$ domain, or more generally, a Lipschitz domain with small local Lipschitz constant. In this paper it is shown that if $u$ is a function harmonic in $\Omega$ and continuous in $\overline \Omega$ which vanishes in a relatively open subset $\Sigma\subset\partial\Omega$ and moreover the normal derivative $\partial_\nu u$ vanishes in a subset of $\Sigma$ with positive surface measure, then $u$ is identically $0$., Comment: More detailed explanation in some argument involving integration by parts and in Remark 3.3. An additional appendix with a self-contained proof of Lemma 4.3, whose proof was not included in the paper previously

The purpose of this paper is to recommend an iterative scheme to approximate a common element of the solution sets of the split problem of variational inclusions, split generalized equilibrium problem and fixed point problem for non-expansive mappings. We prove that the sequences generated by the recommended iterative scheme strongly converge to a common element of solution sets of stated split problems. In the end, we provide a numerical example to support and justify our main result. The result studied in this paper generalizes and extends some widely recognized results in this direction.

In this paper, variational discretization directed against the optimal control problem governed by nonlinear parabolic equations with control constraints is studied. It is known that the a priori error estimates is $|||u-u_h|||_{L^\infty(J; L^2(\Omega))} = O(h+k)$ using backward Euler method for standard finite element. In this paper, the better result $|||u-u_h|||_{L^\infty(J; L^2(\Omega))} = O(h^2+k)$ is gained. Beyond that, we get a posteriori error estimates of residual type.

In their 2012 paper, Bobadilla and Koll\'ar studied topological conditions which guarantee that a proper map of complex algebraic varieties is a topological or differentiable fibration. They also asked whether a certain finiteness property on the relative covering space can imply that a proper map is a fibration. In this paper, we answer positively the integral homology version of their question in the case of abelian varieties, and the rational homology version in the case of compact ball quotients. We also propose several conjectures in relation to the Singer-Hopf conjecture in the complex projective setting., Comment: published/final version

In this paper we propose a new approach to the construction of quadrature formulas of interpolation rational type on an interval. In the introduction, a brief analysis of the results on the topic of the research is carried out. Most attention is paid to the works of mathematicians of the Belarusian school on approximation theory – Gauss, Lobatto, and Radau quadrature formulas with nodes at the zeros of the rational Chebyshev – Markov fractions. Rational fractions on the segment, generalizing the classical orthogonal Jacobi polynomials with one weight, are defined, and some of their properties are described. One of the main results of this paper consists in constructing quadrature formulas with nodes at zeros of the introduced rational fractions, calculating their coefficients in an explicit form, and estimating the remainder. This result is preceded by some auxiliary statements describing the properties of special rational functions. Classical methods of mathematical analysis, approximation theory, and the theory of functions of a complex variable are used for proof. In the conclusion a numerical analysis of the efficiency of the constructed quadrature formulas is carried out. Meanwhile, the choice of the parameters on which the nodes of the quadrature formulas depend is made in several standard ways. The obtained results can be applied for further research of rational quadrature formulas, as well as in numerical analysis.

The dynamic transitions of the Brusselator model has been recently analyzed in Y. Choi et’al (2021) and T. Ma, S. Wang (2011). Our aim in this paper is to address the relation between the pattern formation and dynamic transition results left open in those papers. We consider the problem in the setting of a 2D rectangular box where an instability of the homogeneous steady state occurs due to the perturbations in the direction of several modes becoming critical simultaneously. Our main results are two folds: (1) a rigorous characterization of the types and structure of the dynamic transitions of the model from basic homogeneous states and (2) the relation between the dynamic transitions and the pattern formations. We observe that the Brusselator model exhibits different transition types and patterns depending on the nonlinear interactions of the pattern of the critical modes.

The renormalization group method has been developed to investigate p-adic q-state Potts models on the Cayley tree of order k. This method is closely related to the examination of dynamical behavior of the p-adic Potts–Bethe mapping which depends on the parameters q, k. In Mukhamedov and Khakimov [Chaotic behavior of the p-adic Potts–Behte mapping. Discrete Contin. Dyn. Syst.38 (2018), 231–245], we have considered the case when q is not divisible by p and, under some conditions, it was established that the mapping is conjugate to the full shift on $\kappa _p$ symbols (here $\kappa _p$ is the greatest common factor of k and $p-1$ ). The present paper is a continuation of the forementioned paper, but here we investigate the case when q is divisible by p and k is arbitrary. We are able to fully describe the dynamical behavior of the p-adic Potts–Bethe mapping by means of a Markov partition. Moreover, the existence of a Julia set is established, over which the mapping exhibits a chaotic behavior. We point out that a similar result is not known in the case of real numbers (with rigorous proofs).

In this paper, uniformly most powerful unbiased test for testing the stress-strength model has been presented for the first time. The end of the paper is recommending a method which is appropriate for no large data where a normal asymptotic distribution is not applicable. The previous methods for inference on stress-strength models use almost all the asymptotic properties of maximum likelihood estimators. The distribution of components is considered exponential and generalized logistic. A corresponding unbiased confidence interval is constructed, too. We compare presented methodology with previous methods and show the method of this paper is logically better than other methods. Interesting result is that our recommended method not only uses from small sample size but also has better result than other ones.

In 1993, Shub and Smale posed the problem of finding a sequence of univariate polynomials of degree $N$ with condition number bounded above by $N$. In a previous paper by C. Belt\'an, U. Etayo, J. Marzo and J. Ortega-Cerd\`a, it was proved that the optimal value of the condition number is of the form $O(\sqrt{N})$, and the sequence demanded by Shub and Smale was described by a closed formula (for large enough $N\geqslant N_0$ with $N_0$ unknown) and by a search algorithm for the rest of the cases. In this paper we find concrete estimates for the constant hidden in the $O(\sqrt{N})$ term and we describe a simple formula for a sequence of polynomials whose condition number is at most $N$, valid for all $N=4M^2$, with $M$ a positive integer., Comment: 21 pages

We give a decomposition of the equivariant Kasparov category for discrete quantum group with torsions. As an outcome, we show that the crossed product by a discrete quantum group in a certain class preserves the UCT. We then show that quasidiagonality of a reduced C*-algebra of a countable discrete quantum group $\Gamma$ implies that $\Gamma$ is amenable, and deduce from the work of Tikuisis, White and Winter, and the results in the first part of the paper, the converse (i.e. the quantum Rosenberg Conjecture) for a large class of countable discrete unimodular quantum groups. We also note that the unimodularity is a necessary condition., Comment: 15 pages, v2 corrects a few minor points. The final version of the paper will appear in the Proceedings of the American Mathematical Society

This paper is a continuation of a series of papers devoted to the numerical solution of integral equations using local interpolation splines. The main focus is given to the use of splines of the fourth order of approximation. The features of the application of the polynomial and non-polynomial splines of the fourth order of approximation to the solution of Volterra integral equation of the second kind are discussed. In addition to local splines of the Lagrangian type, integro-differential splines are also used to construct computational schemes. The comparison of the solutions obtained by different methods is carried out. The results of the numerical experiments are presented.

In this paper the authors introduce an analogue of the nilpotent cone, N {\mathcal N} , for a classical Lie superalgebra, g {\mathfrak g} , that generalizes the definition for the nilpotent cone for semisimple Lie algebras. For a classical simple Lie superalgebra, g = g 0 ¯ ⊕ g 1 ¯ {\mathfrak g}={\mathfrak g}_{\bar 0}\oplus {\mathfrak g}_{\bar 1} with Lie G 0 ¯ = g 0 ¯ \text {Lie }G_{\bar 0}={\mathfrak g}_{\bar 0} , it is shown that there are finitely many G 0 ¯ G_{\bar 0} -orbits on N {\mathcal N} . Later the authors prove that the Duflo-Serganova commuting variety, X {\mathcal X} , is contained in N {\mathcal N} for any classical simple Lie superalgebra. Consequently, our finiteness result generalizes and extends the work of Duflo-Serganova on the commuting variety. Further applications are given at the end of the paper.

The mean curvature-based image deblurring model is widely used to enhance the quality of the deblurred images. However, the discretization of the associated Euler-Lagrange equations produce a nonlinear ill-conditioned system which affect the convergence of the numerical algorithms like Krylov subspace methods. To overcome this difficulty, in this paper, we present two new symmetric positive definite (SPD) preconditioners. An efficient algorithm is presented for the mean curvature-based image deblurring problem which combines a fixed point iteration (FPI) with new preconditioned matrices to handle the nonlinearity and ill-conditioned nature of the large system. The eigenvalues analysis is also presented in the paper. Fast convergence has shown in the numerical results by using the proposed new preconditioners.