scholarly journals Entropic Explanation of Power Set

Author(s):  
Yutong Song ◽  
Yong Deng

A power set of a set S is defined as the set of all subsets of S, including set S itself and empty set, denoted as P(S) or 2S. Given a finite set S with |S|=n hypothesis, one property of power set is that the amount of subsets of S is |P(S)| = 2n.  However, the physica meaning of power set needs exploration. To address this issue, a possible explanation of power set is proposed in this paper. A power set of n events can be seen as all possible k-combination, where k ranges from 0 to n. It means the power set extends the event space in probability theory into all possible combination of the single basic event. From the view of power set, all subsets or all combination of basic events, are created equal. These subsets are assigned with the mass function, whose uncertainty can be measured by Deng entropy. The relationship between combinatorial number, Pascal's triangle and power set is revealed by Deng entropy quantitively from the view of information measure. 

2012 ◽  
Vol 96 (536) ◽  
pp. 213-220
Author(s):  
Harlan J. Brothers

Pascal's triangle is well known for its numerous connections to probability theory [1], combinatorics, Euclidean geometry, fractal geometry, and many number sequences including the Fibonacci series [2,3,4]. It also has a deep connection to the base of natural logarithms, e [5]. This link to e can be used as a springboard for generating a family of related triangles that together create a rich combinatoric object.2. From Pascal to LeibnizIn Brothers [5], the author shows that the growth of Pascal's triangle is related to the limit definition of e.Specifically, we define the sequence sn; as follows [6]:


Author(s):  
Engi̇n Özkan ◽  
Bahar Kuloğlu

We give a new definition of Narayana polynomials and show that there is a relationship between the coefficient of the new Narayana polynomials and Pascal’s triangle. We define the Gauss Narayana numbers and their polynomials. Then we show that there is a relationship between the Gauss Narayana polynomials and the new Narayana polynomials. Also, we show that there is a relationship between the derivatives of the new Narayana polynomials and Pascal’s triangle. We also explain the relationship between the new Narayana polynomials and the known Pell numbers. Finally, we give the Hankel transform of the new Narayana polynomials.


1992 ◽  
Vol 85 (7) ◽  
pp. 532-535
Author(s):  
Bonnie H. Litwiller ◽  
David R. Duncan

One major theme of the National Council of Teachers of Mathematic's Curriculum and Evaluation Standards far School Mathematics (1989) is the connection between mathematical ideas and their applications to real-world situations. We shall use concepts from discrete mathematics in describing the relationship between sports series and Pascal's triangle.


Author(s):  
Margaret Morrison

After reviewing some of the recent literature on non-causal and mathematical explanation, this chapter develops an argument as to why renormalization group (RG) methods should be seen as providing non-causal, yet physical, information about certain kinds of systems/phenomena. The argument centres on the structural character of RG explanations and the relationship between RG and probability theory. These features are crucial for the claim that the non-causal status of RG explanations involves something different from simply ignoring or “averaging over” microphysical details—the kind of explanations common to statistical mechanics. The chapter concludes with a discussion of the role of RG in treating dynamical systems and how that role exemplifies the structural aspects of RG explanations which in turn exemplifies the non-causal features.


1963 ◽  
Vol 47 (359) ◽  
pp. 57
Author(s):  
Robert Croasdale

2016 ◽  
Vol 3 (1) ◽  
pp. 1264176 ◽  
Author(s):  
Kantaphon Kuhapatanakul ◽  
Lishan Liu

2017 ◽  
Vol 9 (2) ◽  
pp. 100
Author(s):  
Luis Dias Ferreira

The product of the first $n$ terms of an arithmetic progression may be developed in a polynomial of $n$ terms. Each one of them presents a coefficient $C_{nk}$ that is independent from the initial term and the common difference of the progression. The most interesting point is that one may construct an "Arithmetic Triangle'', displaying these coefficients, in a similar way one does with Pascal's Triangle. Moreover, some remarkable properties, mainly concerning factorials, characterize the Triangle. Other related `triangles' -- eventually treated as matrices -- also display curious facts, in their linear \emph{modus operandi}, such as successive "descendances''.


Sign in / Sign up

Export Citation Format

Share Document