New Results and Matrix Representation for Daehee and Bernoulli Numbers and Polynomials

In this paper, we derive new matrix representation for Daehee numbers and polynomials, the lambda-Daehee numbers and polynomials and the twisted Daehee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on Daehee numbers and polynomials. Moreover, we obtained some new results for Daehee and Bernoulli numbers and polynomials

New Results on Higher-Order Daehee and Bernoulli Numbers and Polynomials

We derive new matrix representation for higher order Daehee numbers and polynomials, the higher order lambda-Daehee numbers and polynomials and the twisted lambda-Daehee numbers and polynomials of order k. This helps us to obtain simple and short proofs of many previous results on higher order Daehee numbers and polynomials. Moreover, we obtained recurrence relation, explicit formulas and some new results for these numbers and polynomials. Furthermore, we investigated the relation between these numbers and polynomials and Stirling numbers, Norlund and Bernoulli numbers of higher order. The results of this article gives a generalization of the results derived very recently by El-Desouky and Mustafa [6]

Classical and quantum quasi-free position dependent mass; P\"oschl-Teller and ordering-ambiguity

We argue that the classical and quantum mechanical correspondence may play a basic role in the fixation of the ordering-ambiguity parameters. We use quasi-free position-dependent masses in the classical and quantum frameworks. The effective P\"oschl-Teller model is used as a manifested reference potential to elaborate on the reliability of the ordering-ambiguity parameters available in the literature.Comment: 10 page

Generalized inequalities on warped product submanifolds in nearly trans-Sasakian manifolds

In this paper, we study warped product submanifolds of nearly trans-Sasakian manifolds. The non-existence of the warped product semi-slant submanifolds of the type $N_\theta\times{_{f}N_T}$ is shown, whereas some characterization and new geometric obstructions are obtained for the warped products of the type $N_T\times{_{f}N_\theta}$. We establish two general inequalities for the squared norm of the second fundamental form. The first inequality generalizes derived inequalities for some contact metric manifolds [16, 18, 19, 24], while by a new technique, the second inequality is constructed to express the relation between extrinsic invariant (second fundamental form) and intrinsic invariant (scalar curvatures). The equality cases are also discussed.Comment: 16 page

Relativistic Expansion of Electron-Positron-Photon Plasma Droplets and Photon Emission

The expansion dynamics of hot electron-positron-photon plasma droplets is dealt with within relativistic hydrodynamics. Such droplets, envisaged to be created in future experiments by irradiating thin foils with counter-propagating ultra-intense laser beams, are sources of flashes of gamma radiation. Warm electron-positron plasma droplets may be identified and characterized by a broadened 511 keV line

Fast Computation of Smith Forms of Sparse Matrices Over Local Rings

We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic. For an \nxn matrix $A$ over the ring \Fzfe, where $f^e$ is a power of an irreducible polynomial f \in \Fz of degree $d$, our algorithm requires \bigO(\eta de^2n) operations in \F, where our black-box is assumed to require \bigO(\eta) operations in \F to compute a matrix-vector product by a vector over \Fzfe (and $\eta$ is assumed greater than \Pden). The algorithm only requires additional storage for \bigO(\Pden) elements of \F. In particular, if \eta=\softO(\Pden), then our algorithm requires only \softO(n^2d^2e^3) operations in \F, which is an improvement on known dense methods for small $d$ and $e$. For the ring \ZZ/p^e\ZZ, where $p$ is a prime, we give an algorithm which is time- and memory-efficient when the number of nontrivial invariant factors is small. We describe a method for dimension reduction while preserving the invariant factors. The time complexity is essentially linear in $\mu n r e \log p,$ where $\mu$ is the number of operations in \ZZ/p\ZZ to evaluate the black-box (assumed greater than $n$) and $r$ is the total number of non-zero invariant factors. To avoid the practical cost of conditioning, we give a Monte Carlo certificate, which at low cost, provides either a high probability of success or a proof of failure. The quest for a time- and memory-efficient solution without restrictions on the number of nontrivial invariant factors remains open. We offer a conjecture which may contribute toward that end.Comment: Preliminary version to appear at ISSAC 201