<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JAMP</journal-id><journal-title-group><journal-title>Journal of Applied Mathematics and Physics</journal-title></journal-title-group><issn pub-type="epub">2327-4352</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jamp.2019.711202</article-id><article-id pub-id-type="publisher-id">JAMP-96769</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Research on Transformation Characteristics of Binomial Coefficient Formula and Its Extended Model
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Minghan</surname><given-names>Zhu</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jeffrey</surname><given-names>Zheng</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Software, Yunnan University, Kunming, China</addr-line></aff><aff id="aff2"><addr-line>Yunnan Laboratory of Quantum Information, Kunming, China</addr-line></aff><pub-date pub-type="epub"><day>04</day><month>11</month><year>2019</year></pub-date><volume>07</volume><issue>11</issue><fpage>2927</fpage><lpage>2932</lpage><history><date date-type="received"><day>20,</day>	<month>July</month>	<year>2019</year></date><date date-type="rev-recd"><day>26,</day>	<month>November</month>	<year>2019</year>	</date><date date-type="accepted"><day>29,</day>	<month>November</month>	<year>2019</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  
    Combinatorial methods are used to give specific mathematics, and the proof of combinatorial identities is the hot spot research of combinatorial mathematics. Binomial coefficients play an important role in the fields of physics, mathematics and computer science. In variances of rotation and reflection is the core characteristic for combinatorial systems. This paper uses different parameters to form reflection, rotation and specific features by using variant construction model and method, meanwhile the quantitative distribution characteristics of binomial coefficient formula are analyzed by three-dimensional maps. Using variant construction, the combinatorial clustering properties are investigated to apply binomial formulas and sample distributions, and various combinatorial patterns are illustrated. It is proved that the basic binomial coefficient formula and its extended model have obvious properties of reflection and rotation invariance. 
  
 
</p></abstract><kwd-group><kwd>Binomial Coefficient</kwd><kwd> Spatial Extension</kwd><kwd> Variant Construction</kwd><kwd> Reflection</kwd><kwd> Ro-tation</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>There are one-to-one relationships between binomial coefficients and PASCAL triangles. Mathematicians from ancient to modern are deeply interested with them from the angle of in variances [<xref ref-type="bibr" rid="scirp.96769-ref1">1</xref>]. Using visual technology of computer graphics and image processing, data streams are transformed into graphics or images as maps that could be displayed on the screen, and then various theory, method and technology are developed for interactive processing [<xref ref-type="bibr" rid="scirp.96769-ref2">2</xref>].</p><p>The resulting distribution with the family of that binomial formula and its extended model contain obvious invariant properties of reflection and rotation in the paper. It is expected that this kind of invariant formula can be closely associated with the invariant properties in quantum mechanics, classical physics, mathematics, computer science and convolutional neural network, which could be helpful to explore the optimization research of various applied computing methods [<xref ref-type="bibr" rid="scirp.96769-ref3">3</xref>].</p></sec><sec id="s2"><title>2. Theoretical Basis</title><sec id="s2_1"><title>2.1. Binomial Coefficient and Combinatorial Number</title><p>Binomial coefficient [<xref ref-type="bibr" rid="scirp.96769-ref4">4</xref>]: or combinatorial numbers, is defined as, the m-th coefficient of expanded x (Where n is a natural number and m is an integer).</p><p>Combinatorial number [<xref ref-type="bibr" rid="scirp.96769-ref5">5</xref>]: the number of all combinations of m (m ≤ n) elements selected from n different elements. It means the number of combinations of m elements from n different elements on the symbol expressed [<xref ref-type="bibr" rid="scirp.96769-ref6">6</xref>].</p></sec><sec id="s2_2"><title>2.2. Variant Construction</title><p>The variant construction [<xref ref-type="bibr" rid="scirp.96769-ref7">7</xref>] proposed in 2010 is composed of three parts: variant logic, variant measurement and variant map. Variant logic is a new logic system based on 0 - 1 vector model.</p><p>Based on the traditional vector state, the system extends its phase spaces using two kinds of vector operations: permutation and complementarity. The n logical function space is extended from a traditional function space to a functional configuration space by two extended logic operations.</p><p>Variant measurements and variant maps have been applied to different problems, including classical cryptographic sequence analysis, quantum cryptographic sequence detection, chromosome whole gene sequence illustration, electrocardiogram signal detection, bat signal processing and other applications [<xref ref-type="bibr" rid="scirp.96769-ref7">7</xref>].</p><p>This paper focuses attention mainly to extend a basic binomial formula in variant measurement [<xref ref-type="bibr" rid="scirp.96769-ref7">7</xref>].</p></sec><sec id="s2_3"><title>2.3. Reflection and Rotation Invariants</title><p>The reflection transformation [<xref ref-type="bibr" rid="scirp.96769-ref8">8</xref>] is one significant part of conversion in the Euclid plane geometry. The axial reflection on the plane and the mirror reflection are both called the reflection transformation [<xref ref-type="bibr" rid="scirp.96769-ref9">9</xref>].</p><p>Rotation invariant [<xref ref-type="bibr" rid="scirp.96769-ref10">10</xref>]: After the center coordinate is determined, the rotation operator rotates 360 degrees to coincide with the original image in the Euclid plane geometry. Meanwhile, the 90-degree rotations are most common in the discrete geometry applications. The rotation operation in this paper is limited to the 90 degree rotation and does not involve other rotation operations at any angle.</p></sec></sec><sec id="s3"><title>3. Process Flow</title>Derive from Binomial Coefficient Formula<p>Ordered structure of four measures: {a, b, c, d} in the monograph on variant constructions [<xref ref-type="bibr" rid="scirp.96769-ref7">7</xref>] pages 39-50. There are 192 different ways of representing structures under both permutation and combination. Any one of arbitrary structure corresponds to a set of binomial coefficients.</p><p>In this paper, the binomial formula f ( m , p , k ) = ( m − p k ) ( p k ) is selected, and the value range is 0 ≤ p ≤ m; 0 ≤ k ≤ p; k ≤ m − p.</p><p>According to the binomial coefficient formula, multiple steps of transformations on different values contain various features of reflection and rotation invariances. Different binomial coefficient formulas are shown in four regions with distinguished characteristics. On a set of four binomial coefficient formula, their parameters and valued ranges are different. The transforming process for the four Zones {I, II, III, IV} is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>The Zone I can be calculated from the formula. Range of Zone III can be carried out by reflecting binomial coefficients of corresponding positions in <xref ref-type="fig" rid="fig2">Figure 2</xref>. To simulate this type of reflection effects on the Zone III, the formula f3 can be applied.</p><p>Because of reflection and rotation invariance between Zone I, III and Zone II, IV, rotated from Zone I, III to Zone II, IV. The binomial coefficients of the four regions are symmetric with the diagrams on m − p = k and p = k.</p><p>In <xref ref-type="fig" rid="fig2">Figure 2</xref>, the four Zones and their relevant positions are systematically illustrated. Formula for each Zone and corresponding parameters are listed as follows.</p><p>1) f ( m , p , k ) = ( m − p k ) ( p k ) , 0 &lt; p &lt; m; 0 &lt; k &lt; p; k &lt; m − p;</p><p>2) f 3 ( m , p , k ) = ( m − k p ) ( k p ) , 0 ≤ k ≤ m; 0 ≤ p ≤ k; k ≤ m − p;</p><p>3) f 2 ( m , p , k ) = ( k m − p ) ( m − k m − p ) , 0 ≤ p ≤ m; 0 ≤ k ≤ p; k &gt; m − p;</p><p>4) f 4 ( m , p , k ) = ( p m − k ) ( m − p m − k ) , 0 ≤ k ≤ m; 0 ≤ p ≤ k; k &gt; m − p.</p></sec><sec id="s4"><title>4. Further Results</title><p>In three-dimensional representation:</p><p>The distribution of different values is analyzed and discussed visually by using the measurement diagram in the combinatorial coefficients.</p><p>Applying the function f<sub>1</sub> m = 11, a total of 42 points are in the region of 12*12 shown in <xref ref-type="fig" rid="fig3">Figure 3</xref>(a) and <xref ref-type="fig" rid="fig3">Figure 3</xref>(b) and the distribution presents symmetric features. The color increases from blue to red. It can be clearly observed that there are two points at the highest level, the tangent values are equal, and there is no highest point in the top view <xref ref-type="fig" rid="fig3">Figure 3</xref>(a). Therefore, top view <xref ref-type="fig" rid="fig3">Figure 3</xref>(d) shows the distribution of the highest points.</p><p>When m = 11 and m = 10, the three-dimensional visualization results of function f1 are shown in Figures 3(a)-(d).</p><p>For Zone II, m = 11 and m = 10 as examples to compare the coefficient distribution by the rule of odd-even after reflection binomial formula.</p><p>Finally, for Zone II and IV, rotation effects are illustrated by the extended binomial coefficient distributions shown in Figures 4(a)-(d) through f<sub>2</sub> and f<sub>4</sub>, as the rotation of f<sub>1</sub> and f<sub>3</sub> functions on rotation invariant.</p><p>There is no vertex at the top of the triangle on the top view, and the highest value is represented for two numerical points when m is odd. The top view triangle has the highest vertex when m is even.</p></sec><sec id="s5"><title>5. Conclusion</title><p>It is a novel approach to explore rotation and reflection patterns using the four binomial coefficient formulas to show their coefficient distribution characteristics as reflection and rotation transformations. It is important to distinguish reflection and rotation characteristics from the selected coefficient binomial formulas and sample distributions following the condition of parameter transformations on</p><p>odd and even numbers. A series of sample results are illustrated to explore the potential expansion ability of variant constructions to form a set of new binomial formula. It lays a theoretical foundation for the basic and applied research on big data analysis and simulation targets with complex combinatorial measurements in the future.</p></sec><sec id="s6"><title>Acknowledgements</title><p>This project is supported by The Key Project of Quantum Communication Technology of Yunnan (2018ZI002) and Yunnan overseas high-level Scholar project.</p></sec><sec id="s7"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s8"><title>Cite this paper</title><p>Zhu, M.H. and Zheng, J. (2019) Research on Transformation Characteristics of Binomial Coefficient Formula and Its Extended Model. Journal of Applied Mathematics and Physics, 7, 2927-2932. https://doi.org/10.4236/jamp.2019.711202</p></sec></body><back><ref-list><title>References</title><ref id="scirp.96769-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Brualdi, R.A. (2005) Combinatorial Mathematics. 4th Edition, China Machine Press.</mixed-citation></ref><ref id="scirp.96769-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Pang, X.M. (2009) Application of Combinatorial Transformation in Equations, Polynomials and Simple Graphs. Nankai University, Tianjin.</mixed-citation></ref><ref id="scirp.96769-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Morgan, F. (2009) Geometric Measure Theory. World Publishing Corporation.</mixed-citation></ref><ref id="scirp.96769-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Wu, J. (2012) Beauty of Mathematics. Posts and Telecom Press.</mixed-citation></ref><ref id="scirp.96769-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Knuth, D.E. (2011) The Art of Computer Programming (Volume 4: Combinatorial Algorithms, Part 1). National Defence Industry Press.</mixed-citation></ref><ref id="scirp.96769-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Knuth, D.E. (2002) The Art of Computer Programming (Volume 1, 3rd Edition). National Defence Industry Press.</mixed-citation></ref><ref id="scirp.96769-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Zheng, J.Z.J. (2019) Variant Construction from Theoretical Foundations to Applications. Springer, China, 39-50, 237-245.  
https://link.springer.com/book/10.1007/978-981-13-2282-2  
https://doi.org/10.1007/978-981-13-2282-2_3</mixed-citation></ref><ref id="scirp.96769-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Wang, Q.P. (2008) Reflection Transformation in Metrological Logic. Fuzzy Systems and Mathematics, 32.</mixed-citation></ref><ref id="scirp.96769-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Yin, S.H. (2012) Calculation of Moment of Inertia of Rigid Body by Bernoulli Coefficient Table. Science Journal of Normal University, 32.</mixed-citation></ref><ref id="scirp.96769-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Zhao, X.Q. (2000) Vandermonde Convolution Formula Unified Form and Corresponding Hypergeometric Transformation. Journal of Dalian University of Technology, 40.</mixed-citation></ref></ref-list></back></article>