Related papers: Investigating Exponential and Geometric Polynomial…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.
We investigate the zonal polynomials, a family of symmetric polynomials that appear in many mathematical contexts, such as multivariate statistics, differential geometry, representation theory, and combinatorics. We present two computer…
Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
One-parameter generalizations of the logarithmic and exponential functions have been obtained as well as algebraic operators to retrieve extensivity. Analytical expressions for the successive applications of the sum or product operators on…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
The Expectation--Maximization (EM) algorithm is a simple meta-algorithm that has been used for many years as a methodology for statistical inference when there are missing measurements in the observed data or when the data is composed of…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…
In this paper, we derive eight basic identities of symmetry in three variables related to generalized Euler polynomials and alternating generalized power sums. All of these are new, since there have been results only about identities of…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
In the present paper, we deal with Fourier-transformation of Frobenius-Euler polynomials. We shall give its applications by using infinite series. Our applications possess interesting properties which we state in this paper.
We revisit Allendoerfer-Weil's formula for the Euler characteristic of embedded hypersurfaces in constant sectional curvature manifolds, first taking some time to re-prove it while demonstrating techniques of [2] and then applying it to…