Search

A classical result of K. L. Chung and W. Feller deals with the partial sums S k S_k arising in a fair coin-tossing game. If N n N_n is the number of “positive” terms among S 1 S_1 , S 2 S_2 , …, S n S_n then the quantity P ( N 2 n = 2 r ) P(N_{2n} = 2r) takes an elegant form. We lift the restriction on an even number of tosses and give a simple expression for P ( N 2 n + 1 = r ) P(N_{2n+1} = r) , r = 0 r = 0 , 1 1 , 2 2 , …, 2 n + 1 2n+1 . We get to this ansatz by adaptating the Feynman–Kac methodology.

Propositions 1.1–1.3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products $$\Pi^n_1(1-z^{a_j}),1\leq{a_1}...\leq{a_n}$$ integers. In the discussion below, {a1,..., an} will be either a proportional subset of {1,..., n} or a set of large arithmetic diameter.

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

In this paper author was proved the boundedness of the multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent. As an application we prove the boundedness of certain sublinear operators on the weighted variable Lebesgue space. Note that the proof of multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent don't contained any mistakes. But at the proving of the boundedness of certain sublinear operators on the weighted variable Lebesgue space Georgian colleagues discovered a small but significant error in this paper. This result is assigned as Theorem 5 in noted paper. In other words, sufficient conditions for general weights ensuring the validity of the two-weight strong type inequalities for some sublinear operator was found. In this theorem the inequality (9) isn't true. In this note we give the details of the correct argument. We presume that the reader is familiar with the contents and notation of our original paper. At the heart of our correction is the following Theorem which replaces Theorem 5.

In 1935, Erdos proved that all natural numbers can be written as a sum of a square of a prime and a square-free number. In 1939, Pillai derived an asymptotic formula for the number of such representations. The mathematical review of Pillai’s paper stated that the proof of the above result contained inaccuracies, thus casting a doubt on the correctness of the paper. In this paper, we re-examine Pillai’s paper and show that his argument was essentially correct. Afterwards, we improve the error term in Pillai’s theorem using the Bombieri–Vinogradov theorem.

We generalize a result of F. Luca and A. Sankaranarayanan by proving that the set of n for which ϕ(1) + + ϕ(n) is squareful is of zero density. A similar statement holds for σ (n) instead of ϕ(n) and for some other multiplicative functions.

AbsrtactStaring form a probability σ on the half-line moments of any order A. G. Pakes has defined probabilities σr, by length biasing order r and gr, by the stationary-excess operation of order r, r = 1, 2,…Examples are given to show that σ can bt determined in the Stieltjes sence while σ1 and g1 are indeterminate in the Stieltjes sence. This shows that a statement in a recent paper by Pakes does not hold.

In this note, we give a counterexample for Theorem 2.3 of the above mentioned paper that is a generalization of the Grothendieck non-vanishing theorem to a class of modules larger than finitely generated modules.

It is shown that an approach earlier used by the author for classification of closed simply connected 6-manifolds (reduction to the problem of calculating certain bordism groups) can also be applied for easily obtaining the results by Barden (1965) on classification of closed simply connected 5-manifolds. Bibliography: 11 titles.

In a recent paper, Chao-Ping Chen and Feng Qi (2005) established sharp upper and lower bounds for the sequence P n := 1.3 … ( 2 n − 1 ) 2.4 … 2 n P_{n}:=\frac {1.3\ldots (2n-1)}{2.4\ldots 2n} . We show that their result follows easily from a theorem of G. N Watson published in 1959. We also show that the main result of Chen and Qi’s paper is a special case of a more general inequality which admits a very short proof.

Zannier proved that for a Laurent series f(x) satisfying the functional equation of type f(x m ) = P(x, f(x)), where \( P(x, y) \in {\Bbb C}(x)[y] \), if f(x) is not rational the set of such m consists of the powers of a single integer. He mentioned that the case f(x) = P(x, f(x m )) should be proved in a similar way. In this paper we first verify this statement and second we show a theorem which is useful for proving the transcendence of a Laurent series satisfying a certain functional equation. This theorem is a generalization of the result that a Laurent series which satisfiesf(x m ) = P(x, f(x)), where\( P(x, y) \in {\Bbb C}(x, y),\,m \geq 2 \)cannot represent an algebraic function unless it is rational (Ke. Nishioka [1], Zannier [8], Section 3).

In [1] Kohli and Vashistha gave an analogue of probabilistic version of Pant‘s Theorem ([2], Theorem 1). We note that mappings defined in Examples 3.6 to 3.8 of [1] are not self maps as claimed in the Definitions 3.1 and 3.2. In this context, we provide some relevant examples to complete the interesting results.

Concerns have been voiced about the correctness of certain technical points in DiPerna’s paper (Comm. Math. Phys. 91 (1983), 1–30) related to the vacuum state. In this note, we provide clarifications. Our conclusion is that these concerns mainly arise from the statement of a lemma for constructing the viscous approximate solutions and some typos; however, the gap can be either fixed by correcting the statement of the lemma and the typos or bypassed by employing the finite difference methods. In [Di], DiPerna found a global entropy solution of the isentropic Euler equations for the following exponents in the equation of state for the pressure: γ = 1 + 2/(2m+ 1), m ≥ 2 integer. (1) He divided his arguments into the following two steps. 1. Compactness framework Assume that a sequence of approximate solutions (ρ (x, t),m (x, t)), 0 ≤ t ≤ T , satisfies: (i). There exists a constant C(T ) > 0, independent of > 0, such that 0 ≤ ρ (x, t) ≤ C, |m (x, t)/ρ (x, t)| ≤ C; (ii). For all weak entropy pairs (η, q) of the isentropic Euler equations, the measure sequence η(ρ ,m )t + q(ρ ,m )x is contained in a compact subset of H −1 loc (R× [0, T ]). If γ satisfies (1), then the sequence (ρ (x, t),m (x, t)) is compact in Lloc(R× [0, T ]). The reason for the restriction on the number γ is that, in such a case, any weak entropy function is a polynomial function of the Riemann invariants (w, z). This is the key step in DiPerna’s arguments and is also his main contribution to the compensated compactness method in this aspect. Received by the editors May 16, 1996. 1991 Mathematics Subject Classification. Primary 35K55, 35L65; Secondary 76N15, 35L60, 65M06.

Let c e IN. For d e ℤ with gcd (d, c) = 1 let δ(d, c) be defined by d · δ(d, c) 1 mod c, 1 ⩽ δ(d, c) ⩽ c. Let s, t e IN with 1 ⩽ s ⩽ c, 1 ⩽ t ⩽ c. The main result is that for arbitrary fixed e > 0, but uniformly over c, s and t Equivalently, the points (d, δ(c,d)) are approximately uniformly distributed in [0, c] × [0, c]: The two-dimensional discrepancy of {(d,δ (c, d)): 1 ⩽ d ⩽ c and (c, d)= 1} in [0,c] × [0,c] is Oe(ce-1/2).

I regret to announce that there is a serious error in my paper in these Transactions, volume 84, pp. 430-443. The error was discovered by Louis Kokoris who found that on line 8 of page 434 the expression given as 4[g(bz)](az) should have been 4[g(az)](bz). As a consequence the computation of P(z, g, az, b) yields nothing, the proof of formula (30) is not valid, and the important Lemma 9 is not proved. Thus the paper does not give a proof of its major result stated as Theorem 1. Nevertheless, the theorems of the paper are all correct and we shall provide a revision of the proof here. This revised proof has been checked by Louis Kokoris to whom the author wishes to express his great thanks. We observe first that the equation

The purpose of this note is to present a new proof of a generalized form of Day's fixed point theorem. The proof we give is suggested by the work of T. Mitchell in his paper, Function algebras, means, and fixed points, [2]. The version of Day's theorem which we present here has not appeared explicitly in the literature before, and seems especially well suited for application to questions concerning fixed point properties of topological semigroups. 1. Preliminaries. We adopt the terminology and notation of [2] except where otherwise specified. New terminology will be introduced as needed. Let y be a convex compactum (compact convex set in a real locally convex linear topological space E), and let A( Y) denote the Banach space of all (real) continuous affine functions on Y under the supremum norm. Observe that A(Y) contains every function of the form h=f\Y + r where fe E* and r is real; thus A(Y) separates points of Y.

It is pointed out that theL1 convergence classes of Fourier series of even functions considered in [2] and [3] are subclasses of theL1 convergence classes of Fomin [7]. Moreover, showing the simple fact that for eachp>1 the classesCp andVp considered in [2] coincide, whereCp={(ak):ak=o (1) and\(n^{p - 1} \sum\limits_{k = n}^\infty {\left| {\Delta _{ak} } \right|^p = o} \left( 1 \right)\)}, it follows that the main result in [2] reduces to an earlier theorem of Fomin [5]. Other equivalent descriptions of these classes are also given.

It is shown that unbranched proper holomorphic maps between pseudoconvex domains with smooth C∞ boundaries, one of which satisfies subelliptic estimates for the\(\bar \partial\)-Neumann problem on (0,1)-forms, extend to unbranched C∞-coverings between the closures of the domains.

The aim of this short note is to improve some recent results of B. Grunbaum by some remarks. We use Grunbaum's notations.

For every separable Banach spaceX there is a Banach spaceY with a separable dual such thatY ⊕X* ≈Y**. There is also a separable spaceZ so thatZ**/JZ is isomorphic toX.

Let H be a real or complex Hilbert space and let L p(1≦p

1. In a recent paper [2] Reich has made the observation that an example of Koebe given in 1918 [1] does not fulfill its asserted purpose. This example was to show that vanishing measure of the complement did not assure that a slit domain was minimal. Reich proceeded to fill the gap by carrying out the following somewhat more general construction. Let A be a compact perfect nowhere dense set on the x-axis in the z-plane (z=x+iy). Then there exists a compact set S in the z-plane with the properties: (i) A is the projection of S on the x-axis, (ii) S is composed of segments symmetric with respect to the x-axis and points on the x-axis, at least one segment being present, (iii) any point in S, not on the x-axis and not at the end of a segment in S, is the limit, both from the left and right, of points of S. Once this construction is performed the desired examples are easily given [2, ?4]. The object of the present paper is to give an alternative construction which is very explicit and direct.

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

In this paper the following generalization of a theorem by B.R. Gelbaum is proved: Let (K, d) be a compact, connected metric space. Let B denote the Borel sets of (K, d), and P be a probability measure on B with P(G)≠O for any nonempty open G, f, geC(K,d) independent random variables on (K,B,P) and let g satisfy the following assumption: There is an y o∃ℝ such that g −1(y0) is a finite nonempty set. Then f is a constant function. Examples show that the assumptions of this theorem are essential.

Throughout, (X, ≤ ) denotes a partially ordered set (p. o. set), where X is assumed to be finite. A subset Y of X is called a k-union if Y contains no chain of length K + 1. In particular, therefore, a 1-union is just an antichain; and it is readily seen that Y is a k-union if and only if it is a union of K antichains. (Dually, a subset Z of X is a k-counion if Z contains no antichain of length k + 1.) We denote by dk (X) the maximum cardinality of a k-union in X, with a similar notation for other p. o. sets. Now let be any partition of X into chains, and write.

An associative locally finite algebra which is also an integral domain over an algebraically closed field is isomorphic to the ground field.

‡ Abstract. In this short paper we study the game of cops and robbers, which is played on the vertices of some fixed graph G. Cops and a robber are allowed to move along the edges of G, and the goal of cops is to capture the robber. The cop number cðGÞ of G is the minimum number of cops required to win the game. Meyniel conjectured a long time ago that Oð ffiffiffi p Þ cops are enough for any connected G on n vertices. Improving several previous results, we prove that the cop number of an n-vertex graph is at most n2 −ð1þoð1ÞÞ ffiffiffiffiffiffiffiffi log n p .A similar result independently and slightly before us was also obtained by Lu and Peng.

Wahl recently proved that the homology of the non-orientable mapping class group stabilizes as the genus increases. In this short paper we analyse the situation where the underlying non-orientable surfaces have marked points.

In this short paper I describe special situations where a local ring is normally flat along a divisorial prime ideal.

The converse of the Borel–Cantelli Lemma states that if { A i } i = 1 ∞ is a sequence of independent events such that ∑ P ( A i ) = ∞ , then almost surely infinitely many of these events will occur. Erdős and Renyi proved that it is sufficient to weaken the condition of independence to pairwise independence. Later, several other weakenings of the condition appeared in the literature. The aim of this paper is to provide a collection of conditions, all of which imply that almost surely infinitely many of the events occur, and determine the complete implicational relationship between them. Many of these results are known, or follow from known results, however, they are not widely known among non-specialists. Yet, the results can be extremely useful for areas outside of probability theory, as evidenced by the original motivation of this paper emerging from infinite combinatorics. Our proofs are aimed to be accessible to a general mathematical audience.

In this paper, in the light of weighted sharing of sets, we investigate the possible uniqueness of meromorphic function of restricted hyper order with its linear c-shift operator. Our first two theorems improve a number of earlier results. Our last theorem together with a corollary improves and extends a result due to Li, Lu and Xu [14]. Most importantly, our another corollary deducted from the last theorem not only provides an answer to an open question posed by Liu [16] but also noticeably improves two results of Chen and Chen [4]. A number of examples have been exhibited by us pertinent with the content of the paper. At the penultimate section which is also the application part of our result, we extend a recent result of Liu, Ma and Zhai [17]. Finally, presenting two examples, we conjecture that one of our result may hold for a larger class of functions and we place it as an open question for future investigations.

Fifty years ago P. Erdős and A. Rényi published their famous paper on the new law of large numbers. In this survey, we describe numerous results and achievements which are related with this paper or motivated by it during these years.

This paper studies the virtual $\chi_{-y}$-genera of Grothendieck's Quot schemes on surfaces, thus refining the calculations of the virtual Euler characteristics by Oprea-Pandharipande. We first prove a structural result expressing the equivariant virtual $\chi_{-y}$-genera of Quot schemes universally in terms of the Seiberg-Witten invariants. The formula is simpler for curve classes of Seiberg-Witten length $N$, which are defined in the paper. By way of application, we give complete answers in the following cases: (i) arbitrary surfaces for the zero curve class, (ii) relatively minimal elliptic surfaces for rational multiples of the fiber class, (iii) minimal surfaces of general type with $p_g>0$ for any curve classes. Furthermore, a blow up formula is obtained for curve classes of Seiberg-Witten length $N$. As a result of these calculations, we prove that the generating series of the virtual $\chi_{-y}$-genera are given by rational functions for all surfaces with $p_g>0$, addressing a conjecture of Oprea-Pandharipande. In addition, we study the reduced $\chi_{-y}$-genera for $K3$ surfaces and primitive curve classes with connections to the Kawai-Yoshioka formula., Comment: 48 pages. Reformulation of Theorem 1 for readability. Extra explanation for the mixed terms in section 2.2.3. Reference updates

In Li et al. (J Aust Math Soc 97:383–390, 2014), the authors discussed two classes of mappings in Banach spaces, which are $$\varphi $$ -quasiisometric mappings in the distance ratio metric (briefly, $$\varphi $$ -DRQI mappings) and fully $$\varphi $$ -quasiisometric mappings in the distance ratio metric (briefly, $$\varphi $$ -FDRQI mappings), where $$\varphi :$$ $$[0,\infty )\rightarrow [0,\infty )$$ denotes a quasiisometric control function. In this paper, we continue this discussion by introducing a new class of mappings, that is, $$\varphi $$ -PDRQI mappings. The purpose of this paper is twofold. Let f be a homeomorphism between two proper domains in a Banach space. First, we prove that f being $$\varphi $$ -PDRQI is equivalent to f being $$\varphi $$ -FDRQI. Then, as an application of the obtained equivalent relation, we show that f being $$\varphi $$ -DRQI, f being $$\varphi $$ -PDRQI and f being $$\varphi $$ -FDRQI are equivalent to each other when the quasiisometric control functions have the form $$\varphi (t)=Mt$$ .

Connectivity is a key theory in fuzzy incidence graphs FIGs . In this paper, we introduced connectivity index CI , average connectivity index ACI , and Wiener index WI of FIGs . Three types of nodes including fuzzy incidence connectivity enhancing node FICEN , fuzzy incidence connectivity reducing node FICRN , and fuzzy incidence connectivity neutral node FICNN are also discussed in this paper. A correspondence between WI and CI of a FIG is also computed.

Since the appearance of Robbins’s paper (1948) the central limit theorem for a sum of a random number of independent identically distributed random variables is one of the most fundamental results in probability, and explains the appearance of the normal distribution in a whole host of diverse applications in mathematics, physics, biology and the social sciences. Compound random sums are extensions of classical random sums when the numbers of independent summands in sums are partial sums of independent identically distributed positive integer-valued random variables, assumed independent of summands of sums. The main aim of this paper is to introduce central limit theorems for normalized compound random sums of independent random variables and establish the convergence rates in types of small-o and large- $$\mathcal{O}$$ estimates, in term of Trotter-distance. The obtained results in this paper are extensions of several known ones.