Related papers: Investigating Exponential and Geometric Polynomial…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices…
The study of partial-twuality polynomials originates from the classical operations of geometric duality and Petrie duality on cellularly embedded graphs. These involutions generate the symmetric group $S_3$, and applying them to subsets of…
We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols.…
In this paper, we investigate the Euler-type integral representations for the generalized hypergeometric matrix function and develop some transformations in terms of hypergeometric matrix functions. Furthermore, unit and half arguments have…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
In this paper, we discuss sums of powers of the positive integers and compute both the exponential and ordinary generating functions for these sums. We express these generating functions in terms of exponential and geometric polynomials and…
In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…
We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…
In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the…
There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…
We study the problem of generalization of Oresme numbers with a new sequence of numbers called Oresme polynomials. Moreover, by using the matrix methods for Oresme polynomials, we obtain the identities including the general bilinear…
We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…