On the continued fraction \frac{1 |}{| z } +\frac{1 |}{| 1 } + \frac{2 |}{| z } +\frac{3 |}{| 1 } + \frac{4 |}{| z} + \cdots

The article on hand deals with the continued fraction $$\frac{1 |}{| z } +\frac{1 |}{| 1 } + \frac{2 |}{| z } +\frac{3 |}{| 1 } + \frac{4 |}{| z} + \cdots.$$ The famous Indian mathematician Srinivasa Ramanujan has given a pre-presentation by a power series, but he however concealed a proof. Subsequently a proof has been established, but a direct verification is intricate. Here we give a quick and direct approach with comparitively little effort.     

Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with {Q \in \{(\frac {1}{3}, \frac {2}{3}), (\frac {2}{3}, \frac{1}{3})\}}

Variable-weight optical orthogonal code (OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service requirements. It is proved that optimal (v, {3, 4}, 1, (1/2, 1/2))-OOCs exist for some complete congruence classes of v. In this paper, for ${Q \in \{(1/3, 2/3), (2/3, 1/3)\}}$ , by using skew starters, it is also proved that optimal (v, {3, 4}, 1, Q)-OOCs exist for some complete congruence classes of v.     

The rigidity of Clifford torusS^1 \left( {\sqrt {\frac{1}{n}} } \right) \times S^{n - 1} \left( {\sqrt {\frac{{n - 1}}{n}} } \right)

In this paper, we prove that ifM is ann-dimensional closed minimal hypersurface with two distinct principal curvatures of a unit sphereS ⁿ⁺¹ (1), thenS=n andM is a Clifford torus ifn≤S≤n+[2n ²(n+4)/3(n(n+4)+4)], whereS is the squared norm of the second fundamental form ofM.     

The estimate for mean values on prime numbers relative to \frac{4} {p} = \frac{1} {{n_1 }} + \frac{1} {{n_2 }} + \frac{1} {{n_3 }}

If n is a positive integer,let f （n） denote the number of positive integer solutions （n 1,n 2,n 3） of the Diophantine equation 4/n=1/n₁ + 1/n₂ + 1/n₃.For the prime number p,f （p） can be split into f 1 （p） + f 2 （p）,where f i （p） （i=1,2） counts those solutions with exactly i of denominators n 1,n 2,n 3 divisible by p.In this paper,we shall study the estimate for mean values ∑ p相似文献   

ALTERNATING BAND CRANK-NICOLSON METHOD FOR δu／δt=δ^2u／δx^2＋δ^2u／δy^2

the Alternating Segment Crank-Nicolson scheme for one-dimensional diffusion equation has been developed in [1],and the Alternating Block Crank-Nicolson method for two-dimensional problem in [2].The methods have the advantages of parallel computing,stability and good accuracy.In this paper for the two-dimensional diffusion equation,the net region is divided into bands,a special kind of block.This method is called the alternating Band Crank-Nicolson method.     

Central limit theorem: Covergence in the norm\left\| u \right\|\left( {\int\limits_{ - \infty }^\infty {u^2 \left( x \right)e^{\frac{{x^2 }}{2}} dx} } \right)^{{\raise0.7ex\hbox{

Sufficient conditions for convergence in the central limit theorem (for identically distributed random variables) with respect to the topology specified in the title are given. These conditions hold for the uniform distribution although there exist distributions with smooth densities concentrated on a bounded interval for which the convergence result does not hold.     

On the difference equationx_{n + 1} = \alpha + \frac{{x_n^p }}{{x_{n - 1}^p }}

We study, firstly, the dynamics of the difference equation $x_{n + 1} = \alpha + \frac{{x_n^p }}{{x_{n - 1}^p }}$ , withp ∈ (0,1) and α∈ [0, ∞). Then, we generalize our results to the (k + 1)th order difference equation $x_{n + 1} = \alpha + \frac{{x_n^p }}{{x_{n - k}^p }}$ ,k = 2, 3,... with positive initial conditions.     

Improved Approximation Algorithms for MAX \frac{n}{{\text{2}}}-DIRECTED-BISECTION and MAX \frac{n}{{\text{2}}}-DENSE-SUBGRAPH

We consider the MAX $\frac{n}{{\text{2}}}$ -DIRECTED-BISECTION problem, i.e., partitioning the vertices of a directed graph into two blocks of equal cardinality so as to maximize the total weight of the edges in the directed cut. A polynomial approximation algorithm using a semidefinite relaxation with 0.6458 performance guarantee is presented for the problem. The previous best-known results for approximating this problem are 0.5 using a linear programming relaxation, 0.6440 using a semidefinite relaxation. We also consider the MAX $\frac{n}{{\text{2}}}$ -DENSE-SUBGRAPH problem, i.e., determine a block of half the number of vertices from a weighted undirected graph such that the sum of the edge weights, within the subgraph induced by the block, is maximized. We present an 0.6236 approximation of the problem as opposed to 0.6221 of Halperin and Zwick.     

On the recursive sequencex_{n + 1} = \alpha + \frac{{x_{n - 1}^p }}{{x_n^p }}

The boundedness, global attractivity, oscillatory and asymptotic periodicity of the positive solutions of the difference equation of the form $$x_{n + 1} = \alpha + \frac{{x_{n - 1}^p }}{{x_n^p }}, n = 0,1,...$$ is investigated, where all the coefficients are nonnegative real numbers.     

Linear codes over {\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}

In this work, we investigate linear codes over the ring ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ . We first analyze the structure of the ring and then define linear codes over this ring which turns out to be a ring that is not finite chain or principal ideal contrary to the rings that have hitherto been studied in coding theory. Lee weights and Gray maps for these codes are defined by extending on those introduced in works such as Betsumiya et al. (Discret Math 275:43–65, 2004) and Dougherty et al. (IEEE Trans Inf 45:32–45, 1999). We then characterize the ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linearity of binary codes under the Gray map and give a main class of binary codes as an example of ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes. The duals and the complete weight enumerators for ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ -linear codes are also defined after which MacWilliams-like identities for complete and Lee weight enumerators as well as for the ideal decompositions of linear codes over ${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$ are obtained.     

On the difference equation y_{n + 1} = \frac{{\alpha + y_n^p }} {{\beta y_{n - 1}^p }} - \frac{{\gamma + y_{n - 1}^p }} {{\beta y_n^p }}

In this paper, we investigate the global stability and the periodic nature of solutions of the difference equation $y_{n + 1} = \frac{{\alpha + y_n^p }} {{\beta y_{n - 1}^p }} - \frac{{\gamma + y_{n - 1}^p }} {{\beta y_n^p }},n = 0,1,2,... $ where α, β, γ ∈ (0,∞), α(1 ? p) ? γ > 0, 0 < p < 1, every y _n ≠ 0 for n = ?1, 0, 1, 2, … and the initial conditions y?1, y0 are arbitrary positive real numbers. We show that the equilibrium point of the difference equation is a global attractor with a basin that depends on the conditions of the coefficients.