A bilinear approach to the restriction and Kakeya conjectures

Bilinear restriction estimates have appeared in work of Bourgain, Klainerman, and Machedon. In this paper we develop the theory of these estimates (together with the analogues for Kakeya estimates). As a consequence we improve the spherical restriction theorem of Wolff from to , and also obtain a sharp spherical restriction theorem for .

     

A sufficient degree condition for a graph to contain all trees of size <Emphasis Type="Italic">k</Emphasis>

The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k formulated in terms of the minimum edge degree ζ(G) of a graph G defined as ζ(G) = min{d(u) + d(v) − 2: uv ∈ E(G)}. More precisely, we show that a connected graph G with maximum degree Δ(G) ≥ k and minimum edge degree ζ(G) ≥ 2k − 4 contains every tree of k edges if d _G (x) + d _G (y) ≥ 2k − 4 for all pairs x, y of nonadjacent neighbors of a vertex u of d _G (u) ≥ k.     

The Structure of the Reduced Product of Preinjective Modules Over a Hereditary Right Pure Semisimple Ring

Abstract

For a monoid S , a (left) S -act is a nonempty set B together with a mapping S ×B→B sending (s, b) to sb such that S (tb)?=?lpar;st)b and 1b ?=?b for all S , t?∈?S and B ?∈?B. Right S -acts A can also be defined, and a tensor product A ??? _s B (a set)can be defined that has the customary universal property with respect to balanced maps from A?×?B into arbitrary sets. Over the past three decades, an extensive theory of flatness properties has been developed (involving free and projective acts, and flat acts of various sorts, defined in terms of when the tensor product functor has certain preservation properties). A recent and complete discussion of this area is contained in the monograph Monoids, Acts and Categories by M. Kilp et al. (New York: Walter de Gruyter, 2000). To date, there have been only a few attempts to generalize this material to ordered monoids acting on partially ordered sets ( S -posets). The present paper is devoted to such a generalization. A unique decomposition theorem for S -posets is given, based on strongly convex, indecomposable S -subposets, and a structure theorem for projective S -posets is given. A criterion for when two elements of the tensor product of S -posets given, which is then applied to investigate several flatness properties.     

A class of counterexamples to the Gel´fand-Kirillov conjecture

Let be a connected non-special semisimple algebraic group and let be a finite dimensional -representation such that has trivial generic stabilizer. Let . Then the semi-direct product is a counter-example to the Gel´fand-Kirillov conjecture.

     

Frames and the Feichtinger conjecture

We show that the conjectured generalization of the Bourgain-Tzafriri restricted-invertibility theorem is equivalent to the conjecture of Feichtinger, stating that every bounded frame can be written as a finite union of Riesz basic sequences. We prove that any bounded frame can at least be written as a finite union of linearly independent sequences. We further show that the two conjectures are implied by the paving conjecture. Finally, we show that Weyl-Heisenberg frames over rational lattices are finite unions of Riesz basic sequences.

     

Prime specialization in genus 0

For a prime polynomial , a classical conjecture predicts how often has prime values. For a finite field and a prime polynomial , the natural analogue of this conjecture (a prediction for how often takes prime values on ) is not generally true when is a polynomial in ( the characteristic of ). The explanation rests on a new global obstruction which can be measured by an appropriate average of the nonzero Möbius values as varies. We prove the surprising fact that this ``Möbius average,' which can be defined without reference to any conjectures, has a periodic behavior governed by the geometry of the plane curve .

The periodic Möbius average behavior implies in specific examples that a polynomial in does not take prime values as often as analogies with suggest, and it leads to a modified conjecture for how often prime values occur.

     

Dade's Invariant Conjecture for the Symplectic Group Sp4(2 n ) and the Special Unitary Group SU4(22n ) in Defining Characteristic

In this article, we verify Dade's projective invariant conjecture for the symplectic group Sp₄(2 ⁿ ) and the special unitary group SU₄(2²ⁿ ) in the defining characteristic, that is, in characteristic 2. Furthermore, we show that the Isaacs–Malle–Navarro version of the McKay conjecture holds for Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) in the defining characteristic, that is, Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) are good for the prime 2 in the sense of Isaacs, Malle, and Navarro.     

On a conjecture of Károly Bezdek and János Pach

Summary The following conjecture of K\'aroly Bezdek and J\'anos Pach is cited in~[1]. If <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>K\subset{\mathbb R}^d$ is a convex body then any packing of pairwise touching positive homothets of $K$ consists of at most $2^d$ copies of $K$. We prove a weaker bound, $2^{d+1}$.     

An Algebraic Formulation of the Graph Reconstruction Conjecture

The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck—the collection of its vertex‐deleted subgraphs. Kocay's Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph G and any finite sequence of graphs, it gives a linear constraint that every reconstruction of G must satisfy. Let be the number of distinct (mutually nonisomorphic) graphs on n vertices, and let be the number of distinct decks that can be constructed from these graphs. Then the difference measures how many graphs cannot be reconstructed from their decks. In particular, the graph reconstruction conjecture is true for n‐vertex graphs if and only if . We give a framework based on Kocay's lemma to study this discrepancy. We prove that if M is a matrix of covering numbers of graphs by sequences of graphs, then . In particular, all n‐vertex graphs are reconstructible if one such matrix has rank . To complement this result, we prove that it is possible to choose a family of sequences of graphs such that the corresponding matrix M of covering numbers satisfies .     

Proof of a conjecture by Đoković on the Poincaré series of the invariants of a binary form

?okovi? (2006)  [3] gave an algorithm for the computation of the Poincaré series of the algebra of invariants of a binary form, where the correctness proof for the algorithm depended on an unproven conjecture. Here we prove this conjecture.     

Nonexistence of abelian difference sets: Lander's conjecture for prime power orders

In 1963 Ryser conjectured that there are no circulant Hadamard matrices of order 4$"> and no cyclic difference sets whose order is not coprime to the group order. These conjectures are special cases of Lander's conjecture which asserts that there is no abelian group with a cyclic Sylow -subgroup containing a difference set of order divisible by . We verify Lander's conjecture for all difference sets whose order is a power of a prime greater than 3.

     

Families of varieties of general type over compact bases

Let be a smooth family of canonically polarized complex varieties over a smooth base. Generalizing the classical Shafarevich hyperbolicity conjecture, Viehweg conjectured that Y is necessarily of log general type if the family has maximal variation. A somewhat stronger and more precise version of Viehweg's conjecture was shown by the authors in [S. Kebekus, S.J. Kovács, Families of canonically polarized varieties over surfaces, preprint math.AG/0511378; Invent. Math. (2008), doi: 10.1007/s00222-008-0128-8; S. Kebekus, S.J. Kovács, The structure of surfaces mapping to the moduli stack of canonically polarized varieties, arXiv: 0707.2054v1 [math.AG], 2007] in the case where Y is a quasi-projective surface. Assuming that the minimal model program holds, this very short paper proves the same result for projective base manifolds Y of arbitrary dimension.     

Coefficients of ternary cyclotomic polynomials

It is customary to define a cyclotomic polynomial Φn(x) to be ternary if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Φn(x) and M(p) be the maximum of A(pqr). In 1968, Sister Marion Beiter (1968, 1971) [3] and [4] conjectured that . In 2008, Yves Gallot and Pieter Moree (2009) [6] showed that the conjecture is false for every p≥11, and they proposed the Corrected Beiter conjecture: . Here we will give a sufficient condition for the Corrected Beiter conjecture and prove it when p=7.     

Analogue of the degree conjecture over function fields

Under a certain assumption, similar to Manin's conjecture, we prove an upper bound on the degree of modular parametrizations of elliptic curves by Drinfeld modular curves, which is the function field analogue of the conjectured bound over the rational numbers.

     

Schanuel's Conjecture and Algebraic Roots of Exponential Polynomials

In this article, I will prove that assuming Schanuel's conjecture, an exponential polynomial with algebraic coefficients can have only finitely many algebraic roots. Furthermore, this proof demonstrates that there are no unexpected algebraic roots of any such exponential polynomial. This implies a special case of Shapiro's conjecture: if p(x) and q(x) are two exponential polynomials with algebraic coefficients, each involving only one iteration of the exponential map, and they have common factors only of the form exp (g) for some exponential polynomial g, then p and q have only finitely many common zeros.     

The ultra‐weak Ash conjecture and some particular cases

Ash's functions N _{σ ,k} count the number of k ‐equivalence classes of σ ‐structures of size n . Some conditions on their asymptotic behavior imply the long standing spectrum conjecture. We present a new condition which is equivalent to this conjecture and we discriminate some easy and difficult particular cases. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.