2020/2http://hdl.handle.net/11012/2003682023-06-06T12:59:21Z2023-06-06T12:59:21ZNote on a class of k-paranormal weighted composition operators on the Fock space Fp(C)Santhoshkumar, C.Veluchamy, T.http://hdl.handle.net/11012/2003942021-08-11T05:55:30Z2021-07-02T10:21:18ZNote on a class of k-paranormal weighted composition operators on the Fock space Fp(C)
Santhoshkumar, C.; Veluchamy, T.
In this paper, we characterize the k-paranormal, isometric, spectral radius and the numerical radius of the weighted composition operator C.
2021-07-02T10:21:18ZOn increasing solutions of half-linear delay differential equationsMatucci, SerenaŘehák, Pavelhttp://hdl.handle.net/11012/2003932021-08-11T05:55:27Z2021-07-02T10:21:18ZOn increasing solutions of half-linear delay differential equations
Matucci, Serena; Řehák, Pavel
We establish conditions guaranteeing that all eventually positive increas-ing solutions of a half-linear delay differential equation are regularly varying andderive precise asymptotic formulae for them. The results presented here are new alsoin the linear case and some of the observations are original also for non-functionalequations. A substantial difference is pointed out between the delayed and non-delayed case for eventually positive decreasing solutions.
2021-07-02T10:21:18ZCoefficient estimates for special subclasses of k-fold symmetric bi-univalent functionsAtshan, Waggas GalibYalçın, SibelHadi, Rasha Abbashttp://hdl.handle.net/11012/2003902021-08-11T05:53:38Z2021-07-02T10:21:18ZCoefficient estimates for special subclasses of k-fold symmetric bi-univalent functions
Atshan, Waggas Galib; Yalçın, Sibel; Hadi, Rasha Abbas
In the present paper, we consider two new subclasses Nk (μ,) and Nk (μ,) of k consisting of analytic and k-fold symmetric bi-univalent functions defined in the open unit disc U = {z : z 2 C and |z| < 1}. For functions belonging to the two classes introduced here, we derive their normalized forms. Furthermore, we find estimates of the initial coefficients |ak+1| and |a2k+1| for these functions. Several related classes are also considered and connections to previously known results are made.
2021-07-02T10:21:18ZOn bornological induced pseudonearnessLeseberg, DieterVaziry, Zohrehhttp://hdl.handle.net/11012/2003922021-08-11T05:53:59Z2021-07-02T10:21:18ZOn bornological induced pseudonearness
Leseberg, Dieter; Vaziry, Zohreh
Pseudonearness is considered a common tool for studying bornology,b-topology, pseudoproximity, and last but not least,classicalnearness. For anypseudonear space we construct ab-completion, which generalizes the classical com-pletion of nearness spaces. Then, b-compactification is introduced in the context ofstrictbornotopologicalextensions.
2021-07-02T10:21:18ZIn-game betting and the Kelly criterionAndersen, RobinHassel, VegardHvattum, Lars MagnusStalhane, Magnushttp://hdl.handle.net/11012/2003892021-08-11T05:53:28Z2021-07-02T10:21:18ZIn-game betting and the Kelly criterion
Andersen, Robin; Hassel, Vegard; Hvattum, Lars Magnus; Stalhane, Magnus
When a bet with a positive expected return is available, the Kelly crite-rion can be used to determine the fraction of wealth to wager so as to maximizethe expected logarithmic return on investment. Several variants of the Kelly cri-terion have been developed and used by investors and bettors to maximize theirperformance in inefficient markets. This paper addresses a situation that has not,hitherto, been discussed in academic literature: when multiple bets can be placedon the same object and the available odds, true probabilities, or both, vary overtime. Such objects are frequently available in sports betting markets, for example,in the case of in-game betting on outcomes of soccer matches. We adapt the Kellycriterion to support decisions in such live betting scenarios, and provide numericalexamples of how optimal bet sizes can sometimes be counter-intuitive.
2021-07-02T10:21:18ZHuffman coding and chains in partition latticesFoldes, Stephanhttp://hdl.handle.net/11012/2003912021-08-11T05:53:54Z2021-07-02T10:21:18ZHuffman coding and chains in partition lattices
Foldes, Stephan
The Huffman coding algorithm is interpreted in the context of the lat-tice of partitions of the source alphabet. Maximal chains in the partition latticecorrespond to linear extensions of tree orders, and those among the chains thatexhibit a simple greedy property correspond precisely to executions of the Huffmanalgorithm
2021-07-02T10:21:18Z