A formality theorem for Hochschild chains

We prove Tsygan's formality conjecture for Hochschild chains of the algebra of functions on an arbitrary smooth manifold M using the Fedosov resolutions proposed in math.QA/0307212 and the formality quasi-isomorphism for Hochschild chains of R[[y¹,...,y^d]] proposed in paper math.QA/0010321 by Shoikhet. This result allows us to describe traces on the quantum algebra of functions on an arbitrary Poisson manifold.     

A proof of the Hoggatt-Bergum conjecture

It is proved that if and are positive integers such that the product of any two distinct elements of the set

increased by is a perfect square, then has to be . This is a generalization of the theorem of Baker and Davenport for .

     

A proof of MIKOTA's conjecture

Coming from MIKOTA's conjecture [1] a proof is given by examinating the properties of the occuring matrices M , K and M ^–1 K and deducing the natural frequencies of the chain structured mass-spring vibration system. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A proof of Nogura's conjecture

Answering a question of T. Nogura (1985), we show using the Open Coloring Axiom that the weak diagonal sequence property is preserved by taking products whenever the products themselves are Fréchet. As an application we show, using the same assumption, that the product of two Fréchet groups is Fréchet provided it is sequential. Recall that the product of two Fréchet groups may not be sequential.

     

A proof of Coleman's conjecture

Almost thirty years ago Coleman made a conjecture that for any convex lattice polygon with v vertices, g (g?1) interior lattice points and b boundary lattice points we have b?2g-v+10. In this note we give a proof of the conjecture. We also aim to describe all convex lattice polygons for which the bound b=2g-v+10 is attained.     

A proof of the bounded graph conjecture

Summary An infinite graph is called bounded if for every labelling of its vertices with natural numbers there exists a sequence of natural numbers which eventually exceeds the labelling along any ray in the graph. We prove an old conjecture of Halin, which characterizes the bounded graphs in terms of four forbidden topological subgraphs.Oblatum 17-IV-1991 & 25-X-1991     

A proof of Hougardy's conjecture for diamond-free graphs

A pair of vertices of a graph is called an even pair if every chordless path between them has an even number of edges. A graph is minimally even pair free if it is not a clique, contains no even pair, but every proper induced subgraph either contains an even pair or is a clique. Hougardy (European J. Combin. 16 (1995) 17–21) conjectured that a minimally even pair free graph is either an odd cycle of length at least five, the complement of an even or odd cycle of length at least five, or the linegraph of a bipartite graph. A diamond is a graph obtained from a complete graph on four vertices by removing an edge. In this paper we verify Hougardy's conjecture for diamond-free graphs by adapting the characterization of perfect diamond-free graphs given by Fonlupt and Zemirline (Maghreb Math. Rev. 1 (1992) 167–202).     

A proof of Freud's conjecture for exponential weights

LetW (x) be a function nonnegative inR, positive on a set of positive measure, and such that all power moments ofW ²(x) are finite. Let {p _n (W ²;x)} ₀ denote the sequence of orthonormal polynomials with respect to the weightW ²(x), and let {A _n } ₁ and {B _n } ₁ denote the coefficients in the recurrence relation

A proof of Sethares'''' conjecture

Let (?)(z) be holomorphic in the unit disk △ and meromorphic on △. Suppose / is a Teichmuller mapping with complex dilatation In 1968, Sethares conjectured that f is extremal if and only if either (i)(?) has a double pole or (ii)(?) has no pole of order exceeding two on (?)△. The "if" part of the conjecture had been solved by himself. We will give the affirmative answer to the "only if" part of the conjecture. In addition, a more general criterion for extremality of quasiconformal mappings is constructed in this paper, which generalizes the "if" part of Sethares' conjecture and improves the result by Reich and Shapiro in 1990.     

A simple proof of the Markoff conjecture for prime powers

We give a simple and independent proof of the result of Jack Button and Paul Schmutz that the Markoff conjecture on the uniqueness of the Markoff triples (a, b, c) where a ≤ b ≤ c holds whenever c is a prime power. We also indicate some further directions for investigation.      

A proof of the strong no loop conjecture

The strong no loop conjecture states that a simple module of finite projective dimension over an artin algebra has no non-zero self-extension. The main result of this paper establishes this well known conjecture for finite dimensional algebras over an algebraically closed field.     

A proof of the rooted tree alternative conjecture

Bonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative conjecture, J. Combinatorial Theory, Series B 96 (2006), 874-880] conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also make some progress towards the original conjecture for locally finite trees and state some new conjectures.     

A proof of Jones' conjecture

In this paper, we prove that Wright's equation $y^{\prime }(t)=?\alpha y(t?1)\{1+y(t)\}$ has a unique slowly oscillating periodic solution for parameter values $\alpha \in (\frac{\pi }{2},1.9]$, up to time translation. This result proves Jones' Conjecture formulated in 1962, that there is a unique slowly oscillating periodic orbit for all $\alpha >\frac{\pi }{2}$. Furthermore, there are no isolas of periodic solutions to Wright's equation; all periodic orbits arise from Hopf bifurcations.