1,395 research outputs found
Banking Sector Systemic Risk in Selected Cenral European Countries. Review of: Bulgaria, Czech Republic, Hungary, Poland, Romania and Slovakia
The paper is an attempt at a comparative overview of banking sector systemic risk in six Central European countries as of the end of 1997 concluding with some policy recommendations. The countries covered by the paper (Bulgaria, Czech Republic, Hungary, Poland, Romania and Slovakia) are specific by the fact that in the early 1990âs they moved from a socialist to a market economy and the legacy of a socialist economy still has an important influence in the shape of their banking sectors. All six countries underwent banking crisis in 1990s and spent significant budgetary resources to deal with them. Crises have been overcome without system destabilization only in Hungary and Poland. Now, the banking sectors in these two countries are relatively robust although small in relation to GDP. In Bulgaria a banking crisis ended with a major destabilization, dramatic downsizing of banking assets and a deep recession. Presently, the banking sector is reported to be liquid and solvent and the potential for assets quality deterioration is limited for some time. Romania, the Czech Republic and Slovakia have yet to deal with their continuing banking crises, which still constitute a danger for economic stability and development.banking sector, systemic risk, Bulgaria, Czech Republic, Hungary, Poland, Romania, Slovakia
Antenna Design for Semi-Passive UHF RFID Transponder with Energy Harvester
A novel microstrip antenna which is dedicated to UHF semi-passive RFID transponders with an energy harvester is presented in this paper. The antenna structure designed and simulated by using Mentor Graphics HyperLynx 3D EM software is described in details. The modeling and simulation results along with comparison with experimental data are analyzed and concluded. The main goal of the project is the need to eliminate a traditional battery form the transponder structure. The energy harvesting block, which is used instead, converts ambient energy (electromagnetic energy of typical radio communication system) into electrical power for internal circuitry. The additional function (gathering extra energy) of the transponder antenna causes the necessity to create new designs in this scope
On the series expansion of a square-free zeta series
In this article, we develop a square-free zeta series associated with the
M\"obius function into a power series, and prove a Stieltjes like formula for
these expansion coefficients. We also investigate another analytical
continuation of these series and develop a formula for in
terms of the M\"obius function, and in the last part, we explore an alternating
series version of these results.Comment: 9 pages, 2 figures (minor updates
The inverse Riemann zeta function
In this article, we develop a formula for an inverse Riemann zeta function
such that for we have for real and complex
domains and . The presented work is based on extending the analytical
recurrence formulas for trivial and non-trivial zeros to solve an equation
for a given -domain using logarithmic differentiation and
zeta recursive root extraction methods. We further explore formulas for trivial
and non-trivial zeros of the Riemann zeta function in greater detail, and next,
we introduce an expansion of the inverse zeta function by its singularities,
and study its properties and develop many identities that emerge from them. In
the last part, we extend the presented results as a general method for finding
zeros and inverses of many other functions, such as the gamma function, the
Bessel function of the first kind, or finite/infinite degree polynomials and
rational functions, etc. We further compute all the presented formulas
numerically to high precision and show that these formulas do indeed converge
to the inverse of the Riemann zeta function and the related results. We also
develop a fast algorithm to compute for complex .Comment: 77 pages, 11 tables, 8 figures, 7 listing
Analytical recurrence formulas for non-trivial zeros of the Riemann zeta function
In this article, we develop four types of analytical recurrence formulas for
non-trivial zeros of the Riemann zeta function on critical line assuming (RH).
Thus, all non-trivial zeros up to the th order must be known in order to
generate the th+1 non-trivial zero. All the presented formulas are based on
certain closed-form representations of the secondary zeta function family,
which are already available in the literature. We also present a formula to
generate the non-trivial zeros directly from primes. Thus all primes can be
converted into an individual non-trivial zero, and we also give a set of
formulas to convert all non-trivial zeros into an individual prime. We also
extend the presented results to other Dirichlet-L functions, and in particular,
we develop an analytical recurrence formula for non-trivial zeros of the
Dirichlet beta function. Throughout this article, we also numerically compute
these formulas to high precision for various test cases and review the computed
results.Comment: 24 pages, 5 tables, 6 listings. arXiv admin note: text overlap with
arXiv:2009.0264
On the series expansion of the secondary zeta function
In article, we explore the secondary zeta function , which is defined
as a generalized zeta type of series over imaginary parts of non-trivial zeros
of the Riemann zeta function . This function has been analytically
continued as a meromorphic function in with one double pole and an
infinity of simple poles. The secondary zeta function is of interest because it
can naturally represent an analytical formula for non-trivial zeros of the
Riemann zeta function that we will explore, and we show that the non-trivial
zeros can be generated directly from primes by introducing a new form of an
explicit formula written in terms of the prime zeta function. Additionally, we
will also give several new series expansions for and numerically compute
these coefficients to high precision, and also develop several new methods to
analytically extend to larger domains and develop algorithms to compute
them.Comment: 32pg, 6 figs, 10 tables (v2 minor improvements
- âŠ