On the determination of the potential function from given orbits

The paper deals with the problem of finding the field of force that generates a given (N ? 1)-parametric family of orbits for a mechanical system with N degrees of freedom. This problem is usually referred to as the inverse problem of dynamics. We study this problem in relation to the problems of celestial mechanics. We state and solve a generalization of the Dainelli and Joukovski problem and propose a new approach to solve the inverse Suslov’s problem. We apply the obtained results to generalize the theorem enunciated by Joukovski in 1890, solve the inverse Stäckel problem and solve the problem of constructing the potential-energy function U that is capable of generating a bi-parametric family of orbits for a particle in space. We determine the equations for the sought-for function U and show that on the basis of these equations we can define a system of two linear partial differential equations with respect to U which contains as a particular case the Szebehely equation. We solve completely a special case of the inverse dynamics problem of constructing U that generates a given family of conics known as Bertrand’s problem. At the end we establish the relation between Bertrand’s problem and the solutions to the Heun differential equation. We illustrate our results by several examples.     

A non-stationary problem coupling PDEs and ODEs modelizing an automotive catalytic converter

In this article we prove the existence and uniqueness of the solution of a non-stationary problem that modelizes the behavior of the concentrations and the temperature of gases going through a cylindrical passage of an automotive catalytic converter. This problem couples parabolic partial differential equations (PDEs) in a domain with one parabolic partial differential equation and some ordinary differential equations (ODEs) on a part of its boundary.     

Approximate controllability for fractional diffusion equations by interior control

We consider the approximate controllability by interior control of a partial differential equation with time derivatives of non-integer order. First, we prove the well-posedness of the inhomogeneous problem for the controlled system. Next, we study the dual system and show a weak type of unique continuation property. Finally, we prove the approximate controllability.     

A brief historical introduction to Euler's formula for polyhedra,topology, graph theory and networks

This article is essentially devoted to a brief historical introduction to Euler's formula for polyhedra, topology, theory of graphs and networks with many examples from the real-world. Celebrated Königsberg seven-bridge problem and some of the basic properties of graphs and networks for some understanding of the macroscopic behaviour of real physical systems are included. We also mention some important and modern applications of graph theory or network problems from transportation to telecommunications. Graphs or networks are effectively used as powerful tools in industrial, electrical and civil engineering, communication networks in the planning of business and industry. Graph theory and combinatorics can be used to understand the changes that occur in many large and complex scientific, technical and medical systems. With the advent of fast large computers and the ubiquitous Internet consisting of a very large network of computers, large-scale complex optimization problems can be modelled in terms of graphs or networks and then solved by algorithms available in graph theory. Many large and more complex combinatorial problems dealing with the possible arrangements of situations of various kinds, and computing the number and properties of such arrangements can be formulated in terms of networks. The Knight's tour problem, Hamilton's tour problem, problem of magic squares, the Euler Graeco-Latin squares problem and their modern developments in the twentieth century are also included.     

Two Questions of Erdős on Hypergraphs above the Turán Threshold

For ordinary graphs it is known that any graph G with more edges than the Turán number of must contain several copies of , and a copy of , the complete graph on vertices with one missing edge. Erd?s asked if the same result is true for , the complete 3‐uniform hypergraph on s vertices. In this note, we show that for small values of n, the number of vertices in G, the answer is negative for . For the second property, that of containing a , we show that for the answer is negative for all large n as well, by proving that the Turán density of is greater than that of .     

Regularity for solutions to anisotropic obstacle problems

For Ω a bounded subset of R n,n 2,ψ any function in Ω with values in R∪{±∞}andθ∈W1,(q i)(Ω),let K(q i)ψ,θ(Ω)={v∈W1,(q i)(Ω):vψ,a.e.and v-θ∈W1,(q i)0(Ω}.This paper deals with solutions to K(q i)ψ,θ-obstacle problems for the A-harmonic equation-divA(x,u(x),u(x))=-divf(x)as well as the integral functional I(u;Ω)=Ωf(x,u(x),u(x))dx.Local regularity and local boundedness results are obtained under some coercive and controllable growth conditions on the operator A and some growth conditions on the integrand f.