Optimal Sobolev Imbeddings Involving Rearrangement-Invariant Quasinorms

Let m and n be positive integers with n2 and 1mn−1. We study rearrangement-invariant quasinorms _R and _D on functions f: (0, 1)→ such that to each bounded domain Ω in ⁿ, with Lebesgue measure |Ω|, there corresponds C=C(|Ω|)>0 for which one has the Sobolev imbedding inequality _R(u*(|Ω| t))C_D(|^mu|* (|Ω| t)), uC^m₀(Ω), involving the nonincreasing rearrangements of u and a certain mth order gradient of u. When m=1 we deal, in fact, with a closely related imbedding inequality of Talenti, in which _D need not be rearrangement-invariant, _R(u*(|Ω| t))C_D((d/dt) ∫_{{x ⁿ : |u(x)|>u*(|Ω| t)}} |(u)(x)| dx), uC¹₀(Ω). In both cases we are especially interested in when the quasinorms are optimal, in the sense that _R cannot be replaced by an essentially larger quasinorm and _D cannot be replaced by an essentially smaller one. Our results yield best possible refinements of such (limiting) Sobolev inequalities as those of Trudinger, Strichartz, Hansson, Brézis, and Wainger.     

Density and invariant means in left amenable semigroups

A left cancellative and left amenable semigroup S satisfies the Strong Følner Condition. That is, given any finite subset H of S and any >0, there is a finite nonempty subset F of S such that for each sH, |sFF|<|F|. This condition is useful in defining a very well behaved notion of density, which we call Følner density, via the notion of a left Følner net, that is a net F_ααD of finite nonempty subsets of S such that for each sS, (|sF_αF_α|)/|F_α| converges to 0. Motivated by a desire to show that this density behaves as it should on cartesian products, we were led to consider the set LIM₀(S) which is the set of left invariant means which are weak^* limits in l_∞(S)^* of left Følner nets. We show that the set of all left invariant means is the weak^* closure of the convex hull of LIM₀(S). (If S is a left amenable group, this is a relatively old result of C. Chou.) We obtain our desired density result as a corollary. We also show that the set of left invariant means on is actually equal to . We also derive some properties of the extreme points of the set of left invariant means on S, regarded as measures on βS, and investigate the algebraic implications of the assumption that there is a left invariant mean on S which is non-zero on some singleton subset of βS.     

Barrelledness of Spaces with Toeplitz Decompositions

A Toeplitz decomposition of a locally convex space E into subspaces (E_k) with projections (P_k) is a decomposition of every x  E as x = ∑_kP_kx, where ordinary summability has been replaced by summability with respect to an infinite and lower triangular regular matrix. We extend to the setting of Toeplitz decompositions a couple of results about barrelledness of Schauder decompositions. The first result, given for Schauder decompositions by Noll and Stadler, links the barrelledness of a normed space E to the barrelledness of the pieces E_k via the fact that E′ is big enough so as to coincide with its summability dual. Our second theorem, given for Schauder decompositions by Dı́az and Miñarro, links the quasibarrelledness of an ₀-quasibarrelled (in particular, (DF)) space E to the quasibarrelledness of the pieces E_k via the fact that the decomposition is simple.     

Symmetry in the vanishing of Ext over stably symmetric algebras

A Frobenius algebra over a field k is called symmetric if the Nakayama automorphism is an inner automorphism. A stably symmetric algebra is defined to be a generalization of a symmetric k-algebra. In this paper we will study symmetry in the vanishing of Ext for such algebras R, namely, for all finitely generated R-modules M and N, for all i0 if and only if for all i0. We show that a certain class of noetherian stably symmetric Gorenstein algebras, such as the group algebra of a finite group and the exterior algebra Λ(kⁿ) when n is odd, have this symmetry using Serre duality. We also show that every exterior algebra Λ(kⁿ), whether n is even or odd, has this symmetry for graded modules using Koszul duality.     

Subconvexity bounds for Rankin–Selberg L-functions for congruence subgroups

Estimation of shifted sums of Fourier coefficients of cusp forms plays crucial roles in analytic number theory. Its known region of holomorphy and bounds, however, depend on bounds toward the general Ramanujan conjecture. In this article, we extended such a shifted sum meromorphically to a larger half plane Res>1/2 and proved a better bound. As an application, we then proved a subconvexity bound for Rankin–Selberg L-functions which does not rely on bounds toward the Ramanujan conjecture: Let f be either a holomorphic cusp form of weight k, or a Maass cusp form with Laplace eigenvalue 1/4+k², for . Let g be a fixed holomorphic or Maass cusp form. What we obtained is the following bound for the L-function L(s,fg) in the k aspect:

L(1/2+it,fg)k^{1−1/(8+4θ)+ε},

where θ is from bounds toward the generalized Ramanujan conjecture. Note that a trivial θ=1/2 still yields a subconvexity bound.     

Vandermonde sets and super-Vandermonde sets

Given a set TGF(q), |T|=t, w_T is defined as the smallest positive integer k for which ∑_yTy^k≠0. It can be shown that w_Tt always and w_Tt−1 if the characteristic p divides t. T is called a Vandermonde set if w_Tt−1 and a super-Vandermonde set if w_T=t. This (extremal) algebraic property is interesting for its own right, but the original motivation comes from finite geometries. In this paper we classify small and large super-Vandermonde sets.     

Global existence, uniqueness, and continuous dependence for a semilinear initial value problem

In this paper, we consider the semilinear initial value problem associated with an operator A whose spectrum lies in a sector of the complex plane and whose resolvent satisfies (z−A)⁻¹M|z|^γ for some −1<γ<0 and all z outside the sector. The properties of existence and uniqueness of global mild solutions and continuous dependence on the initial data are investigated.     

Universal Polynomial Majorants on Convex Bodies

Let K be a convex body in ^d (d2), and denote by B_n(K) the set of all polynomials p_n in ^d of total degree n such that |p_n|1 on K. In this paper we consider the following question: does there exist a p*_nB_n(K) which majorates every element of B_n(K) outside of K? In other words can we find a minimal γ1 and p*_nB_n(K) so that |p_n(x)|γ |p*_n(x)| for every p_nB_n(K) and x ^d\K? We discuss the magnitude of γ and construct the universal majorants p*_n for evenn. It is shown that γ can be 1 only on ellipsoids. Moreover, γ=O(1) on polytopes and has at most polynomial growth with respect to n, in general, for every convex body K.     

A note on the limited stability of surface spline interpolation

Given a finite subset and data f_|Ξ, the surface spline interpolant to the data f_|Ξ is a function s which minimizes a certain seminorm subject to the interpolation conditions s_|Ξ=f_|Ξ. It is known that surface spline interpolation is stable on the Sobolev space W^m in the sense that s_L∞(Ω)constf_W^m, where m is an integer parameter which specifies the surface spline. In this note we show that surface spline interpolation is not stable on W^γ whenever .     

Approximate range searching using binary space partitions

We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(nlogn) such that -approximate range searching queries with any constant-complexity convex query range can be answered in O(min_>0{(1/)+k}logn) time, where k is the number of segments intersecting the -extended range. The same result can be obtained for disjoint constant-complexity curves, if we allow the BSP to use splitting curves along the given curves.We also describe how to construct a linear-size BSP tree for low-density scenes consisting of n objects in such that -approximate range searching with any constant-complexity convex query range can be done in O(logn+min_>0{(1/^d−1)+k}) time.     

Classification Theorems for General Orthogonal Polynomials on the Unit Circle

The set of all probability measures σ on the unit circle splits into three disjoint subsets depending on properties of the derived set of {|_n|²dσ}_n0, denoted by Lim(σ). Here {_n}_n0 are orthogonal polynomials in L²(dσ). The first subset is the set of Rakhmanov measures, i.e., of σ with {m}=Lim(σ), m being the normalized (m( )=1) Lebesgue measure on . The second subset Mar( ) consists of Markoff measures, i.e., of σ with mLim(σ), and is in fact the subject of study for the present paper. A measure σ, belongs to Mar( ) iff there are >0 and l>0 such that sup{|a_n+j|:0jl}>, n=0,1,2,…,{a_n} is the Geronimus parameters (=reflectioncoefficients) of σ. We use this equivalence to describe the asymptotic behavior of the zeros of the corresponding orthogonal polynomials (see Theorem G). The third subset consists of σ with {m}Lim(σ). We show that σ is ratio asymptotic iff either σ is a Rakhmanov measure or σ satisfies the López condition (which implies σMar( )). Measures σ satisfying Lim(σ)={ν} (i.e., weakly asymptotic measures) are also classified. Either ν is the sum of equal point masses placed at the roots of zⁿ=λ, λ , n=1,2,…, or ν is the equilibrium measure (with respect to the logarithmic kernel) for the inverse image under an m-preserving endomorphism z→zⁿ, n=1,2,…, of a closed arc J (including J= ) with removed open concentric arc J₀ (including J₀=). Next, weakly asymptotic measures are completely described in terms of their Geronimus parameters. Finally, we obtain explicit formulae for the parameters of the equilibrium measures ν and show that these measures satisfy {ν}=Lim(ν).     

About equivalent interval colorings of weighted graphs

Given a graph G=(V,E) with strictly positive integer weights ω_i on the vertices iV, a k-interval coloring of G is a function I that assigns an interval I(i){1,…,k} of ω_i consecutive integers (called colors) to each vertex iV. If two adjacent vertices x and y have common colors, i.e. I(i)∩I(j)≠0/ for an edge [i,j] in G, then the edge [i,j] is said conflicting. A k-interval coloring without conflicting edges is said legal. The interval coloring problem (ICP) is to determine the smallest integer k, called interval chromatic number of G and denoted χ_int(G), such that there exists a legal k-interval coloring of G. For a fixed integer k, the k-interval graph coloring problem (k-ICP) is to determine a k-interval coloring of G with a minimum number of conflicting edges. The ICP and k-ICP generalize classical vertex coloring problems where a single color has to be assigned to each vertex (i.e., ω_i=1 for all vertices iV).Two k-interval colorings I₁ and I₂ are said equivalent if there is a permutation π of the integers 1,…,k such that ℓI₁(i) if and only if π(ℓ)I₂(i) for all vertices iV. As for classical vertex coloring, the efficiency of algorithms that solve the ICP or the k-ICP can be increased by avoiding considering equivalent k-interval colorings, assuming that they can be identified very quickly. To this purpose, we define and prove a necessary and sufficient condition for the equivalence of two k-interval colorings. We then show how a simple tabu search algorithm for the k-ICP can possibly be improved by forbidding the visit of equivalent solutions.     

An Inequality on the Size of a Set in a Cartesian Product

Let Ω be a finite subset of the Cartesian productW₁  ×   × W_nof n sets. ForA    {1, 2, , n }, denote by Ω_Athe projection ofΩ onto the Cartesian product of W_i, i   A. Generalizing an inequality given in an article by Shen, we prove that | Ω |² ≤  |Ω_A1 || Ω_Ak| provided that { A₁, , A_k} is a double cover of {1, 2, , n }. This inequality is applied to give some bounds on the numbers of special subgraphs of a graph.     

Strong characterizing sequences for subgroups of compact groups

In [A. Biró, V.T. Sós, Strong characterizing sequences in simultaneous Diophantine approximation, J. Number Theory 99 (2003) 405–414] we proved that if Γ is a subgroup of the torus R/Z generated by finitely many independent irrationals, then there is an infinite subset AZ which characterizes Γ in the sense that for γR/Z we have ∑_aAaγ<∞ if and only if γΓ. Here we consider a general compact metrizable Abelian group G instead of R/Z, and we characterize its finitely generated free subgroups Γ by subsets AG^*, where G^* is the Pontriagin dual of G. For this case we prove stronger forms of the analogue of the theorem of the above mentioned work, and we find necessary and sufficient conditions for a kind of strengthening of this statement to be true.     

Optimal Recovery of the Derivative of Periodic Analytic Functions from Hardy Classes

LetS_β{z : |Im z|<β}. For 2π-periodic functions which are analytic inS_βwithp-integrable boundary values, we construct an optimal method of recovery off′(ξ), ξS_β, using information about the valuesf(x₁), mldr;, f(x_n), x_j[0, 2π).     

Attractors of the reaction-diffusion systems with rapidly oscillating coefficients and their homogenization

The following reaction-diffusion system in spatially non-homogeneous almost-periodic media is considered in a bounded domain : (1)∂_tu=Au−f(u)+g, u|_∂Ω=0. Here u=(u¹,…,u^k) is an unknown vector-valued function, f is a given nonlinear interaction function and the second order elliptic operator A has the following structure: where a_ij^l(y) are given almost-periodic functions. We prove that, under natural assumptions on the nonlinear term f(u), the longtime behavior of solutions of (1) can be described in terms of the global attractor of the associated dynamical system and that the attractors  , 0<<₀1, converge to the attractor of the homogenized problem (1) as →0. Moreover, in the particular case of periodic media, we give explicit estimates for the distance between the non-homogenized and the homogenized attractors in terms of the parameter .     

Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

Given a planar convex set C, we give sublinear approximation algorithms to determine approximations of the largest axially symmetric convex set S contained in C, and the smallest such set S^′ that contains C. More precisely, for any >0, we find an axially symmetric convex polygon QC with area |Q|>(1−)|S| and we find an axially symmetric convex polygon Q^′ containing C with area |Q^′|<(1+)|S^′|. We assume that C is given in a data structure that allows to answer the following two types of query in time T_C: given a direction u, find an extreme point of C in direction u, and given a line ℓ, find C∩ℓ. For instance, if C is a convex n-gon and its vertices are given in a sorted array, then T_C=O(logn). Then we can find Q and Q^′ in time O(^−1/2T_C+^−3/2). Using these techniques, we can also find approximations to the perimeter, area, diameter, width, smallest enclosing rectangle and smallest enclosing circle of C in time O(^−1/2T_C).     

Borne sur la torsion dans les variétés abéliennes de type CM

Let A be an abelian variety of dimension g1 defined over a number field K. We study the size of the torsion group A(F)_tors where F/K is a finite extension and more precisely we study the best possible exponent γ in the inequality Card(A(F)_tors)[F:K]^γ when F is any finite extension of K. In the CM case we give an exact formula for the exponent γ in terms of the characters of the Mumford–Tate group—a torus in this case—and discuss briefly the general case.Finally we give an application of the main result in direction of a generalisation of the Manin–Mumford conjecture.     

Long time behaviour for generalized complex Ginzburg–Landau equation

In this paper, the two-dimensional generalized complex Ginzburg–Landau equation (CGL)

u_t=ρu−Δφ(u)−(1+iγ)Δu−νΔ²u−(1+iμ)|u|^2σu+αλ₁(|u|²u)+β(λ₂)|u|²