Search results for "polynomial"

Central polynomials and matrix invariants

1996

LetK be a field, charK=0 andM n (K) the algebra ofn×n matrices overK. If λ=(λ1,…,λ m ) andμ=(μ 1,…,μ m ) are partitions ofn 2 let $$\begin{gathered} F^{\lambda ,\mu } = \sum\limits_{\sigma ,\tau \in S_n 2} {\left( {\operatorname{sgn} \sigma \tau } \right)x_\sigma (1) \cdot \cdot \cdot x_\sigma (\lambda _1 )^{y_\tau } (1)^{ \cdot \cdot \cdot } y_\tau (\mu _1 )^{x\sigma } (\lambda _1 + 1)} \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \lambda _2 )^{y_\tau } (\mu _1 ^{ + 1} )^{ \cdot \cdot \cdot y_\tau } (\mu _1 + \mu _2 ) \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \cdot \cdot \cdot + \lambda _{\mu - 1} ^{ + 1} ) \hfill \\ \cdot \cdot \cdot x_\sigma (n^2 )^{y_\tau } (\mu _1 ^{ + \…

On the simultaneous determination of polynomial roots

1982

A variation on theorems of Jordan and Gluck

2006

Abstract Gluck proved that any finite group G has an abelian subgroup A such that | G : A | is bounded by a polynomial function of the largest degree of the complex irreducible characters of G . This improved on a previous bound of Isaacs and Passman. In this paper, we present a variation of this result that looks at the number of prime factors. All these results, in turn, may be seen as variations on the classical theorem of Jordan on linear groups.

Y-proper graded cocharacters and codimensions of upper triangular matrices of size 2, 3, 4

2012

Abstract Let F be a field of characteristic 0. We consider the upper triangular matrices with entries in F of size 2, 3 and 4 endowed with the grading induced by that of Vasilovsky. In this paper we give explicit computation for the multiplicities of the Y -proper graded cocharacters and codimensions of these algebras.

Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III

1980

In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…

Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation

1970

If, for each zero of a polynomial, an approximation is known, estimates for the errors of these approximations are given, based on the evaluation of the polynomial at these points. The procedure can be carried over to the case of multiple roots and root clusters using derivatives up to the orderk - 1, wherek is the multiplicity of the cluster.

A Computational Technique for Solving Singularly Perturbed Delay Partial Differential Equations

2021

Abstract In this work, a matrix method based on Laguerre series to solve singularly perturbed second order delay parabolic convection-diffusion and reaction-diffusion type problems involving boundary and initial conditions is introduced. The approximate solution of the problem is obtained by truncated Laguerre series. Moreover convergence analysis is introduced and stability is explained. Besides, a test case is given and the error analysis is considered by the different norms in order to show the applicability of the method.

MultivariateApart: Generalized partial fractions

2021

We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied to terms of a sum separately. The package is designed to work in Mathematica, but also provides interfaces to the Form and Singular computer algebra systems.

Understanding star-fundamental algebras

2021

Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.

A Function Algebra Providing New Mergelyan Type Theorems in Several Complex Variables

2019

For compact sets $K\subset \mathbb C^{d}$, we introduce a subalgebra $A_{D}(K)$ of $A(K)$, which allows us to obtain Mergelyan type theorems for products of planar compact sets as well as for graphs of functions.