๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Conjecture Concerning the Spectrum of a Sentence

โœ Scribed by Christopher J. Ash

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
268 KB
Volume
40
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

We give a plausibleโ€sounding conjecture involving the number of nโ€equivalence classes of structures of size m which would imply that the complement of a spectrum is also a spectrum.

Mathematics Subject Classification: 03B10, 03D15, 68Q15.

๐Ÿ“œ SIMILAR VOLUMES

On a Conjecture Concerning a Theorem of
On a Conjecture Concerning a Theorem of Cramรฉr and Wold
โœ Guenther Walther ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 302 KB

A conjecture concerning the Crame r Wold device is answered in the negative by giving a Fourier-free, probabilistic proof using only elementary techniques. It is also shown how a geometric idea allows one to interpret the Crame r Wold device as a special case of a more general concept.

On a conjecture of Thomassen concerning
On a conjecture of Thomassen concerning subgraphs of large girth
โœ Domingos Dellamonica Jr; Vรกclav Koubek; Daniel M. Martin; Vojtฤ›ch Rรถdl ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 156 KB

In 1983 C. Thomassen conjectured that for every k, g โˆˆ N there exists d such that any graph with average degree at least d contains a subgraph with average degree at least k and girth at least g. Kรผhn and Osthus [2004] proved the case g = 6. We give another proof for the case g = 6 which is based

On a Conjecture Concerning Monotonicity
On a Conjecture Concerning Monotonicity of Zeros of Ultraspherical Polynomials
โœ Dimitar K. Dimitrov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

Let C \* n , n=0, 1, ..., \*>&1ร‚2 be the ultraspherical (Gegenbauer) polynomials, orthogonal on (&1, 1) with respect to the weight (1&x 2 ) \*&1ร‚2 . Denote by `n, k (\*), k=1, ..., [nร‚2] the positive zeros of C \* n enumerated in decreasing order. The problem of finding the ``extremal'' function f f

A Proof of a Conjecture of Bondy Concern
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs
โœ B. Bollobรกs; A.D. Scott ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 365 KB

Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in e