Sciweavers

2432 search results - page 93 / 487
» Degrees and choice numbers
Sort
View
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
15 years 6 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
MOC
2002
98views more  MOC 2002»
15 years 6 months ago
Bounds for the smallest norm in an ideal class
We develop a method for obtaining upper bounds for the smallest norm among all norms of integral ideals in an ideal class. Applying this to number fields of small degree, we are ab...
Ana-Cecilia de la Maza
FFA
2010
84views more  FFA 2010»
15 years 4 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
JSC
2010
85views more  JSC 2010»
15 years 4 months ago
On the minimum of a positive polynomial over the standard simplex
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...
Gabriela Jeronimo, Daniel Perrucci
JSC
2010
99views more  JSC 2010»
15 years 4 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray