Spectra of Bipartite P- and Q-Polynomial Association Schemes

 Let Y=(X,{R _i }_0≤i≤D) denote a symmetric association scheme with D≥3, and assume Y is not an ordinary cycle. Suppose Y is bipartite P-polynomial with respect to the given ordering A ₀, A ₁,…, A _D of the associate matrices, and Q-polynomial with respect to the ordering E ₀, E ₁,…,E _D of the primitive idempotents. Then the eigenvalues and dual eigenvalues satisfy exactly one of (i)–(iv). (i)

On Cesáro summability of fourier series with respect to double complete orthonormal systems

Let {ϕn(x), n = 1, 2,...} be an arbitrary complete orthonormal system on the interval I:= [0, 1]which consists of a.e. bounded functions. Suppose that E ₀ ⊂ I ² is any Lebesgue measurable set such that μ₂ E ₀ > 0, and φ, φ(0) = 0, is an increasing continuous function on [0, ∞) with φ(u) = o(u ln u) as u → ∞. Then there exist a function f ∈ L¹(I ²) and a set E ₀ ^′ , ⊂ E ₀, μ₂ E ₀ ^′ > 0, such that

On antipodal Euclidean tight (2e + 1)-designs

Neumaier and Seidel (1988) generalized the concept of spherical designs and defined Euclidean designs in ℝ ⁿ . For an integer t, a finite subset X of ℝ ⁿ given together with a weight function w is a Euclidean t-design if holds for any polynomial f(x) of deg(f)≤ t, where {S _i , 1≤ i ≤ p} is the set of all the concentric spheres centered at the origin that intersect with X, X _i = X∩ S _i , and w:X→ ℝ_{> 0}. (The case of X⊂ S ⁿ⁻¹ with w≡ 1 on X corresponds to a spherical t-design.) In this paper we study antipodal Euclidean (2e+1)-designs. We give some new examples of antipodal Euclidean tight 5-designs. We also give the classification of all antipodal Euclidean tight 3-designs, the classification of antipodal Euclidean tight 5-designs supported by 2 concentric spheres.     

Bipartite Distance-regular Graphs, Part I

Let Γ=(X,E) denote a bipartite distance-regular graph with diameter D≥4, and fix a vertex x of Γ. The Terwilliger algebra T=T(x) is the subalgebra of Mat _X(C) generated by A, E ^* ₀, E ^* ₁,…,E ^* _D, where A denotes the adjacency matrix for Γ and E ^* _i denotes the projection onto the i ^TH subconstituent of Γ with respect to x. An irreducible T-module W is said to be thin whenever dimE ^* _i W≤1 for 0≤i≤Di. The endpoint of W is min{i|E ^* _i W≠0}. We determine the structure of the (unique) irreducible T-module of endpoint 0 in terms of the intersection numbers of Γ. We show that up to isomorphism there is a unique irreducible T-module of endpoint 1 and it is thin. We determine its structure in terms of the intersection numbers of Γ. We determine the structure of each thin irreducible T-module W of endpoint 2 in terms of the intersection numbers of Γ and an additional real parameter ψ=ψ(W), which we refer to as the type of W. We now assume each irreducible T-module of endpoint 2 is thin and obtain the following two-fold result. First, we show that the intersection numbers of Γ are determined by the diameter D of Γ and the set of ordered pairs

Projection Theorems for Harmonic Measure in NTA Domains

Suppose D is an NTA domain, E D is any closed set, and P ^x ₀(E) is the projection with respect to a point x ₀D of the set E onto the boundary of D. The projection P ^x ₀ satisfies certain geometric properties so that it is a generalization of the notion of radial projection with respect to a point x ₀ onto a boundary of a domain. It is shown that the harmonic measure of E with respect to the domain DE evaluated at the point x ₀ is bounded below by a constant times the harmonic measure of the set P ^x ₀(E) with respect to the domain D evaluated at the point x ₀. The constant is independent of the set E but it may depend upon x ₀.     

Approximation of several dimensional functions by trigonometric polynomials

Let f(x, y) be a periodic function defined on the region D

On integral equations of stationary distributions for biological systems

In this paper, properties of solutions of the convolution-type integral equation

On Extraction of Smooth Solutions of a Class of Almost Hypoelliptic Equations with Constant Power

A linear differential operator P(x, D) = P(x₁,... x _n , D₁,..., D _n ) = ∑_αγ_α(x)D^α with coefficients γ_α(x) defined in E ⁿ is called formally almost hypoelliptic in E ⁿ if all the derivatives D^ν_ξP(x, ξ) can be estimated by P(x, ξ), and the operator P(x, D) has uniformly constant power in Eⁿ. In the present paper, we prove that if P(x, D) is a formally almost hypoelliptic operator, then all solutions of equation P(x, D)u = 0, which together with some of their derivatives are square integrable with a specified exponential weight, are infinitely differentiable functions.     

Refinement Equations and Feller Operators

Results on the existence and non-existence of nontrivial \mathbb L¹{\mathbb L^1}-solutions of the refinement equation

The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs

If G is a connected graph of order n ⩾ 1, then by a hamiltonian coloring of G we mean a mapping c of V (G) into the set of all positive integers such that |c(x) − c(y)| ⩾ n − 1 − D _G (x, y) (where D _G (x, y) denotes the length of a longest x − y path in G) for all distinct x, y ∈ V (G). Let G be a connected graph. By the hamiltonian chromatic number of G we mean

On the number of divisors which are values of a polynomial

Let τ(n) be the number of positive divisors of an integer n, and for a polynomial P(X)∈ℤ[X], let

The pressure equation for fluid flow in a stochastic medium

An equation modelling the pressurep(x) =p(x, w) atx ∈D ⊂R ^d of an incompressible fluid in a heterogeneous, isotropic medium with a stochastic permeabilityk(x, w) ≥ 0 is the stochastic partial differential equation

On the Global Integrability of Non-Negative Harmonic Functions

Let ⁺(D) be the set of all non-negative harmonic functions on a domain DR^d. Let q>0 and define L^q(D) to be the set of all Borel functions f such that |f|^q is Lebesgue-integrable on D. Let x₀D. N. Suzuki established the following:

An Extension of Polyak’s Theorem in a Hilbert Space

Let H be an infinite-dimensional real Hilbert space equipped with the scalar product (⋅,⋅) _H . Let us consider three linear bounded operators,

Embedding graphs with bounded degree in sparse pseudorandom graphs

In this paper, we show the equivalence of somequasi-random properties for sparse graphs, that is, graphsG with edge densityp=|E(G)|/( ₂ ⁿ )=o(1), whereo(1)→0 asn=|V(G)|→∞. Our main result (Theorem 16) is the following embedding result. For a graphJ, writeN _J(x) for the neighborhood of the vertexx inJ, and letδ(J) andΔ(J) be the minimum and the maximum degree inJ. LetH be atriangle-free graph and setd _H=max{δ(J):J⊆H}. Moreover, putD _H=min{2d _H,Δ(H)}. LetC>1 be a fixed constant and supposep=p(n)≫n ⁻¹ D _H. We show that ifG is such that

The symmetrized Sine addition formula

As a continuation of An and Yang (Integral Equ Oper Theory 66:183–195, 2010) in this paper, the symmetrized Sine addition formula

Green’s relations and regularity for semigroups of transformations that preserve order and a double direction equivalence

Let T _X be the full transformation semigroup on a set X,

C 1 surface interpolation with constraints

Givenn pairwise distinct and arbitrarily spaced pointsP _i in a domainD of thex–y plane andn real numbersf _i, consider the problem of computing a bivariate functionf(x, y) of classC ¹ inD whose values inP _i are exactlyf _i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ _l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy.