Sciweavers

1368 search results - page 20 / 274
» Generalized Rook Polynomials
Sort
View
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
COMBINATORICS
2006
96views more  COMBINATORICS 2006»
13 years 8 months ago
A New Statistic on Linear and Circular r-Mino Arrangements
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Mark A. Shattuck, Carl G. Wagner
APPML
2007
76views more  APPML 2007»
13 years 8 months ago
A distance bound for pseudospectra of matrix polynomials
In this note, we obtain a lower bound for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it, generalizing a known result on pseu...
Panayiotis Psarrakos
TCS
2011
13 years 3 months ago
The three column Bandpass problem is solvable in linear time
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
Zhong Li, Guohui Lin
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 4 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska