Gemins 2–8 and Unr‐interacting protein (UNRIP) are intimate partners of the survival motor neuron (SMN) protein, which is the determining factor for the neuromuscular disorder spinal muscular atrophy (SMA). The most documented role of SMN, Gemins and UNRIP occurs within the large macromolecular SMN complex and involves the cytoplasmic assembly of spliceosomal uridine‐rich small nuclear ribonucleoproteins (UsnRNPs), a housekeeping process critical in all cells. Several reports detailing alternative functions for SMN in either motor neurons or skeletal muscles may, however, hold (...) the answer to the extreme neuromuscular tissue specificity observed in SMA. Recent discoveries indicate that collaboration between SMN and Gemins also extends to these non‐canonical functions, hence raising the possibility that mutations in Gemin genes may be the cause of unlinked neuromuscular hereditary syndromes. This review evaluates the functions of Gemins and UNRIP inside the SMN complex and discusses whether these less notorious SMN complex members are capable of acting independently of SMN. (shrink)

In his note [5] Hausner states a simple combinatorial principle, namely: $$(H)\left\{ {\begin{array}{*{20}c} {if f is a function a non - empty finite set \sigma into itself, p a} \\ {prime, f^p = i_\sigma and \sigma _0 the set of fixed points of f, then } \\ {\left| \sigma \right| \equiv \left| {\sigma _0 } \right|(mod p).} \\\end{array}} \right.$$ .He then shows how this principle can be used to prove:Fermat's little theorem,Cauchy's theorem for finite groups,Lucas' theorem for binomial numbers.Letε=(0,1, ...),ℱ (...) 1−1 the family of all one-to-one functions from a subset ofε intoε andℳ 1−1 the family of all p.r. (i.e., partial recursive) one-to-one functions from a subset ofε intoε. A subsetα of ε is finite, ifα is not equivalent to a proper subset under a function inℱ 1−1. The setα is calledisolated, if it is not equivalent to a proper subset under a function inℳ 1−1. An isolated set can also be defined as a subset ofε which has no infinite r.e. (i.e., recursively enumerable) subset. While every finite set is isolated, there are $c = 2^{\aleph _0 }$ infinite sets which are isolated; these sets are calledimmune. It is the purpose of this paper to generalize (H) to a principle (H*) for isolated sets and to show how (H*) can be used to prove generalizations of Fermat's little theorem and Cauchy's theorem for finite groups. We have been unable to generalize Lucas' theorem in a similar manner. (shrink)

Gleason-type theorems derive the density operator and the Born rule formalism of quantum theory from the measurement postulate, by considering additive functions which assign probabilities to measurement outcomes. Additivity is also the defining property of solutions to Cauchy’s functional equation. This observation suggests an alternative proof of the strongest known Gleason-type theorem, based on techniques used to solve functional equations.

The authors would like to make the corrections to the original article described below.

The foundations of analysis offered by Cauchy and Riemann were not immediately welcomed by the mathematical community. Before 1870 the foundations of mathematics were considered more or less a national affair. In this paper, Dutch ideas of rigour in analysis between 1840 and 1870 will be discussed. These ideas show that Dutch mathematicians were aware of developments abroad but preferred the concept of infinitesimals as a foundation of mathematics.

One of the most influential scientific treatises in Cauchy's era was J.-L. Lagrange's Mécanique Analytique, the second edition of which came out in 1811, when Cauchy was barely out of his teens. Lagrange opens his treatise with an unequivocal endorsement of infinitesimals. Referring to the system of infinitesimal calculus, Lagrange writes:Lorsqu'on a bien conçu l'esprit de ce système, et qu'on s'est convaincu de l'exactitude de ses résultats par la méthode géométrique des premières et dernières raisons, ou par la méthode analytique (...) des fonctions dérivées, on peut employer les infiniment petits comme un instrument sûr et commode pour abréger et simplifier les demonstrations.Lagrange's renewed enthusiasm for .. (shrink)

J. S. Silverberg, The Most Obscure and Inconvenient Tables ever Constructed.- D. J. Melville, Commercializing Arithmetic: The Case of Edward Hatton.- C. Baltus, Leading to Poncelet: A Story of Collinear Points.- R. Godard, Cauchy, Le Verrier et Jacobi sur le problème algébrique des valeurs propres et les inégalités séculaires des mouvements des planètes.- A. Ackerberg-Hastings, Mathematics in Astronomy at Harvard College Before 1839 as a Case Study for Teaching Historical Writing in Mathematics Courses.- J. J. Tattersall, S. L. McMurran, "Lectures (...) for Women" and the Founding of Newnham College, Cambridge.- D. Waszek, Are Euclid's Diagrams "Representations"? On an Argument by Ken Manders.- B. Buldt, Abstraction by Embedding and Constraint-Based Design.- W. Meyer, The Birth of Undergraduate Modern Algebra in the United States.- P. Liu, History as a Source of Mathematical Narrative in Developing Students' Interpretations of Mathematics.- F. Kamareddine, J. P. Seldin, Thoughts on Using the History of Mathematics to Teach the Foundations of Mathematical Analysis. (shrink)

A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by Lifschitz (Proc Am Math Soc 73:101–106, 1979). A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten (J Symb Log 55:805–821, 1990). In that paper he also extended Lifschitz’ realizability to second order arithmetic. The objective here is to extend it to full intuitionistic Zermelo–Fraenkel set theory, IZF. The machinery (...) would also work for extensions of IZF with large set axioms. In addition to separating Church’s thesis with uniqueness condition from its general form in intuitionistic set theory, we also obtain several interesting corollaries. The interpretation repudiates a weak form of countable choice, ACω,ω, asserting that a countable family of inhabited sets of natural numbers has a choice function. ACω,ω is validated by ordinary Kleene realizability and is of course provable in ZF. On the other hand, a pivotal consequence of ACω,ω, namely that the sets of Cauchy reals and Dedekind reals are isomorphic, remains valid in this interpretation. Another interesting aspect of this realizability is that it validates the lesser limited principle of omniscience. (shrink)