Asymptotic behavior and finite element error estimates of Kelvin-Voigt viscoelastic fluid flow model

In this article, the convergence of the solution of the Kelvin-Voigt viscoelastic fluid flow model to its steady state solution with exponential rate is established under the uniqueness assumption. Then, a semidiscrete Galerkin method for spatial direction keeping time variable continuous is considered and asymptotic behavior of the semidiscrete solution is derived. Moreover, optimal error estimates are achieved for large time using steady state error estimates. Based on linearized backward Euler method, asymptotic behavior for the fully discrete solution is studied and optimal error estimates are derived for large time. All the results are even valid for κ→0, that is, when the Kelvin-Voigt model converges to the Navier-Stokes system. Finally, some numerical experiments are conducted to confirm our theoretical findings.     

Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers

The model is a service system, consisting of several large server pools. A server’s processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the total customer arrival rate and pool sizes scale to infinity simultaneously, in proportion to a scaling parameter n, while the number of routers remains fixed. We define and study a multi-router generalization of the pull-based customer assignment (routing) algorithm PULL, introduced in Stolyar (Queueing Syst 80(4): 341–361, 2015) for the single-router model. Under the PULL algorithm, when a server becomes idle it sends a “pull-message” to a randomly uniformly selected router; each router operates independently—it assigns an arriving customer to a server according to a randomly uniformly chosen available (at this router) pull-message, if there is any, or to a randomly uniformly selected server in the entire system otherwise. Under Markov assumptions (Poisson arrival process and independent exponentially distributed service requirements), and under subcritical system load, we prove asymptotic optimality of PULL: as \(n\rightarrow \infty \), the steady-state probability of an arriving customer experiencing blocking or waiting vanishes. Furthermore, PULL has an extremely low router–server message exchange rate of one message per customer. These results generalize some of the single-router results in Stolyar (2015).     

Koszulity and Koszul modules of dual extension algebras

Let A and B be algebras, and let T be the dual extension algebra of A and B. We provide a different method to prove that T is Koszul if and only if both A and B are Koszul. Furthermore, we prove that an algebra is Koszul if and only if one of its iterated dual extension algebras is Koszul, if and only if all its iterated dual extension algebras are Koszul. Finally, we give a necessary and sufficient condition for a dual extension algebra to have the property that all linearly presented modules are Koszul modules, which provides an effective way to construct algebras with such a property.     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

On the growth and approximation of entire functions represented by Laplace–Stieltjes’ transformation

In the present paper, we obtain the characterization of various growth parameters of an entire function F(s) represented by Laplace–Stieltjes transformation in terms of the rate of decrease of \(E_n ( {F,\beta } ),\)where \(E_n ( {F,\beta } )\) represents the error in approximating the function F(s) by exponential polynomials.     

On optimal partitions,individual values and cooperative games: Does a wiser agent always produce a higher value?

We consider an optimal partition of resources (e.g. consumers) between several agents, given utility functions (“wisdoms”) for the agents and their capacities. This problem is a variant of optimal transport (Monge–Kantorovich) between two measure spaces where one of the measures is discrete (capacities) and the costs of transport are the wisdoms of the agents. We concentrate on the individual value for each agent under optimal partition and show that, counter-intuitively, this value may decrease if the agent’s wisdom is increased. Sufficient and necessary conditions for the monotonicity with respect to the wisdom functions of the individual values will be given, independently of the other agents. The sharpness of these conditions is also discussed. Motivated by the above we define a cooperative game based on optimal partition and investigate conditions for stability of the grand coalition.     

Strange products of projections

Let H be an infinite-dimensional Hilbert space. We show that there exist three orthogonal projections X ₁,X ₂,X ₃ onto closed subspaces of H such that for every 0 ≠ z ₀ ∈ H there exist k ₁, k ₂, · · · ∈ {1, 2, 3} so that the sequence of iterates defined by z _n = X _kn z _n ?1 does not converge in norm.     

Rational integrability of trigonometric polynomial potentials on the flat torus

We consider a lattice ? ? ? ⁿ and a trigonometric potential V with frequencies k ∈ ?. We then prove a strong rational integrability condition on V, using the support of its Fourier transform. We then use this condition to prove that a real trigonometric polynomial potential is rationally integrable if and only if it separates up to rotation of the coordinates. Removing the real condition, we also make a classification of rationally integrable potentials in dimensions 2 and 3 and recover several integrable cases. After a complex change of variables, these potentials become real and correspond to generalized Toda integrable potentials. Moreover, along the proof, some of them with high-degree first integrals are explicitly integrated.     

Computing topological indices of Sudoku graphs

In QSAR/QSPR study, physico-chemical properties and topological indices such as Randi?, atom-bond connectivity (ABC) and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. A topological index is actually designed by transforming a chemical structure into a numeric number. These topological indices correlate certain physico-chemical properties like boiling point, stability, strain energy etc. of chemical compounds. Graph theory has found a considerable use in this area of research. The topological indices of certain interconnection networks were studied recently by Imran et al. (Appl Math Comput 244:936–951, 2014). In this paper, we extend this study to \(n\times n\) Sudoku graphs and derive analytical closed results of general Randi? index \(R_{\alpha }(G)\) for different values of “\(\alpha \)” for Sudoku (SK). We also compute the general Randi?, first Zagreb, ABC, GA, \(ABC_{4}\) and \(GA_{5}\) indices and give closed formulae of these indices for Sudoku graphs.     

Inverse Anisotropic Curvature Flow from Convex Hypersurfaces

In this paper, we study the inverse anisotropic curvature flow from strictly convex hypersurfaces. We show the long-time existence and the convergence to the Wulff shape after rescaling, under certain conditions on the general speed functions.