Displaying 21 – 40 of 2019

Showing per page

A fast numerical test of multivariate polynomial positiveness with applications

Petr Augusta, Petra Augustová (2018)

Kybernetika

The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.

A generalization of a result on integers in metacyclic extensions

James Carter (1999)

Colloquium Mathematicae

Let p be an odd prime and let c be an integer such that c>1 and c divides p-1. Let G be a metacyclic group of order pc and let k be a field such that pc is prime to the characteristic of k. Assume that k contains a primitive pcth root of unity. We first characterize the normal extensions L/k with Galois group isomorphic to G when p and c satisfy a certain condition. Then we apply our characterization to the case in which k is an algebraic number field with ring of integers ℴ, and, assuming some...

A generalization of the Gauss-Lucas theorem

J. L. Díaz-Barrero, J. J. Egozcue (2008)

Czechoslovak Mathematical Journal

Given a set of points in the complex plane, an incomplete polynomial is defined as the one which has these points as zeros except one of them. The classical result known as Gauss-Lucas theorem on the location of zeros of polynomials and their derivatives is extended to convex linear combinations of incomplete polynomials. An integral representation of convex linear combinations of incomplete polynomials is also given.

A monogenic Hasse-Arf theorem

James Borger (2004)

Journal de Théorie des Nombres de Bordeaux

I extend the Hasse–Arf theorem from residually separable extensions of complete discrete valuation rings to monogenic extensions.

Currently displaying 21 – 40 of 2019