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.

This work is a contribution to the Project UIDB/04035/2020, funded by FCT - Fundacao para a Ciencia e a Tecnologia, Portugal.

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

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.

We correct an error in the paper of Z. Shen, S. Li, and J. Zhang published in [4]. In addition, we give an answer to a question posed by the authors.

This expository paper presents known results on distribution functions g(x) of the sequence of blocks where xn is an increasing sequence of positive integers. Also presents results of the set G(Xn) of all distribution functions g(x). Specially: - continuity of g(x); - connectivity of G(Xn); - singleton of G(Xn); - one-step g(x); - uniform distribution of Xn, n = 1, 2, . . . ; - lower and upper bounds of g(x); - applications to bounds of ; - many examples, e.g., , where pn is the nth prime, is uniformly distributed. The present results have been published by 25 papers of several authors between 2001-2013.

We characterize functions of finite energy in the plane in terms of their traces on the lines that make up "graph paper" with squares of side length $mn$ for all $n$, and certain $\12-$order Sobolev norms on the graph paper lines. We also obtain analogous results for functions of finite energy on two classical fractals: the Sierpinski gasket and the Sierpinski carpet.

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.

The proofs of Theorem 2.2 of K. J. Dykema and M. Rørdam, Purely infinite simple C*-algebras arising from free product constructions, Canad. J. Math. 50 (1998), 323–341 and of Theorem 3.1 of K J. Dykema, Purely infinite simple C*-algebras arising from free product constructions, II,Math. Scand. 90 (2002), 73–86 are corrected.

It is shown that an old direct argument of Erdős and Heilbronn may be elaborated to yield a result of the current inverse type.

In our previous paper (Bull. Korean Math. Soc. 37(2000), 493-505), we claimed a theorem on a certain subset of a projective space over a finite field (Theorem 3.1). Recently, however, Professor Kato pointed out that our proof does not work if the field consists of two elements. Here we give an alternative proof of the theorem for the exceptional case.

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 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.

Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce from that a characterization of generalized Arnoux-Rauzy sequences or episturmian infinite words.

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.

The spectral gap conjecture of M. van den Berg [2, formula (65)] asserts that λ2 − λ1 ≥ 3π for all convex euclidean domains of diameter 1, where λ1 and λ2 denote the first two eigenvalues of the Dirichlet Laplacian. Notice that equality holds for the 1-dimensional unit interval, which can be regarded also as a degenerate n-dimensional rectangular box. The gap estimate is conjectured to hold more generally for Schrodinger operators with convex potentials, under Dirichlet boundary conditions; see the work of S.-T. Yau and collaborators [9, 11]. This Schrodinger gap conjecture was proved some time ago in 1 dimension by R. Lavine [8], and more recently in all dimensions by B. Andrews and J. Clutterbuck [1]. The proof in this journal by H. Donnelly [3] of the original gap conjecture in 2 dimensions (for the Dirichlet Laplacian with zero potential) is not correct. The Editors of Mathematische Zeitschrift have asked us to describe the flaws in the proof, in order to clarify the state of the literature. Donnelly’s approach to the problem is a natural one: first perform a shape optimization to rule out a non-degenerate minimizing domain, and then analyze the spectral gap for a sequence of domains degenerating to an interval, with the help of results by D. Jerison [5]. (For some history on this approach, and on the gap conjecture more generally, see the report on the AIM meeting “Low Eigenvalues of Laplace and Schrodinger Operators” [10], especially page 12 of the open problems list.) The error lies in the proof of the shape optimization step, as we now explain. Donnelly wishes to prove that no minimizing domain can exist for

We generalize and give a simple proof of a Theorem of Blasco. For a topological space X , C(X) denotes the algebra of real valued continuous functions on X under the operation (αf + gh)(x) := αf(x) + h(x)g(x) for each f, g, h ∈ C(X) and α ∈ R. An algebra A on X means a subalgebra of C(X) which contains the constant functions. By a ∗-algebra A on X we mean an algebra on X and all bounded functions in A separate points from the closed sets. Let A be an algebra on X and π : A −→ R be a (algebra) homomorphism and α be a cardinal number. π is said to be α-evaluating if for each subset B of A with cardinality at most α there exits xB ∈ X such that π(f) = f(xB) for each f ∈ B. If α = |N|(=the cardinal number of the set of the natural numbers N), the α-evaluating homomorphism is called countable evaluating. Let α be a cardinal number. Recall that a topological space X is called αLindelof if for each open cover U has a subcover V such that the cardinality of V is at most α. A lindelof space means a |N|-Lindelof space. The following theorem is given in [1] as one of the main results. Theorem 1. Let X be a completely regular Hausdorff space. Then X is Lindelof if and only if each countable evaluating homomorphism π on a ∗-algebra A on X is point evaluating. Received June 9, 2004; accepted June 30, 2004. Communicated by Bor-Luh Lin. 2000 Mathematics Subject Classification: Primary 54C35, 46E25.

One result concerning the series representation for the continuous Jacobi transform in Walter and Zayed [1] is improved, the same thought also can be applied to the related results in [1].

We observe that a strictly singular operator is not necessarily condensing, so that the invariant subspace problem for strictly singular operators remains open.

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

It is pointed out that the proof of the basic result of Rahmanov's paper has a serious gap. It is documented by original sources that a statement he relied on in the proof contains a misprint, and it is shown by a counterexample that this statement (with the misprint) is, in fact, false. A somewhat weaker statement is proved true.

The reading of Ayres' interesting paper suggested to me the following remarks: 1. The order of a subset of a set S in a point p4 cannot surpass the order of S in p. Hence if S2 denotes the set of all points of S of order 2, then S2 has in each point of S the order 2, the order 1, or the order 0, where the terms "order 0" and "0-dimensional" are used synonymously. SI(M), S2(1), S" may denote the set of all points of S in which S2 has the order 0, 1, 2, respectively. The points of order 2 of S are also called the ordinary points of S, and the set S2 of all ordinarv points of S may be called the ordinary part of S. The set S" of all ordinary points of the ordinary part of S may be designated the ordinary kernel of S. WVe have

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 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.

R. A. Brualdi [1] presents a construction yielding matrices whose Birkhoff representation consists of the maximum number of permutation matrices and having 0(2n2) line sum. In this note a counterexample to such a construction is given. Furthermore, a new construction is presented, yielding matrices with lower line sums.

n/a

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

We consider the problem of maximizing a homogeneous polynomial on the unit sphere and its hierarchy of sum-of-squares relaxations. Exploiting the polynomial kernel technique, we obtain a quadratic improvement of the known convergence rate by Reznick and Doherty and Wehner. Specifically, we show that the rate of convergence is no worse than $$O(d^2/\ell ^2)$$ O ( d 2 / ℓ 2 ) in the regime $$\ell = \Omega (d)$$ ℓ = Ω ( d ) where $$\ell $$ ℓ is the level of the hierarchy and d the dimension, solving a problem left open in the recent paper by de Klerk and Laurent (arXiv:1904.08828 ). Importantly, our analysis also works for matrix-valued polynomials on the sphere which has applications in quantum information for the Best Separable State problem. By exploiting the duality relation between sums of squares and the Doherty–Parrilo–Spedalieri hierarchy in quantum information theory, we show that our result generalizes to nonquadratic polynomials the convergence rates of Navascués, Owari and Plenio.

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.