Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “math.HO”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16Linked to original sources

"Strange" occurrences in SuperEnalotto

In this paper a way is suggested for calculating the probability of consecutive number strings within a sequence of n numbers randomly drawn (without replacement) among the set of the first N consecutive numbers, with N>>n. An explicit derivation is carried out for the special case of SuperEnalotto, nowadays the most famous lottery in Italy, with N=90 and n=6. It turns out that, on average, one every three drawings presents one or more consecutive number strings inside.

math.HO↗

The topology of Helmholtz domains

The goal of this paper is to describe and clarify as much as possible the 3-dimensional topology underlying the Helmholtz cuts method, which occurs in a wide theoretic and applied literature about Electromagnetism, Fluid dynamics and Elasticity on domains of the ordinary space. We consider two classes of bounded domains that satisfy mild boundary conditions and that become "simple" after a finite number of disjoint cuts along properly embedded surfaces. For the first class (Helmholtz), "simple" means that every curl-free smooth vector field admits a potential. For the second (weakly-Helmholtz), we only require that a potential exists for the restriction of every curl-free smooth vector field defined on the whole initial domain. By means of classical and rather elementary facts of 3-dimensional geometric and algebraic topology, we give an exhaustive description of Helmholtz domains, realizing that their topology is forced to be quite elementary (in particular, Helmholtz domains with connected boundary are just possibly knotted handlebodies, and the complement of any non-trivial link is not Helmholtz). The discussion about weakly-Helmholtz domains is a bit more advanced, and their classification appears to be a quite difficult issue. Nevertheless, we provide several interesting characterizations of them and, in particular, we point out that the class of links with weakly-Helmholtz complements eventually coincides with the class of the so-called homology boundary links, that have been widely studied in Knot Theory.

math.GT↗

The Search for Certainty: a critical assessment

The Search for Certainty was published in 2009 by Krzysztof Burdzy. It examines the "philosophical duopoly" of von Mises and de Finetti at the foundation of probability and statistics and find this duopoly missing. This review exposes the weakness of the arguments presented in the book, it questions the relevance of introducing a new set of probability axioms from a methodological perspective, and it concludes at the lack of impact of this book on statistical foundations and practice.

math.ST↗

The discrete and the continuous: which comes first?

In solving diffusion problems, it is common to consider the finite difference equation to be an approximation to the differential equation. Nevertheless, history shows that the finite difference equation is primitive and that the differential equation is its idealized representation designed to obtain solutions in algebraic form. The difference equation is logically consistent within itself, independent of the differential equation. The difference equation and the differential equation together constitute two powerful complementary tools, one providing numerical solutions to problems of arbitrary complexity on a case by case basis, and the other providing insights into classes of problems under idealized conditions.

math.HO↗

Aryabhata's Mathematics

This paper presents certains aspects of the mathematics of Aryabhata that are of interest to the cryptography community.

cs.CR↗

The Three Doors Problem...-s

I argue that we must distinguish between: (0) the Three-Doors-Problem Problem [sic], which is to make sense of some real world question of a real person. (1) a large number of solutions to this meta-problem, i.e., many specific Three-Doors-Problem problems, which are competing mathematizations of the meta-problem (0). Each of the solutions at level (1) can well have a number of different solutions: nice ones and ugly ones; correct ones and incorrect ones. I discuss three level (1) solutions, i.e., three different Monty Hall problems; and try to give three short correct and attractive solutions. These are: an unconditional probability question; a conditional probability question; and a game-theory question. The meta-message of the article is that applied statisticians should beware of solution-driven science.

stat.AP↗

Peano on derivative of measures, strict derivative of distributive set functions

By retracing research on coexistent magnitudes (grandeurs coexistantes) by Cauchy (1841), Peano in "Applicazioni geometriche del calcolo infinitesimale" (1887) defines the "density" (strict derivative) of a "mass" (a distributive set function) with respect to a "volume" (a positive distributive set function), proves its continuity (whenever the strict derivative exists) and shows the validity of the mass-density paradigm: "mass" is recovered from "density" by integration with respect to "volume". It is remarkable that Peano's strict derivative provides a consistent mathematical ground to the concept of "infinitesimal ratio" between two magnitudes, successfully used since Kepler. In this way the classical (i.e., pre-Lebesgue) measure theory reaches a complete and definitive form in Peano's Applicazioni geometriche. A primary aim of the present paper is a detailed exposition of Peano's work of 1887 leading to the concept of strict derivative of distributive set functions and their use. Moreover, we compare Peano's work and Lebesgue's "La mesure des grandeurs" (1935): in this memoir Lebesgue, motivated by coexistent magnitudes of Cauchy, introduces a uniform-derivative of certain additive set functions, a concept that coincides with Peano's strict derivative. Intriguing questions are whether Lebesgue was aware of the contributions of Peano and which role is played by the notions of strict derivative or of uniform-derivative in today mathematical practice.

math.HO↗

Reworking on affine exterior algebra of Grassmann, Peano and his school

In this paper a construction of affine exterior algebra of Grassmann, with a special attention to the revisitation of this subject operated by Peano and his School, is examined from a historical viewpoint. Even if the exterior algebra over a vector space is a well known concept, the construction of an exterior algebra over an affine space, in which points and vectors coexist, has been neglected. This paper wants to fill this lack. Some attention is given to the introduction of defining by abstraction (today called definition by quotienting or by equivalence relation), a procedure due to and used by Peano to define geometric forms, basic elements of an affine exterior algebra. This Peano's innovative way of defining, is a relevant contribution to mathematics. It is observed that in the construction of an affine exterior algebra on the Euclidean three-dimensional space, Grassmann and Peano make use of metric concepts: an accurate analysis shows that, in some cases, the metric aspects can be eliminated, putting into evidence the sufficiency of the underlying affine structure of the Euclidean space. In the final part of the paper some geometrical and mechanical applications and interpretations of the affine exterior algebra given by Grassmann and Peano are presented.

math.HO↗

Towards historical roots of necessary conditions of optimality. Regula of Peano

At the end of 19th century Peano discerned vector spaces, differentiability, convex sets, limits of families of sets, tangent cones, and many other concepts, in a modern perfect form. He applied these notions to solve numerous problems. The theorem on necessary conditions of optimality (Regula) is one of these. The formal language of logic that he developed, enabled him to perceive mathematics with great precision and depth. Actually he built mathematics axiomatically based exclusively on logical and set-theoretic primitive terms and properties, which was a revolutionary turning point in the development of mathematics.

math.HO↗

Online resources in mathematics: teachers' genesis of use

The long-term objective of our research is to develop the instrumental approach for teachers. A first step, presented in this paper, is to observe stable behaviours of teachers using internet resources in mathematics. We retain the scenarios as indicators of the genesis processes. We propose a scenario taxonomy taken from categories elaborated by computer sciences specialists and complemented to take into account didactical aspects. The descriptions provided by teachers permitted to observe an evolution of their scenarios elaboration's practices.

math.HO↗

Iron Rings, Doctor Honoris Causa Raoul Bott, Carl Herz, and a Hidden Hand

The degree of Doctor of Sciences, honoris causa, was conferred on Raoul Bott by McGill University in 1987. Much of the work to make this happen was done by Carl Herz. Some of the author's personal recollections of both professors are included, along with some context for the awarding of this degree and ample historical tangents. Some cultural aspects occurring in the addresses are elaborated on, primarily, the Canadian engineer's iron ring. This paper also reprints both the convocation address of Raoul Bott and the presentation of Carl Herz on that occasion.

math.HO↗

${{5} \choose {2}}$ Proofs that ${{n} \choose {k}} \leq {{n} \choose {k+1}}$ if $k<n/2$

There is no trivial mathematics, there are only trivial mathematicians! A mathematician is trivial if he or she believes that there exists trivial mathematics. Being a non-trivial mathematician myself, I will describe ten different proofs of the seemingly trivial fact that the number of ways of choosing k people out of n people is less than or equal to the number of ways of choosing k+1 people out of n people, provided that k is less than half of n.

math.CO↗

Tangency vis-a'-vis differentiability by Peano, Severi and Guareschi

Peano defined 'differentiability' of functions and 'lower tangent cones' in 1887, and 'upper tangent cones' in 1903, but uses the latter concept already in 1887 without giving a formal definition. Both cones were defined for arbitrary sets, as certain limits of appropriate homothetic relations. Around 1930 Severi and Guareschi, in a series of mutually fecundating individual papers, characterized differentiability in terms of 'lower tangent cones' and strict differentiability in terms of 'lower paratangent cones', a notion introduced, independently, by Severi and Bouligand in 1928. Severi and Guareschi graduated about 1900 from the University of Turin, where Peano taught till his demise in 1932.

math.HO↗

Zooming in on infinitesimal 1-.9.. in a post-triumvirate era

The view of infinity as a metaphor, a basic premise of modern cognitive theory of embodied knowledge, suggests in particular that there may be alternative ways in which one could formalize mathematical ideas about infinity. We discuss the key ideas about infinitesimals via a proceptual analysis of the meaning of the ellipsis"..." in the real formula .999... = 1. Infinitesimal-enriched number systems accomodate quantities in the half-open interval [0,1) whose extended decimal expansion starts with an unlimited number of repeated digits 9. Do such quantities pose a challenge to the unital evaluation of the symbol ".999..."? We present some non-standard thoughts on the ambiguity of the ellipsis, in the context of the cognitive concept of generic limit of B. Cornu and D. Tall. We analyze the vigorous debates among mathematicians concerning the idea of infinitesimals.

math.HO↗

A Survey on Connes' Embedding Conjecture

In a very celebrated paper A. Connes has formulated a conjecture which is now one of the most important open problem in Operator Algebras. This importance comes from the works of many mathematicians who have found some unexpected equivalent statements showing as this conjecture is transversal to almost all the sub-specialization of Operator Algebras. In this survey I would like to give a more or less detailed description of all these approaches.

math.OA↗

A defense of Columbo (and of the use of Bayesian inference in forensics): A multilevel introduction to probabilistic reasoning

Triggered by a recent interesting New Scientist article on the too frequent incorrect use of probabilistic evidence in courts, I introduce the basic concepts of probabilistic inference with a toy model, and discuss several important issues that need to be understood in order to extend the basic reasoning to real life cases. In particular, I emphasize the often neglected point that degrees of beliefs are updated not by `bare facts' alone, but by all available information pertaining to them, including how they have been acquired. In this light I show that, contrary to what claimed in that article, there was no "probabilistic pitfall" in the Columbo's episode pointed as example of "bad mathematics" yielding "rough justice". Instead, such a criticism could have a `negative reaction' to the article itself and to the use of Bayesian reasoning in courts, as well as in all other places in which probabilities need to be assessed and decisions need to be made. Anyway, besides introductory/recreational aspects, the paper touches important questions, like: role and evaluation of priors; subjective evaluation of Bayes factors; role and limits of intuition; `weights of evidence' and `intensities of beliefs' (following Peirce) and `judgments leaning' (here introduced), including their uncertainties and combinations; role of relative frequencies to assess and express beliefs; pitfalls due to `standard' statistical education; weight of evidences mediated by testimonies. A small introduction to Bayesian networks, based on the same toy model (complicated by the possibility of incorrect testimonies) and implemented using Hugin software, is also provided, to stress the importance of formal, computer aided probabilistic reasoning.

math.HO↗