The notion of variable quantities ω in Bolzano's early works

Amid the debate over infinitesimals, Bolzano introduced the alternative notion of variable quantities ω in his 1816 work on the binomial theorem. It has often been assumed that his 1817 definition of continuity using them is practically the modern one. This paper explores Bolzano's early mathematical works and diaries to gain insight into the subtleties in his definition of ω and some of his mathematical procedures. We show that those quantities are not clearly ‘proto-Weierstrassian’ and argue that Bolzano was in the process of refinement and increasing abstraction of the idea of quantity that eventually led to the development of a theory of real numbers.     

Infinitely small quantities in Cauchy's textbooks

The fundamental role of infinitely small quantities for his teaching of the calculus was underlined by Cauchy himself in the introduction to his Cours d'analyse of 1821 and in the announcements of his later textbooks. First steps toward theories of such quantities which are briefly denoted as variables having zero as their limit were made by Cauchy, who represented them by sequences converging to zero (in the Cours) or by functions vanishing at zero (since 1823). It is shown that the famous so-called errors of Cauchy are correct theorems when interpreted with his own concepts. A few gaps in his proofs are explained by the hypothesis that he tacitly assumed continuity. No assumptions on uniformity or on nonstandard numbers are needed. Finally, some possible completions of Cauchy's rudimentary theories of infinitesimals are ventured.     

Lawvere Completeness in Topology

It is known since 1973 that Lawvere’s notion of Cauchy-complete enriched category is meaningful for metric spaces: it captures exactly Cauchy-complete metric spaces. In this paper, we introduce the corresponding notion of Lawvere completeness for (\mathbbT,V)(\mathbb{T},\mathsf{V})-categories and show that it has an interesting meaning for topological spaces and quasi-uniform spaces: for the former ones it means weak sobriety while for the latter it means Cauchy completeness. Further, we show that V\mathsf{V} has a canonical (\mathbbT,V)(\mathbb{T},\mathsf{V})-category structure which plays a key role: it is Lawvere-complete under reasonable conditions on the setting; this structure permits us to define a Yoneda embedding in the realm of (\mathbbT,V)(\mathbb{T},\mathsf{V})-categories.     

SMYTH COMPLETENESS IN TERMS OF NETS: THE GENERAL CASE

Abstract

Smyth completeness is the appropriate notion of completeness for quasi-uniform spaces carrying an additional topology to serve as domains of computation [2, 3]. The goal of this paper is to provide a better understanding of Smyth completeness by giving a characterization in terms of nets. We develop the notion of computational Cauchy net and an appropriate notion of strong convergence to get the result that a space is Smyth complete if and only if every computational Cauchy net strongly converges. As we are dealing with typically non-symmetric spaces, this is not an instance of the classical net-filter translation in general topology.     

One class of separable optimization problems: solution method,application

Convexity and generalized convexity play a central role in mathematical economics and optimization theory. So, the research on criteria for convexity or generalized convexity is one of the most important aspects in mathematical programming, in order to characterize the solutions set. Many efforts have been made in the few last years to weaken the convexity notions. In this article, taking in mind Craven's notion of K-invexity function (when K is a cone in ? ⁿ ) and Martin's notion of Karush–Kuhn–Tucker invexity (hereafter KKT-invexity), we define a new notion of generalized convexity that is both necessary and sufficient to ensure every KKT point is a global optimum for programming problems with conic constraints. This new definition is a generalization of KKT-invexity concept given by Martin and K-invexity function given by Craven. Moreover, it is the weakest to characterize the set of optimal solutions. The notions and results that exist in the literature up to now are particular instances of the ones presented here.     

Sup-norm stability for Glimm's scheme

We consider the Cauchy problem for a general N × N system of conservation laws. Existence of solutions was proved by Glimm using his celebrated random choice scheme. In this paper, we obtain a third-order interaction estimate analagous to that obtained by Glimm for 2×2 systems. By using this estimate, and identifying a global cancellation effect, we obtain L^∞-stability for solutions generated by Glimm's scheme. As an immediate consequence we have L¹-stability and L^∞-decay, obtained by Temple for 2×2 systems. © 1993 John Wiley & Sons, Inc.     

The Heat Equation with Initial Data Corrupted by Measurement Error and Missing Data

In this work the Cauchy problem for the one-dimensional heat equation is considered. In contrast to existing literature it is assumed that the initial state f is unknown and that information regarding f is obtained by some process of measurement. To enhance realism, both measurement errors and missing data are allowed for. Under assumptions on f in the Fourier-domain first an approximation to f is derived from the data by means of a novel uncertainty principle. Then, it is studied how this perturbation in the initial state propagates with time.      

Student's t Vector Random Fields with Power-Law and Log-Law Decaying Direct and Cross Covariances

This article deals with the Student's t vector random field, which is formulated as a scale mixture of Gaussian vector random fields, and whose finite-dimensional distributions decay in power-law and have heavy tails. There are two classes of Student's t vector random fields, one with second-order moments, and the other without a second-order moment. A Cauchy vector random field is an example of Student's t vector random fields without a first-order moment, and is also an example of Stable vector random fields. A second-order Student's t vector random field allows for any given correlation structure, just as a Gaussian vector random field does. We propose four types of covariance matrix structures for second-order Student's t vector random fields, which decay in power-law or log-law.     

Dio e l'uomo nella matematica di Kronecker

The paper aims to give an insight into the meaning of Kronecker's program of Arithmetisierung of the whole mathematics through a reappraisal of the realization of a small part of it in the reinterpretation of numerical notions such as that of integer, rational, and algebraic number in terms of the fundamental notion of natural number. It tries to convey the flavor of Kronecker's strong and deliberate opposition to both the abstract and the set-theoretic trend which were blossoming during the last three decades of the 19th century, showing at the same time how an attentive reading of Kronecker's papers on the foundations of mathematics can shed some light on how one of his most celebrated aphorisms should properly be understood.     

Coalitions and payoffs in three‐person sequential games: Initial tests of two formal models

In this paper we develop two formal models predicting coalitions and payoffs among rank striving players in a sequential three‐person game. We test the models’ predictions with data from a laboratory study of eleven male triads. Each triad plays a sequence of games; in each game a two‐person coalition forms and divides the coalition's point value between the two coalition partners. Participants know that the sequence of games will end without warning at a randomly chosen time; at the sequence's end each player's monetary payoff is a linear function of the rank of his accumulated point score, relative to those of the other members of his triad. The complexity of this situation prevents players and analysts from representing it as a single game; thus they are unable to use n‐person game theory to identify optimal strategies. Consequently, we assume that players, unable to develop strategies that are demonstrably optimal in the long run, adopt certain bargaining heuristics and surrogate short run objectives.

The two models follow the same basic outline; they differ, however, in the planning horizon they assume players to use. Proceeding from a priori assumptions concerning each player's decision calculus and the bargaining process, the two models state the probability that each coalition forms and predict the point divisions in the winning coalition. The laboratory data provide consistently strong support for the predictions of both models.     

Summability of Formal Power-Series Solutions of Partial Differential Equations with Constant Coefficients

We study Gevrey properties and summability of power series in two variables that are formal solutions of a Cauchy problem for general linear partial differential equations with constant coefficients. In doing so, we extend earlier results in two articles of Balser and Lutz, Miyake, and Schäfke for the complex heat equation, as well as in a paper of Balser and Miyake, who have investigated the same questions for a certain class of linear PDE with constant coefficients subject to some restrictive assumptions. Moreover, we also present an example of a PDE where the formal solution of the Cauchy problem is not k-summable for whatever value of k, but instead is multisummable with two levels under corresponding conditions upon the Cauchy data. That this can occur has not been observed up to now.     

A new regularization method for a Cauchy problem of the time fractional diffusion equation

In this paper, we consider a Cauchy problem of the time fractional diffusion equation (TFDE). Such problem is obtained from the classical diffusion equation by replacing the first-order time derivative by the Caputo fractional derivative of order α (0 < α ≤ 1). We show that the Cauchy problem of TFDE is severely ill-posed and further apply a new regularization method to solve it based on the solution given by the Fourier method. Convergence estimates in the interior and on the boundary of solution domain are obtained respectively under different a-priori bound assumptions for the exact solution and suitable choices of regularization parameters. Finally, numerical examples are given to show that the proposed numerical method is effective.     

Cyclic Tableaux and Symmetric Functions

We introduce the notion of cyclic tableaux and develop involutions for Waring's formulas expressing the power sum symmetric function p_n in terms of the elementary symmetric function e_n and the homogeneous symmetric function h_n. The coefficients appearing in Waring's formulas are shown to be a cyclic analog of the multinomial coefficients, a fact that seems to have been neglected before. Our involutions also spell out the duality between these two forms of Waring's formulas, which turns out to be exactly the “duality between sets and multisets.” We also present an involution for permutations in cycle notation, leading to probably the simplest combinatorial interpretation of the Möbius function of the partition lattice and a purely combinatorial treatment of the fundamental theorem on symmetric functions. This paper is motivated by Chebyshev polynomials in connection with Waring's formula in two variables.     

Extension phenomena in multidimensional complex analysis: correction of the historical record

Conclusion  Even though Bochner should not be credited with the proof of any version of theCR extension theorem, his 1943 paper remains a landmark in the history of the Hartogs extension phenomenon. His vision to enlarge his horizon from holomorphic functions to certain harmonic functions set the stage for further generalizations by himself (for example [Bochner 1954]) as well as for Ehrenpreis’s investigations on related problems for solutions of more general elliptic partial-differential operators. In closing, it should be pointed out that Bochner’s 1943 paper, in an ironic twist, includes an important result for which Bochner did not receive any credit until recently [Range 1986, p. 188]. Bochner proved the solution of ∂ on polydiscs (for (0, l)-forms in the real-analytic case, which was the case of interest to him), via the Cauchy transform with parameters in dimension one, and by induction on the number of differentialsdzj appearing in the given form (Theorem 11,op. cit., p. 665). This result, with essentially the same proof, 10 years later became widely known as the Dolbeault-Grothendieck Lemma. But this is another story….     

Efficient identity-based encryption with Hierarchical key-insulation from HIBE

Hierarchical key-insulated identity-based encryption (HKIBE) is identity-based encryption (IBE) that allows users to update their secret keys to achieve (hierarchical) key-exposure resilience, which is an important notion in practice. However, existing HKIBE constructions have limitations in efficiency: sizes of ciphertexts and secret keys depend on the hierarchical depth. In this paper, we first triumph over the barrier by proposing simple but effective design methodologies to construct efficient HKIBE schemes. First, we show a generic construction from any hierarchical IBE (HIBE) scheme that satisfies a special requirement, called MSK evaluatability introduced by Emura et al. (Des. Codes Cryptography 89(7):1535–1574, 2021). It provides several new and efficient instantiations since most pairing-based HIBE schemes satisfy the requirement. It is worth noting that it preserves all parameters’ sizes of the underlying HIBE scheme, and hence we obtain several efficient HKIBE schemes under the k-linear assumption in the standard model. Since MSK evaluatability is dedicated to pairing-based HIBE schemes, the first construction restricts pairing-based instantiations. To realize efficient instantiation from various assumptions, we next propose a generic construction of an HKIBE scheme from any plain HIBE scheme. It is based on Hanaoka et al.’s HKIBE scheme (Asiacrypt 2005), and does not need any special properties. Therefore, we obtain new efficient instantiations from various assumptions other than pairing-oriented ones. Though the sizes of secret keys and ciphertexts are larger than those of the first construction, it is more efficient than Hanaoka et al.’s scheme in the sense of the sizes of master public/secret keys.

     

On the theory of motion of nonholonomic systems. The reducing-multiplier theorem

This classical paper by S.A. Chaplygin presents a part of his research in non-holonomic mechanics. In this paper, Chaplygin suggests a general method for integration of the equations of motion for non-holonomic systems, which he himself called the “reducing-multiplier method”. The method is illustrated on two concrete problems from non-holonomic mechanics. This paper produced a considerable effect on the further development of the Russian non-holonomic community. With the help of Chaplygin’s reducing-multiplier theory the equations for quite a number of non-holonomic systems were solved (such systems are known as Chaplygin systems). First published about a hundred years ago, this work has not lost its scientific significance and is hoped to be estimated at its true worth by the English-speaking world. This publication contributes to the series of RCD translations of Chaplygin’s scientific heritage. In 2002 we published two of his works (both cited in this one) in the special issue dedicated to non-holonomic mechanics (RCD, Vol. 7, no. 2). These translations along with translations of his other two papers on hydrodynamics (RCD, Vol. 12, nos. 1,2) aroused considerable interest and are broadly cited by modern researches. Originally published in: Matematicheskiĭ sbornik (Mathematical Collection), 1911, vol. 28, issue 1. The content of §§ 2 and 3 of this study was presented at the session of the Moscow Mathematical Society on December 11, 1906.     

Extended balance of linear momentum from higher gradient stress field theory

We present the equation of linear momentum considering higher gradients for stress and body force. Both are approximated via Taylor series expansion within a finite Cauchy cube of dimensions L_c. Whereas linear terms of the series expansion result to the classical balance of linear momentum, terms up to third order yield an extended balance equation. The extension includes an internal length scale L²_c caused by surface integrals on the cube. The approach makes use of Cauchy's theorem and standard Newtonian mechanics but constitutive assumptions are not applied. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Trilinear Lp estimates with applications to the Cauchy problem for the Hartree-type equation

In this paper, $L^p$ estimates for a trilinear operator associated with the Hartree type nonlinearity are proved. Moreover, as application of these estimates, it is proved that after a linear transformation, the Cauchy problem for the Hartree-type equation becomes locally well posed in the Bessel potential and homogeneous Besov spaces under certain regularity assumptions on the initial data. This notion of well-posedness and the functional framework to solve the equation were firstly proposed by Y. Zhou.     

Extremal length and rayleigh's reciprocal theorem

In a well-known paper R.J. Duffin [J. Math. Anal. Appl., 5 (1962) 200-215] extends the notion of extremal length to electrical networks, by allowing variable specific resistivity along the arcs of the network, and shows extremal length and extremal width are reciprocals for planar networks yielding Rayleigh's Theorem that conjugate* conductors have reciprocal resistances, Similar results are obtained by F. W. Gehring [Mich. Math. J., 9 (1962), 137-150] for continuous conductors with constant specific resistivity in 3-space, This paper unifies the continuous and discrete cases by obtaining the Reciprocity Theorem for p-capacities in n-space provided the specific resistivity satisfies certain realistic smoothness conditions, It follows that Rayleigh's Theorem holds for nonptanar networks confirming a conjecture of Duffin