Victoriia Kravtsiv

Prof. Victoriia Kravtsiv

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 January 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
TATamara Antonova
Tamara Antonova
Roman DmytryshynRoman Dmytryshyn
Roman Dmytryshyn
VKVictoriia Kravtsiv
Victoriia Kravtsiv
The paper deals with the problem of construction and investigation of branched continued fraction expansions of special functions of several variables. We give some recurrence relations of Horn hypergeometric functions H3. By these relations the branched continued fraction expansions of Horn’s hypergeometric function H3 ratios have been constructed. We have established some convergence criteria for the above-mentioned branched continued fractions with elements in R2 and C2. In addition, it is proved that the branched continued fraction expansions converges to the functions which are an analytic continuation of the above-mentioned ratios in some domain (here domain is an open connected set). Application for some system of partial differential equations is considered.

21 January 2022 in Axioms
Verified
Journal Article
Open access
PDF file
Andriy BanduraAndriy Bandura
Andriy Bandura
VKVictoriia Kravtsiv
Victoriia Kravtsiv
TVTaras Vasylyshyn
Taras Vasylyshyn
We construct a countable algebraic basis of the algebra of all symmetric continuous polynomials on the Cartesian product ℓp1×…×ℓpn, where p1,…,pn∈[1,+∞), and ℓp is the complex Banach space of all p-power summable sequences of complex numbers for p∈[1,+∞).

13 December 2024 in Matematychni Studii
Verified
Journal Article
Open access
PDF file
VHVolodymyr Hladun
Volodymyr Hladun
VKVictoriia Kravtsiv
Victoriia Kravtsiv
Marta DmytryshynMarta Dmytryshyn
Marta Dmytryshyn
RRR. Rusyn
R. Rusyn
The paper considers the numerical stability of the backward recurrence algorithm (BR-algorithm) for computing approximants of the continued fraction with complex elements. The new method establishes sufficient conditions for the numerical stability of this algorithm and the error bounds of the calculation of the $n$th approximant of the continued fraction with complex elements. It follows from the obtained conditions that the numerical stability of the algorithm depends not only on the rounding errors of the elements and errors of machine operations but also on the value sets and the element sets of the continued fraction. The obtained results were used to study the numerical stability of the BR-algorithm for computing the approximants of the continued fraction expansion of the ratio of Horn's confluent functions $\mathrm{H}_7$. Bidisc and bicardioid regions are established, which guarantee the numerical stability of the BR-algorithm. The obtained result is applied to the study of the numerical stability of computing approximants of the continued fraction expansion of the ratio of Horn's confluent function $\mathrm{H}_7$ with complex parameters. In addition, the analysis of the relative errors arising from the computation of approximants using the backward recurrence algorithm, the forward recurrence algorithm, and Lenz's algorithm is given. The method for studying the numerical stability of the BR-algorithm proposed in the paper can be used to study the numerical stability of the branched continued fraction expansions and numerical branched continued fractions with elements in angular and parabolic domains.

30 June 2019 in Carpathian Mathematical Publications
Verified
Journal Article
Open access
PDF file
VKVictoriia Kravtsiv
Victoriia Kravtsiv
We concider so called block-symmetric polynomials on sequence spaces $\ell_1\oplus \ell_{\infty},\ell_1\oplus c, \ell_1\oplus c_0,$ that is, polynomials which are symmetric with respect to permutationsof elements of the sequences. It is proved that every continuous block-symmetric polynomialson $\ell_1\oplus \ell_{\infty}$can be uniquelly represented as an algebraic combination of some special block-symmetric polynomials whichform an algebraic basis. It is interesting to notethat the algebra of block-symmetric polynomials is infinite-generated while $\ell_{\infty}$ admits no symmetricpolynomials. Algebraic bases ofthe algebras of block-symmetric polynomials on $\ell_1\oplus \ell_{\infty}$ and $\ell_1\oplus c_0$ described.

28 February 2020 in Journal of Mathematical Sciences
Verified
Journal Article
Closed access
PDF file
АZА. V. Zagorodnyuk
А. V. Zagorodnyuk
VKVictoriia Kravtsiv
Victoriia Kravtsiv

2 February 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
VKVictoriia Kravtsiv
Victoriia Kravtsiv
In this paper, we consider a supersymmetric version of block-symmetric polynomials on a Banach space of two-sided absolutely summing series of vectors in Cs for some positive integer s>1. We describe some sequences of generators of the algebra of block-supersymmetric polynomials and algebraic relations between the generators for the finite-dimensional case and construct algebraic bases of block-supersymmetric polynomials in the infinite-dimensional case. Furthermore, we propose some consequences for algebras of block-supersymmetric analytic functions of bounded type and their spectra. Finally, we consider some special derivatives in algebras of block-symmetric and block-supersymmetric analytic functions and find related Appell-type sequences of polynomials.