Type

Database

Creator

Date

Thumbnail

# Search results

15,838 records were found.

## Partial cubes: structures, characterizations, and constructions

Comment: 36 pages, 17 figures

## On the HOMFLY and Tutte polynomials

Comment: This paper has been withdrawn due to an error in Lemma 8

## Mediatic graphs

Comment: Four axioms replaced by two; two references added; Fig.6 corrected

## Catalan's intervals and realizers of triangulations

Comment: 22 pages

## Uniform random sampling of planar graphs in linear time

Comment: 55 pages

## Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity

Comment: 37 pages, 3 figures

## The Label Algorithm For Irreducible Decomposition of Monomial Ideals

The paper that was here is a preprint that was never turned into a proper paper. In particular it does not have enough citations to the literature. The paper "The Slice Algorithm For Irreducible Decomposition of Monomial Ideals" contains a much better description of the Label algorithm than this preprint did. If you still wish to read the original preprint then access the arXiv's version 1 of this paper, instead of version 2 which is what you are reading now.

## On the generalization of the Costas property in the continuum

We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct Costas bijections in the real continuum within the class of piecewise continuously differentiable functions, but our attempts to construct a fractal-like Costas bijection there are successful only under slight but necessary deviations from the usual arithmetic laws. Furthermore, we are able, contingent on the validity of Artin's conjecture, to set up a limiting process according to which sequences of Welch Costas arrays converge to smooth Costas bijections over the reals. The situation over the rationals is different: there, we propose an algorithm of great generality and flexibility for the construct...