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.

Investigating the research trends within a scientific domain by analyzing semantic information extracted from scientific journals has been a topic of interest in the natural language processing (NLP) field. A research trend evaluation is generally based on the time evolution of the term occurrence or the term topic, but it neglects an important aspect—research publication latency. The average time lag between the research and its publication may vary from one month to more than one year, and it is a characteristic that may have significant impact when assessing research trends, mainly for rapidly evolving scientific areas. To cope with this problem, the present paper is the first work that explicitly considers research publication latency as a parameter in the trend evaluation process. Consequently, we provide a new trend detection methodology that mixes auto-ARIMA prediction with Mann–Kendall trend evaluations. The experimental results in an electronic design automation case study prove the viability of our approach.

Rewinding machines are used in the paper converting industrial sector to unroll paper veils from large source reels and wind them around smaller rolls, for the production of paper logs to be used in household activities. Many different types of rewinding machine exist, and they are mostly based on stapling devices which automatically unroll a large coil of paper, roll it up around a new log, stop the veil allowing it to be torn off, unload the completed paper log, and reload a new paper core to be rolled up. Winding units generally include a primary and a secondary roller, supplying the desired rotational speed for winding, and a pressure unit consisting of a pressure roller in contact with the paper log being rolled up, which assures adequate containment and avoids the paper log to escape. All known systems have some mechanical limitations, mainly due to the contact of the pressure roller with the paper log, causing instabilities and vibrations, particularly when working with soft paper veils. This limits the maximum possible winding speed. The aim of this paper is it to present a detailed kinematic analysis of a novel pressure unit which overcomes the aforementioned limitation.

Very recently, I. Altun, M. Aslantas and H. Sahin [1] introduced the notion of $$p$$ -proximal contractions and surveyed the existence of best proximity points for such class of non-self mappings in metric spaces. In this note we show that this existence result is a straightforward consequence of the same conclusion in fixed point theory.

Sendov’s conjecture states that if all the zeroes of a complex polynomial P(z) of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of P(z). In a paper that appeared in 2014, Degot proved that, for each a ∈ (0, 1), there exists an integer N such that for any polynomial P(z) with degree greater than N, if P(a) = 0 and all zeroes lie inside the unit disk, the disk |z − a| ≤ 1 contains a critical point of P(z). Based on this result, we derive an explicit formula N(a) for each a ∈ (0, 1) and, consequently obtain a uniform bound N for all a ∈ [α, β] where 0 < α < β < 1. This (partially) addresses the questions posed in Degot’s paper.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We show that if there exists a continuous linear unbounded operator between l-K\"{o}the spaces, then there exists a continuous unbounded quasi-diagonal operator between them. Using this result, we study in terms of corresponding K\"{o}the matrices when every continuous linear operator between l-K\"{o}the spaces is bounded. As an application, we observe that the existence of an unbounded operator between l-K\"{o}the spaces, under a splitting condition, causes the existence of a common basic subspace.

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.

The translation into English of Aleksandr Yakovlevich Khinchin's (1894–1959) 1926 paper entitled ‘Ideas of intuitionism and the struggle for a subject matter in contemporary mathematics’ is made available for the first time. Here, Khinchin presented the famous foundational debate between L.E.J. Brouwer and David Hilbert of the 1920s in terms of a search for a mathematics with content. His main aim seems to have been to make intuitionism ideologically acceptable to his audience at the Communist Academy by means of the claim that insofar as Brouwer's intuitionism had a clear ‘subject matter’ and Hilbert's new program was a concession to intuitionism, the alleged victory of intuitionism not only implied the defeat of ‘empty’ formalism, but also showed the compatibility and affinity of Marxism with the newest developments in modern mathematics. This introduction provides a tentative exploration of the issue of what was tactical (or due to ideological pressure) and what was real scientific interest (or due to ignorance) (or what was both) in Khinchin's 1926 paper in the form of a detailed commentary, especially, on the tactical side of his presentation of the positions of Brouwer and Hilbert.

In 1903, Epstein published his proof of meromorphic continuation and a functional equation for Dirichlet series associated with quadratic forms, now called Epstein zeta-functions. However, already in 1889 (or even earlier) Hurwitz was aware of these results as his mathematical diaries and some unpublished notes (in an almost final form) found in his estate at the ETH Zurich show. In this article we present and analyze Hurwitz's notes and compare his reasoning with Epstein's paper in detail.

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 complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

In a recent paper, (Math Notes 91(3–4): 508–516, 2012) Zarhin proved that each member of a naturally defined family of linear maps \({\mathbb {C}}^n \rightarrow {\mathbb {C}}^n\) has co-rank one. We present a direct proof of Zarhin’s result about complex polynomials with distinct roots; it is rather similar to that of Appendix by Vik.S. Kulikov to Zarhin’s paper but we give explicit constants. We also discuss the case of a polynomial with multiple roots.

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.

We indicate how recent results of Grafakos and Teschl (J Fourier Anal Appl 19:167–179, 2013), and Estrada (J Fourier Anal Appl 20:301–320, 2014), relating the Fourier transform of a radial function in $$\mathbb R^n$$ and the Fourier transform of the same function in $$\mathbb R^{n+2}$$ and $$\mathbb R^{n+1}$$ , respectively, are located within known results on transplantation for Hankel transforms.

The issue of Bernstein polynomials is enough far from the basic range of Kantorovich’s interests. He devoted only two papers to them in 1930 and 1931 and made a report at the First All-Union Mathematical Congress in Khar’kov in 1930.

A left canonical factorization theorem for rational matrix functions relative to the unit circle is presented. The result is a time invariant version of a recent strict LU factorization theorem for certain semi-separable operators, due to Dewilde (2012) [6]. Explicit formulas for the factors are also given. The theorem is proved, first by using the state space method of Dewilde (2012) [6], and next by using an operator theory approach. In both cases the main part of the proof concerns rational matrix functions that are unitary on the unit circle. © 2012 Royal Dutch Mathematical Society (KWG).

What are modules? In Eilenberg [3], they are basically partial deterministic automata without initial or final states. In the paper “Modules” by Bret Tilson, this is taken one level up. Bret, in his seminal work [12], showed that one needs categories to understand wreath products of monoids. Obviously one should then need transformation categories to understand wreath products of transformation monoids. So why modules? Because there are results, like the Presentation Lemma [1, 2, 7, 10, 11, 13], where one needs to look at “quotients” of transformation monoids that lose their algebraic structure. This leads one to modules and wreath products of modules. So, for Bret, a module is like an automaton where the input alphabet is a graph. Such a gadget has a transition category and the derived transformation semigroup from [3] now gets its foundations fixed by becoming a module over a graph. The algebraic viewpoint to all of this is best obtained by reading Bret’s paper. I want to give a geometric overview of what Bret has achieved so that a wider audience can appreciate what he has done. In particular, I believe this gives the best justification for Bret’s change in the definition of division of transformation semigroup from that given in Eilenberg [3] to a tighter notion. For the past decade, or more, a number of people have been looking at automata from a geometric viewpoint. Perhaps Margolis and Meakin, in the case of inverse automata [5], were the first to emphasize this approach by relating inverse automata to Stallings’ notion of graph immersions [8]. Stallings folding, which was independently discovered by Bret [13], plays a key role in the “Modules” paper. I, and other

In this note we re-examine the analysis of the paper "On the martingale property of stochastic exponentials" by B. Wong and C.C. Heyde, Journal of Applied Probability, 41(3):654-664, 2004. Some counterexamples are presented and alternative formulations are discussed., Comment: To appear in Journal of Applied Probability, 11 pages

In the present paper, necessary and sufficient conditions are given for the equality of the power rezidue symbols $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ and $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ in the cyclotomic field ℚ(ζ n ), 2 ∤ n, for a ∈ ℤ, (a, n) = 1. This result is a generalization of the classical Eisenstein reciprocity law and its continuation in a Hasse’s paper. Bibliography: 3 titles.

An error has been detected (and also corrected) in Theorem 2.8 of the paper entitled “Adjoining an Order Unit to a Matrix Ordered Space” (Positivity, (2005)9: 207–223; DOI 10.1007/s11117-003-2778-5). Accordingly, some of the results of the paper have been modified. Also, a notion of C*-matricially, Riesz normed spaces has been introduced.

We investigate the Chow groups of projective determinantal varieties and those of their strata of matrices of fixed rank, using Chern class computations (© 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

The paper [3] contains an upper bound to the weighted density of a packing of circles on the unit sphere with radii from a given finite set. This bound is attained by many packings and has applications to problems of solidity. In the present note it is shown that a certain condition imposed on the set of admissible radii can be removed by modifying the original proof of the 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.

The concept of a metaplectic form was introduced about 40 years ago by T. Kubota. He showed how Jacobi-Legendre symbols of arbitrary order give rise to characters of arithmetic groups. Metaplectic forms are the automorphic forms with these characters. Kubota also showed how higher analogues of the classical theta functions could be constructed using Selberg's theory of Eisenstein series. Unfortunately many aspects of these generalized theta series are still unknown, for example, their Fourier coefficients. The analogues in the case of function fields over finite fields can in principle be calculated explicitly and this was done first by J. Hoffstein in the case of a rational function field. Here we shall return to his calculations and clarify a number of aspects of them, some of which are important for recent developments.

Complementing the work of T.-S. Liu and A.C.M. van Rooij we show that the existence of non-zero translation invariant operators between certain function spaces on a locally compact group implies its amenability.

The idea of cutting out a curve while looking at the direction of cut of the scissors is used to explore concepts related to curves, tangents and derivatives, especially tangent line, concavity and points of inflection, curvature, and a curve as envelope of tangent lines.

It is proved that the set of those natural numbers which cannot be written as n-Ω(n) is of positive lower density. Here Ω(n) is the number of the prime power divisors of n. This is a refinement of a theorem of F. Luca.

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 recent years, after a prolonged period of intense activity, the study of numerical methods for solving stiff initial-value problems for ordinary differential equations and differential algebraic equations has reached a certain maturity. There now exist some excellent codes which are both efficient and reliable for solving these particular classes of problems. In this paper, we sketch some of the main theory which underpins stiff integration methods and we use this to describe, and put into context, some of the best codes currently available. By referencing only codes which have been thoroughly tested and are widely available, our aim is to direct users of numerical software to those codes which they should try initially if faced with the problem of solving ordinary differential equations of this type. An additional feature is that the codes which we propose serve as benchmarks against which any new codes can be evaluated.

Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games.

Kolmogorov-Arnold-Moser (or KAM) theory was developed for conservative dynamical systems that are nearly integrable. Integrable systems in their phase space usually contain lots of invariant tori, and KAM theory establishes persistence results for such tori, which carry quasi-periodic motions. We sketch this theory, which begins with Kolmogorov's pioneering work.

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.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

We give the asymptotics of the sum \(\sum\nolimits_{x \leqslant n \leqslant x + h} {f(n)}\), where \(h \gg x^{7/12 + \varepsilon }\), for the multiplicative functions \(f(n) = z^{\omega (n)} , z^{\omega (n)} |\mu (n)|, 1/d_k (n)\), and \(nd(n)\).

This paper presents a sufficient condition for a one-dimensional Dirac operator with a potential tending to infinity at infinity to have no eigenvalues. It also provides a quick proof (and suggests variations) of a related criterion given by Evans and Harris.

A remarkable contribution to the theory of differential equations was made by Adolph Steen in 1874. His results were presented in Danish in a journal containing few articles on mathematics and were wholly ignored by the mathematical community for more than a century. During this time much of his work was rediscovered and extended by numerous authors; in fact the relevant literature embraces five languages in addition to the original Danish and is scattered over correspondingly many countries. In Part I we outline the historical development of Steen's ideas and in Part II we reproduce his pioneering article in an English translation. Though correction of a historical injustice is the primary goal, not everything in his paper has been rediscovered by others. Hence some of the results retain, even at this late date, more than merely historical interest.

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

We considered in Example 3.1 of the paper [1] an S-structure on R2n+s . We concluded that when s > 1 this manifold cannot be of constant φ-sectional curvature. Unfortunately this result is wrong. In fact, essentially due to a sign mistake in defining the φ-structure and a consequent transposition of the elements of the φ-basis (3.2), some of the Christoffel’s symbols were incorrect. In the present rectification, using a more slendler tecnique, we prove that our manifold is of constant φ-sectional curvature −3s and then it is η-Einstein.

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.

We consider the matrix for the Satake isomorphism with respect to natural bases. We give a simple proof in the case of Chevalley groups that the matrix coefficients which are not obviously zero are in fact positive numbers. We also relate the matrix coefficients to Kazhdan–Lusztig polynomials and to Bernstein functions.