#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1967

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (6)

#### Publication Type

#### Publication Venue

#### Key Phrases

Learn More

- Martin Weimann
- J. Complexity
- 2010

We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton poly-tope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with now a polynomial complexity in the volume of the Newton polytope. We adopt a geometrical point of… (More)

- MARTIN WEIMANN
- 2009

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of C 2 and D an effective divisor with support ∂X = X \ C 2. Our main result gives explicit conditions equivalent to that a given Cartier divisor on the subscheme (|D|, O D) extends to X. These… (More)

- Martin Weimann
- 1995

- M L Weimann
- The Journal of the Medical Society of New Jersey
- 1967

- Martin Weimann
- ACM Comm. Computer Algebra
- 2015

- Martin Weimann
- Foundations of Computational Mathematics
- 2012

— We extend the usual projective Abel-Radon transform to the larger context of a smooth complete toric variety X. We define and study toric E-concavity attached to a split vector bundle on X. Then we obtain a multidimensional residual representation of the toric Abel-transform and we prove a toric version of the classical Abel-inverse theorem. Résumé. —… (More)

- Martin Weimann
- J. Symb. Comput.
- 2013

We relate factorization of bivariate polynomials to singularities of projective plane curves. We prove that adjoint polynomials of a polynomial F ∈ k[x, y] with coefficients in a field k permit to recombinations of the factors of F (0, y) induced by both the absolute and rational factorizations of F , and so without using Hensel lifting. We show in such a… (More)

- ‹
- 1
- ›