scholarly journals The story of one formula

2020 ◽  
Vol 2020 (1) ◽  
pp. 33-45
Author(s):  
A. S. Kovtun ◽  
O. O. Demianenko
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Power Series ◽  
Mathematical Problem ◽  
The Other ◽  
Basic Knowledge ◽  
Definite Integral ◽  
Stirling’S Formula ◽  
Logarithmic Function ◽  
The Given

This article aims to represent the diversity of approaches applicable to a certain mathematical problem – Stirling’s approximation was chosen here to achieve the mentioned goal. The first section of the work gives a sight of how the formula appeared, from the derivation of an idea to a publication of the strict results. Further, we provide readers with six different proofs of the approximation. Two of them use methods from calculus and mathematical analysis such that properties of logarithmic function and definite integral as well as representing functions as power series. The other two apply the Gamma function due to its connection with the notion of the factorial, namely Γ(n) = n!, n ∈ N. The last two have a probabilistic idea in their core: both of them combine Poisson distributed random variables with Central Limit Theorem to yield the desired formula. Some of the given proofs are not mathematically rigorous but rather give a sketch of a strict proof. Having all the results we assert that this story can be a good example of the variety of methods that can be used to solve one mathematical problem, even though all the listed proofs use only basic knowledge from several mathematical courses. Keywords: Stirling’s formula; factorial; Taylor series

Multidimensional regular C-fraction with independent variables corresponding to formal multiple power series

2019 ◽  
Vol 150 (4) ◽  
pp. 1853-1870 ◽  
Author(s):  
R. I. Dmytryshyn
Keyword(s):  
Power Series ◽  
Continued Fractions ◽  
Numerical Experiments ◽  
The Other ◽  
Independent Variables ◽  
Classical Algorithm ◽  
Multiple Power ◽  
The One ◽  
The Given ◽  
Multiple Power Series

AbstractIn the paper the correspondence between a formal multiple power series and a special type of branched continued fractions, the so-called ‘multidimensional regular C-fractions with independent variables’ is analysed providing with an algorithm based upon the classical algorithm and that enables us to compute from the coefficients of the given formal multiple power series, the coefficients of the corresponding multidimensional regular C-fraction with independent variables. A few numerical experiments show, on the one hand, the efficiency of the proposed algorithm and, on the other, the power and feasibility of the method in order to numerically approximate certain multivariable functions from their formal multiple power series.

Central Limit Theorem for Time to Broadcast in Radio Networks

1995 ◽  
Vol 9 (2) ◽  
pp. 201-209 ◽  
Author(s):  
Krishnamurthi Ravishankar ◽  
Suresh Singh
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Law Of Large Numbers ◽  
Radio Networks ◽  
The Other ◽  
The Central Limit Theorem ◽  
Large Numbers ◽  
Constant Radius ◽  
Radio Transmitters

We study the problem of broadcasting in a system where nodes are equipped with radio transmitters with constant radius of transmission. A message originating at a node has to be transmitted to all the other nodes in the system. We prove the central limit theorem and the law of large numbers for the number of time steps required to complete a broadcast for the case when the nodes are placed on a line independently uniformly distributed. We show that the number of time steps required to broadcast is 3n/4 in probability.

scholarly journals Rooted edges of a minimal directed spanning tree on random points

2006 ◽  
Vol 38 (01) ◽  
pp. 1-30 ◽  
Author(s):  
Z. D. Bai ◽  
Sungchul Lee ◽  
Mathew D. Penrose
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Partial Order ◽  
Central Limit ◽  
Spanning Tree ◽  
Minimal Points ◽  
Directed Spanning Tree ◽  
The Mean ◽  
The Given ◽  
Independent Identically Distributed

For n independent, identically distributed uniform points in [0, 1] d , d ≥ 2, let L n be the total distance from the origin to all the minimal points under the coordinatewise partial order (this is also the total length of the rooted edges of a minimal directed spanning tree on the given random points). For d ≥ 3, we establish the asymptotics of the mean and the variance of L n , and show that L n satisfies a central limit theorem, unlike in the case d = 2.

scholarly journals Rooted edges of a minimal directed spanning tree on random points

2006 ◽  
Vol 38 (1) ◽  
pp. 1-30 ◽  
Author(s):  
Z. D. Bai ◽  
Sungchul Lee ◽  
Mathew D. Penrose
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Partial Order ◽  
Central Limit ◽  
Spanning Tree ◽  
Minimal Points ◽  
Directed Spanning Tree ◽  
The Mean ◽  
The Given ◽  
Independent Identically Distributed

For n independent, identically distributed uniform points in [0, 1]d, d ≥ 2, let Ln be the total distance from the origin to all the minimal points under the coordinatewise partial order (this is also the total length of the rooted edges of a minimal directed spanning tree on the given random points). For d ≥ 3, we establish the asymptotics of the mean and the variance of Ln, and show that Ln satisfies a central limit theorem, unlike in the case d = 2.

The acquisition of Hungarian recursive PPs

2018 ◽  
Vol 4 (1) ◽  
pp. 105-123
Author(s):  
Ágnes Langó-Tóth
Keyword(s):  
Language Acquisition ◽  
Functional Element ◽  
The Other ◽  
Functional Head ◽  
Experiment Subject ◽  
The Given

Abstract In this study an experiment is presented on how Hungarian children interpret two word orders of recursive PPs (subject-PP-verb and PP-subject-verb order). According to the research of Roeper (2011) and Hollebrandse and Roeper (2014), children tend to give conjunctive interpretation to multiple embedded sentences at the beginning of language acquisition. This interpretation later turns into an adult-like, recursive interpretation. Our aim is to discover (i) whether Hungarian children start with conjunction as well, and whether (ii) the apparently more salient functional head lévő appearing in Hungarian recursive PPs can help them to acquire the correct, recursive interpretation early. We also want to find out whether (iii) the word orders in recursive PPs have an influence on the acquisition of children. In this paper two experiments are presented conducted with 6 and 8-year-olds and adults, in which the participants were asked to choose between two pictures. One of the pictures depicted recursive and the other one depicted conjunctive interpretation of the given sentence. In the first experiment subject-PP-verb order was tested, but in the second one sentences were tested with PP-subject-verb order. We will claim that lévő, which is (arguably) a more salient Hungarian functional element than -i, does not help children to acquire the embedded reading of recursive sentences, because both of them are overt functional heads. However, the two types of word orders affect the acquisition of recursive PPs. PP-subject-verb order is easier to compute because the order of the elements in the sentences and the order of the elements in the pictures matches.

Growth Characteristics of Activated Sludges Acclimated to para-Nitrophenol in Batch and Continuous Modes

1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa
Keyword(s):  
Growth Characteristics ◽  
The Other ◽  
Operational Mode ◽  
Continuous Mode ◽  
Relative Resistance ◽  
Batch Mode ◽  
The Given ◽  
Operational Modes ◽  
Very High ◽  
Sensitive Group

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.

Giving and Promising

2018 ◽  
Author(s):  
Jean-Yves Lacoste ◽  
Oliver O’Donovan
Keyword(s):  
The Other ◽  
Face To Face ◽  
Present Experience ◽  
The World ◽  
The Given

Giving and promise must be thought together. Being-in-the world entails being-with the other, who is both “given” and bearer of a gift promised. But any disclosure may be understood as a gift; it is not anthropomorphic to speak of “self-giving” with a wider reference than person-to-person disclosure. Which implies that no act of giving can exhaust itself in its gift. Present experience never brings closure to self-revealing. Yet giving is crystallized into “the given,” the closure of gift. “The given” is what it is, needing no gift-event to reveal it. But the given, too, is precarious, and can be destabilized when giving brings us face to face with something unfamiliar. Nothing appears without a promise of further appearances, and God himself can never be “given.”

Sign in / Sign up

Export Citation Format

Share Document