Sciweavers

80 search results - page 13 / 16
» jsc 2006
Sort
View
JSC
2000
60views more  JSC 2000»
13 years 8 months ago
Generic Extensions and Generic Polynomials
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
Arne Ledet
JSC
2002
74views more  JSC 2002»
13 years 8 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
JSC
2002
61views more  JSC 2002»
13 years 8 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
JSC
2007
56views more  JSC 2007»
13 years 8 months ago
Restriction of A-discriminants and dual defect toric varieties
We study the A-discriminant of toric varieties. We reduce its computation to the case of irreducible configurations and describe its behavior under specialization of some of the ...
Raymond Curran, Eduardo Cattani
JSC
2006
102views more  JSC 2006»
13 years 8 months ago
Counterexamples to witness conjectures
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
Joris van der Hoeven