Sciweavers

JSC
2010
82views more  JSC 2010»
12 years 11 months ago
The first rational Chebyshev knots
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
Pierre-Vincent Koseleff, D. Pecker, F. Rouillier
JSC
2010
100views more  JSC 2010»
12 years 11 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
JSC
2010
63views more  JSC 2010»
12 years 11 months ago
A bound on the projective dimension of three cubics
We show that given any polynomial ring R over a field and any ideal J R which is generated by three cubic forms, the projective dimension of R/J is at most 36. We also settle the...
Bahman Engheta
JSC
2010
70views more  JSC 2010»
12 years 11 months ago
Liouvillian solutions of linear difference-differential equations
For a field k with an automorphism and a derivation , we introduce the notion of liouvillian solutions of linear difference-differential systems {(Y ) = AY, (Y ) = BY } over k an...
Ruyong Feng, Michael F. Singer, Min Wu
JSC
2010
83views more  JSC 2010»
12 years 11 months ago
Computing differential characteristic sets by change of ordering
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
François Boulier, François Lemaire, ...
JSC
2010
86views more  JSC 2010»
12 years 11 months ago
Rational two-parameter families of spheres and rational offset surfaces
The present paper investigates two-parameter families of spheres in R3 and their corresponding two-dimensional surfaces in R4 . Considering a rational surface in R4 , the envelo...
Martin Peternell
JSC
2010
107views more  JSC 2010»
12 years 11 months ago
On the relation between Context and Sequence Unification
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
Temur Kutsia, Jordi Levy, Mateu Villaret
JSC
2010
82views more  JSC 2010»
12 years 11 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Sonia L. Rueda, J. Rafael Sendra
JSC
2010
90views more  JSC 2010»
13 years 2 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
Cristina Bertone, Guillaume Chèze, Andr&eac...
JSC
2010
96views more  JSC 2010»
13 years 2 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner