scholarly journals The Distribution of Heights of Binary Trees and Other Simple Trees

1993 ◽  
Vol 2 (2) ◽  
pp. 145-156 ◽  
Author(s):  
Philippe Flajolet ◽  
Zhicheng Gao ◽  
Andrew Odlyzko ◽  
Bruce Richmond
Keyword(s):  
Asymptotic Formula ◽  
Positive Constant ◽  
Binary Trees ◽  
Asymptotic Results ◽  
Image Position

The number, , of rooted plane binary trees of height ≤ h with n internal nodes is shown to satisfyuniformly for δ−1(log n)−1/2 ≤ β ≤ δ(log n)1/2, where and δ is a positive constant. An asymptotic formula for is derived for h = cn, where 0 < c < 1. Bounds for are also derived for large and small heights. The methods apply to any simple family of trees, and the general asymptotic results are stated.

Functions regular in the unit circle

1956 ◽  
Vol 52 (1) ◽  
pp. 49-60 ◽  
Author(s):  
C. N. Linden ◽  
M. L. Cartwright
Keyword(s):  
Unit Circle ◽  
Positive Constant ◽  
Upper Bounds ◽  
Image Position

Letbe a function regular for | z | < 1. With the hypotheses f(0) = 0 andfor some positive constant α, Cartwright(1) has deduced upper bounds for |f(z) | in the unit circle. Three cases have arisen and according as (1) holds with α < 1, α = 1 or α > 1, the bounds on each circle | z | = r are given respectively byK(α) being a constant which depends only on the corresponding value of α which occurs in (1). We shall always use the symbols K and A to represent constants dependent on certain parameters such as α, not necessarily having the same value at each occurrence.

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

On two integral equations of queueing theory

1967 ◽  
Vol 4 (2) ◽  
pp. 343-355 ◽  
Author(s):  
J. W. Cohen
Keyword(s):  
Stochastic Process ◽  
Integral Equations ◽  
Positive Constant ◽  
Mathematical Description ◽  
Queueing Theory ◽  
Image Position

In the present paper the solutions of two integral equations are derived. One of the integral equations dominates the mathematical description of the stochastic process {vn, n = 1,2, …}, recursively defined by K is a positive constant, τ1, τ2, …; Σ1, Σ2, …; are independent, non-negative variables, with τ1, τ2,…, identically distributed, similarly, the variables Σ1, Σ2, …, are identically distributed.

On Functional Properties of Incomplete Gaussian Sums

1991 ◽  
Vol 43 (1) ◽  
pp. 182-212 ◽  
Author(s):  
K. I. Oskolkov
Keyword(s):  
Functional Properties ◽  
Positive Constant ◽  
Absolute Constant ◽  
Special Function ◽  
Absolute Positive Constant ◽  
Image Position ◽  
Gaussian Sums

AbstractThe following special function of two real variables x2 and x1 is considered: and its connections with the incomplete Gaussian sums where ω are intervals of length |ω| ≤1. In particular, it is proved that for each fixed x2 and uniformly in X2 the function H(x2, x1) is of weakly bounded 2-variation in the variable x1 over the period [0, 1]. In terms of the sums W this means that for collections Ω = {ωk}, consisting of nonoverlapping intervals ωk ∪ [0,1) the following estimate is valid: where card denotes the number of elements, and c is an absolute positive constant. The exact value of the best absolute constant к in the estimate (which is due to G. H. Hardy and J. E. Littlewood) is discussed.

Small Solutions of the Congruence ax2 + by2 ≡ c(mod k)

1969 ◽  
Vol 12 (3) ◽  
pp. 311-320 ◽  
Author(s):  
Kenneth S. Williams
Keyword(s):  
Asymptotic Formula ◽  
Absolute Constant ◽  
Log P ◽  
Positive Absolute Constant ◽  
Image Position

In 1957, Mordell [3] provedTheorem. If p is an odd prime there exist non-negative integers x, y ≤ A p3/4 log p, where A is a positive absolute constant, such that(1.1)provided (abc, p) = 1.Recently Smith [5] has obtained a sharp asymptotic formula for the sum where r(n) denotes the number of representations of n as the sum of two squares.

scholarly journals Oscillations in a nonautonomous delay logistic difference equation

1992 ◽  
Vol 35 (1) ◽  
pp. 121-131 ◽  
Author(s):  
Ch. G. Philos
Keyword(s):  
Difference Equation ◽  
Equilibrium Point ◽  
Positive Constant ◽  
Sufficient Conditions ◽  
Existence Of A Solution ◽  
Sharp Condition ◽  
All Solutions ◽  
Image Position ◽  
Positive Integers ◽  
Logistic Difference Equation

Consider the nonautonomous delay logistic difference equationwhere (pn)n≧0 is a sequence of nonnegative numbers, (ln)n≧0 is a sequence of positive integers with limn→∞(n−ln) = ∞ and K is a positive constant. Only solutions which are positive for n≧0 are considered. We established a sharp condition under which all solutions of (E0) are oscillatory about the equilibrium point K. Also we obtained sufficient conditions for the existence of a solution of (E0) which is nonoscillatory about K.

scholarly journals Correlations of multiplicative functions and applications

2017 ◽  
Vol 153 (8) ◽  
pp. 1622-1657 ◽  
Author(s):  
Oleksiy Klurman
Keyword(s):  
Asymptotic Formula ◽  
Multiplicative Function ◽  
Divided Difference ◽  
Circle Method ◽  
Partial Sums ◽  
Multiplicative Functions ◽  
Image Position ◽  
Bounded Partial Sums

We give an asymptotic formula for correlations $$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}f_{1}(P_{1}(n))f_{2}(P_{2}(n))\cdots f_{m}(P_{m}(n)),\end{eqnarray}$$ where $f,\ldots ,f_{m}$ are bounded ‘pretentious’ multiplicative functions, under certain natural hypotheses. We then deduce several desirable consequences. First, we characterize all multiplicative functions $f:\mathbb{N}\rightarrow \{-1,+1\}$ with bounded partial sums. This answers a question of Erdős from $1957$ in the form conjectured by Tao. Second, we show that if the average of the first divided difference of the multiplicative function is zero, then either $f(n)=n^{s}$ for $\operatorname{Re}(s)<1$ or $|f(n)|$ is small on average. This settles an old conjecture of Kátai. Third, we apply our theorem to count the number of representations of $n=a+b$, where $a,b$ belong to some multiplicative subsets of $\mathbb{N}$. This gives a new ‘circle method-free’ proof of a result of Brüdern.

A weighted bilinear gradient inequality

2014 ◽  
Vol 144 (4) ◽  
pp. 819-829 ◽  
Author(s):  
Pedro Ortega Salvador
Keyword(s):  
Positive Constant ◽  
Image Position

We characterize the weights w0, w1, w2 such that the weighted bilinear gradient inequalityholds for all functions , with a positive constant K independent of f1 and f2, for all possible values of q, p1 and p2 with 1 < q, p1, p2 < ∞.

The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d

1997 ◽  
Vol 29 (3) ◽  
pp. 582-594 ◽  
Author(s):  
Martin J. B. Appel ◽  
Ralph P. Russo
Keyword(s):  
Random Graph ◽  
Nearest Neighbor ◽  
Vertex Degree ◽  
Degree Zero ◽  
Asymptotic Results ◽  
Limiting Behavior ◽  
Edge Distance ◽  
Vertex Set ◽  
Image Position

This article continues an investigation begun in [2]. A random graph Gn(x) is constructed on independent random points U1, · ··, Un distributed uniformly on [0, 1]d, d ≧ 1, in which two distinct such points are joined by an edge if the l∞-distance between them is at most some prescribed value 0 < x < 1.Almost-sure asymptotic results are obtained for the convergence/divergence of the minimum vertex degree of the random graph, as the number n of points becomes large and the edge distance x is allowed to vary with n. The largest nearest neighbor link dn, the smallest x such that Gn(x) has no vertices of degree zero, is shown to satisfy Series and sequence criteria on edge distances {xn} are provided which guarantee the random graph to be complete, a.s. These criteria imply a.s. limiting behavior of the diameter of the vertex set.

scholarly journals Primes in Short Segments of Arithmetic Progressions

1998 ◽  
Vol 50 (3) ◽  
pp. 563-580 ◽  
Author(s):  
D. A. Goldston ◽  
C. Y. Yildirim
Keyword(s):  
Asymptotic Formula ◽  
Lower Bounds ◽  
Arithmetic Progression ◽  
Riemann Hypothesis ◽  
Total Variance ◽  
Correct Order ◽  
Asymptotic Results ◽  
Extended Range ◽  
Order Of Magnitude ◽  
Almost All

AbstractConsider the variance for the number of primes that are both in the interval [y,y + h] for y ∈ [x,2x] and in an arithmetic progression of modulus q. We study the total variance obtained by adding these variances over all the reduced residue classes modulo q. Assuming a strong form of the twin prime conjecture and the Riemann Hypothesis one can obtain an asymptotic formula for the total variance in the range when 1 ≤ h/q ≤ x1/2-∈ , for any ∈ > 0. We show that one can still obtain some weaker asymptotic results assuming the Generalized Riemann Hypothesis (GRH) in place of the twin prime conjecture. In their simplest form, our results are that on GRH the same asymptotic formula obtained with the twin prime conjecture is true for “almost all” q in the range 1 ≤ h/q ≤ x1/4-∈, that on averaging over q one obtains an asymptotic formula in the extended range 1 ≤ h/q ≤ x1/2-∈, and that there are lower bounds with the correct order of magnitude for all q in the range 1 ≤ h/q ≤ x1/3-∈.

Sign in / Sign up

Export Citation Format

Share Document