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.

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.

This discussion reviews the paper by Zhengjun Zhang in the context of broader research on multivariate extreme value theory and max-stable processes.

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

Giving the proper citations, it is shown that, except of Lemma 2.4 and Theorem 2.6, almost all the results of the paper in the title have been previously published for ordered hypersemigroups in Eur. J. Pure Appl. Math. and they are not new. There are also two results obtained from ordered semigroups just putting a ``$\circ$" instead of ``$\cdot$" (that isn't a correct way to work), without reference to ordered semigroups on which the results on ordered hypersemigroups are based. One of them can be obtained as corollary to a theorem in Eur. J. Pure Appl. Math. as well, and it is not new.

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. © 2019 Howison et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

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

In this work, we describe a new approach that uses deep neural networks (DNN) to obtain regularization parameters for solving inverse problems. We consider a supervised learning approach, where a network is trained to approximate the mapping from observation data to regularization parameters. Once the network is trained, regularization parameters for newly obtained data can be computed by efficient forward propagation of the DNN. We show that a wide variety of regularization functionals, forward models, and noise models may be considered. The network-obtained regularization parameters can be computed more efficiently and may even lead to more accurate solutions compared to existing regularization parameter selection methods. We emphasize that the key advantage of using DNNs for learning regularization parameters, compared to previous works on learning via optimal experimental design or empirical Bayes risk minimization, is greater generalizability. That is, rather than computing one set of parameters that is optimal with respect to one particular design objective, DNN-computed regularization parameters are tailored to the specific features or properties of the newly observed data. Thus, our approach may better handle cases where the observation is not a close representation of the training set. Furthermore, we avoid the need for expensive and challenging bilevel optimization methods as utilized in other existing training approaches. Numerical results demonstrate the potential of using DNNs to learn regularization parameters., 27 pages, 16 figures

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

Thomas L. Saaty, a world-renowned scholar and our beloved Advisory Editor, passed away on August 14, 2017 at the age of 91.  He has made many fundamental contributions to operations research, analytics, business and mathematics. Despite his heavy illness for 14 months, as passionate about science, he has also enthusiastically published his research. We review his final works published in 2017 and 2018. We are also honored to reveal and publish his final statements on neural firing and synthesis in making comparisons & life satisfaction, respectively, in his final two papers; the previous one submitted by him just before his passing and the other one submitted by his co-authors after his death to European Journal of Pure and Applied Mathematics (EJPAM).We just would like to remember and honor Saaty’s memory by publishing his final papers at EJPAM and this humble remarks dedicated to the memory of Thomas L. Saaty on the occasion of the first anniversary of his passing, August 14, 2018.

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs. Moreover, we extend the definition of approximately pseudo-dissipative in the setting of metrizable topological vector spaces.

We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata.

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

This Forum Note concerns the question of necessary optimality conditions in optimal control problems subject to state constraints. Some critical remarks about a recently published paper are made.

Author summary Conferences are great venues for disseminating algorithmic bioinformatics results, but they unfortunately do not offer an opportunity to make major revisions in the way that journals do. As a result, it is not possible for authors to fix mistakes that might be easily correctable but nevertheless can cause the paper to be rejected. As a reviewer, I wish that I had the opportunity to tell the authors, “Hey, you forgot to do this really important thing, without which it is hard to accept the paper, but if you could go back and fix it, you might have a great paper for the conference.” This lack of a back and forth can be especially problematic for first-time submitters or those from outside the field, e.g., biologists. In this article, I outline Ten Simple Rules to follow when writing an algorithmic bioinformatics conference paper to avoid having it rejected.

The purpose of this comment paper is to show that the results of the paper (Cui, 2021) are incorrect.

These notes aim to provide a deeper insight on the specifics of two articles dealing with chemotaxis models with nonlinear production. More precisely, we are referring to the papers “Boundedness of solutions to a quasilinear parabolic–parabolic chemotaxis model with nonlinear signal production” by Tao et al. (2019) [2] and “Boundedness for a fully parabolic Keller–Segel model with sublinear segregation and superlinear aggregation” by Frassu and Viglialoro (2021) [1] . These works, independently published in these last years, present results leaving open room for further improvement. Indeed, in the first a gap in the proof of the main claim appears, whereas the cornerstone assumption in the second is not sharp. In these pages we give a more complete picture to the relative underlying comprehension.

This paper addresses the stability analysis of linear systems subject to a time-varying delay. The contribution of this paper is twofolds. First, we aim at presenting a new matrix inequality, which can be seen as an improved version of the reciprocally convex combination, which provides a more accurate delay-dependent lower bound. When gathering this new inequality with the Wirtinger-based integral inequality, efficient stability conditions expressed in terms of LMI are designed and show a clear reduction of the conservatism with a reasonable associated computational cost. The second original contribution of this paper consists in noting that stability conditions issued from the Wirtinger-based integral inequality depends in an affine manner on the bounds of the delay function and also on its derivative. This allows to refine the definition of allowable delay set and to relax usual convex on the delay function. As a result of this new characterization, the LMI conditions allows obtaining stability regions for slow time-varying delay systems which are very closed to the constant delay case.

International audience; This article studies the kinetic dynamics of the rock-paper-scissors binary game. We first prove existence and uniqueness of the solution of the kinetic equation and subsequently we prove the rigorous derivation of the quasi-invariant limit for two meaningful choices of the domain of definition of the independent variables. We notice that the domain of definition of the problem plays a crucial role and heavily influences the behavior of the solution. The rigorous proof of the relaxation limit does not need the use of entropy estimates for ensuring compactness.

A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium., Author summary A game of rock-paper-scissors is more than just a children’s game. This type of interactions is often used to describe competition among animals or humans. A special feature of such an interaction is that none of the pure strategies dominates, resulting in a cyclic pattern. However, in wild communities such interactions are rarely observed by biologists. Our results suggest that this lack of cyclicity may stem from imperfectness of interacting individuals. In other words, we show analytically that heterogeneity in behavioural patterns may break a cyclic relationship and lead to a stable equilibrium in pure or mixed strategies.

We discuss the recent paper by A. Dar\'os and L.K. Arruda (On the instability of elliptic traveling wave solutions of the modified Camassa-Holm equation, J. Diff. Equat., 266 (2019), 1946-1968). Our intention is to correct some imperfections left by the authors and present the orbital stability of periodic snoidal waves in the energy space., Comment: 10 pages and 2 figures

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.

In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later, in 2005, Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding, by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a large family containing all linear codes. We also compute the exact number of embedding solutions and point out the relationship between wet paper codes and orthogonal arrays.

We congratulate the authors Bertsimas, Pauphilet and van Parys (hereafter BPvP) and Hastie, Tibshirani and Tibshirani (hereafter HTT) for providing fresh and insightful views on the problem of variable selection and prediction in linear models. Their contributions at the fundamental level provide guidance for more complex models and procedures.

Inspired by the article “Anomalous relaxation model based on the fractional derivative with a Prabhakar-like kernel” (Z. Angew. Math. Phys. (2019) 70:42) whose authors Zhao and Sun studied the integro-differential equation with the kernel given by the Prabhakar function $$e^{-\gamma }_{\alpha , \beta }(t, \lambda )$$ , we provide the solution to this equation which is complementary to that obtained up to now. Our solution is valid for effective relaxation times whose admissible range extends the limits given in Zhao and Sun (Z Angew Math Phys 70:42, 2019, Theorem 3.1) to all positive values. For special choices of parameters entering the equation itself and/or characterizing the kernel, the solution comprises to known phenomenological relaxation patterns, e.g., to the Cole–Cole model (if $$\gamma = 1, \beta =1-\alpha $$ ) or to the standard Debye relaxation.

The aim of this paper is the development of a mathematical model to compute the optimal inventory mix to face stochastic demand at minimum cost in a two-level supply chain. The paper addresses a multi-product dynamic lot-sizing problem under stochastic demand subject to capacity and service level constraints. This model is executed to compare a Make To Order (MTO) strategy to a Vendor Managed Inventory (VMI) partnership between the supplier and their customers. Both strategies provide the demand order to be produced. A schedule of production orders is determined over the planning horizon in order to minimize the inventory holding costs of the supply chain, taking into consideration that the supplier is also responsible of initiating the replenishment orders and deliveries of their customers according to the VMI partnership. The simulation model is illustrated empirically using a real case study: a paper manufacturing company that pursues to improve customer service level and supply chain inventory costs through a proper production planning of their paper machines and a suitable VMI order replenishment schedule.

We propose a new concept which is a generalization of fuzzy soft subset and fuzzy soft equal. Using such notions, we will be able to consider the distributive law of fuzzy soft sets. Using the distributive law of fuzzy soft sets, we point out that the distributive law of trapezoidal fuzzy soft sets as proposed by Xiao et al. (2012) is not true. The correction will further improve further extensions of the results of Xiao et al. (2012). We will also establish the generalized distributive law of trapezoidal fuzzy soft sets along with illustrative examples.

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

I would like to take this opportunity to congratulate Zhengjun for his continuing contribution to extreme-value statistics in recent years. In this review paper, some fundamental theories on univar...

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing.

Discretizing a differential equation may change the qualitative behaviour drastically, even if the stepsize is small. We illustrate this by looking at the discretization of a piecewise continuous differential equation that models a population of agents playing the Rock-Paper-Scissors game. The globally asymptotically stable equilibrium of the differential equation turns, after discretization, into a repeller surrounded by an annulus shaped attracting region. In this region, more and more periodic orbits emerge as the discretization step approaches zero.

We derive a one-dimensional model that describes pressing of water saturated paper in the press-section of the paper machine. The model involves two nonlinear diffusion equations which are coupled across an internal boundary. Existence and uniqueness as a number of qualitative properties are demonstrated. Further, computational results for a concrete case are discussed.

In (2012), Leonetti and Siepe [10] considered solutions to boundary value problems of some anisotropic elliptic equations of the type { ∑ i = 1 n D i ( a i ( x , D u ( x ) ) ) = 0 , x ∈ Ω , u ( x ) = θ ( x ) , x ∈ ∂ Ω . Under some suitable conditions, they obtained an integrability result, which shows that higher integrability of the boundary datum θ forces solutions u to have higher integrability as well. In the present paper, we consider K ψ , θ ( p i ) -obstacle problems of the nonhomogeneous anisotropic elliptic equations ∑ i = 1 n D i ( a i ( x , D u ( x ) ) ) = ∑ i = 1 n D i f i ( x ) under some controllable growth and monotonicity conditions. We obtain an integrability result, which can be regarded as a generalization of the result due to Leonetti and Siepe.

In several recent papers, attempts have been made to apply Wardowski's method of $F$-contractions in order to obtain fixed point results for single and multivalued mappings in $b$-metric spaces. In this article, it is shown that in most cases the conditions imposed on respective mappings are too strong and that the results can be obtained directly, i.e., without using most of the properties of auxiliary function $F$.

In a series of papers by Annunziato and Borzi, Model Predictive Control of the Fokker-Planck equation has been established as a numerically feasible way for controlling stochastic processes via their probability density functions. Numerical simulations suggest that the resulting controller yields an asymptotically stable closed loop system for optimization horizons looking only one time step into the future. In this paper we provide a formal proof of this fact for the Fokker-Planck equation corresponding to the controlled Ornstein-Uhlenbeck process using an L2 cost and control functions that are constant in space. The key step of the proof consists in the verification of an exponential controllability property with respect to the stage cost. Numerical simulations are provided to illustrate our results.

Paperfolding sequences are represented by 0’s and 1’s. In this paper, we introduce paper-oor sequences which are represented by nonnegative integers. We investigate the structure of paper-oor sequences which represent the oors obtained by paperfoldings. Mathematics Subject Classication: 97A20, 68R99

Rock-paper-scissors games metaphorically model cyclic dominance in ecology and microbiology. In a static environment, these models are characterized by fixation probabilities obeying two different "laws" in large and small well-mixed populations. Here, we investigate the evolution of these three-species models subject to a randomly switching carrying capacity modeling the endless change between states of resources scarcity and abundance. Focusing mainly on the zero-sum rock-paper-scissors game, equivalent to the cyclic Lotka-Volterra model, we study how the ${\it coupling}$ of demographic and environmental noise influences the fixation properties. More specifically, we investigate which species is the most likely to prevail in a population of fluctuating size and how the outcome depends on the environmental variability. We show that demographic noise coupled with environmental randomness "levels the field" of cyclic competition by balancing the effect of selection. In particular, we show that fast switching effectively reduces the selection intensity proportionally to the variance of the carrying capacity. We determine the conditions under which new fixation scenarios arise, where the most likely species to prevail changes with the rate of switching and the variance of the carrying capacity. Random switching has a limited effect on the mean fixation time that scales linearly with the average population size. Hence, environmental randomness makes the cyclic competition more egalitarian, but does not prolong the species coexistence. We also show how the fixation probabilities of close-to-zero-sum rock-paper-scissors games can be obtained from those of the zero-sum model by rescaling the selection intensity., 31 pages, 15 figures: Main text (18 pages, 9 figures) followed by Supplementary Material (13 pages, 6 figures). Supplementary Information and resources available at https://doi.org/10.6084/m9.figshare.8858273.v1

Leonetti proved that whenever $${\mathcal {I}}$$ is an ideal on $${\mathbb {N}}$$ such that there exists an uncountable family of sets that are not in $${\mathcal {I}}$$ with the property that the intersection of any two distinct members of that family is in $${\mathcal {I}}$$ , then the space $$c_{0,{\mathcal {I}}}$$ of sequences in $$\ell _\infty $$ that converge to 0 along $${\mathcal {I}}$$ is not complemented. We provide a shorter proof of a more general fact that the quotient space $$\ell _\infty / c_{0,{\mathcal {I}}}$$ does not even embed into $$\ell _\infty $$ .

The present comment concerns the correct presentation of the equations giving the CW-OSL intensity in the case of second- and general-order kinetics. Those equations have also been published with their wrong formulation in two eminent books in their topic. Since most researchers (especially early stage) would use directly the proposed functions as published in the various sources, they should be notified of their correct formulation.