Searcharxiv⌕ Search

arXiv subjects

Nihal Özgür

Publications and source records attributed to Nihal Özgür.

8 recordsLinked to original sources

Zeros and Their Distribution for Leonardo Polynomials

We investigate the zeros of Leonardo polynomials and their distribution in the complex plane. We show that the structure of the zeros differs between even and odd degrees. For even degrees, all zeros are simple and purely imaginary, with imaginary parts lying in \((-2,2)\). For odd degrees, there is exactly one positive real zero, whereas no negative real or purely imaginary zeros occur. We obtain two-sided bounds for the unique positive real zero, prove that it decreases strictly to zero as the degree increases through odd values, and determine its asymptotic behavior. Using the relation between Leonardo and Fibonacci polynomials together with a complex trigonometric parametrization, we transform the zero equation into a family of fixed-point problems. Suitable invariant disks are constructed, and the corresponding mappings are shown to be contractions. This yields a constructive description of the complete zero set, proves the simplicity of all zeros, and provides geometrically convergent iterations for their numerical approximation. The method also provides explicit control over the approximation error. Finally, we establish a degree-dependent vertical strip containing all zeros and show that its width tends to zero as the degree increases. Consequently, the zeros become uniformly concentrated near the imaginary axis. Numerical examples illustrate the convergence of the proposed method, the associated error estimates, and the resulting zero distributions.

math.GM↗

A Matrix-Based Polyalphabetic Algorithm for Information Encoding and Decoding Using Number Sequences

In this paper, we propose a matrix-based polyalphabetic data encoding and decoding scheme using Fibonacci, Leonardo, Jacobsthal, and Lucas sequences. The method employs three sequence-based alphabets for character substitution and a Lucas-based auxiliary alphabet for word separators. A position-dependent selector, \[ σ=\bigl(v^2+(i-1)+(j-1)\bigr)\pmod 3, \] distributes repeated plaintext symbols among different numerical alphabets, thereby reducing frequency concentration. The resulting numerical matrix is divided into $3\times 3$ blocks and transformed using powers of the Leonardo $Q$-matrix with block-dependent keys generated from pre-shared parameters $(s,p)$. A collision-free public prime $P$ is used to keep ciphertext entries bounded while preserving unique decoding. A worked example and preliminary statistical, entropy, avalanche, and timing results indicate that the proposed modular construction is computationally efficient and provides improved distributional behavior compared with standard monoalphabetic substitution.

math.GM↗

$φ$-fixed points of self-mappings on metric spaces with a geometric viewpoint

A recent open problem was stated on the geometric properties of $φ$-fixed points of self-mappings of a metric space in the non-unique fixed point cases. In this paper, we deal with the solutions of this open problem and present some solutions via the help of appropriate auxiliary numbers and geometric conditions. We see that a zero of a given function $φ$ can produce a fixed circle (resp. fixed disc) contained in the fixed point set of a self-mapping $T$ on a metric space. Moreover, this circle (resp. fixed disc) is also contained in the set of zeros of the function $φ$.

math.GN↗

A New Generalization of Rhoades' Condition

In this paper, our aim is to obtain a new generalization of the well-kown Rhoades' contractive condition. To do this, we introduce the notion of an $S$-normed space. We extend the Rhoades' contractive condition to $S$-normed spaces and define a new type of contractive conditions. We support our theoretical results with necessary illustrative examples.

math.GM↗

Geometric Properties of Fixed Points and Simulation Functions

Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a geometric figure. In this paper, we consider the set of simulation functions for geometric applications in the fixed point theory both on metric and some generalized metric spaces ($S$-metric spaces and $b$-metric spaces). The main motivation of this paper is to investigate the geometric properties of non unique fixed points of self-mappings via simulation functions.

math.MG↗

New Multivalued Contractions and the Fixed-Circle Problem

In this paper, we focus on the fixed-circle problem on metric spaces by means of the multivalued mappings. We introduce new multivalued contractions using Wardowski's techniques and obtain new fixed-circle results related to multivalued contractions with some applications to integral type contractions. We verify the validity of our obtained results with illustrative examples.

math.MG↗

A New Solution to the Rhoades' Open Problem with an Application

We give a new solution to the Rhoades' open problem on the discontinuity at fixed point via the notion of an $S$-metric. To do this, we inspire with the notion of a Zamfirescu mapping. Also, we consider a recent problem called the "fixed-circle problem" and propose a new solution to this problem as an application of our technique.

math.FA↗

Pata Zamfirescu Type Fixed-Disc Results with a Proximal Application

This paper is concerning to the geometric study of fixed points of a self-mapping on a metric space. We establish new generalized contractive conditions which ensure that a self-mapping has a fixed disc or a fixed circle. We introduce the notion of a best proximity circle and explore some proximal contractions for a non-self-mapping as an application. Necessary illustrative examples are presented to highlight the importance of the obtained results.

math.MG↗