The Elliott conjecture for Villadsen algebras of the first type

We study the class of simple C^∗-algebras introduced by Villadsen in his pioneering work on perforated ordered K-theory. We establish six equivalent characterisations of the proper subclass which satisfies the strong form of Elliott's classification conjecture: two C^∗-algebraic (Z-stability and approximate divisibility), one K-theoretic (strict comparison of positive elements), and three topological (finite decomposition rank, slow dimension growth, and bounded dimension growth). The equivalence of Z-stability and strict comparison constitutes a stably finite version of Kirchberg's characterisation of purely infinite C^∗-algebras. The other equivalences confirm, for Villadsen's algebras, heretofore conjectural relationships between various notions of good behaviour for nuclear C^∗-algebras.     

Generalizations of the image conjecture and the Mathieu conjecture

We first propose a generalization of the image conjecture Zhao (submitted for publication) [31] for the commuting differential operators related with classical orthogonal polynomials. We then show that the non-trivial case of this generalized image conjecture is equivalent to a variation of the Mathieu conjecture Mathieu (1997) [21] from integrals of G-finite functions over reductive Lie groups G to integrals of polynomials over open subsets of Rⁿ with any positive measures. Via this equivalence, the generalized image conjecture can also be viewed as a natural variation of the Duistermaat and van der Kallen theorem Duistermaat and van der Kallen (1998) [14] on Laurent polynomials with no constant terms. To put all the conjectures above in a common setting, we introduce what we call the Mathieu subspaces of associative algebras. We also discuss some examples of Mathieu subspaces from other sources and derive some general results on this newly introduced notion.     

A note on Greenberg's conjecture and the abc conjecture

For any totally real number field and any prime number , Greenberg's conjecture for asserts that the Iwasawa invariants and are both zero. For a fixed real abelian field , we prove that the conjecture is ``affirmative' for infinitely many (which split in if we assume the abc conjecture for .

     

New results on the conjecture of Rhodes and on the topological conjecture

The Conjecture of Rhodes, originally called the “type II conjecture” by Rhodes, gives an algorithm to compute the kernel of a finite semigroup. This conjecture has numerous important consequences and is one of the most attractive problems on finite semigroups. It was known that the conjecture of Rhodes is a consequence of another conjecture on the finite group topology for the free monoid. In this paper, we show that the topological conjecture and the conjecture of Rhodes are both equivalent to a third conjecture and we prove this third conjecture in a number of significant particular cases.     

Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture

Summary We show that Walter Neumann's strengthened form of Hanna Neumann's conjecture on the best possible upper bound for the rank of the intersection of two subgroups of a free group is equivalent to a conjecture on the best possible upper bound for the number of edges in a bipartite graph with a certain weak symmetry condition. We illustrate the usefulness of this equivalence by deriving relatively easily certain previously known results.Oblatum 30-VIII-1993     

On the Cameron-Praeger conjecture

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that the Cameron-Praeger conjecture is true for the important case of non-trivial Steiner 6-designs, i.e. for 6-(v,k,λ) designs with λ=1, except possibly when the group is PΓL(2,pe) with p=2 or 3, and e is an odd prime power.     

On the multiplier conjecture

The Multiplier Theorem is a celebrated theorem in the Design theory. The conditionp>λ is crucial to all known proofs of the multiplier theorem. However in all known examples of difference sets μ _p . is a multiplier for every primep with (p, v)=1 andp‖n. Thus there is the multiplier conjecture: “The multiplier theorem holds without the assumption thatp>λ”. The general form of the multiplier theorem may be viewed as an attempt to partially resolve the multiplier conjecture, where the assumption “p>λ” is replaced by “n ₁>λ”. Since then Newman (1963), Turyn (1964), and McFarland (1970) attempted to partially resolve the multiplier conjecture (see [7], [8], [9]). This paper will prove the following result using the representation theory of finite groups and the algebraic number theory: LetG be an abelian group of orderv,v ₀ be the exponent ofG, andD be a (v, k, λ)-difference set inG. Ifn=2_{n 1}, then the general form of the multiplier theorem holds without the assumption thatn ₁>λ in any of the following cases:

Towards the Willmore conjecture

We develop a variety of approaches, mainly using integral geometry, to proving that the integral of the square of the mean curvature of a torus immersed in must always take a value no less than . Our partial results, phrased mainly within the -formulation of the problem, are typically strongest when the Gauss curvature can be controlled in terms of extrinsic curvatures or when the torus enjoys further properties related to its distribution within the ambient space (see Sect. 3). Corollaries include a recent result of Ros [20] confirming the Willmore conjecture for surfaces invariant under the antipodal map, and a strengthening of the expected results for flat tori. The value arises in this work in a number of different ways – as the volume (or renormalised volume) of or , and in terms of the length of shortest nontrivial loops in subgroups of SO(4). Received April 26, 1999 / Accepted January 14, 2000 / Published online June 28, 2000     

On the points-lines-planes conjecture

It has been conjectured that in any matroid, if W₁, W₂, W₃ denote the number of points, lines, and planes respectively, then W₂² ≥ W₁W₃. We prove this conjecture (and some strengthenings) for matroids in which no line has five or more points, thus generalizing a result of Stonesifer, who proved it for graphic matroids.     

On the Vergne conjecture

Consider a Hamiltonian action by a compact Lie group on a possibly non-compact symplectic manifold. We give a short proof of a geometric formula for the decomposition into irreducible representations of the equivariant index of a \({{\mathrm{{{\mathrm{Spin}}}^c}}}\)-Dirac operator in this context. This formula was conjectured by Vergne in (Eur Math Soc Zürich I:635–664, 2007) and proved by Ma and Zhang in (Acta Math 212:11–57, 2014).     

On the direct sum conjecture

We prove the direct sum conjecture for various sets of systems of bilinear forms. Our results depend on a priori knowledge of the complexity of at least one of the direct summands and its underlying algebraic structure. We also briefly survey some previous results concerning the complexity and structure of minimal algorithms for various direct sum systems.     

Proof of the Razumov-Stroganov conjecture

The Razumov-Stroganov conjecture relates the ground-state coefficients in the periodic even-length dense O(1) loop model to the enumeration of fully-packed loop configurations on the square, with alternating boundary conditions, refined according to the link pattern for the boundary points.Here we prove this conjecture, by means of purely combinatorial methods. The main ingredient is a generalization of the Wieland proof technique for the dihedral symmetry of these classes, based on the ‘gyration’ operation, whose full strength we will investigate in a companion paper.     

On checking the Goldbach conjecture

This paper describes an attempt to check Goldbach's conjecture on a digital computer. The validity of the conjecture has been numerically verified up toN=33,000,000.     

Extensions of the Multiplicity conjecture

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded -algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several directions. We discuss when these bounds are sharp, find a sharp lower bound in the case of not necessarily arithmetically Cohen-Macaulay one-dimensional schemes of 3-space, and propose an upper bound for finitely generated graded torsion modules. We establish this bound for torsion modules whose codimension is at most two.

     

Proof of the BMV conjecture

We prove the BMV (Bessis, Moussa, Villani, [1]) conjecture, which states that the function ${t \mapsto \mathop{\rm Tr}\exp(A-tB)}$ , ${t \geqslant 0}$ , is the Laplace transform of a positive measure on [0,∞) if A and B are ${n \times n}$ Hermitian matrices and B is positive semidefinite. A semi-explicit representation for this measure is given.