Yan’s oscillation theorem revisited

Yan’s contribution [J. Yan, Oscillation theorems for second order linear differential equations with damping, Proc. Amer. Math. Soc. 98 (1986) 276–282] was an important breakthrough in the development of the Theory of Oscillation. This frequently cited paper has stimulated extensive investigations in the field. During the last decade, an integral oscillation technique has been developed to such an extent as to allow us to revisit Yan’s fundamental oscillation theorem and remove one of the conditions, leaving the other assumptions and the conclusion intact, thus enhancing this keystone result.     

Berkson’s theorem

We give a new proof of the theorem that Amitsur’s complex for purely inseparable field extensions has vanishing homology in dimensions higher than 2. This is accomplished by computing the kernel and cokernel of the logarithmic derivativet →Dt/t mapping the multiplicative Amitsur complex to the acyclic additive one (D is a derivation of the extension field). This research was supported by National Science Foundation grant NSF GP 1649.     

Higman’s question revisited

We construct a two-generated group with the co-recursively enumerable word problem that has no presentation by recursive permutations. This answers Higman’s question and exemplifies a group with the minimal possible number of generators. The previous article [1], in which that question was claimed settled, contains an incorrigible error. Dedicated to the 60th birthday of Academician Yu. L. Ershov Supported by the Alexander von Humboldt Foundation. This result was obtained during my work at the University of Heidelberg (Germany) as Alexander von Humboldt Research Fellow. The term a “II-group” was proposed by A. Nies. Translated fromAlgebra i Logika, Vol. 39, No. 2, pp. 134–144, March–April, 2000.     

Dawson’s chess revisited

In this paper we prove that in a Quasi-Dawson’s Chess (a restricted version of Dawson’s Chess) playing on a 3 × d board, the first player is loser if and only if d (mod)5 = 1 or d (mod)5 = 2. Furthermore, we have designed two algorithms that are responsible for storing the results of Quasi-Dawson’s Chess games having less than d + 1 files and finding the strategy that leads to win, if there is a possibility of winning (by a wining position, we mean one from which one can win with best play). Moreover we show that the total complexity of our algorithms is O(d ²). Finally we have implemented our algorithm in C₊₊ which admits the main results of the paper even for large values of d.     

Martin’s maximum revisited

We present several results relating the general theory of the stationary tower forcing developed by Woodin with forcing axioms. In particular we show that, in combination with class many Woodin cardinals, the forcing axiom MM⁺⁺ makes the \({\Pi_2}\)-fragment of the theory of \({H_{\aleph_2}}\) invariant with respect to stationary set preserving forcings that preserve BMM. We argue that this is a promising generalization to \({H_{\aleph_2}}\) of Woodin’s absoluteness results for \({L(\mathbb{R})}\). In due course of proving this, we shall give a new proof of some of these results of Woodin. Finally we relate our generic absoluteness results with the resurrection axioms introduced by Hamkins and Johnstone and with their unbounded versions introduced by Tsaprounis.     

Pythagoras’s oxen revisited

it is said that when Pythagoras discovered his famous theorem, in a right-angled triangle the squares of the smaller sides sum up to the square of the hypoteneuse, he sacrificed a hundred oxen to thank the gods.     

Herman’s theory revisited

We prove that a C ^2+α -smooth orientation-preserving circle diffeomorphism with rotation number in Diophantine class D _δ , 0≤δ<α≤1, α−δ≠1, is C ^1+α−δ -smoothly conjugate to a rigid rotation. This is the first sharp result on the smoothness of the conjugacy. We also derive the most precise version of Denjoy’s inequality for such diffeomorphisms.     

On Jordan’s theorem

In the present paper, we give some remarks on the well-known Jordan theorem and Hamiltonians.     

Extending Kotzig’s theorem

The weight of a graphG is the minimum sum of the two degrees of the end points of edges ofG. Kotzig proved that every graph triangulating the sphere has weight at most 13, and Grünbaum and Shephard proved that every graph triangulating the torus has weight at most 15. We extend these results for graphs, multigraphs and pseudographs “triangulating” the sphere withg handlesS _g ,g≧1, showing that the corresponding weights are at most about and 24g−9, respectively; if a (multi, pseudo) graph triangulatesS _g and it is big enough, then its weight is at most 15.     

Connected Baranyai’s theorem

Let K _n ^h = (V, ( _h ^V )) be the complete h-uniform hypergraph on vertex set V with ¦V¦ = n. Baranyai showed that K _n ^h can be expressed as the union of edge-disjoint r-regular factors if and only if h divides rn and r divides \((_{h - 1}^{n - 1} )\) . Using a new proof technique, in this paper we prove that λK _n ^h can be expressed as the union \(\mathcal{G}_1 \cup ... \cup \mathcal{G}_k \) of k edge-disjoint factors, where for 1≤i≤k, \(\mathcal{G}_i \) is r _i -regular, if and only if (i) h divides r _i n for 1≤i≤k, and (ii) \(\sum\nolimits_{i = 1}^k {r_i = \lambda (_{h - 1}^{n - 1} )} \) . Moreover, for any i (1≤i≤k) for which r _i ≥2, this new technique allows us to guarantee that \(\mathcal{G}_i \) is connected, generalizing Baranyai’s theorem, and answering a question by Katona.     

Rosenberg’s reconstruction theorem

Alexander L. Rosenberg has constructed a spectrum for abelian categories which is able to reconstruct a quasi-separated scheme from its category of quasi-coherent sheaves. In this note we present a detailed proof of this result which is due to Ofer Gabber. Moreover, we determine the automorphism class group of the category of quasi-coherent sheaves.     

On Litoff’s theorem

We give a short proof of Litoff’s theorem from the viewpoint of completely reducible modules.     

Local dynamics of intersections: V. I. Arnold’s theorem revisited

V. I. Arnold proved in 1993 that the intersection multiplicity between two germs of analytic subvarieties at a fixed point of a holomorphic invertible self-map remains bounded when one of the germs is dragged by iterations of the self-map. The proof is based on the Skolem-Mahler-Lech theorem on zeros in recurrent sequences. We give a different proof, based on the Noetherianity of certain algebras, which allows one to generalize Arnold’s theorem for local actions of arbitrary finitely generated commutative groups, with both discrete and infinitesimal generators. Simple examples show that for non-commutative groups the analogous assertion fails.