Elementary approximations for zeros of Bessel functions

Let j_vk, y_vk and c_vk denote the kth positive zeros of the Bessel functions J_v(x), Y_v(x) and of the general cylinder function C_v(x) = cos αJ_v(x)?sin αY_v(x), 0 ? α < π, respectively. In this paper we extend to c_vk, k = 2, 3,..., some linear inequalities presently known only for j_vk. In the case of the zeros y_vk we are able to extend these inequalities also to k = 1. Finally in the case of the first positive zero j_v1 we compare the linear enequalities given in [9] with some other known inequalities.     

Clique graphs of time graphs

A simple, finite graph G is called a time graph (equivalently, an indifference graph) if there is an injective real function f on the vertices v(G) such that v_iv_j ∈ e(G) for v_i ≠ v_j if and only if |f(v_i) ? f(v_j)| ≤ 1. A clique of a graph G is a maximal complete subgraph of G. The clique graph K(G) of a graph G is the intersection graph of the cliques of G. It will be shown that the clique graph of a time graph is a time graph, and that every time graph is the clique graph of some time graph. Denote the clique graph of a clique graph of G by K²(G), and inductively, denote K(K^m?1(G)) by K^m(G). Define the index indx(G) of a connected time graph G as the smallest integer n such that Kⁿ(G) is the trivial graph. It will be shown that the index of a time graph is equal to its diameter. Finally, bounds on the diameter of a time graph will be derived.     

On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v_i and v_j in V(G) of G, recall that G+v_iv_j is the supergraph formed from G by adding an edge between vertices v_i and v_j. Denote the Harary index of G and G+v_iv_j by H(G) and H(G+v_iv_j), respectively. We obtain lower and upper bounds on H(G+v_iv_j)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

Homology of certain algebras defined by graphs

Let K(G) for a finite graph G with vertices v₁,...,v_n denote the K-algebra with generators X₁,...,X_n and defining relations X_iX_j=X_jX_i if and only if v_i is not connected to v_j by an edge in G. We describe centralizers of monomials, show that the centralizer of a monomial is again a graph algebra, prove a unique factorization theorem for factorizations of monomials into commuting factors, compute the homology of K(G), and show that K(G) is the homology ring of a certain loop space. We also construct a K(π, 1) explicitly where π is the group with generators X₁,...,X_n and defining relations X_iX_j=X_jX_i if and only if v_i is not connected to v_j by an edge in G.     

解在QK 型及Dirichlet 型空间中的线性微分方程

对于单位圆盘上系数函数是解析函数的复微分方程
f⁽ⁿ⁾+A_n-1(z)f^(n-1)+…+A₁(z)f''+A₀(z)f=0,
给出了方程的系数函数和解函数之间的关系, 即当系数函数A_j 满足给定的条件时, 方程的所有解属于Q_K型空间和Dirichlet 型空间.     

Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems

In this paper we present a minimal set of conditions sufficient to assure the existence of a solution to a system of nonnegative linear diophantine equations. More specifically, suppose we are given a finite item set U = {u₁, u₂, . . . , u_k} together with a "size" v_i ≡ v(u_i) ∈ Z⁺, such that v_i ≠ v_j for i ≠ j, a "frequency" a_i ≡ a(u_i) ∈ Z⁺, and a positive integer (shelf length) L ∈ Z⁺ with the following conditions: (i) L = ∏ⁿ_j=1p_j(p_j ∈ Z⁺ ∀j, p_j ≠ p_l for j ≠ l) and v_i = ∏ _j∈Aip_j, A_i ⊆ {l, 2, . . . , n} for i = 1, . . . , n; (ii) (A_i\{⋂^k_j=1A_j}) ∩ (A_l\{⋂^k_j=1A_j}) = ⊘∀i ≠ l. Note that v_i|L (divides L) for each i. If for a given m ∈ Z⁺, ∑ⁿ_i=1a_iv_i = mL (i.e., the total size of all the items equals the total length of the shelf space), we prove that conditions (i) and (ii) are sufficient conditions for the existence of a set of integers {b₁₁, b₁₂, . . . , b_1m, b₂₁, . . . , b_n1, . . . , b_nm}⊆ N such that ∑^m_j=1b_ij = a_i, i = 1, . . . , k, and ∑^k_i=1b_ijv_i = L, j =1, . . . , m (i.e., m shelves of length L can be fully utilized). We indicate a number of special cases of well known NP-complete problems which are subsequently decided in polynomial time.     

On the elliptic curve y 2 = x 3 −2rDx and factoring integers

Let D=pq be the product of two distinct odd primes.Assuming the parity conjecture,we construct infinitely many r≥1 such that E2rD:y2=x3-2rDx has conjectural rank one and vp(x([k]Q))≠vq(x([k]Q))for any odd integer k,where Q is the generator of the free part of E(Q).Furthermore,under the generalized Riemann hypothesis,the minimal value of r is less than c log4 D for some absolute constant c.As a corollary,one can factor D by computing the generator Q.     

Fluctuations of the empirical quantiles of independent Brownian motions

We consider iid Brownian motions, B_j(t), where B_j(0) has a rapidly decreasing, smooth density function f. The empirical quantiles, or pointwise order statistics, are denoted by B_j:n(t), and we consider a sequence Q_n(t)=B_j(n):n(t), where j(n)/n→α∈(0,1). This sequence converges in probability to q(t), the α-quantile of the law of B_j(t). We first show convergence in law in C[0,∞) of F_n=n^1/2(Q_n−q). We then investigate properties of the limit process F, including its local covariance structure, and Hölder-continuity and variations of its sample paths. In particular, we find that F has the same local properties as fBm with Hurst parameter H=1/4.     

Random evolutions in discrete and continuous time

This paper points out a connection between random evolutions and products of random matrices. This connection is useful in predicting the long-run growth rate of a single-type, continuously changing population in randomly varying environments using only observations at discrete points in time. A scalar Markov random evolution is specified by the n×n irreducible intensity matrix or infinitesimal generator Q = (q_ij) of a time-homogeneous Markov chain and by n finite real growth rates (scalars) s_i. The scalar Markov random evolution is the quantity M^C(t) = exp(Σⁿ_j=1s_jg^C_j (t)), where g^C_j(t) is the occupancy times in state j up to time t. The scalar Markov product of random matrices induced by this scalar Markov random evolution is the quantity M^D(t) = exp(Σⁿ_j=1s_jg^D_j (t)), where g^D_j(t) is the occupancy time in state j up to and including t of the discrete-time Markov chain with stochastic one-step transition matrix P = e^Q. We show that lim_t→∞(1/t)E(logM^D(t))=lim_t→∞(1/t)E(logM^C(t)) but that in general lim_t→∞(1/t)logE(M^C(t)) ≠ lim_t→∞(1/t)logE(M^D(t)). Thus the mean Malthusian parameter of population biologists is invariant with respect to the choice of continuous or discrete time, but the rate of growth of average population size is not. By contrast with a single-type population, in multitype populations whose growth is governed by non-commuting operators, the mean Malthusian parameter may be destined for a less prominent role as a measure of long-run growth.     

On determining the 4-rank of the ideal class group of a quadratic field

Let e_j denote the number of 2^j-invariants of the narrow ideal class group of a quadratic field $\text{Q}$(D^1/2). Pumplün has stated a criterion for e₂ > 0. The equivalence of this criterion to one arising from the Redei-Reichardt theorem is shown to be a graph-theoretic result, for which a direct proof is given.     

Limits of translates of divergent geodesics and integral points on one-sheeted hyperboloids

For any non-uniform lattice Γ in SL₂(?), we describe the limit distribution of orthogonal translates of a divergent geodesic in Γ\SL₂(?). As an application, for a quadratic form Q of signature (2, 1), a lattice Γ in its isometry group, and v ₀ ∈ ?³ with Q(v ₀) > 0, we compute the asymptotic (with a logarithmic error term) of the number of points in a discrete orbit v ₀Γ of norm at most T, when the stabilizer of v ₀ in Γ is finite. Our result in particular implies that for any non-zero integer d, the smoothed count for the number of integral binary quadratic forms with discriminant d ² and with coefficients bounded by T is asymptotic to c · T log T + O(T).     

Lipschitz homeomorphisms of the Hilbert cube

We study the question whether the Hilbert cube Q is Lipschitz homogeneous. The answer depends on the metric of Q. For example, setting d(x,y)=sup_j|x_j-y_j|/j we obtain a Lipschitz homogeneous metric, but if the last j is replaced by j!, the answer is negative.     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

Strong approximation in the Apollonian group

The Apollonian group is a finitely generated, infinite index subgroup of the orthogonal group OQ(Z) fixing the Descartes quadratic form Q. For nonzero v∈Z⁴ satisfying Q(v)=0, the orbits Pv=Av correspond to Apollonian circle packings in which every circle has integer curvature. In this paper, we specify the reduction of primitive orbits Pv mod any integer d>1. We show that this reduction has a multiplicative structure, and that mod primes p?5 it is the full cone of integer solutions to Q(v)≡0 for v?0. This analysis is an essential ingredient in applications of the affine linear sieve as developed by Bourgain, Gamburd and Sarnak.     

On friendly index sets of 2-regular graphs

Let G be a graph with vertex set V and edge set E, and let A be an abelian group. A labeling f:V→A induces an edge labeling f^∗:E→A defined by f^∗(xy)=f(x)+f(y). For i∈A, let v_f(i)=card{v∈V:f(v)=i} and e_f(i)=card{e∈E:f^∗(e)=i}. A labeling f is said to be A-friendly if |v_f(i)−v_f(j)|≤1 for all (i,j)∈A×A, and A-cordial if we also have |e_f(i)−e_f(j)|≤1 for all (i,j)∈A×A. When A=Z₂, the friendly index set of the graph G is defined as {|e_f(1)−e_f(0)|:the vertex labelingf is Z₂-friendly}. In this paper we completely determine the friendly index sets of 2-regular graphs. In particular, we show that a 2-regular graph of order n is cordial if and only if n?2 (mod 4).     

The orthogonality property of the Lommel polynomials and a twofold infinity of relations between Rayleigh''s σ-sums

Making use of a remarkable theorem which expresses a relationship between a certain type of infinite continued fractions and systems of orthogonal polynomials, it is proven that the known infinite continued fraction development of the ratio of Bessel functions J_v?1(z)/J_v(z) gives rise to an orthogonality property of the Lommel polynomials $\text{{R}{}_{\mathrm{m,v}}\text{(}\text{1}\text{z}\text{)|m?}\text{N}\text{}}$ when v is real and positive. The corresponding weight function which appears to be non-negative in the interval of definition, is obtained by the application of two successive integral transforms. It consists of an infinite series of Dirac δ-functions whose singularities are distributed symmetrically around the origin on the real axis in such a manner that the origin is their limit point on both sides. For any positive v, the Lommel polynomials form a system of so-called orthogonal polynomials of a discrete variable. The orthogonality property may also be conveniently expressed by means of a Stieltjes integral. One of its corollaries is a twofold infinity of linear relations between the sums σ_v^(r) defined by σ_v^(r)=Σ_n=1^+∞1/j_v,n^2r, with $\text{v+1Σ}\text{R}{}_0{}^{\mathrm{+}}\text{, rΣ}\text{N}{}_0\text{,}\text{in which}\text{j}{}_{\mathrm{v,n}}\text{represents the}\text{n}\text{th positive zero of}\text{J}{}_{\mathrm{v}}\text{(z)}$.Another by-product consists of a complement to a theorem of Hurwitz concerning the nature and the position of the zeros of the Lommel polynomials written as g_m,v(z) in the modified notation of the mentioned author. From this study also result two interesting approximations of j_v,1 applicable for v?]?1, +1].     

Følner sequences and Hilbert’s Irreducibility Theorem over Q

Letf(X; T ₁, ...,T _n) be an irreducible polynomial overQ. LetB be the set ofb teZ ⁿ such thatf(X;b) is of lesser degree or reducible overQ. Let ?={F _j}{F _j } _j?1 ^∞ be a Følner sequence inZ ⁿ — that is, a sequence of finite nonempty subsetsF _j ?Z ⁿ such that for eachvteZ ⁿ , $\mathop {lim}\limits_{j \to \infty } \frac{{\left| {F_j \cap (F_j + \upsilon )} \right|}}{{\left| {F_j } \right|}} = 1$ Suppose ? satisfies the extra condition that forW a properQ-subvariety ofP ⁿ ?A ⁿ and ?>0, there is a neighborhoodU ofW(R) in the real topology such that $\mathop {lim sup}\limits_{j \to \infty } \frac{{\left| {F_j \cap U} \right|}}{{\left| {F_j } \right|}}< \varepsilon $ whereZ ⁿ is identified withA ⁿ (Z). We prove $\mathop {lim}\limits_{j \to \infty } \frac{{\left| {F_j \cap B} \right|}}{{\left| {F_j } \right|}} = 0$ .     

Decomposition of complete multigraphs into crown graphs

Let λ K _v be the complete multigraph, G a finite simple graph. A G-design of λ K _v is denoted by GD(v,G,λ). The crown graph Q _n is obtained by joining single pendant edge to each vertex of an n-cycle. We give new constructions for Q _n -designs. Let v and λ be two positive integers. For n=4, 6, 8 and λ≥1, there exists a GD(v,Q _n ,λ) if and only if either (1) v>2n and λ v(v?1)≡0 (mod 4n), or (2) v=2n and λ≡0 (mod 4). Let n≥4 be even. Then (1) there exists a GD(2n,Q _n ,λ) if and only if λ≡0 (mod 4). (2) There exists a GD(2n+1,Q _n ,λ) when λ≡0 (mod 4).     

Uniform bound for asymptotic normality of discounted <Emphasis Type="Italic">m</Emphasis>-dependent random variables using Heinrich's method

We estimate the difference | F_Zv(x) - F(x) | \left| {{F_{{Z_v}}}(x) - \Phi (x)} \right| , where F_Zv(x) {F_{{Z_v}}}(x) is the distribution function of normalized series Z _v = B ⁻¹ _v Σ^∞ _j=0 v ^j X _j with B ² _v = \mathbb E \mathbb {E} (Σ^∞ _j=0 v ^j X _j ) > 0 and the discount factor v, 0 < v < 1; X ₀,X ₁,X ₂,… is a sequence of m-dependent random variables, and Φ(x) is the standard normal distribution function. In a particular case, the obtained upper bound is of order O((1−v)^1/2).