Browsing 2020/2 by Issue Date

Now showing items 1-6 of 6

  • Note on a class of k-paranormal weighted composition operators on the Fock space Fp(C) 

    Santhoshkumar, C.; Veluchamy, T. (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    In this paper, we characterize the k-paranormal, isometric, spectral radius and the numerical radius of the weighted composition operator C.

  • On increasing solutions of half-linear delay differential equations 

    Matucci, Serena; Řehák, Pavel (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    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 ...

  • Coefficient estimates for special subclasses of k-fold symmetric bi-univalent functions 

    Atshan, Waggas Galib; Yalçın, Sibel; Hadi, Rasha Abbas (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    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 ...

  • On bornological induced pseudonearness 

    Leseberg, Dieter; Vaziry, Zohreh (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    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 ...

  • In-game betting and the Kelly criterion 

    Andersen, Robin; Hassel, Vegard; Hvattum, Lars Magnus; Stalhane, Magnus (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    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 ...

  • Huffman coding and chains in partition lattices 

    Foldes, Stephan (Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky, 2020)
    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 ...