Probabilistic proofs of some q-identities

Author(s):  
Mingjin Wang

In this paper, we use probabilistic method to prove the three well-known q-identities: the identity of Andrews, Mehler's formula, the Jackson q-analogue of the Euler transform.

2020 ◽  
Vol 2020 (9) ◽  
pp. 29-33
Author(s):  
Sergey Bulatov

The paper purpose is the effectiveness estimation in the technological equipment use, taking into account its reliability and productivity for defective transmission units of buses. The problem consists in the determination of time to be spent on repair of bus transmission units taking into account technological equipment reliability. In the paper there is used a probabilistic method for the prediction bus transmission units, and also a method of the dynamics of averages which allow ensuring minimum of costs for units downtime during repair and equipment cost. The need for repair of transmission units (gear box) arises on an average after 650 hours, the average productivity of the bench makes 4.2 bus / hour. The bench fails on the average after 4600 hours of work, the average time of the bench makes 2 hours. In such a way the solution of the problem specified allows analyzing the necessity of time decrease for transmission unit repair to avoid long downtimes of buses in repair areas without negative impact upon high repair quality and safety during the further operation.


Author(s):  
Bodan Arsovski

Abstract Extending a result by Alon, Linial, and Meshulam to abelian groups, we prove that if G is a finite abelian group of exponent m and S is a sequence of elements of G such that any subsequence of S consisting of at least $$|S| - m\ln |G|$$ elements generates G, then S is an additive basis of G . We also prove that the additive span of any l generating sets of G contains a coset of a subgroup of size at least $$|G{|^{1 - c{ \in ^l}}}$$ for certain c=c(m) and $$ \in = \in (m) < 1$$ ; we use the probabilistic method to give sharper values of c(m) and $$ \in (m)$$ in the case when G is a vector space; and we give new proofs of related known results.


2021 ◽  
Vol 1745 (1) ◽  
pp. 012086
Author(s):  
V V Salmin ◽  
I S Tkachenko ◽  
S S Volgin ◽  
M A Ivanushkin

2021 ◽  
Vol 9 (6) ◽  
pp. 667
Author(s):  
Dracos Vassalos ◽  
M. P. Mujeeb-Ahmed

The paper provides a full description and explanation of the probabilistic method for ship damage stability assessment from its conception to date with focus on the probability of survival (s-factor), explaining pertinent assumptions and limitations and describing its evolution for specific application to passenger ships, using contemporary numerical and experimental tools and data. It also provides comparisons in results between statistical and direct approaches and makes recommendations on how these can be reconciled with better understanding of the implicit assumptions in the approach for use in ship design and operation. Evolution over the latter years to support pertinent regulatory developments relating to flooding risk (safety level) assessment as well as research in this direction with a focus on passenger ships, have created a new focus that combines all flooding hazards (collision, bottom and side groundings) to assess potential loss of life as a means of guiding further research and developments on damage stability for this ship type. The paper concludes by providing recommendations on the way forward for ship damage stability and flooding risk assessment.


Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 174
Author(s):  
Wenxiao Zhao

The stochastic approximation algorithm (SAA), starting from the pioneer work by Robbins and Monro in 1950s, has been successfully applied in systems and control, statistics, machine learning, and so forth. In this paper, we will review the development of SAA in China, to be specific, the stochastic approximation algorithm with expanding truncations (SAAWET) developed by Han-Fu Chen and his colleagues during the past 35 years. We first review the historical development for the centralized algorithm including the probabilistic method (PM) and the ordinary differential equation (ODE) method for SAA and the trajectory-subsequence method for SAAWET. Then, we will give an application example of SAAWET to the recursive principal component analysis. We will also introduce the recent progress on SAAWET in a networked and distributed setting, named the distributed SAAWET (DSAAWET).


1994 ◽  
Vol 21 (6) ◽  
pp. 1074-1080 ◽  
Author(s):  
J. Llamas ◽  
C. Diaz Delgado ◽  
M.-L. Lavertu

In this paper, an improved probabilistic method for flood analysis using the probable maximum flood, the beta function, and orthogonal Jacobi’s polynomials is proposed. The shape of the beta function depends on the sample's characteristics and the bounds of the phenomenon. On the other hand, a serial of Jacobi’s polynomials has been used improving the beta function and increasing its convergence degree toward the real flood probability density function. This mathematical model has been tested using a sample of 1000 generated beta random data. Finally, some practical applications with real data series, from important Quebec's rivers, have been performed; the model solutions for these rivers showed the accuracy of this new method in flood frequency estimation. Key words: probable maximum flood, beta function, orthogonal polynomials, distribution function, flood frequency estimation, data generation, convergency.


Sign in / Sign up

Export Citation Format

Share Document