Sciweavers

35 search results - page 5 / 7
» jct 2000
Sort
View
JCT
2000
94views more  JCT 2000»
13 years 8 months ago
Combinatorial Flag Varieties
We prove that -matroids associated with maps on compact closed surfaces are representable, with the space of representation provided by cohomology of the surface with punctured po...
Alexandre V. Borovik, Israel M. Gelfand, Neil Whit...
JCT
2006
46views more  JCT 2006»
13 years 8 months ago
Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function--proving a conjecture of Guttmann [Discrete Math. 217 (2000) 167
Andrew Rechnitzer
JCT
2000
103views more  JCT 2000»
13 years 8 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
JCT
2000
91views more  JCT 2000»
13 years 8 months ago
Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater
We answer a question posed by Lampert and Slater [7]. Consider a sequence of real numbers qn in the interval [0, 1] defined by q0 = 0, q1 = 1, and, for n 1, qn+1 equals an averag...
Neil J. Calkin, E. Rodney Canfield, Herbert S. Wil...
JCT
2000
90views more  JCT 2000»
13 years 8 months ago
The Spider Poset Is Macaulay
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l (cf. Fig. 1). We show that for any n 1 the nth cartesian power of
Sergei L. Bezrukov, Robert Elsässer