Transferring strong boundedness among Laguerre orthogonal systems

Given the family of Laguerre polynomials, it is known that several orthonormal systems of Laguerre functions can be considered. In this paper we prove that an exhaustive knowledge of the boundedness in weighted L ^p of the heat and Poisson semigroups, Riesz transforms and g-functions associated to a particular Laguerre orthonormal system of functions, implies a complete knowledge of the boundedness of the corresponding operators on the other Laguerre orthonormal system of functions. As a byproduct, new weighted L ^p boundedness are obtained. The method also allows us to get new weighted estimates for operators related with Laguerre polynomials. Carlos Segovia passed away on April 3, 2007.     

A proof of the uniform boundedness of solutions to the wave equation on slowly rotating Kerr backgrounds

We consider Kerr spacetimes with parameters a and M such that |a|≪M, Kerr-Newman spacetimes with parameters |Q|≪M, |a|≪M, and more generally, stationary axisymmetric black hole exterior spacetimes (M,g)(\mathcal{M},g) which are sufficiently close to a Schwarzschild metric with parameter M>0 and whose Killing fields span the null generator of the event horizon. We show uniform boundedness on the exterior for solutions to the wave equation □ _g ψ=0. The most fundamental statement is at the level of energy: We show that given a suitable foliation Σ _τ , then there exists a constant C depending only on the parameter M and the choice of the foliation such that for all solutions ψ, a suitable energy flux through Σ _τ is bounded by C times the initial energy flux through Σ₀. This energy flux is positive definite and does not degenerate at the horizon, i.e. it agrees with the energy as measured by a local observer. It is shown that a similar boundedness statement holds for all higher order energies, again without degeneration at the horizon. This leads in particular to the pointwise uniform boundedness of ψ, in terms of a higher order initial energy on Σ₀. Note that in view of the very general assumptions, the separability properties of the wave equation or geodesic flow on the Kerr background are not used. In fact, the physical mechanism for boundedness uncovered in this paper is independent of the dispersive properties of waves in the high-frequency geometric optics regime.     

Rothe's Method for Semilinear Parabolic Problems with Degeneration

The paper deals with semilinear parabolic initial-boundary value problems whereat the coefficient g(x, t) of the time derivative may vanish at a set of zero measure. Existence of a local weak solution of the problem is proved by means of semidiscretization in time. In order to omit a growth limitation for the nonlinearity we derive uniform boundedness of the approximates in L_∞ (Q_T). Moreover, the weak solution turns out to be continuous even in the points of degeneration.     

Bifurcation for Quasilinear Elliptic Singular BVP

For a continuous function g ≥ 0 on (0, + ∞) (which may be singular at zero), we confront a quasilinear elliptic differential operator with natural growth in ?u, ? Δu + g(u)|?u|², with a power type nonlinearity, λu ^p  + f ₀(x). The range of values of the parameter λ for which the associated homogeneous Dirichlet boundary value problem admits positive solutions depends on the behavior of g and on the exponent p. Using bifurcations techniques we deduce sufficient conditions for the boundedness or unboundedness of the cited range.     

The Hardness of 3-Uniform Hypergraph Coloring

We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n^1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c₂ > c₁ > 1, coloring a k-uniform c₁-colorable hypergraph with c₂ colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness result for approximately-coloring a 3-uniform hypergraph that is colorable with a constant number of colors. For k ≥ 4 such a result has been shown by [14], who also discussed the inherent difference between the k = 3 case and k ≥ 4. Our proof presents a new connection between the Long-Code and the Kneser graph, and relies on the high chromatic numbers of the Kneser graph [19,22] and the Schrijver graph [26]. We prove a certain maximization variant of the Kneser conjecture, namely that any coloring of the Kneser graph by fewer colors than its chromatic number, has ‘many’ non-monochromatic edges. * Research supported by NSF grant CCR-9987845. † Supported by an Alon Fellowship and by NSF grant CCR-9987845. ‡ Work supported in part by NSF grants CCF-9988526 and DMS 9729992, and the State of New Jersery.     

Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs

In this paper a formula for the coefficient of λ ^n-gh+g-1 in the chromatic polynomial of a linear h-uniform hypergraph H of order n and girth g is proposed provided (g,  h) ≠ (3, 3). This formula involves 13 types of spanning subhypergraphs of H for 3 ≤ h ≤ 5.     

Bmo boundedness for banach space valued singular integrals

In this paper, we consider a class of Banach space valued singular integrals. The Lp boundedness of these operators has already been obtained. We shall discuss their boundedness from BMO to BMO. As applications, we get BMO boundednessfor the classic g-function and the Marcinkiewicz integral. Some known results are improved.     

Pseudo-differential operators on Sobolev and Lipschitz spaces

In this paper, by discovering a new fact that the Lebesgue boundedness of a class of pseudo- differential operators implies the Sobolev boundedness of another related class of pseudo-differential operators, the authors establish the boundedness of pseudo-differential operators with symbols in Sρ,δ^m on Sobolev spaces, where ∈ R, ρ≤ 1 and δ≤ 1. As its applications, the boundedness of commutators generated by pseudo-differential operators on Sobolev and Bessel potential spaces is deduced. Moreover, the boundedness of pseudo-differential operators on Lipschitz spaces is also obtained.     

Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles

A 4-uniform hypergraph represents the P ₄-structure of a graph G if its hyperedges are the vertex sets of the P ₄'s in G. By using the weighted 2-section graph of the hypergraph we propose a simple efficient algorithm to decide whether a given 4-uniform hypergraph represents the P ₄-structure of a bipartite graph without 4-cycle and 6-cycle. For trees, our algorithm is different from that given by G. Ding and has a better running time namely O(n ²) where n is the number of vertices. Revised: February 18, 1998     

Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs

A hamiltonian path (cycle) in an n-vertex 3-uniform hypergraph is a (cyclic) ordering of the vertices in which every three consecutive vertices form an edge. For large n, we prove an analog of the celebrated Dirac theorem for graphs: there exists n₀ such that every n-vertex 3-uniform hypergraph H, n?n₀, in which each pair of vertices belongs to at least n/2−1 (⌊n/2⌋) edges, contains a hamiltonian path (cycle, respectively). Both results are easily seen to be optimal.     

Bounded Toeplitz Products on the Bergman Space of the Unit Ball in \mathbb{C}^n

We investigate necessary and sufficient conditions for boundedness of the operator on the Bergman space of the unit ball for n ≥ 1, where T_f is the Toeplitz operator. Those conditions are related to boundedness of the Berezin transform of symbols f and g. We construct the inner product formula which plays a crucial role in proving the sufficiency of the conditions.     

Some highly symmetric authentication perpendicular arrays

A set S of permutations of k objects is -uniform, t-homogeneous if for every pair A, B of t-subsets of the ground set, there are exactly permutations in S mapping A onto B. Arithmetical conditions and symmetries are discussed. We describe the character-theoretic method which is useful if S is contained in a permutation group. A main result is the construction of a 2-uniform, 2-homogeneous set of permutations on 6 objects and of a 3-uniform, 3-homogeneous set of permutations on 9 objects. These are contained in the simple permutation groups PSL ₂(5) and PSL ₂(8), respectively. The result is useful in the framework of theoretical secrecy and authentication (see Stinson 1990, Bierbrauer and Tran 1991).     

On density properties of certain subgroups with boundedness conditions

LetG be a locally compact group acting on a topological space. Here we define some boundedness conditions for the action. For a nondiscrete locally compact vector spaceV andgG L (V), layering structures forV and the projective spaceP (V) ofV are obtained. From the layering structures, we derive then density properties of subgroups ofG with boundedness conditions. We generalize the Borel density theorem and Prasad's theorem on automorphisms of algebraic semi-simple groups. Some new results onp-adic groups are added.Partially supported by N. S. F. Grant 7702168.     

Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs

Edge colorings of r-uniform hypergraphs naturally define a multicoloring on the 2-shadow, i.e., on the pairs that are covered by hyperedges. We show that in any (r – 1)-coloring of the edges of an r-uniform hypergraph with n vertices and at least (1-e)( *20c nr)(1-\varepsilon)\left( {\begin{array}{*{20}c} n\\ r\\ \end{array}}\right) edges, the 2-shadow has a monochromatic matching covering all but at most o(n) vertices. This result confirms an earlier conjecture and implies that for any fixed r and sufficiently large n, there is a monochromatic Berge-cycle of length (1 – o(1))n in every (r – 1)-coloring of the edges of K^(r)_n{K^{(r)}_{n}}, the complete r-uniform hypergraph on n vertices.     

Decomposition of large uniform hypergraphs

We determine a minimum cardinality family _{n, k} (resp. _{n, k} ) ofn-uniform,k-edge hypergraphs satisfying the following property: all, except for finitely many,n-uniform hypergraphs satisfying the divisibility condition have an _{n, k} -decomposition (resp. vertex _{n, k} -decomposition).     

广义Morrey 空间上带变量核的Littlewood-Paley 算子

该文给出了一类带变量核的抛物型Littlewood-Paley 算子g_Φ 在 广义 Morrey 空间L^p,ω(Rⁿ)上的有界性. 作为上述结果的应用, 得到了g_Φ 与 BMO 函数 b(x)生成的交换子[b, g_Φ]在L^p,ω( Rⁿ)上的有界性.     

Perfect fractional matchings in random hypergraphs

Given an r-uniform hypergraph H = (V, E) on |V| = n vertices, a real-valued function f:E→R⁺ is called a perfect fractional matching if Σ_vϵe f(e) ≤ 1 for all vϵV and Σ_eϵE f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n→ infinity, at the very moment t₀ when the last isolated vertex disappears, the hypergraph H_t0 has a perfect fractional matching. This result is clearly best possible. As a consequence, we derive that if p(n) = (ln n + w(n))/ , where w(n) is any function tending to infinity with n, then with probability tending to 1 a random r-uniform hypergraph on n vertices with edge probability p has a perfect fractional matching. Similar results hold also for random r-partite hypergraphs. © 1996 John Wiley & Sons, Inc.     

Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n

A truncated transversal design TTD of type g^km¹ is a {k, k+1}-GDD of type g^km¹ in which each point on the group of size m lies only in blocks of size k+1. Thus a TTD of type g^km¹ is equivalent to a transversal design TD (k, g) having m disjoint parallel classes of blocks. We employ a new construction developed by the author (1993, J. Combin. Des.1, 15–26) to show that if g₁<g₂ and if there exists a TD (k, g₁) and a TD (k+1, g₂), then there exists a TTD of type (g₁g₂)^km¹ for any 0m(g₂ div g₁) g²₁. As a corollary, we obtain a new lower bound on the number of mutually orthogonal idempotent latin squares of side g: if g₁<g₂ and there exist r MOLS of side g₁ and r+1 MOLS of side g₂ , then N(1 ^g₁g₂)r.     

推广的Volterra复合算子的本性范数

本文研究单位圆盘上Bergman型空间到Zygmund型空间上的一类推广的Volterra复合算子.利用符号函数ϕ和g刻画这类算子的有界性、紧性,并计算其本性范数.     

Commutators of Littlewood-Paley operators

Let b ∈ Lloc(Rn) and L denote the Littlewood-Paley operators including the LittlewoodPaley g function,Lusin area integral and gλ* function. In this paper,the authors prove that the Lp boundedness of commutators [b,L] implies that b ∈ BMO(Rn) . The authors therefore get a characterization of the Lp-boundedness of the commutators [b,L]. Notice that the condition of kernel function of L is weaker than the Lipshitz condition and the Littlewood-Paley operators L is only sublinear,so the results obtained in the p...