Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs

Let Γ be a d-bounded distance-regular graph with diameter d?3. Suppose that P(x) is a set of all strongly closed subgraphs containing x and that P(x,i) is a subset of P(x) consisting of all elements of P(x) with diameter i. Let L^′(x,i) be the set generated by all joins of the elements in P(x,i). By ordering L^′(x,i) by inclusion or reverse inclusion, L^′(x,i) is denoted by or . We prove that and are both finite atomic lattices, and give the conditions for them both being geometric lattices. We also give the eigenpolynomial of      

Unique expansions of real numbers

It was discovered some years ago that there exist non-integer real numbers q>1 for which only one sequence (ci) of integers ci∈[0,q) satisfies the equality . The set of such “univoque numbers” has a rich topological structure, and its study revealed a number of unexpected connections with measure theory, fractals, ergodic theory and Diophantine approximation.In this paper we consider for each fixed q>1 the set Uq of real numbers x having a unique representation of the form with integers ci belonging to [0,q). We carry out a detailed topological study of these sets. For instance, we characterize their closures, and we determine those bases q for which Uq is closed or even a Cantor set. We also study the set consisting of all sequences (ci) of integers ci∈[0,q) such that . We determine the numbers r>1 for which the map (defined on (1,∞)) is constant in a neighborhood of r and the numbers q>1 for which is a subshift or a subshift of finite type.     

A remark on Ricceri's conjecture for a class of nonlinear eigenvalue problems

Consider the eigenvalue problem : −Δu=λf(x,u) in Ω, u=0 on ∂Ω, where Ω is a bounded smooth domain in RN. Denote by the set of all Carathéodory functions f:Ω×R→R such that for a.e. x∈Ω, f(x,⋅) is Lipschitzian with Lipschitz constant L, f(x,0)=0 and , and denote by (resp. ) the set of λ>0 such that has at least one nonzero classical (resp. weak) solution. Let λ₁ be the first eigenvalue for the Laplacian-Dirichlet problem. We prove that and . Our result is a positive answer to Ricceri's conjecture if use f(x,u) instead of f(u) in the conjecture.     

Beta-expansion and continued fraction expansion

For any real number β>1, let ε(1,β)=(ε₁(1),ε₂(1),…,εn(1),…) be the infinite β-expansion of 1. Define . Let x∈[0,1) be an irrational number. We denote by kn(x) the exact number of partial quotients in the continued fraction expansion of x given by the first n digits in the β-expansion of x. If is bounded, we obtain that for all x∈[0,1)?Q,

     

Positive periodic solutions of functional differential equations

We consider the existence, multiplicity and nonexistence of positive ω-periodic solutions for the periodic equation x′(t)=a(t)g(x)x(t)−λb(t)f(x(t−τ(t))), where are ω-periodic, , , f,g∈C([0,∞),[0,∞)), and f(u)>0 for u>0, g(x) is bounded, τ(t) is a continuous ω-periodic function. Define , , i₀=number of zeros in the set and i_∞=number of infinities in the set . We show that the equation has i₀ or i_∞ positive ω-periodic solution(s) for sufficiently large or small λ>0, respectively.     

On the period five trichotomy of all positive solutions of xn+1=(p+xn−2)/xn

We study the behavior of all positive solutions of the difference equation in the title, where p is a positive real parameter and the initial conditions x₋₂,x₋₁,x₀ are positive real numbers. For all the values of the positive parameter p there exists a unique positive equilibrium x? which satisfies the equation

     

A tripling construction for overlarge sets of KTS

An overlarge set of , denoted by , is a collection {(X?{x},B_x):x∈X}, where X is a (v+1)-set, each (X?{x},B_x) is a and {B_x:x∈X} forms a partition of all triples on X. In this paper, we give a tripling construction for overlarge sets of KTS. Our main result is that: If there exists an with a special property, then there exists an . It is obtained that there exists an for u=2²ⁿ⁻¹−1 or u=qⁿ, where prime power q≡7 (mod 12) and m≥0,n≥1.     

Convergence theorems for fixed points of uniformly continuous generalized Φ-hemi-contractive mappings

Let E be a real normed linear space, K be a nonempty subset of E and be a uniformly continuous generalized Φ-hemi-contractive mapping, i.e., , and there exist x^∗∈F(T) and a strictly increasing function , Φ(0)=0 such that for all x∈K, there exists j(x−x^∗)∈J(x−x^∗) such that

〈Tx−x^∗,j(x−x^∗)〉?‖x−x^∗‖2−Φ(‖x−x^∗‖).     

On k-regular functions with values in a universal Clifford algebra

In this paper, we mainly study properties of nullsolutions of the operator Dk (k∈N^∗=N?{0}), so-called k-regular functions. Firstly, we study the set of all homogeneous polynomials of degree p in x₁,…,xn which are k-regular in the whole Rn, clearly is a right module over C(Vn,n), we construct a basis for the right module . Secondly, we study the k-regular and analytic functions, and we give the Taylor expansions for these functions. At last, the corresponding Taylor expansions for k-regular functions are given since each k-regular function is a real analytic function.     

A general iterative method for nonexpansive mappings in Hilbert spaces

Let H be a real Hilbert space. Consider on H a nonexpansive mapping T with a fixed point, a contraction f with coefficient 0<α<1, and a strongly positive linear bounded operator A with coefficient . Let . It is proved that the sequence {xn} generated by the iterative method xn+1=(I−αnA)Txn+αnγf(xn) converges strongly to a fixed point which solves the variational inequality for x∈Fix(T).     

Distribution of exponential functions with squarefull exponent in residue rings

For a real x ≥ 1 we denote by S[x] the set of squarefull integers n ≤x, that is, the set of positive integers n ≤ such that l²|n for any prime divisor l|n. We estimate exponential sums of the form

     

Modular metric spaces, I: Basic concepts

The notion of a modular is introduced as follows. A (metric) modular on a set X is a function w:(0,∞)×X×X→[0,∞] satisfying, for all x,y,z∈X, the following three properties: x=y if and only if w(λ,x,y)=0 for all λ>0; w(λ,x,y)=w(λ,y,x) for all λ>0; w(λ+μ,x,y)≤w(λ,x,z)+w(μ,y,z) for all λ,μ>0. We show that, given x₀∈X, the set X_w={x∈X:lim_λ→∞w(λ,x,x₀)=0} is a metric space with metric , called a modular space. The modular w is said to be convex if (λ,x,y)?λw(λ,x,y) is also a modular on X. In this case X_w coincides with the set of all x∈X such that w(λ,x,x₀)<∞ for some λ=λ(x)>0 and is metrizable by . Moreover, if or , then ; otherwise, the reverse inequalities hold. We develop the theory of metric spaces, generated by modulars, and extend the results by H. Nakano, J. Musielak, W. Orlicz, Ph. Turpin and others for modulars on linear spaces.     

A generalization of Barbashin-Krasovski theorem

The classical criterion of asymptotic stability of the zero solution of equations x^′=f(t,x) is that there exists a function V(t,x), a(‖x‖)?V(t,x)?b(‖x‖) for some a,b∈K, such that for some c∈K. In this paper we prove that if f(t,x) is bounded, is uniformly continuous and bounded, then the condition that can be weakened and replaced by and contains no complete trajectory of , t∈[−T,T], where , uniformly for (t,x)∈[−T,T]×BH.     

A linear algorithm for minimum 1-identifying codes in oriented trees

Consider an oriented graph G=(V,A), a subset of vertices C⊆V, and an integer r?1; for any vertex v∈V, let denote the set of all vertices x such that there exists a path from x to v with at most r arcs. If for all vertices v∈V, the sets are all nonempty and different, then we call C an r-identifying code. We describe a linear algorithm which gives a minimum 1-identifying code in any oriented tree.     

Markov interlacing property for exponential polynomials

Let Un be an extended Tchebycheff system on the real line. Given a point , where x₁<?<xn, we denote by the polynomial from Un, which has zeros x₁,…,xn. (It is uniquely determined up to multiplication by a constant.) The system Un has the Markov interlacing property (M) if the assumption that and interlace implies that the zeros of and interlace strictly, unless . We formulate a general condition which ensures the validity of the property (M) for polynomials from Un. We also prove that the condition is satisfied for some known systems, including exponential polynomials and . As a corollary we obtain that property (M) holds true for Müntz polynomials , too.