Distance-Regular Graphs

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.

/pdf/hybrid-threshold-adaptable-quantum-secret-sharing-scheme-2mkkl3wyo6.pdf

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding

Concrete mathematics, a foundation for computer science, by Ronald L. Graham, Donald E. Knuth and Oren Patashnik. Pp 625. £24·95. 1989. ISBN 0-201-14236-8 (Addison-Wesley)

The work is giving estimations of the discrepancy between solutions of the initial and the homogenized problems for a one{dimensional second order elliptic operators with random coeecients satisfying strong or uniform mixing conditions. We obtain several sharp estimates in terms of the corresponding mixing coeecient. Abstract. In the theory of homogenisation it is of particular interest to determine the classes of problems which are stable on taking the homogenisation limits. A notable situation where the limit enlarges the class of original problems is known as memory (nonlocal) eeects. A number of results in that direction has been obtained for linear problems. Tartar (1990) innitiated the study of the eeective equation corresponding to nonlinear equation: @ t u n + a n u 2 n = f: Signiicant progress has been hampered by the complexity of required computations needed in order to obtain the terms in power{series expansion. We propose a method which overcomes that diiculty by introducing graphs representing the domain of integration of the integrals in each term. The graphs are relatively simple, it is easy to calculate with them and they give us a clear image of the form of each term. The method allows us to discuss the form of the eeective equation and the convergence of power{series expansions. The feasibility of our method for other types of nonlinearities will be discussed as well.

Applied Mathematics and Computation

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m -bonacci sequences to detect eavesdropping. Meanwhile, we encode m -bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.

We present generalizations of Ruehr’s identities with two additional parameters. We prove the claimed results by two different proof methods, namely combinatorially and mechanically. Further, we derive recurrence relations for some special cases by using the Zeilberger algorithm.

Ruehr's identities with two additional parameters

We shall consider two curious divisibility properties due to (1, 5). Our main purpose is to generalize these properties for a general second order linear recursion. We use generating matrix approach for our purposes. By using our results, we derive a new recursive identities for two general second order linear recurrences. We give a more general result extending earlier divisibility properties on the similar subject. 2000 Mathematics Subject Classification: 11B37; 15B36

/pdf/a-matrix-approach-for-generalizing-two-curious-divisibility-1lzu5deem6.pdf

A matrix approach for generalizing two curious divisibility properties

Abstract Recently Marques and Trojovsky [On some new identities for the Fibonomial coefficients, Math. Slovaca 64 (2014), 809–818] presented interesting two sum identities including the Fibonomial coefficients and Fibonacci numbers. These sums are unusual as they include a rare sign function and their upper bounds are odd. In this paper, we give generalizations of these sums including the Gaussian q-binomial coefficients. We also derive analogue q-binomial sums whose upper bounds are even. Finally we give q-binomial sums formulæ whose weighted functions are different from the earlier ones. To prove the claimed results, we analytically use q-calculus.

On Fibonomial sums identities with special sign functions: analytically q-calculus approach

Sums Of Generalized Fibonacci Numbers By Matrix Methods.

The reciprocal super Catalan matrix studied by Prodinger is further generalized, introducing two additional parameters. Explicit formulae are derived for the LU-decomposition and their inverses, as well as the Cholesky decomposition. The approach is to use q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger's celebrated algorithm.

https://journals.tubitak.gov.tr/math/issues/mat-16-40-5/mat-40-5-3-1504-100.pdf

Emrah Kılıç

Papers

Ruehr's identities with two additional parameters

A matrix approach for generalizing two curious divisibility properties

On Fibonomial sums identities with special sign functions: analytically q-calculus approach

Sums Of Generalized Fibonacci Numbers By Matrix Methods.

The generalized reciprocal super Catalan matrix