Sciweavers

2430 search results - page 31 / 486
» Computing Tutte Polynomials
Sort
View
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 7 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
ITA
2002
13 years 7 months ago
On multiplicatively dependent linear numeration systems, and periodic points
Abstract. Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively...
Christiane Frougny
JSC
2010
82views more  JSC 2010»
13 years 2 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
CADE
2008
Springer
13 years 9 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
FOCM
2010
91views more  FOCM 2010»
13 years 6 months ago
On the Ranks and Border Ranks of Symmetric Tensors
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
J. M. Landsberg, Zach Teitler