Passage to the limit in Proposition I, Book I of Newton's Principia

The purpose of this paper is to analyze the way in which Newton uses his polygon model and passes to the limit in Proposition I, Book I of his Principia. It will be evident from his method that the limit of the polygon is indeed the orbital arc of the body and that his approximation of the actual continuous force situation by a series of impulses passes correctly in the limit into the continuous centripetal force situation. The analysis of the polygon model is done in two ways: (1) using the modern concepts of force, linear momentum, linear impulse, and velocity, and (2) using Newton's concepts of motive force and quantity of motion. It should be clearly understood that the term “force” without the adjective “motive,” is used in the modern sense, which is that force is a vector which is the time rate of change of the linear momentum. Newton did not use the word “force” in this modern sense. The symbol F denotes modern force. For Newton “force” was “motive force,” which is measured by the change in the quantity of motion of a body. Newton's “quantity of motion” is proportional to the magnitude of the modern vector momentum. Motive force is a scalar and the symbol F_m is used for motive force.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

CDS simulation and pattern formation of phase separation

Several properties of the generation and evolution of phase separating patterns for binary material studied by CDS model are proposed. The main conclusions are (1) for alloys spinodal decomposition, the conceptions of “macro-pattern” and “micropattern” are posed by “black-and- white graph” and “gray-scale graph” respectively. We find that though the four forms of map f that represent the self-evolution of order parameter in a cell (lattice) are similar to each other in “macro-pattern”, there are evident differences in their micro-pattern, e.g., some different fine netted structures in the black domain and the white domain are found by the micro-pattern, so that distinct mechanical and physical behaviors shall be obtained. (2) If the two constitutions of block copolymers are not symmetric (i.e. r ≠ 0.5), a pattern called “grain-strip cross pattern” is discovered, in the 0.43 <r <0.45.     

Line Insertions in Totally Positive Matrices

It is obvious that between any two rows (columns) of an m-by-n totally nonnegative matrix a new row (column) may be inserted to form an (m+1)-by-n (m-by-(n+1)) totally nonnegative matrix. The analogous question, in which “totally nonnegative” is replaced by “totally positive” arises, for example, in completion problems and in extension of collocation matrices, and its answer is not obvious. Here, the totally positive case is answered affirmatively, and in the process an analysis of totally positive linear systems, that may be of independent interest, is used.     

Gauss map and Lyapunov exponents of interacting particles in a billiard

We show that the Lyapunov exponent (LE) of periodic orbits with Lebesgue measure zero from the Gauss map can be used to determine the main qualitative behavior of the LE of a Hamiltonian system. The Hamiltonian system is a one-dimensional box with two particles interacting via a Yukawa potential and does not possess Kolmogorov–Arnold–Moser (KAM) curves. In our case the Gauss map is applied to the mass ratio (γ = m₂/m₁) between particles. Besides the main qualitative behavior, some unexpected peaks in the γ dependence of the mean LE and the appearance of ‘stickness’ in phase space can also be understand via LE from the Gauss map. This shows a nice example of the relation between the “instability” of the continued fraction representation of a number with the stability of non-periodic curves (no KAM curves) from the physical model. Our results also confirm the intuition that pseudo-integrable systems with more complicated invariant surfaces of the flow (higher genus) should be more unstable under perturbation.     

Māl, enunciations, and the prehistory of Arabic algebra

Medieval Arabic algebra books intended for practical training generally have in common a first “book” which is divided into two sections: one on the methods of solving simplified equations and manipulating expressions, followed by one consisting of worked-out problems. By paying close attention to the wording of the problems in the books of al-Khwārizmī, Abū Kāmil, and Ibn Badr, we reveal the different ways the word māl was used. In the enunciation of a problem it is a common noun meaning “quantity,” while in the solution it is the proper noun naming the square of “thing” (shay '). We then look into the differences between the wording of enunciations and equations, which clarify certain problems solved without “thing,” and help explain the development of algebra before the time of al-Khwārizmī.     

Managing the Complexity of Human/Machine Interactions in Computerized Learning Environments: Guiding Students’ Command Process through Instrumental Orchestrations

After an introduction which addresses some basic questions, this article is organized around three points: (1) The theoretical framework of the so-called “instrumental approach” which has been a theme in the last two CAME symposia; (2) A consideration of two processes (instrumentalization and instrumentation) which interact in the instrumental genesis; and (3) The introduction of the idea of instrumental orchestration as a way of allowing the teacher to assist the student’s instrumental genesis.This article originates from a lecture given at the Third CAME (Computer Algebra in Mathematics Education) Symposium (Reims, June 2003).     

Bicolored graph partitioning, or: gerrymandering at its worst

This study is motivated by an electoral application where we look into the following question: how much biased can the assignment of parliament seats be in a majority system under the effect of vicious gerrymandering when the two competing parties have the same electoral strength? To give a first theoretical answer to this question, we introduce a stylized combinatorial model, where the territory is represented by a rectangular grid graph, the vote outcome by a “balanced” red/blue node bicoloring and a district map by a connected partition of the grid whose components all have the same size. We constructively prove the existence in cycles and grid graphs of a balanced bicoloring and of two antagonist “partisan” district maps such that the discrepancy between their number of “red” (or “blue”) districts for that bicoloring is extremely large, in fact as large as allowed by color balance.     

Implication in fuzzy logic

Intermediate truth values and the order relation “as true as” are interpreted. The material implication A → B quantifies the degree by which “B is at least as true as A.” Axioms for the → operator lead to a representation of → by the pseudo-Lukasiewicz model. A canonical scale for the truth value of a fuzzy proposition is selected such that the → operator is the Lukasiewicz operator and the negation is the classical 1−. operator. The mathematical structure of some conjunction and disjunction operators related to → are derived.     

Subtractive Categories

We introduce a notion of a subtractive category. It generalizes the notion of a pointed subtractive variety of universal algebras in the sense of A. Ursini. Subtractive categories are closely related to Mal’tsev and additive categories: (i) a category C with finite limits is a Mal’tsev category if and only if for every object X in C the category Pt(X)=((X,1_X)↓(C↓X)) of “points over X” is subtractive; (ii) a pointed category C with finite limits is additive if and only if C is subtractive and half-additive.Mathematics Subject Classifications (2000) 18C99, 18E05, 08B05.     

Violation of Symmetry in the System of Three Laterally Coupled Quantum Waveguides,and Resonance Asymptotics

The system of three two-dimensional laterally coupled quantum waveguides with the Dirichlet boundary condition is considered. Violation of geometrical symmetry is studied. The behaviour of the resonance asymptotics and the transition “eigenvalue — resonance” are investigated. Bibliography: 16 titles.__________Published in Zapiski Nauchnykh Seminarov POMI, Vol. 300, 2003, pp. 221–227.     

Reverse mathematics and well-ordering principles: A pilot study

The larger project broached here is to look at the generally sentence “if X is well-ordered then f(X) is well-ordered”, where f is a standard proof-theoretic function from ordinals to ordinals. It has turned out that a statement of this form is often equivalent to the existence of countable coded ω-models for a particular theory T_f whose consistency can be proved by means of a cut elimination theorem in infinitary logic which crucially involves the function f. To illustrate this theme, we prove in this paper that the statement “if X is well-ordered then ε_X is well-ordered” is equivalent to . This was first proved by Marcone and Montalban [Alberto Marcone, Antonio Montalbán, The epsilon function for computability theorists, draft, 2007] using recursion-theoretic and combinatorial methods. The proof given here is principally proof-theoretic, the main techniques being Schütte’s method of proof search (deduction chains) [Kurt Schütte, Proof Theory, Springer-Verlag, Berlin, Heidelberg, 1977] and cut elimination for a (small) fragment of .     

The b-transform

The b-transform is used to convert entire functions into “primary b-functions” by replacing the powers and factorials in the Taylor series of the entire function with corresponding “generalized powers” (which arise from a polynomial function with combinatorial applications) and “generalized factorials.” The b-transform of the exponential function turns out to be a generalization of the Euler partition generating function, and partition generating functions play a key role in obtaining results for the b-transforms of the elementary entire transcendental functions. A variety of normal-looking results arise, including generalizations of Euler's formula and De Moivre's theorem. Applications to discrete probability and applied mathematics (i.e., damped harmonic motion) are indicated. Also, generalized derivatives are obtained by extending the concept of a b-transform.     

The net Bayes premium with dependence between the risk profiles

In Bayesian analysis it is usual to assume that the risk profiles Θ₁ and Θ₂ associated with the random variables “number of claims” and “amount of a single claim”, respectively, are independent. A few studies have addressed a model of this nature assuming some degree of dependence between the two random variables (and most of these studies include copulas). In this paper, we focus on the collective and Bayes net premiums for the aggregate amount of claims under a compound model assuming some degree of dependence between the random variables Θ₁ and Θ₂. The degree of dependence is modelled using the Sarmanov–Lee family of distributions [Sarmanov, O.V., 1966. Generalized normal correlation and two-dimensional Frechet classes. Doklady (Soviet Mathematics) 168, 596–599 and Ting-Lee, M.L., 1996. Properties and applications of the Sarmanov family of bivariate distributions. Communications Statistics: Theory and Methods 25 (6) 1207–1222], which allows us to study the impact of this assumption on the collective and Bayes net premiums. The results obtained show that a low degree of correlation produces Bayes premiums that are highly sensitive.     

On Some Subfactors of Integer Index Arising from Vertex Models

This paper is devoted to the study of subfactors arising out of commuting squares constructed out of the simplest possible vertex models. After setting up the necessary general background, we start with two classes of commuting squares and compute the principal graphs of the resulting subfactors, one of them being related to the group dual of a suitable (closed) subgroup ofU(N), and the other to the Cayley graph of a (non-closed) group, modulo scalars, generated byNelements ofU(N). In the last section, we “classify” the commuting squares in dimension 2, and identify the possible resulting principal graphs asA⁽¹⁾_(2n−1), 1n∞     

Optimal Mal’tsev conditions for congruence modular varieties

For varieties, congruence modularity is equivalent to the tolerance intersection property, TIP in short. Based on TIP, it was proved in [5] that for an arbitrary lattice identity implying modularity (or at least congruence modularity) there exists a Mal’tsev condition such that the identity holds in congruence lattices of algebras of a variety if and only if the variety satisfies the corresponding Mal’tsev condition. However, the Mal’tsev condition constructed in [5] is not the simplest known one in general. Now we improve this result by constructing the best Mal’tsev condition and various related conditions. As an application, we give a particularly easy new proof of the result of Freese and Jónsson [11] stating that modular congruence varieties are Arguesian, and we strengthen this result by replacing “Arguesian” by “higher Arguesian” in the sense of Haiman [18]. We show that lattice terms for congruences of an arbitrary congruence modular variety can be computed in two steps: the first step mimics the use of congruence distributivity, while the second step corresponds to congruence permutability. Particular cases of this result were known; the present approach using TIP is even simpler than the proofs of the previous partial results.Dedicated to the memory of Ivan RivalReceived February 12, 2003; accepted in final form August 5, 2004.This revised version was published online in August 2005 with a corrected cover date.     

Notes on subtlety and ineffability in P κ λ

A type of subtlety for P_κλ called “strongly subtle” is introduced to show almost ineffability is consistencywise stronger than Shelah property. The following are also shown: is strongly subtle” has rather strong consequences. (ii) The ideal is not strongly subtle} is not λ-saturated , and completely ineffable ideal is not precipitous. (iii) In case that λ^<κ=2^λ, almost λ-ineffability coincides with λ-ineffability. (iv) It is not provable that κ is λ^<κ-ineffable whenever κ is λ-ineffable.Research partially supported by “Grant-in-Aid for Scientific research (C), The Ministry of Education, Science, Sports and Culture of Japan 09640299”, and “Japan Society for the Promotion of Science 14540142”.The author is very grateful to the referee for his correcting many errors and helpful suggestions.     

Best Interpolatory Approximation in Normed Linear Spaces

A theory of best approximation with interpolatory contraints from a finite-dimensional subspaceMof a normed linear spaceXis developed. In particular, to eachxX, best approximations are sought from a subsetM(x) ofMwhichdependson the elementxbeing approximated. It is shown that this “parametric approximation” problem can be essentially reduced to the “usual” one involving a certainfixedsubspaceM₀ofM. More detailed results can be obtained when (1) Xis a Hilbert space, or (2) Mis an “interpolating subspace” ofX(in the sense of [1]).     

Twistless Tori Near Low-Order Resonances

In this paper, we investigate the behavior of the twist near low-order resonances of a periodic orbit or an equilibrium of a Hamiltonian system with two degrees of freedom. Namely, we analyze the case where the Hamiltonian has multiple eigenvalues (the Hamiltonian Hopf bifurcation) or a zero eigenvalue near the equilibrium and the case where the system has a periodic orbit whose multipliers are equal to 1 (the saddle-center bifurcation) or −1 (the period-doubling bifurcation). We show that the twist does not vanish at least in a small neighborhood of the period-doubling bifurcation. For the saddle-center bifurcation and the resonances of the equilibrium under consideration, we prove the existence of a “twistless” torus for sufficiently small values of the bifurcation parameter. An explicit dependence of the energy corresponding to the twistless torus on the bifurcation parameter is derived. Bibliography: 6 titles.__________Published in Zapiski Nauchnykh Seminarov POMI, Vol. 300, 2003, pp. 135–144.