The Friedlander-Gordon-Miller conjecture is true
نویسندگان
چکیده
We complete the proof of the Friedlander, Gordon and Miller Conjecture that every finite abelian group whose Sylow 2-subgroup either is trivial or both non-trivial and non-cyclic is R-sequenceable. This settles a question of Ringel for abelian groups.
منابع مشابه
The Friedlander – Milnor Conjecture
Conjecture 32.1 is easily seen to be true for a torus (i.e., G G r m for some r 0), but even the simplest non-trivial case (that of G SL2 ) remains inaccessible. Guido and I published 5 papers together, all in some sense connected with this conjecture. We used the integral form GZ of a complex reductive algebraic group (which is a group scheme over Spec Z ) in order to form the group G(F) of po...
متن کامل$L_1$-Biharmonic Hypersurfaces in Euclidean Spaces with Three Distinct Principal Curvatures
Chen's biharmonic conjecture is well-known and stays open: The only biharmonic submanifolds of Euclidean spaces are the minimal ones. In this paper, we consider an advanced version of the conjecture, replacing $Delta$ by its extension, $L_1$-operator ($L_1$-conjecture). The $L_1$-conjecture states that any $L_1$-biharmonic Euclidean hypersurface is 1-minimal. We prove that the $L_1$-conje...
متن کاملRemarks on the Membrane and Buckling Eigenvalues for Planar Domains
I present a counter-example to the conjecture that the first eigenvalue of the clamped buckling problem in a planar domain is not smaller than the third eigenvalue of the fixed membrane in that domain. I also prove that the conjecture holds for domains that are invariant under rotation by angle π/2.
متن کاملThe Prime Power Conjecture is True for
The Prime Power Conjecture (PPC) states that abelian planar difference sets of order n exist only for n a prime power. Evans and Mann [1] verified this for cyclic difference sets for n ≤ 1600. In this paper we use the Mann test to verify the PPC for n ≤ 2, 000, 000.
متن کاملThe Prime Power Conjecture is True for n < 2, 000, 000
The Prime Power Conjecture (PPC) states that abelian planar diierence sets of order n exist only for n a prime power. Evans and Mann 2] veriied this for cyclic diierence sets for n 1600. In this paper we verify the PPC for n 2;000;000, using many necessary conditions on the group of multipliers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 67 شماره
صفحات -
تاریخ انتشار 2017