Results 21 to 30 of about 494,508 (266)
Orbit Growth of Periodic-Finite-Type Shifts via Artin–Mazur Zeta Function
The prime orbit and Mertens’ orbit counting functions describe the growth of closed orbits in a discrete dynamical system in a certain way. In this paper, we prove the asymptotic behavior of these functions for a periodic-finite-type shift.
Azmeer Nordin, Mohd Salmi Md Noorani
doaj +1 more source
Counting zeros of Dirichlet $L$-functions
22 ...
Michael A. Bennett +3 more
openaire +4 more sources
The component counts of random functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
An Automatic Counting Algorithm for Topographic Maps Based on Videos for Map Management
Topographic maps comprise a rich data source for the processing and analysis of geographic information. However, the management of paper topographic maps is still dominated by an inefficient manual method, and there is no counting equipment for ...
Wen Cao +7 more
doaj +1 more source
The angular value distribution of random analytic functions [PDF]
Let $mathcal{R}in(0,+infty]$, $f(z)=sum c_nz^n$ be ananalytic function in the disk ${zcolon |z|
M. P. Mahola, P. V. Filevych
doaj
On the Essential Decreasing of the Summation Order in the Abel-Lidskii Sense
In this paper, we consider a problem of decreasing the summation order in the Abel-Lidskii sense. The problem has a significant prehistory since 1962 created by such mathematicians as Lidskii V.B., Katsnelson V.E., Matsaev V.I., Agranovich M.S. As a main
Maksim V. Kukushkin
doaj +1 more source
We developed an analytical model to evaluate the effect of signal pileup on the recorded energy spectrum in X-ray photon-counting detectors affected by dead time and equipped with retrigger capability.
P. Zambon, C. Amato
doaj +1 more source
Asymptotic estimates for entire functions of minimal growth with given zeros
Let $\zeta=(\zeta_n)$ be an arbitrary complex sequence such that ...
P. V. Filevych
doaj +1 more source
Let q1+⋯+qn+m objects be arranged in n rows with q1,…,qn objects and one last row with m objects. The Janjić–Petković counting function denotes the number of (n+k)-insets, defined as subsets containing n+k objects such that at least one object is chosen ...
Marcus Kollar
doaj +1 more source
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of (0,1)-matrices, having a fixed number of 1's, and having no zero rows and zero columns. Further, we show that our function
Janjic, Milan, Petkovic, Boris
openaire +2 more sources

