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.

Numbers of citations of outstanding conference papers (OCPs) of IEEE Nuclear and Space Radiation Effects Conferences (NSRECs) from 1966 to 2017 are compared with citations of the most highly cited papers (HCPs) of the corresponding special issues of the IEEE TRANSACTIONS ON NUCLEAR SCIENCE (TNS), as well as average numbers of citations and cumulative $h$ index, $h_{\mathrm {cum}}$ , for all TNS papers published in the same year. 85% of NSREC OCPs are cited at a higher rate than the average for all TNS articles in that year. 55% of NSREC OCP citation totals are higher than $h_{\mathrm {cum}}$ for TNS in that year; these rank among the ~8% most highly cited TNS papers for that year. In ~10% of cases, the NSREC OCP is also the most HCP. Similarly high citation impact is found for papers nominated as candidates for OCPs. Radiation effects papers published in annual NSREC special issues comprise a significant fraction of all TNS articles cited $h_{\mathrm {cum}}$ times or more. These results support the use of $h_{\mathrm {cum}}$ as a metric of citation impact in this work and show that the NSREC OCP process generally meets awards criteria guidelines for impact. Potential reasons for variations in citation rates are discussed, and recommendations are provided to enhance the awards process.

In a recent paper [I. Altun and A. Tasdemir, On best proximity points of interpolative proximal contractions, Quaestiones Math. (2020), DOI: 10.2989/16073606.2020.1785576] the authors proved two best proximity point theorems for a new class of non-self mappings, called interpolative Reich- Rus-Ciric type proximal contractions of the rst and second kinds. Our purpose is to show that their results follow from a xed point theorem for interpolative Reich-Rus-Ciric type contraction mappings [E. Karapinar, R. Agarwal and H. Aydi, Interpolative Reich-Rus-Ciric contractions on partial metric spaces, Mathematics 6 (2018), 7 pages].

This is a corrigendum to our paper, “On a class of prime entire functions”, published in Acta Math. Sin., Engl. Ser., 25, 1647–1652 (2009).

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively.

The Rock–scissors–paper game has been studied to account for cyclic behaviour under various game dynamics. We use a two-person parametrised version of this game. The cyclic behaviour is observed near a heteroclinic cycle, in a heteroclinic network, with two nodes such that, at each node, players alternate in winning and losing. This cycle is shown to be as stable as possible for a wide range of parameter values. The parameters are related to the players’ payoff when a tie occurs.

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

Counting the number of words of a certain length accepted by a non-deterministic finite automaton (NFA) is a fundamental problem, which has many applications in different areas such as graph databases, knowledge compilation, and information extraction. Along with this, generating such words uniformly at random is also a relevant problem, particularly in scenarios where returning varied outputs is a desirable feature. The previous problems are formalized as follows. The input of #NFA is an NFA N and a length k given in unary (that is, given as a string 0^k), and then the task is to compute the number of strings of length k accepted by N. The input of GEN-NFA is the same as #NFA, but now the task is to generate uniformly, at random, a string accepted by N of length k. It is known that #NFA is #P-complete, so an efficient algorithm to compute this function exactly is not expected to exist. However, this does not preclude the existence of an efficient approximation algorithm for it. In this talk, we will show that #NFA admits a fully polynomial-time randomized approximation scheme (FPRAS). Prior to our work, it was open whether #NFA admits an FPRAS; in fact, the best randomized approximation scheme known for #NFA ran in time n^O(log(n)). Besides, we will mention some consequences and applications of our results. In particular, from well-known results on counting and uniform generation, we obtain that GEN-NFA admits a fully polynomial-time almost uniform generator. Moreover, as #NFA is SpanL-complete under polynomial-time parsimonious reductions, we obtain that every function in the complexity class SpanL admits an FPRAS.

A fundamental result in statistical learning theory is the equivalence of PAC learnability of a class with the finiteness of its Vapnik-Chervonenkis dimension. However, this clean result applies only to binary classification problems. In search for a similar combinatorial characterization of learnability in a more general setting, we discovered a surprising independence of set theory for some basic general notion of learnability. Consider the following statistical estimation problem: given a family F of real valued random variables over some domain X and an i.i.d. sample drawn from an unknown distribution P over X, find f in F such that its expectation w.r.t. P is close to the supremum expectation over all members of F. This Expectation Maximization (EMX) problem captures many well studied learning problems. Surprisingly, we show that the EMX learnability of some simple classes depends on the cardinality of the continuum and is therefore independent of the set theory ZFC axioms. Our results imply that that there exist no "finitary" combinatorial parameter that characterizes EMX learnability in a way similar to the VC-dimension characterization of binary classification learnability.

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.

Sunaga considered all computational procedures, which had beenВ traditionally defined on real numbers, as being too ideal andВ proposed to replace them by the procedures on real intervals inВ order to make everything "more realistic". Sunaga studied manyВ different kinds of numerical procedures including the Taylor-seriesВ interval solution of the initial-value problem of ordinaryВ differential equations.The purpose of the present note is to mark the 60-th anniversary of the publication of the seminal work by the Japan mathematician Teruo Sunaga. The paper summarizes the results of his Master Thesis. Sunaga's work sets the foundation of the contemporary interval analysis and reliable computing. This is an interdisciplinary field, combining abstract mathematical theories and practical applications related to computer science, numerical analysis and mathematical modeling in the natural, engineering and social-economic sciences.

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

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.

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

The report entitled "L. Liu, D. Li, F. Bai, A relative Lempel-Ziv complexity: Application to comparing biological sequences, Chem. Phys. Lett. 530 (2012) 107-112" mentions on the powerful construction of phylogenetic trees based on Lempel-Ziv algorithm. On the other hand, the method explained in the paper does not give promising result on the data set on invasive Caulerpa taxifolia in the Mediterranean Sea. The phylogenetic trees are obtained by the proposed method of the aforementioned paper in this short note. (C) 2018 Elsevier B.V. All rights reserved.

In this short note, we show that Theorem 4.3 of Liu and Yu (Monatshefte Math 195:173–176, 2021) is a consequence of Lemma 2 of Ballester-Bolinches and Esteban-Romero (J Aust Math Soc 75:181–191, 2003).

Ebaid et al. (2020) proposed the following new extended FGM copula (1) C ( u , v ) = u v [ 1 + a ( 1 − u ) ( 1 − v ) ( 1 − b u ) ( 1 − b v ) ] , 0 ≤ b < 1. Ebaid et al. (2020) claimed that, the adm...

I am grateful to Jiandong Ren for providing readers with a unified treatment of compound sums with frequency component in the (a,b,0) class of counting distributions, which is central to insurance ...

We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings \(\mathcal K_k\) with bounded multiplicity \(k \ge 2\). However, we show that process-terminating leader election is possible in the sub-class \(\mathcal U^* \cap \mathcal K_k\), where \(\mathcal U^*\) is the class of rings which contain a process with a unique label.

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.

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas that are g-satisfiable (i.e. some assignment satisfies at least g literals in every clause) from those that are not even 1-satisfiable is NP-hard if $\frac{g}{k} < \frac{1}{2}$ and is in P otherwise. We study a generalisation of SAT on arbitrary finite domains, with clauses that are disjunctions of unary constraints, and establish analogous behaviour. Thus we give a dichotomy for a natural fragment of promise constraint satisfaction problems (PCSPs) on arbitrary finite domains. The hardness side is proved using the algebraic approach, via a new general NP-hardness criterion on polymorphisms of the problem, based on a gap version of the Layered Label Cover problem. We show that previously used criteria are insufficient -- the problem hence gives an interesting benchmark of algebraic techniques for proving hardness of approximation problems such as PCSPs., Comment: Full version of an ICALP 2020 paper

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

In their celebrated paper (Furst et al., Math. Syst. Theory 17(1), 13---27 (12)), Furst, Saxe, and Sipser used random restrictions to reveal the weakness of Boolean circuits of bounded depth, establishing that constant-depth and polynomial-size circuits cannot compute the parity function. Such local restrictions have played important roles and have found many applications in complexity analysis and algorithm design over the past three decades. In this article, we give a brief overview of two intriguing applications of local restrictions: the first one is for the Isomorphism Conjecture and the second one is for moderately exponential time algorithms for the Boolean formula satisfiability problem.

This second part (out of three) of a series of position papers on triangular norms (for Part I see Triangular norms. Position paper I: basic analytical and algebraic properties, Fuzzy Sets and Systems, in press) deals with general construction methods based on additive and multiplicative generators, and on ordinal sums. Also included are some constructions leading to non-continuous t-norms, and a presentation of some distinguished families of t-norms.

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC)-a system of higher-order logic modulo theories-and prove its soundness and refutational completeness w.r.t. both standard and Henkin semantics. As corollaries, we obtain the compactness theorem and semi-decidability of HoCHC for semi-decidable background theories, and we prove that HoCHC satisfies a canonical model property. Moreover a variant of the well-known translation from higher-order to 1st-order logic is shown to be sound and complete for HoCHC in both semantics. We illustrate how to transfer decidability results for (fragments of) 1st-order logic modulo theories to our higher-order setting, using as example the Bernays-Schonflukel-Ramsey fragment of HoCHC modulo a restricted form of Linear Integer Arithmetic.

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

For any discrete valuation ring R, any R-linear mapping u from an R-module E into an R-module F and any \(y_0\in F\), a necessary and sufficient condition for the solvability of the equation \(u(x)=y_0\) is established, and an application of this result is presented.

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

We construct a counterexample that disproves the claim of Theorem 0.2 of the paper “Injective mappings and solvable vector fields of Euclidean spaces”, which appeared in Topology Appl. 136 (2004), 261–274.

In this note, we give affirmative answers to two open problems posed by Agarwal et al. in the paper (J Optim Theory Appl 163(2):482---490, 2014).

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

This article is intended to indicate and discuss some errors in N. Lavi’s paper “A Ganzstellensatz for semi-algebraic sets and a boundedness criterion for rational functions”.

With this note, we want to open a discussion on the duality theory for Interval Optimization. We begin by showing that some duality results Wu ( J Optim Theory Appl 144:615---628, 2010) are useless.

Dear Editors, [...]

The Kalman-Yakubovich-Popov (KYP) Lemma, giving the frequency-domain criteria for solvability of LQR problems and feasibility of related LMIs and Lur'e-Riccati equations, is undoubtedly one of the cornerstone results in modern control theory. Numerous applications of the KYP lemma in nonlinear and robust control motivated its extension to systems with distributed parameters. Unlike the finite-dimensional case, where the KYP lemma admits elegant proofs by means of algebraic techniques and methods from convex analysis, a prerequisite for its infinite-dimensional extensions is feasibility of the corresponding LQR problem, resulting on assumptions of exponential or L 2 -stabilizability. This property is restrictive and not easily verifiable for general infinite-dimensional systems. Being quite natural in the problems of absolute stability, it seems unnecessary in other applications of the KYP lemma which require only solvability of the operator inequality, but not positivity of its solution, such as e.g. instability or dichotomy criteria. In the present paper we show, that in the “strict” or coercive case the KYP lemma retains its validity, replacing stabilizability assumption with some technical assumption which holds, for instance, whenever the linear system is exponentially dichotomic.

A relation, established by Andras Schubert (Scientometrics 78(3): 559–565, 2009) on the relation between a paper’s h-index and its total number of received citations, is explained. The relation is a concavely increasing power law and is explained based on the Lotkaian model for the h-index, proved by Egghe and Rousseau.

In the paper the second order half-linear delay differential equation ( r ( t ) | u ' ( t ) | α - 1 u ' ( t ) ) ' + p ( t ) | u ( ? ( t ) ) | α - 1 u ( ? ( t ) ) = 0 , α 1 is studied under the condition ? ∞ r - 1 / α ( t ) d t < ∞ . The oscillation criterion proved by Sun and Meng (2006, Theorem 2.2) is carefully examined and improved by simplifying and sharpening the estimates used in the original proof and removing unnecessary assumptions. Among others, using elementary arguments we show that an arbitrary positive nondecreasing function ? from this criterion can be safely and with no loss of generality replaced by a constant function. An extension to other related equations, such as neutral equations is also provided.

This article calculates probabilities for the occurrence of different types of papers such as genius papers, basic papers, ordinary papers or insignificant papers. The basis of these calculations are the formulae for the cumulative n-th citation distribution, being the cumulative distribution of times at which articles receive their n-th (n=1,2,3,...) citation. These formulae (proved in previous papers) are extended to allow for different aging rates of the papers. These new results are then used to define different importance classes of papers according to the different values of n, in function of time t. Examples are given in case of a classification into four parts: genius papers, basic papers, ordinary papers and (almost) insignificant papers. The fact that, in these examples, the size of each class is inversely related to the importance of the journals in this class is proved in a general mathematical context in which we have an arbitrary number of classes and where the threshold values of n in each class are defined according to the natural law of Weber-Fechner.

A bound on the capacity of the causal dirty paper problem 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 log 2 (1 + SNR over e) bits per real dimension. This bound is useful for SNR ≤ e(e - 2).

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 show abstract versions for Banach couples of several limiting compact interpolation theorems established by Edmunds and Opic for couples of Lp spaces.