Sciweavers

110 search results - page 8 / 22
» Chain polynomials and Tutte polynomials
Sort
View
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
14 years 7 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
JCAM
2010
97views more  JCAM 2010»
13 years 2 months ago
Random walk with long-range interaction with a barrier and its dual: Exact results
We consider the random walk on Z+ = {0, 1, ...} , with up and down transition probabilities given the chain is in state x {1, 2, ...}: (1) px = 1 2 ,, 1 2x +
Thierry Huillet
QEST
2006
IEEE
14 years 1 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 7 months ago
On Ritt's decomposition Theorem in the case of finite fields
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
Jaime Gutierrez, David Sevilla