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.

It is well-known that Einstein’s first attempt to explain E = mc2 which was published in Annalen der Physik in 1905, has been criticized as problematic. In particular, it has been shown by Ives and reiterated by Jammer that it suffers from the error of circular reasoning. Attempts have been made in the scientific literature to discount the circular reasoning objection of Ives, Jammer, Arzelies and others. Fritz Rohrlich in 1990 gave a remarkably simple and concise derivation of E = mc2 along lines similar to Einstein’s but based on both momentum and energy conservation, in contrast to Einstein’s which uses only energy considerations. Rohrlich’s approach using momentum conservation is an alternative to Einstein’s, which is free from objection in logical error, and we make it quite clear on the importance of the implicit assumption of momentum conservation in any attempt to refute the circular reasoning error in Einstein’s paper. It is our contention that this point is overlooked or altogether avoided by those who have attempted to uproot the circular reasoning criticism of Einstein’s paper.

In a recently published theorem on the split common fixed point problem for strict pseudocontractive and asymptotically nonexpansive mappings, Tang et al. (J. Inequal. Appl. 2015:305, 2015) studied a uniformly convex and 2-uniformly smooth real Banach space with the Opial property and best smoothness constant κ satisfying the condition $0 0 < κ < 1 2 , as a real Banach space more general than Hilbert spaces. A well-known example of a uniformly convex and 2-uniformly smooth real Banach space with the Opial property is $E=l_{p}$ E = l p , $2\leq p 2 ≤ p < ∞ . It is shown in this paper that, if κ is the best smoothness constant of E and satisfies the condition $0 0 < κ ≤ 1 2 , then E is necessarily $l_{2}$ l 2 , a real Hilbert space. Furthermore, some important remarks concerning the proof of this theorem are presented.

In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative fold orientations), but in general this specification is consistent with exponentially many possible folded states. We analyze the complexity of finding the best consistent folded state according to twometrics:minimizing the total number of layers in the folded state (so that a “flat folding” is indeed close toflat), andminimizing the total amount of paper required to execute the folding (where “thicker” creases consume more paper). We prove both problems strongly NP-complete even for 1D folding. On the other hand, we prove the first problem fixed-parameter tractable in 1D with respect to the number of layers., National Science Foundation (U.S.). Origami Design for Integration of Self-assembling Systems for Engineering Innovation (grant EFRI- 124038), National Science Foundation (U.S.). Expedition grant (CCF-1138967), United States. Department of Defense. National Defense Science and Engineering Graduate (NDSEG) Fellowship (32 CFR 168a)

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown that the second-order rate improves on an existing one based on independent and identically distributed random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state.

Annotated translations from Latin of three of the Euler’s papers on celestial mechanics are presented, which fall into the category of three-body problems. The first translation deals with an exact solution of three bodies that move around the common center of mass and always line up. This is considered the first work from which the three collinear Lagrange points could be obtained. The second translation deals with motions of Sun, Earth and Moon in syzygy and Moon libration as well, where, for the first time, Euler introduces an archaic form of a Fourier sine series expansion to describe the Moon’s wagging motion. The last translation relates to a paper that was written with the goal of alleviating astronomical computations of the perturbed motion of the Moon around the Earth by the Sun, ending up with eight coupled differential equations for resolving the perturbed motion of this celestial body. Despite showing great analytical skills, Euler gave no indications on how this system of equations could be solved, which renders his efforts practically useless in the determination of the variations of the nodal line and inclination of the Moon’s orbit.

In this note we offer some criticism on the paper “On an identity for zeros of Bessel functions” by Baricz et al. [3] . The paper gives identities of type Stieltjes–Calogero for the sums of reciprocals of differences of fourth powers of zeros of Bessel functions. Although interesting in principle, by containing one too many sums of similar complexity the identities fail to convey the true spirit of the work of Stieltjes and Calogero. We rectify this by providing what we think is the correct type of identity for the above-said sums, in the general setup of entire functions of order

The analysis of dielectric response function obtained from the power transformer is a well-accepted technique in insulation diagnosis. A convenient way of analysing time-domain dielectric response φ(t) is the formulation of simple resistance−capacitance-based circuits like the conventional Debye model (CDM) or the modified Debye model (MDM) that are capable of modelling φ(t). However, available techniques do not guarantee unique branch parameters of such circuits for a given φ(t). In fact, the branch parameters are known to depend on the curve-fitting procedure opted during model formulation. This makes accuracy of CDM and MDM parameter-based diagnosis techniques less reliable. Furthermore, it seems logical to analyse the time-domain dielectric response of oil-paper insulation using a model containing time-varying parameters. In this study, a methodology is proposed using which such an insulation model (containing time-varying parameters) is formulated using time-domain insulation response. Related analysis presented suggests that the proposed model is immune to problems associated with available insulation models (containing time-invariant parameters). The performance of the proposed model in indicating insulation condition is tested on data obtained from several real-life power transformers.

In this paper, we consider precoder designs for multiuser multiple-input-single-output (MISO) broadcasting channels. Instead of using a traditional linear zero-forcing (ZF) precoder, we propose a generalized ZF (GZF) precoder in conjunction with successive dirty-paper coding (DPC) for data-transmissions, namely, the GZF-DP precoder, where the suffix \lq{}DP\rq{} stands for \lq{}dirty-paper\rq{}. The GZF-DP precoder is designed to generate a band-shaped and lower-triangular effective channel $\vec{F}$ such that only the entries along the main diagonal and the $\nu$ first lower-diagonals can take non-zero values. Utilizing the successive DPC, the known non-causal inter-user interferences from the other (up to) $\nu$ users are canceled through successive encoding. We analyze optimal GZF-DP precoder designs both for sum-rate and minimum user-rate maximizations. Utilizing Lagrange multipliers, the optimal precoders for both cases are solved in closed-forms in relation to optimal power allocations. For the sum-rate maximization, the optimal power allocation can be found through water-filling, but with modified water-levels depending on the parameter $\nu$. While for the minimum user-rate maximization that measures the quality of the service (QoS), the optimal power allocation is directly solved in closed-form which also depends on $\nu$. Moreover, we propose two low-complexity user-ordering algorithms for the GZF-DP precoder designs for both maximizations, respectively. We show through numerical results that, the proposed GZF-DP precoder with a small $\nu$ ($\leq\!3$) renders significant rate increments compared to the previous precoder designs such as the linear ZF and user-grouping based DPC (UG-DP) precoders., Comment: 31 pages, 13 figures, submitted to IEEE Transactions on Wireless Communications in Aug. 2016

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.

This letter solves an open question of origami paper spring risen by Yoneda et al.(Phys. Rev. E 2019). By using both dimensional analysis and data fitting, a universal scaling law of a paper spring is formulated. The scaling law shows that origami spring force obeys power square law of spring extension, however strong nonlinear to the total twist angle. The study has also successfully generalized the scaling law from the Poisson ratio 0.3 to an arbitrary Poisson's ratio with the help of dimensional analysis., Comment: 3 pages, 3 figues and 1 table

It has been critically argued by V. A. Leus (Sobolev Institute of Mathematics, Novosibirsk, Russia) that in my proof that Einstein’s Special Theory of Relativity is logically inconsistent and therefore false, I violated the basic tenets of Special Relativity and foisted an alternative theory upon Einstein’s. A careful study of the critical analysis reveals however a failure to address the key arguments I adduced to prove Special Relativity logically inconsistent, and a concomitant invocation of Einstein’s theory to try to argue that my analysis is incorrect because it does not concur with Einstein. There is therefore no proof advanced of any alleged error in my analysis. In my paper I did not introduce an alternative theory. The aforementioned critical paper affords opportunity in rebuttal to amplify the invalidity of A. Einstein’s tacit assumption, in constructing the Special Theory of Relativity, that systems of clock-synchronised stationary observers consistent with Lorentz Transformation can be mathematically constructed. Since such systems of observers have in fact no mathematical existence the Special Theory of Relativity is logically inconsistent. It is therefore invalid. The consequences for physics, astronomy, and cosmology, are significant.

In a recent paper referred to in the title, the author used the concept of quasi self-adjointness to obtain conservation laws for a system of the ( 2 + 1 ) -dimensional Bogoyavlensky–Konopelchenko equation. Apart from the adjoint system of equations, all the results on the quasi self-adjointness and the subsequent conservation laws obtained are inaccurate. In this comment, we clarify these inaccuracies and also generate conservation laws for a potential form of the underlying equation through Noether theorem.

Based on symbolic and numeric manipulations, a model simplification technique is proposed in this paper for the linear fractional representation (LFR) and for the differential algebraic representation introduced by Trofino and Dezuo (2013). This representation is needed for computational Lyapunov stability analysis of uncertain rational nonlinear systems. The structure of the parameterized rational Lyapunov function is generated from the linear fractional representation (LFR) of the system model. The developed method is briefly compared to the n-D order reduction technique known from the literature. The proposed model transformations does not affect the structure of Lyapunov function candidate, preserves the well-posedness of the LFR and guarantees that the resulting uncertainty block is at most the same dimensional as the initial one. The applicability of the proposed method is illustrated on two examples.

O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants., Comment: 6 pages. Improved bound for Theorem 4

One of the simplest examples of a robust heteroclinic cycle involves three saddle equilibria: each one is unstable to the next in turn, and connections from one to the next occur within invariant subspaces. Such a situation can be described by a third-order ordinary differential equation (ODE), and typical trajectories approach each equilibrium point in turn, spending progressively longer to cycle around the three points but never stopping. This cycle has been invoked as a model of cyclic competition between populations adopting three strategies, characterised as Rock, Paper and Scissors. When spatial distribution and mobility of the populations is taken into account, waves of Rock can invade regions of Scissors, only to be invaded by Paper in turn. The dynamics is described by a set of partial differential equations (PDEs) that has travelling wave (in one dimension) and spiral (in two dimensions) solutions. In this paper, we explore how the robust heteroclinic cycle in the ODE manifests itself in the PDEs. Taking the wavespeed as a parameter, and moving into a travelling frame, the PDEs reduce to a sixth-order set of ODEs, in which travelling waves are created in a Hopf bifurcation and are destroyed in three different heteroclinic bifurcations, depending on parameters, as the travelling wave approaches the heteroclinic cycle. We explore the three different heteroclinic bifurcations, none of which have been observed in the context of robust heteroclinic cycles previously. These results are an important step towards a full understanding of the spiral patterns found in two dimensions, with possible application to travelling waves and spirals in other population dynamics models., Comment: 36 pages, 8 figures

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.

The objective of this contribution is to improve recent stability results for a system coupling ordinary differential equations to a vectorial transport partial differential equation by proposing a new structure of Lyapunov functional. Following the same process of most of the investigations in literature, that are based on an a priori selection of Lyapunov functionals and use the usual integral inequalities (Jensen, Wirtinger, Bessel...), we will present an efficient method to estimate the exponential decay rate of this coupled system leading to a tractable test expressed in terms of linear matrix inequalities. These LMI conditions stem from the new design of a candidate Lyapunov functional, but also the inherent properties of the Legendre polynomials, that are used to build a projection of the infinite dimensional part of the state of the system. Based on these polynomials and using the appropriate Bessel-Legendre inequality, we will prove an exponential stability result and in the end, we will show the efficiency of our approach on academic example.

Multi-sensor object detection and tracking on a highway scene with radar measurements is presented. The estimation algorithm is the random finite set based Bernoulli filter, working in the Bayesian framework. The recursion for calculating the Bayes estimation is implemented as a particle filter. A method is presented for calculating the likelihoods, suitable for particle filtering performed with moving sensors, assuming additive Gaussian measurement noise. In our approach, for calculating the posterior estimate of the object state, the measurement likelihoods are computed in the state space, instead of the measurement space, by mapping each measurement to the global coordinate system. The map consists of a nonlinear and an affine part. While the affine transformation trivially preserves the Gaussian nature, the nonlinear is well-proven to be approximated as affine too. This approach allows the particles to be drawn directly from the state space, hence the evaluation of the measurement model is not needed, which saves computational power.

We describe a method to construct smooth and compactly supported solutions of 3D incompressible Euler equations and related models. The method is based on localizable Grad–Shafranov equations and is inspired by the recent result (Gavrilov in A steady Euler flow with compact support. Geom Funct Anal 29(1):90–197, [Gav19]).

In this paper, the approximate capacity of the 3-receiver “writing on random dirty paper” (WRDP) channel is derived. In the M-receiver WRDP channel, the channel output is obtained as the sum of the channel input, white Gaussian noise and a channel state sequence randomly selected among a set of M independent Gaussian sequences. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which one is selected to produce the channel output. In the following, we derive upper and lower bounds to the capacity of the 3-receiver WRDP channel which are to within a distance of at most 3 bits-per-channel-use (bpcu) for all channel parameters. In the achievability proof, the channel input is composed of the superposition of three codewords: the receiver opportunistically decodes a different set of codewords, depending on the variance of the channel state appearing in the channel output. Time-sharing among multiple transmission phases is employed to guarantee that transmitted message can be decoded regardless of the state realization. In the converse proof, we derive a novel outer bound which matches the pre-log coefficient arising in the achievability proof due to time-sharing. Although developed for the case of three possible state realizations, our results can be extended the general WRDP.

We summarize the papers published by Einstein in the Annalen der Physik in the years 1902-04 on the derivation of the properties of thermal equilibrium on the basis of the mechanical equations of motion and of the calculus of probabilities. We point out the line of thought that led Einstein to an especially economical foundation of the discipline, and to focus on fluctuations of the energy as a possible tool for establishing the validity of this foundation. We also sketch a comparison of Einstein's approach with that of Gibbs, suggesting that although they obtained similar results, they had different motivations and interpreted them in very different ways., Comment: 22 pages, submitted to JSP

Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the channel modifying the interference is uncertain. We present an upper bound on the capacity of a compound vector dirty paper channel where although an additive Gaussian sequence is known to the transmitter, the channel matrix between the interferer and receiver is uncertain but known to lie within a bounded set. Our bound is tighter than previous bounds in the low-SIR regime for the scalar version of the compound dirty paper channel and employs a construction that focuses on the relationship between the dimension of the message-bearing signal and the dimension of the additive state sequence. Additionally, a bound on the high-SNR behavior of the system is established., Comment: to be presented at ISIT 2013

The primary role played by analogy in Henri Poincare’s work, and in particular in his “analysis situs” papers, is emphasized. Poincare’s “sixth example” (showing that Betti numbers do not suffice to classify 3-manifolds) and his construction of the homology sphere are discussed in detail.

We complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

Translation of the seminal 1877 paper by Ludwig Boltzmann which for the first time established the probabilistic basis of entropy. Includes a scientific commentary.

A Galerkin-based family of numerical formulations is presented for solving nonlinear optimal control problems. This paper introduces a family of direct methods that calculate optimal trajectories by discretizing the system dynamics using Galerkin numerical techniques and approximate the cost function with Gaussian quadrature. In this numerical approach, the analysis is based on L 2 -norms. An important result in the theoretical foundation is that the feasibility and consistency theorems are proved for problems with piecewise continuous controls. Galerkin methods may be formulated in a number of ways that allow for eficiency and/or improved accuracy while solving a wide range of optimal control problems with a variety of state and control constraints. Numerical formulations using Legendre test functions are derived. One formulation allows for a weak enforcement of boundary conditions, which imposes end conditions only up to the accuracy of the numerical approximation itself. Finally, a numerical example is shown to demonstrate the exponential convergence of Galerkin optimal control.

A generalized approach to design a proportional and derivative system faults fuzzy observer for continuous-time nonlinear systems described in the Takagi-Sugeno descriptor statespace form is presented in the paper. Considering measurable premise variables, the problem addressed is formulated as an enhanced concept to descriptor systems design, implying the asymptotic convergence both the state observer error as fault estimate error. Presented in the sense of the second Lyapunov method, an associated structure of linear matrix inequalities is outlined to possess the global observer asymptotic dynamic properties with compiling the local insiders by inference through the membership functions equal those of the system model. The proposed design conditions are verified by simulations in the numerical illustrative example.

The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected among a set possible realizations. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which sequence is selected to produce the channel output. We study the capacity of the CCDP channel for two scenarios: (i) the state sequences are independent and identically distributed, and (ii) the state sequences are scaled versions of the same sequence. In the first scenario, we show that a combination of superposition coding, time-sharing and Gel'fand-Pinsker binning is sufficient to approach the capacity to within three bits per channel use for any number of possible state realizations. In the second scenario, we derive capacity to within four bits-per-channel-use for the case of two possible state sequences. This result is extended to the CCDP channel with any number of possible state sequences under certain conditions on the scaling parameters which we denote as "strong fading" regime. We conclude by providing some remarks on the capacity of the CCDP channel in which the state sequences have any jointly Gaussian distribution.

We design a coding scheme for Costa's dirty paper coding (DPC) (M.H.M. Costa, 1983) using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC channel can be converted into the binary erasure channel (BEC) with binary interference with memory. Furthermore, the messages exchanged during the iterative decoding between the channel and shaping codes become one dimensional under the new model. We analyze the iterative decoding and find good shaping and channel code pairs using some closed-form extrinsic information transfer (EXIT) curves. We verify that our dirty paper codes designed using this method are also good for the original DPC channel with the additive white Gaussian noise (AWGN) and arbitrary interference. Our implementation of DPC uses short block codes such as repetition codes for shaping codes. Although the shaping gains of such codes are not very high, they may provide a better complexity-performance trade-off for simple practical implementations of DPC. Furthermore, we show accurate theoretical analysis is possible for such codes under our channel model.

This paper presents a new method to calculate the feedback control gain for a class of multivariable bilinear system, and also applied this method on the control of two sections of paper-making process with disturbance. The robust H∞ control problem is to design a state feedback controller such that the robust stability and a prescribed H∞ performance of the resulting closed-loop system are ensured. The controller turns out to be robust with respect to the disturbance in the plant. Utilizing the Schur complement and some variable transformations, the stability conditions of the multivariable bilinear systems are formulated in terms of Lyapunov function via the form of linear matrix inequality (LMI). The gain of controller will be calculated via LMI. Finally, the application examples of a headbox section and a dryer section of paper-making process are used to illustrate the applicability of the proposed method.

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 (Barbour, 1990) foundations for diffusion approximation via Stein's method are laid. This paper has been cited more than 130 times and is a cornerstone in the area of Stein's method. A semigroup argument is used therein to solve a Stein equation for Gaussian diffusion approximation. We prove that, contrary to the claim in (Barbour, 1990), the semigroup considered therein is not strongly continuous on the Banach space of continuous, real-valued functions on D[0,1] growing slower than a cubic, equipped with an appropriate norm. We also provide a proof of the exact formulation of the solution to the Stein equation of interest, which does not require the aforementioned strong continuity. This shows that the main results of (Barbour, 1990) hold true., Comment: 8 pages

Riemann’s mathematical papers contain many ideas that arise in physics, and some of them are motivated by problems from physics. In fact, it is not easy to separate Riemann’s ideas in mathematics from there in physics. Furthermore, Riemann’s philosophical ideas are often in the background of his work on science. The aim of this chapter is to give an overview of Riemann’s mathematical results based on physical reasoning or motivated by physics. We also elaborate on the relation with philosophy. While we discuss some of Riemann’s philosophical points of view, we review some ideas on the same subjects emitted by Riemann’s predecessors, and in particular Greek philosophers, mainly the pre-socratics and Aristotle.

This paper describes a way of implementing DPC in a Gaussian MIMO broadcast channel. The outer encoder is based on a vector TCQ designed to possess certain "good properties". Simpler schemes such as the Tomlinson Harashima or Scalar Costa's scheme are also considered by a way of comparison. The inner encoder is implemented through a vector version of the ZF-DPC and the MMSE-DPC. The BER performance of the DPC schemes is evaluated and compared to that of conventional interference cancellers (pre-ZF, pre-MMSE). From simulation results the choices of the inner encoder, the outer encoder (THS/SCS/TCQ) and the interference cancellation technique (conventional or DPC) are discussed.

We present some rigorous results about the bending behaviour of paper. By adapting these results to the Mobius strip, we obtain some qualitative properties of developable Mobius strips which minimize the bending energy. We also provide some numerical simulations which illustrate and strengthen the analytic results.

In this paper, we introduce some notions of invariancy for the Ricci tensor on real hypersurfaces in complex two-plane Grassmannians G 2 ( C m + 2 ) , namely, F -invariant and invariant Ricci tensor. Using these notions, we give non-existence theorem and characterization for the special case among the real hypersurfaces of Type ( A ) in G 2 ( C m + 2 ) , respectively. Here the distribution F is defined by F = [ ξ ] ∪ D ⊥ where D ⊥ = Span { ξ 1 , ξ 2 , ξ 3 } and [ ξ ] = Span { ξ } .

In T. Kruse and A. Popier, we established existence and uniqueness of solutions of backward stochastic differential equations in under a monotonicity condition on the generator and in a general filtration. There was a mistake in the case . Here we give a corrected proof. Moreover the quasi-left continuity condition on the filtration is removed.

In the paper (HA14), unfortunately, a computational error occurred in one estimate. Although the wrong estimate does not affect the main results, we want to present the necessary corrections. Essentially, Lemma 5.2 has to be corrected and, since it is used in the proof of Theorem 5.1, the proof of this theorem also requires an adaptation. (i) The corrected formulation of Lemma 5.2 is as follows. Lemma 5.2 For Lagrange finite elements with a shape-regular family of affine meshes { T n h } h>0 there is a constant C > 0 independent of q and h such that for all w ∈ Wh and q = 2m, m ∈N: CΛq−2 p (∇w,∇Ip h (wq−1))T ∫ T ‖∇w‖l2‖w‖ q−2 0,∞,T dx, ∀T ∈ T n h , (5.1) where Λp = ‖ ∑ndof i=1 |φi|‖0,∞,T is the Lebesgue constant.

We provide a commentary on Teichmuller's paper "Extremale quasikonforme Abbildungen und quadratische Differentiale" (Extremal quasiconformal mappings of closed oriented Riemann surfaces), Abh. Preuss. Akad. Wiss., Math.-Naturw. Kl. 1940, No.22, 1-197 (1940). The paper is quoted in several works, although it was read by very few people. Some of the results it contains were rediscovered later on and published without any reference to Teichmuller. In this commentary, we highlight the main results and the main ideas contained in that paper and we describe some of the important developments they gave rise to.

This is a mathematical commentary on Teichmuller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Flachen" (Determination of extremal quasiconformal maps of closed oriented Riemann surfaces). This paper is among the last (and may be the last one) that Teichmuller wrote on the theory of moduli. It contains the proof of the so-called Teichmuller existence theorem for a closed surface of genus at least 2. For this proof, the author defines a mapping between a space of equivalence classes of marked Riemann surfaces (the Teichmuller space) and a space of equivalence classes of certain Fuchsian groups (the so-called Fricke space). After that, he defines a map between the latter and the Euclidean space of dimension 6g-6 Using Brouwer's theorem of invariance of domain, he shows that this map is a homeomorphism. This involves in particular a careful definition of the topologies of Fricke space, the computation of its dimension, and comparison results between hyperbolic distance and quasiconformal dilatation. The use of the invariance of domain theorem is in the spirit of Poincare and Klein's use of the so-called ``continuity principle" in their attempts to prove the uniformization theorem.

We give a simple proof and a multivariable generalization of an identity due to E. Alkan concerning a weighted average of the Ramanujan sums. We deduce identities for other weighted averages of the Ramanujan sums with weights concerning logarithms, values of arithmetic functions for gcd's, the Gamma function, the Bernoulli polynomials, and binomial coefficients., Comment: 8 pages

We note a simple algebraic proof of Frolkina’s result that [Formula: see text] does not contain uncountably many pairwise disjoint copies of the Möbius band, and of a similar result in higher dimensions.

This paper examines zero-sum games that are based on a cyclic preference relation defined over undistinguished actions. For each of these games, the set of Nash equilibria is characterized. When the number of actions is odd, a unique Nash equilibrium is always obtained. On the other hand, in the case of an even number of actions, every such game exhibits an infinite number of Nash equilibria. Our results give some insights as to the robustness of Nash equilibria with respect to perturbations of the action set.

We supplement a very recent paper of R. Crandall concerned with the multiprecision computation of several important special functions and numbers. We show an alternative series representation for the Riemann and Hurwitz zeta functions providing analytic continuation through out the whole complex plane. Additionally we demonstrate some series representations for the initial Stieltjes constants appearing in the Laurent expansion of the Hurwitz zeta function. A particular point of elaboration in these developments is the hypergeometric form and its equivalents for certain derivatives of the incomplete Gamma function. Finally, we evaluate certain integrals including $\int_{\tiny{Re} s=c} {{\zeta(s)} \over s} ds$ and $\int_{\tiny{Re} s=c} {{\eta(s)} \over s} ds$, with $\zeta$ the Riemann zeta function and $\eta$ its alternating form., Comment: 17 pages, no figures

The archimedean solids Cubus simus (snub cube) and Dodecaedron simum (snub dodecahedron) cannot be constructed by ruler and compass. We explain that for general reasons their vertices can be constructed via paper folding on the faces of a cube, respectively dodecahedron, and we present explicit folding constructions. The construction of the Cubus simus is particularly elegant. We also review and prove the construction rules of the other Archimedean solids., Comment: 13 pages, 12 figures, v2: as published in Geometriae Dedicata

A bound on the capacity of the causal dirty-paper channel with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise, the capacity is upper bounded by log2(1+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2) .

The purpose of this comment is to correct mistaken assumptions and claims made in the paper “Stochastic feedback, nonlinear families of Markov processes, and nonlinear Fokker–Planck equations” by T. D. Frank [T.D. Frank, Stochastic feedback, non-linear families of Markov processes, and nonlinear Fokker–Planck equations, Physica A 331 (2004) 391]. Our comment centers on the claims of a “non-linear Markov process” and a “non-linear Fokker–Planck equation.” First, memory in transition densities is misidentified as a Markov process. Second, the paper assumes that one can derive a Fokker–Planck equation from a Chapman–Kolmogorov equation, but no proof was offered that a Chapman–Kolmogorov equation exists for the memory-dependent processes considered. A “non-linear Markov process” is claimed on the basis of a non-linear diffusion pde for a 1-point probability density. We show that, regardless of which initial value problem one may solve for the 1-point density, the resulting stochastic process, defined necessarily by the conditional probabilities (the transition probabilities), is either an ordinary linearly generated Markovian one, or else is a linearly generated non-Markovian process with memory. We provide explicit examples of diffusion coefficients that reflect both the Markovian and the memory-dependent cases. So there is neither a “non-linear Markov process”, nor a “non-linear Fokker–Planck equation” for a conditional probability density. The confusion rampant in the literature arises in part from labeling a non-linear diffusion equation for a 1-point probability density as “non-linear Fokker–Planck,” whereas neither a 1-point density nor an equation of motion for a 1-point density can define a stochastic process. In a closely related context, we point out that Borland misidentified a translation invariant 1-point probability density derived from a non-linear diffusion equation as a conditional probability density. Finally, in the Appendix A we present the theory of Fokker–Planck pdes and Chapman–Kolmogorov equations for stochastic processes with finite memory.

Two players of Rock-Paper-Scissors are modeled as adaptive agents which use a reinforcement learning algorithm and exhibit chaotic behavior in terms of trajectories of probability in mixed strategies space. This paper demonstrates that an external super-agent can exploit the behavior of the other players to predict favorable moments to play against one of the other players the symbol suggested by a sub-optimal strategy. This third agent does not affect the learning process of the other two players, whose only goal is to beat each other. The choice of the best moment to play is based on a threshold associated with the Local Lyapunov Exponent or the Entropy, each computed by using the time series of symbols played by one of the other players. A method for automatically adapting such a threshold is presented and evaluated. The results show that these techniques can be used effectively by a super-agent in a game involving adaptive agents that exhibit collective chaotic behavior.