Approximation by entire functions, on a countable union of real-axis segments.4. Inverse Theorem
For more than a century, the constructive description of functional classes in terms of the possible rate of approximation of its functions by means of functions chosen from a certain set remains among the most important problems of approximation theory. It turns out that the nonuniformity of the approximation rate due between the points of the domain of the approximated function is substantial. For instance, it was only in the mid-1950s that it was possible to constructively describe Holder classes on the segment [–1; 1] in terms of the approximation by algebraic polynomials. For that particular case, the constructive description requires the approximation at neighborhoods of the segment endpoints to be essentially better than the one in a neighborhood of its midpoint. A possible approximation quality test is to find out whether the approximation rate provides a possibility to reconstruct the smoothness of the approximated function. Earlier, we investigated the approximation of classes of smooth functions on a countable union of segments on the real axis. In the present paper, we prove that the rate of the approximation by the entire exponential-type functions provides the possibility to reconstruct the smoothness of the approximated function, i.e., a constructive description of classes of smooth functions is possible in terms of the specified approximation method. In an earlier paper, that result is announced for Holder classes, but the construction of a certain function needed for the proof is omitted. In the present paper, we use another proof; it does not apply the specified function.
This paper argues that modeling granularity and approximation (Krifka 2007; Lewis 1979) is crucial for capturing important aspects of the distribution and interpretation of adjectives and their modifiers, modulo certain differences between modified adjectives and numerals. In addition, the paper presents supporting experimental results with minimizers like slightly and maximizers like completely.
Consideration was given to the omega square Cramer–von Mises tests intended to verify the goodness hypothesis about the distribution of the observed multivariable random vector with the distribution in the unit cube. The limit distribution of the statistics of these tests was defined by the distribution of an infinite quadratic form in the normal random variables. For convenience of computing its distribution, the residue of the quadratic form was approximated by a finite linear combination of the χ2-distributed random variables. Formulas for determination of the residue parameters were established.
This book constitutes revised selected papers from the First International Workshop on Machine Learning, Optimization, and Big Data, MOD 2015, held in Taormina, Sicily, Italy, in July 2015. The 32 papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with the algorithms, methods and theories relevant in data science, optimization and machine learning.
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free, that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of view of parameterized complexity and kernelization. In particular, it was shown that the problems do not admit polynomial kernels (under plausible complexity assumptions) for almost all graphs H, with several important exceptions occurring when the class of H-free graphs exhibits some structural properties. In this work we complement the parameterized study of edge modification problems to H-free graphs by considering their approximability. We prove that whenever H is 3-connected and has at least two non-edges, then both H-free Edge Deletion and H-free Edge Completion are very hard to approximate: they do not admit poly(OPT)-approximation in polynomial time, unless P=NP, or even in time subexponential in OPT, unless the Exponential Time Hypothesis fails. The assumption of the existence of two non-edges appears to be important: we show that whenever H is a complete graph without one edge, then H-free Edge Deletion is tightly connected to the \minhorn problem, whose approximability is still open. Finally, in an attempt to extend our hardness results beyond 3-connected graphs, we consider the cases of H being a path or a cycle, and we achieve an almost complete dichotomy there.
The increasing of the efficiency of technological modes of steel products manufacturing requires simulation of metal forming during hot deformation. To obtain correct results, one should set the correct initial and boundary conditions, including the mechanical properties of materials, which represent the dependence of the stress-strain and strain rate at maintained temperature. In the experiments one must reveal the mechanical properties and constants of the steels according to strain rate, predetermined temperature and chemical composition. So, the type of test is usually dependents on the technology process, which simulation will be using the obtained information. One can identify four main types of tests used in the hot deformation: compression, tension, torsion and rupture tests. The simplest tests are considered as uniaxial compression or tension tests. The results of these tests are the curves of <<flow stress -- strain>>. The present study describes an approximation method of test results for uniaxial compression of cylindrical samples made from AISI304 steel. During this work a mathematical model of the <<stress -- strain>> relation has been described. An algorithm that determines the necessary numerical coefficients for this model was developed. As a result, the equation of the material state, which is characterized by the stress relation on the strain, strain rate (0.15, 0.5, 1.5, 5 and 15 inverse seconds) and temperature (800, 950, 1080 and 1200 degree Celsius) was found. Also the approximation comparison with the experimental results were obtained.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.