Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; quantum computation, IC-POVMs, knot theory, three-manifolds, branch coverings, Dehn surgeries.
Online: 26 November 2018 (10:11:29 CET)
|
|
|
Share this article with
×
A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Lie superalgebra; supertrace; commutative superalgebra; 3-Lie superalgebra
Online: 23 November 2018 (10:57:17 CET)
|
|
Share this article with
×
We show that given a Lie superalgebra and an element of its dual space one can construct the 3-Lie superalgebra. We apply this approach to Lie superalgebra of (m,n)-block matrices taking supertrace of a matrix as the element of dual space. Then we also apply this approach to commutative superalgebra and the Lie superalgebra of its derivations to construct 3-Lie superalgebra. The graded Lie brackets are constructed by means of a derivation and involution of commutative superalgebra, and we use them to construct 3-Lie superalgebras.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Complexity; Chebyshev Polynomials; Gear graph; Pyramid graphs.
Online: 9 November 2018 (15:17:44 CET)
|
|
Share this article with
×
In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Smarandache algebra; point algebra; $p$-derived algebra.
Online: 5 November 2018 (12:53:07 CET)
|
|
Share this article with
×
If an algebra of type $A$ contains a subalgebra
which is also an algebra of type $B$, then it is a Smarandache $B$-type $A$-algebra provided the subalgebra of type $B$ contains at least two elements. This generalizes the notion of Smarandache
group, where the group of order $\geq 2$ is a subsemigroup of a semigroup.
In this paper we investigate a number of such pairings
and we deduce a number of conclusions as a consequence.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Changhee polynomials, Changhee polynomials of type two, p-adic interal
on Zp
Online: 1 November 2018 (18:13:42 CET)
|
|
Share this article with
×
In this paper we consider Changhee polynomials of type two, which
are motivated from the recent work of Kim and Kim.
We investigate some symmetry identities for the Changhee polynomials of type
two which are derived from the properties of symmtery for the fermionic p-adic
integral on Zp.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Lucas sequences, public key cryptosystems, Multi-receiver encryption scheme, Chinese Remainder Theorem, Anonymity.
Online: 31 October 2018 (11:03:09 CET)
|
|
Share this article with
×
Multi-receiver encryption enables a sender to encrypt a message and transmit the ciphertext to a set of authorized users, while no one out this group of authorized users can decrypt the message. Multi-receiver encryption is of great importance in many sectors such as broadcast
communication, cloud computing, wireless communications, networking applications, e-voting, lottery, and medical applications. This paper proposes an efficient multi-receiver public key
encryption scheme based on Lucas sequences. The results of the computational analysis show that, projected scheme is better against renown attacks and prevailing anonymous multireceiver algorithms
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-differential graded algebra; (σ,τ)-differential graded algebra; generalized Clifford algebra; pre-cosimplicial complex
Online: 31 October 2018 (10:03:24 CET)
|
|
Share this article with
×
We propose a notion of $(q,\sigma,\tau)$-differential graded algebra, which generalizes the notions of $(\sigma,\tau)$-differential graded algebra and $q$-differential graded algebra. We construct two examples of $(q,\sigma,\tau)$-differential graded algebra, where the first one is constructed by means of generalized Clifford algebra with two generators (reduced quantum plane), where we use a $(\sigma,\tau)$-twisted graded $q$-commutator. In order to construct the second example, we introduce a notion of $(\sigma,\tau)$-pre-cosimplicial algebra.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Faulhaber's formula; Faulhaber's theorem; binomial theorem; binomial coefficient; binomial distribution; binomial identities; power sums; finite differences
Online: 22 October 2018 (11:02:08 CEST)
|
|
Share this article with
×
In this paper, we derive and prove, by means of Binomial theorem and Faulhaber's formula, the following identity between $m$-order polynomials in $T$ $$\sum_{k=1}^{\ell}\sum_{j=0}^m A_{m,j}k^j(T-k)^j=\sum_{k=0}^{m}(-1)^{m-k}U_m(\ell,k)\cdot T^k=T^{2m+1}, \ \ell=T\in\mathbb{N}.$$
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; (left-, right-) pseudo-commutative; commutative; d/BCK-algebra; disjoint; (linear) groupoid
Online: 22 October 2018 (10:04:34 CEST)
|
|
Share this article with
×
In this paper, we investigate the effects of certain variants of the commutative laws on properties of several families of algebras which are in general not commutative, such as groups, linear algebras, or actually quite anti-commutative, such as $BCK$-algebras and $d$-algebras among others. From results obtained it becomes clear that by considering these variants in the presence of yet other axioms it is to be expected that a quite rich and varied set of results may be obtained both in the general and the particular setting of which what has been accomplished in this paper is a substantial sample.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; (h,q)-Euler polynomials; degenerate (h,q)-Changhee polynomials,; fermionic p-adic q-integral on Z_p.
Online: 8 October 2018 (11:40:33 CEST)
|
|
Share this article with
×
In this paper, we investigate a new $q$-analogue of the higher order degenerate Changhee polynomials and numbers, which are called the Witt-type formula for the $q$-analogue of degenerate Changhee polynomials of order $r$. We can derive some new interesting identities related to the degenerate $(h,q)$-Changhee polynomials and numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; degenerate Daehee polynomials; fully degenerate Daehee polynomials of the second kind; higher-order Daehee polynomials of the second kind
Online: 8 October 2018 (05:53:03 CEST)
|
|
Share this article with
×
In this paper, we investigate the new degenerate Daehee polynomials and numbers which are called the degenerate Daehee polynomials of the second kind, and derive some new and interesting identities and properties of those polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Riemann Zeta function; matrix; tensor
Online: 30 September 2018 (08:47:17 CEST)
|
|
Share this article with
×
This paper attempts to extend the Riemann Zeta function of a complex number to a function of a matrix and/or a tensor $A$, namely $$\zeta (A)=\sum _{n=1}^{\infty} \frac{1}{n^{A}}= \sum _{n=1}^{\infty} \sum_{k=1}^n\lambda_k A^k$$ and inverse $$A=\sum _{n=1}^{\infty} \sum_{k=1}^n \mu(n)\lambda_k \zeta(A^k)$$ where $\mu(n)$ is the M\"obius function, $A$ is a complex matrix or tensor with any order, and $\lambda_k$ is eigenvalue of the matri/tensor $A$. This kind of calculations on the Riemann Zeta function has never been seen in the literature. Some examples are provided.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; rough sets; covering approximation space; neighborhood system; approximation operation; partition
Online: 28 September 2018 (10:30:37 CEST)
|
|
Share this article with
×
In this paper, we propose a new covering-based set in which the lower and the upper approximation operation are defined by neighborhood systems. We discuss this new type of covering-based set systematically in two steps. First, we study the basic properties of this covering-based set, such as the properties of normality, contraction, and monotone. Second, we discuss the relationship between the new type of covering-based set and the other ten sets proposed.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Galois ring; optimal normal basis; multiplicative complexity; finite field
Online: 28 September 2018 (09:41:32 CEST)
|
|
Share this article with
×
In this paper we study the normal bases for Galois ring extension ${{R}} / {Z}_{p^r}$ where ${R}$ = ${GR}$(pr, n). We present a criterion on normal basis for ${{R}} / {Z}_{p^r}$ and reduce this problem to one of finite field extension $\overline{R} / \overline{Z}_{p^r}=F_{q} / F_{p} (q=p^n)$ by Theorem 1. We determine all optimal normal bases for Galois ring extension.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; degenerate log function; degenerate Daehee numbers of the thirdkind; nonlinear differential equation.
Online: 24 September 2018 (10:22:32 CEST)
|
|
Share this article with
×
In this paper, we define new kind of Daehee numbers, the degenerate Daehee numbers of the third kind, using degenerate log function as generating function. We obtain some identities for the degenerate Daehee numbers of the third kind associated with the Daehee, degenerate Daehee and degenerate Daehee numbers of the second kind. In addition, we derive a differential equation associated with the degenerate log function. We deduce some identities from the differential equation.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Fubini polynomials; Euler numbers; congruence; elementary method
Online: 20 August 2018 (18:50:20 CEST)
|
|
Share this article with
×
The aim of this paper is to use the elementary method and the properties of the second kind Stirling numbers to study the congruence properties of a new sequence, which is closely related to Fubini polynomials and Euler numbers, and give some interesting congruences for it. This solves a problem proposed by the first author at an unpublished paper.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; series representation; power function; monomial; binomial theorem; multinomial theorem; worpitzky identity; stirling numbers of second kind; faulhaber's sum; finite difference; faulhaber's formula; central factorial numbers; binomial coefficients; binomial distribution; binomial transform; bernoulli numbers; oeis; multinomial coefficients
Online: 17 August 2018 (11:10:47 CEST)
|
|
Share this article with
×
In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials Dm(n,k) and Um(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n2m+1.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; partially degenerate Changhee-Genocchi polynomials, degenerate Genocchi polynomials, degenerate Changhee polynomials.
Online: 7 August 2018 (13:16:55 CEST)
|
|
Share this article with
×
In this paper, we introduce the partially degenerate Changhee-Genocchi polynomials and numbers and investigated some identities of these polynomials. Furthermore, we investigate some explicit identities and properties of the partially degenerate Changhee-Genocchi arising from the nonlinear di erential equations.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-Bernoulli numbers; q-Bernoulli polynomials; Bernstein polynomials; q-Bernstein polynomials; p-adic integral on Zp
Online: 30 July 2018 (08:17:45 CEST)
|
|
Share this article with
×
In this paper, we study the p-adic integral representation on Zp of q-Bernoulli numbers arising from two variable q-Bernstein polynomials and investigate some properties for the q-Bernoulli numbers. In addition, we give some new identities of q-Bernoulli numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; authentication schemes; resilient maps; gray map
Online: 30 July 2018 (04:26:47 CEST)
|
|
Share this article with
×
Two new systematic authentication codes based on the Gray map over a Galois ring are introduced. The first introduced code attains optimal impersonation and substitution probabilities. The second code improves space sizes but it does not attain optimal probabilities. Besides it is conditioned to the existence of a special class of bent maps on Galois rings.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; matrix algebra; accounting; industry 4.0
Online: 24 July 2018 (05:01:28 CEST)
|
|
Share this article with
×
The aim of this paper is to show how the mathematical basis is used for a precise treatment of double-entry bookkeeping, which was firstly developed in the nineteenth century by Sir William Rowan Hamilton. This is done by using basic notions of matrix algebra with the roots to the idea of using ordered pairs. We also reveal how the complex numbers and the rationals (fractions) developed in a mainstream of accounting science and became a leading platform for the ongoing processes within the Industry 4.0. The paper concludes with the examples on how accounting operations can be represented by matrix equations with a result of the essential report generating. The author represents a mathematical model of accounting which is independent of the specific existential forms but is capable to undertake the form of any of them and thus has the prospect of being understood and accepted by specialists globally.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; RSA, Cryptanalysis, Lattices, LLL algorithm, Coppersmith’s method
Online: 20 July 2018 (11:07:00 CEST)
|
|
Share this article with
×
In this paper, we gave an attack on RSA when Euler function has small multiplicative inverse modulo "e" and the prime sum p+q is of the form p+q=2^nk_0+k_1 where n is a given positive integer and k_0 and k_1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith's methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Zeros at infinity, Jacobian Conjecture
Online: 17 July 2018 (12:04:11 CEST)
|
|
Share this article with
×
This article contains the theorems concerning the algebraic dependence of polynomial mappings with the constant Jacobian having two zeros at infinity. The work is related to the issues of the classical Jacobian Conjecture. This hypothesis affirm that the polynomial mapping of two complex variables with constant
non-zero Jacobian is invertible. The Jacobian Conjecture is equivalent to the fact that polynomial mappings with constant non-zero Jacobian do not have two zeros at infinity, therefore it is equivalent to the two theorems given in the work. The proofs of these theorems proceeds by induction.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; domination, vertex-edge domination, total vertex-edge domination
Online: 11 July 2018 (10:52:10 CEST)
|
|
Share this article with
×
A novel domination invariant defined by Boutrig and Chellali in the recent: total vertex-edge domination. In this paper we obtain an improved upper bound of total vertex edge-domination number of a tree. If is a connected tree with order , then with and we characterize the trees attaining this upper bound. Furthermore we provide a characterization of trees with
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; degenerate Bernstein polynomials, degenerate Bernstein operators, degenerate Euler polynomials.
Online: 10 July 2018 (13:56:13 CEST)
|
|
Share this article with
×
In this paper, we investigate the recently introduced degenerate Bernstein polynomials and operators and derive some of their properties. Also, we give some properties of the degenerate Euler numbers and polynomials and their connection with the degenerate Euler polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; binary system(groupoid); minimum (mutual) covering set; (mutual) shortest distance; (di)frame graph; d/BCK-algebra
Online: 28 June 2018 (04:48:32 CEST)
|
|
Share this article with
×
In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Chebyshev polynomials; sums of finite products; hypergeometric function
Online: 6 June 2018 (09:44:52 CEST)
|
|
Share this article with
×
Here we consider sums of finite products of Chebyshev polynomials of the third and fourth kinds. Then we represent each of those sums of finite products as linear combinations of the four kinds of Chebyshev polynomials which involve the hypergeometric function 3F2.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; double framed T-soft fuzzy set; double framed T-soft fuzzy algebra; double framed B-soft fuzzy algebra
Online: 23 April 2018 (12:15:40 CEST)
|
|
Share this article with
×
The aim of this article is introduced the concept of double framed T-soft fuzzy set (DFT-soft fuzzy set) which is the combination of soft set and fuzzy set. We also defined the notions and apply this concept in BCK/BCI-algebras. By using example, we also discussed the concept of double framed T-soft fuzzy algebra (DFT-soft fuzzy algebra) and double framed B-soft fuzzy algebra (DFB-soft fuzzy algebra) and also investigated their properties. Each double framed T-soft fuzzy algebra is double framed B-soft fuzzy algebra but by using example, we proved that converse may or may not be possible.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; coarse structure; coarse space; ballean; varieties of coarse spaces
Online: 23 April 2018 (12:13:38 CEST)
|
|
Share this article with
×
A class of coarse spaces is called a variety if is closed under formation of subspaces, coarse images and products. We classify the varieties of coarse spaces and, in particular, show that if a variety contains an unbounded metric space then is the variety of all coarse spaces.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Fubini polynomials; w-torsion Fubini polynomials; fermionic p-adic integrals; symmetric identities
Online: 23 April 2018 (08:24:37 CEST)
|
|
Share this article with
×
In this paper, we represent the generating function of w-torsion Fubini polynomials by fermionic p-adic integral on Zp. Then we consider a quotient of such fermionic p-adic integrals on Zp, representing generating functions of three w-torsion Fubini polynomials and derive some new symmetric identities for the w-torsion Fubini and two variable w-torsion Fubini polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; computable upper bound on the heights of rational solutions; computable upper bound on the moduli of integer solutions; Diophantine equation with a finite number of solutions; finite-fold Diophantine representation; single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; single query to an oracle that decides whether or not a given Diophantine equation has a rational solution
Online: 16 April 2018 (05:12:59 CEST)
|
|
Share this article with
×
Let , and let for every positive integer n. We consider the following hypothesis: if a system S ⊆ {xi · xj = xk : i, j, k ∈ {1, . . . , n}} ∪ {xi + 1 = xk : i, k ∈{1, . . . , n}} has only finitely many solutions in non-negative integers x1, . . . , xn, then each such solution (x1, . . . , xn) satisfies x1, . . . , xn ≤ f (2n). We prove: (1) the hypothesisimplies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that there exists an algorithm for listing the Diophantine equations with infinitely many solutions in non-negative integers; (3) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (4) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (5) the hypothesis implies that if a set ⊆ has a finite-fold Diophantine representation, then is computable.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-calculus; (p,q)-calculus; exponential functions; trigonometric functions; hyperbolic functions
Online: 9 March 2018 (14:49:59 CET)
|
|
Share this article with
×
This paper includes some new investigations and results for post quantum calculus, denoted by (p,q)-calculus. A chain rule for (p,q)-derivative is developed. Also, a new (p,q)-analogue of the exponential function is introduced and some its properties including the addition property for (p,q)-exponential functions are investigated. Several useful results involving (p,q)-binomial coefficients and (p,q)-antiderivative are discovered. At the final part of this paper, (p,q)-analogue of some elementary functions including trigonometric functions and hyperbolic functions are considered and some properties and relations among them are analyzed extensively.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Hermite-Kampé de Fériet polynomials; Hermite Bernoulli polynomials; poly Bernoulli polynomials; Stirling numbers of second kind; Polylogarithm functions.
Online: 22 February 2018 (15:28:12 CET)
|
|
Share this article with
×
We introduce the Hermite based poly-Bernoulli polynomials with a q parameter and give someof their basic properties including not only addition property, but also derivative properties and integralrepresentations. We also de.ne the Hermite based λ -Stirling polynomials of the second kind, and thenprovide some relations. Moreover, we derive several correlations and identities including the Hermite-Kampéde Fériet (or Gould-Hopper) family of polynomials, the Hermite based poly-Bernoulli polynomials with a qparameter and the Hermite based λ -Stirling polynomials of the second kind.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; numbers and polynomials; Bernoulli numbers and polynomials; Genocchi numbers and polynomials; power sums
Online: 19 February 2018 (14:18:47 CET)
|
|
Share this article with
×
We study on the sums of powers of consequtive integers and alternating sums of power of consequtive integers. We derive many identities and correlations including Bernoulli, Euler and Genocchi polynomials and numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; p-adic numbers; p-adic gamma function; p-adic Euler constant; q-Daehee polynomials; Stirling numbers of the first kind
Online: 19 February 2018 (14:12:04 CET)
|
|
Share this article with
×
In this paper, we investigate p-adic q-integral (q-Volkenborn integral) on Zp of p-adic gamma function via their Mahler expansions. We also derived two q-Volkenborn integrals of p-adic gamma function in terms of q-Daehee polynomials and numbers and q-Daehee polynomials and numbers of the second kind. Moreover, we discover q-Volkenborn integral of the derivative of p-adic gamma function. We acquire the relationship between the p-adic gamma function and Stirling numbers of the first kind. We finally develop a novel and interesting representation for the p-adic Euler constant by means of the q-Daehee polynomials and numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; LiDAR; smooth contour line; break line; point cloud; forests
Online: 1 February 2018 (03:37:44 CET)
|
|
Share this article with
×
A methodology for both accurate and smooth contour line generation from Light Detection and Ranging (LiDAR) point clouds is proposed in this paper. In order to improve the accuracy of contour lines in the area of forests, constrained triangulation networks with break lines are then constructed to generate contour lines. In break line extraction, a bi-threshold method for edge line detection is used to extract both complete and reliable break lines. A point clouds elevation adjustment with constrain of break lines and an interpolator considering a contour interval is proposed to improve the smoothness of contour lines. The proposed interpotator is also can avoid contour line intersection when contour lines are interpolated. Statistical parameters and shape index are then used to evaluate quantitatively the accuracy and smoothness of the resultant contour lines, which fill in the blank of contour lines evaluation in theory. The experiments show that high-quality contours in terms of smoothness and accuracy can be generated from LiDAR point clouds.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; quantum chaos; Riemann hypothesis; eigenspectra
Online: 28 December 2017 (10:53:20 CET)
|
|
Share this article with
×
The Hamiltonian of a quantum mechanical system has an affiliated spectrum. If this spectrum is the sequence of prime numbers, a connection between quantum mechanics and the nontrivial zeros of the Riemann zeta function can be made. In this case, the Riemann zeta function is analogous to chaotic quantum systems, as the harmonic oscillator is for integrable quantum systems. Such quantum Riemann zeta function analogies have led to the Bender-Brody-Müller (BBM) conjecture, which involves a non-Hermitian Hamiltonian that maps to the zeros of the Riemann zeta function. If the BBM Hamiltonian can be shown to be Hermitian, then the Riemann Hypothesis follows. As such, herein we perform a symmetrization procedure of the BBM Hamiltonian to obtain a unique Hermitian Hamiltonian that maps to the zeros of the analytic continuation of the Riemann zeta function, and provide an analytical expression for the eigenvalues of the results. The holomorphicity of the resulting eigenvalues is examined. Moreover, a second quantization of the resulting Schrödinger equation is performed, and a convergent solution for the nontrivial zeros of the analytic continuation of the Riemann zeta function is obtained. Finally, from the holomorphicity of the eigenvalues it is shown that the real part of every nontrivial zero of the Riemann zeta function converges at σ = 1/2.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; (p, q)-calculus; apostol-bernoulli polynomials; apostol-euler polynomials; apostol- genocchi polynomials; stirling numbers of second kind; generating function; cauchy product
Online: 21 December 2017 (05:30:46 CET)
|
|
Share this article with
×
Motivated by Kurt's work [Filomat 30 (4) 921-927, 2016], we first consider a class of a new generating function for (p, q)-analog of Apostol type polynomials of order a including Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi polynomials of order a. By making use of their generating function, we derive some useful identities. We also introduce (p, q)-analog of Stirling numbers of second kind of order v by which we construct a relation including aforementioned polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-umbral calculus; apostol-bernoulli polynomials; modi.ed apostol type q-bernoulli polynomials; q-appell polynomials; generating functions
Online: 18 December 2017 (10:01:24 CET)
|
|
Share this article with
×
This article aims to identify the generating function of modi
ed Apostol type q-Bernoulli polynomials. With the aid of this generating function, some properties of modi
ed Apostol type q-Bernoulli polynomials are given. It is shown that aforementioned polynomials are q-Appell. Hence, we make use of these polynomials to have applications on q-Umbral calculus. From those applications, we derive some theorems in order to get Apostol type modi
ed q-Bernoulli polynomials as a linear combination of some known polynomials which we stated in the paper.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-calculus; stirling numbers of the second kind; bernoulli polynomials and numbers; generating function; cauchy product
Online: 18 December 2017 (08:22:41 CET)
|
|
Share this article with
×
In this paper, we introduce a new generalization of the r-Stirling numbers of the second kind based on the q-numbers via an exponential generating function. We investigate their some properties and derive several relations among q-Bernoulli numbers and polynomials, and newly de
ned (q, r, w)-Stirling numbers of the second kind. We also obtain q-Bernstein polynomials as a linear combination of (q, r, w)-Stirling numbers of the second kind and q-Bernoulli polynomials in w.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Carlitz’s q-Bernoulli polynomials; Stirling numbers of the first kind; Stirling numbers of the second kind; p-adic q-integral
Online: 15 December 2017 (09:31:13 CET)
|
|
Share this article with
×
The main goal of the present paper is to construct some families of the Carlitz’s q-Bernoulli polynomials and numbers. We firstly introduce the modified Carlitz’s q-Bernoulli polynomials and numbers with weight (α, β) and investigate their some explicit properties and identities arising from the bosonic q-Volkenborn integral on ℤp. We then define the modified degenerate Carlitz’s q-Bernoulli polynomials and numbers with weight (α, β) and obtain some recurrence relations and other identities. Moreover, we derive some correlations with the modified Carlitz’s q-Bernoulli polynomials with weight (α, β), the modified degenerate Carlitz’s q-Bernoulli polynomials with weight (α, β), the Stirling numbers of the first kind and second kind.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; (p, q)-calculus; Bernoulli polynomials; Euler polynomials; Genocchi polynomials; Frobenius-Euler polynomials; generating function; Cauchy product
Online: 15 December 2017 (09:14:10 CET)
|
|
Share this article with
×
In the present paper, we introduce (p, q)-extension of Apostol type Frobenius-Euler polynomials and numbers and investigate some basic identities and properties for these polynomials and numbers, including addition theorems, difference equations, derivative properties, recurrence relations and so on. Then, we provide integral representations, explicit formulas and relations for these polynomials and numbers. Moreover, we discover (p, q)-extensions of Carlitz's result [L. Carlitz, Mat. Mag., 32 (1959), 247–260] and Srivastava and Pintér addition theorems in [H. M. Srivastava, A. Pinter, Appl. Math. Lett., 17 (2004), 375–380].
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; multi-order logarithmic number; multi-order logarithmic polynomial; explicit formula; identity; recurrence relation; inversion theorem; Bell polynomial of the second kind; Stirling number; determinantal inequality; product inequality; completely monotonic function; logarithmic convexity; Faa di Bruno formula
Online: 11 September 2017 (04:22:18 CEST)
|
|
Share this article with
×
In the paper, the author introduces the notions "multi-order logarithmic numbers" and "multi-order logarithmic polynomials", establishes an explicit formula, an identity, and two recurrence relations by virtue of the Faa di Bruno formula and two identities of the Bell polynomials of the second kind in terms of the Stirling numbers of the fi rst and second kinds, and constructs some determinantal inequalities, product inequalities, logarithmic convexity for multi-order logarithmic numbers and polynomials by virtue of some properties of completely monotonic functions.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; inequality; ratio; Bernoulli number; Riemann zeta function; Dirichlet eta function; accuracy
Online: 28 August 2017 (09:30:34 CEST)
|
|
Share this article with
×
In the paper, by virtue of some properties for the Riemann zeta function, the author finds a double inequality for the ratio of two consecutive Bernoulli numbers with even indexes and analyzes the approximating accuracy of the double inequality.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Bell number; Bell polynomial; generalization; explicit formula; inversion formula; inversion theorem; Stirling number; Bell polynomial of the second kind; determinantal inequality; product inequality; completely monotonic function; logarithmic convexity
Online: 26 August 2017 (09:12:05 CEST)
|
|
Share this article with
×
In the paper, the authors present unified generalizations for the Bell numbers and polynomials, establish explicit formulas and inversion formulas for these generalizations in terms of the Stirling numbers of the first and second kinds with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem connected with the Stirling numbers of the first and second kinds, construct determinantal and product inequalities for these generalizations with aid of properties of the completely monotonic functions, and derive the logarithmic convexity for the sequence of these generalizations.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Bell polynomial; Bell number; Bell polynomial of the second kind; higher order derivative; generating function; Faa di Bruno formula; inversion theorem; Stirling number of the first kind; Stirling number of the second kind; explicit formula; inversion formula; logarithmically absolute monotonicity; logarithmically complete monotonicity; determinantal inequality; product inequality
Online: 25 August 2017 (08:41:30 CEST)
|
|
Share this article with
×
In the paper, the author (1) presents an explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials, with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds; (2) recovers an explicit formula and its inversion formula for the Bell polynomials in terms of the Stirling numbers of the first and second kinds, with the aid of the above explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials; (3) constructs some determinantal and product inequalities and deduces the logarithmic convexity of the Bell polynomials, with the assistance of the complete monotonicity of generating functions of the Bell polynomials. These inequalities are main results of the paper.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; identity; inverse matrix; explicit formula; generating function; Chebyshev polynomials of the second kind; Catalan number; triangular matrix; classical hypergeometric function; integral representation
Online: 7 August 2017 (15:49:11 CEST)
|
|
Share this article with
×
In the paper, the authors establish two identities to express the generating function of the Chebyshev polynomials of the second kind and its higher order derivatives in terms of the generating function and its derivatives each other, deduce an explicit formula and an identities for the Chebyshev polynomials of the second kind, derive the inverse of an integer, unit, and lower triangular matrix, present several identities of the Catalan numbers, and give some remarks on the closely related results including connections of the Catalan numbers respectively with the Chebyshev polynomials, the central Delannoy numbers, and the Fibonacci polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; prime graph; simple group; orthogonal groups; quasirecognition
Online: 10 July 2017 (09:01:04 CEST)
|
|
Share this article with
×
Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in Γ(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G)=Γ(P), G has a composition factor isomorphic to P. In [4] proved finite simple groups 2Dn(q), where n ≠ 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups 2D2k(q), where k ≥ 9 and q is a prime power less than 105.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; closed expression; Fibonacci number; Fibonacci polynomial; tridiagonal determinant; Hessenberg determinant
Online: 28 March 2017 (03:11:06 CEST)
|
|
Share this article with
×
In the paper, the authors nd a new closed expression for the Fibonacci polynomials and, consequently, for the Fibonacci numbers, in terms of a tridiagonal determinant.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; explicit formula; recursive formula; generalized Motzkin number; Motzkin number; restricted hexagonal number; Catalan number; generating function
Online: 27 March 2017 (11:02:41 CEST)
|
|
Share this article with
×
In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; homomorphism; Grassmannian; generalized geometry; cathelineau's complex
Online: 15 March 2017 (08:04:30 CET)
|
|
Share this article with
×
In this article, a generalization of the geometry of Grassmannian chain complex of free abelian groups generated by the projective configuration of points and Cathelineau's infinitesimal complex of polylogarithmic groups is proposed. Firstly, homomorphisms for weight n =2 up to weight n=6 will be introduced to connect sub-complexes of Grassmannian and Cathelineau. Lately, generalization of these morphisms will be shown for weight n=N. The associated diagrams will also be proven to be commutative and bi-complex.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; viewpoint; ordinary differential equation; solution; derivative polynomial; identity; Stirling numbers; Bernoulli number; Bernoulli polynomial; Frobenius-Euler polynomial
Online: 12 October 2016 (11:47:48 CEST)
|
|
Share this article with
×
In the paper, the authors view some ordinary differential equations and their solutions from the angle of (the generalized) derivative polynomials and simplify some known identities for the Bernoulli numbers and polynomials, the Frobenius-Euler polynomials, the Euler numbers and polynomials, in terms of the Stirling numbers of the first and second kinds.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; derangement number; closed form; Hessenberg determinant; tridiagonal determinant; generating function; recurrence relation; derivative
Online: 11 October 2016 (10:53:07 CEST)
|
|
Share this article with
×
In the paper, the authors find closed forms for derangement numbers in terms of the Hessenberg determinants, discover a recurrence relation of derangement numbers, present a formula for any higher order derivative of the exponential generating function of derangement numbers, and compute some related Hessenberg and tridiagonal determinants.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; determinantal expression; recurrence relation; Euler polynomial; Euler number; Hessenberg determinant
Online: 11 October 2016 (10:40:02 CEST)
|
|
Share this article with
×
In the paper, by a very simple approach, the author establishes an expression in terms of a lower Hessenberg determinant for the Euler polynomials. By the determinantal expression, the author finds a recurrence relation for the Euler polynomials. By the way, the author derives the corresponding expression and recurrence relation for the Euler numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; integral form; infinite series; modulus function; transformation function
Online: 26 August 2016 (12:57:10 CEST)
|
|
Share this article with
×
According to the fact that the low convergence level on the complete elliptic integral of the first kind for the modulus which having values approach to one. In this paper we propose novelty of the complete elliptic integral consists of the new infinite series. We apply the scheme of iteration by substituting the common modulus with own modulus function into the new infinite series. We obtained so many new exact formulas of the complete elliptic integral derived from this method correspond to the number of iteration order. On the other hand, it has been also obtained a lot of new modulus functions rather than common used previously. The calculation results show that the number of significant figures of the new infinite series of the complete elliptic integral of the first kind is increased more and more. It means more fastly convergent would be obtained comparison values with the previous infinite series.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Riemann hypothesis, Farey sequence, Gauss sum associated with a Dirichlet character
Online: 10 August 2016 (11:35:25 CEST)
|
|
Share this article with
×
Relationships between the Farey sequence and the Riemann hypothesis other than the Franel-Landau theorem are discussed. Whether a function similar to Chebyshev’s second function is square-root close to a line having a slope different from 1 is discussed. The nontrivial zeros of the Riemann zeta function can be used to approximate many functions in analytic number theory. For example, it could be said that the nontrival zeta function zeros and the Möbius function generate in essence the same function - the Mertens function. A different approach is to start with a sequence that is analogous to the nontrivial zeros of the zeta function and follow the same procedure with both this sequence and the nontrivial zeros of the zeta function to generate in essence the same function. A procedure for generating such a function is given.