Mathematics / Matematik

Permanent URI for this collectionhttps://hdl.handle.net/11147/8

Browse

Now showing 1 - 10 of 10

Citation - WoS: 1
Dedekind Harmonic Numbers
(Indian Academy of Sciences, 2021-10) Altuntaş, Çağatay; Göral, Haydar; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
For any number field, we define Dedekind harmonic numbers with respect to this number field. First, we show that they are not integers except finitely many of them. Then, we present a uniform and an explicit version of this result for quadratic number fields. Moreover, by assuming the Riemann hypothesis for Dedekind zeta functions, we prove that the difference of two Dedekind harmonic numbers are not integers after a while if we have enough terms, and we prove the non-integrality of Dedekind harmonic numbers for quadratic number fields in another uniform way together with an asymptotic result.
Citation - WoS: 1
Citation - Scopus: 1
Fatigue Life Prediction and Optimization of Gfrp Composites Based on Failure Tensor Polynomial in Fatigue Model With Exponential Fitting Approach
(SAGE Publications, 2022) Güneş, Mehmet Deniz; İmamoğlu Karabaş, Neslişah; Deveci, Hamza Arda; Tanoğlu, Gamze; Tanoğlu, Metin; 03.10. Department of Mechanical Engineering; 04.02. Department of Mathematics; 03. Faculty of Engineering; 04. Faculty of Science; 01. Izmir Institute of Technology
In this study, a new fatigue life prediction and optimization strategy utilizing the Failure Tensor Polynomial in Fatigue (FTPF) model with exponential fitting and numerical bisection method for fiber reinforced polymer composites has been proposed. Within the experimental stage, glass/epoxy composite laminates with (Formula presented.), (Formula presented.), and (Formula presented.) lay-up configurations were fabricated, quasi-static and fatigue mechanical behavior of GFRP composites was characterized to be used in the FTPF model. The prediction capability of the FTPF model was tested based on the experimental data obtained for multidirectional laminates of various composite materials. Fatigue life prediction results of the glass/epoxy laminates were found to be better as compared to those for the linear fitting predictions. The results also indicated that the approach with exponential fitting provides better fatigue life predictions as compared to those obtained by linear fitting, especially for glass/epoxy laminates. Moreover, an optimization study using the proposed methodology for fatigue life advancement of the glass/epoxy laminates was performed by a powerful hybrid algorithm, PSA/GPSA. So, two optimization scenarios including various loading configurations were considered. The optimization results exhibited that the optimized stacking sequences having maximized fatigue life can be obtained in various loading cases. It was also revealed that the tension-compression loading and the loadings involving shear loads are critical for fatigue, and further improvement in fatigue life may be achieved by designing only symmetric lay-ups instead of symmetric-balanced and diversification of fiber angles to be used in the optimization.
Citation - WoS: 1
Citation - Scopus: 2
The Green-Tao Theorem and the Infinitude of Primes in Domains
(Taylor & Francis, 2022) Göral, Haydar; Özcan, Hikmet Burak; Sertbaş, Doğa Can; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
We first prove an elementary analogue of the Green-Tao Theorem. The celebrated Green-Tao Theorem states that there are arbitrarily long arithmetic progressions in the set of prime numbers. In fact, we show the Green-Tao Theorem for polynomial rings over integral domains with several variables. Using the Generalized Polynomial van der Waerden Theorem, we also prove that in an infinite unique factorization domain, if the cardinality of the set of units is strictly less than that of the domain, then there are infinitely many prime elements. Moreover, we deduce the infinitude of prime numbers in the positive integers using polynomial progressions of length three. In addition, using unit equations, we provide two more proofs of the infinitude of prime numbers. Finally, we give a new proof of the divergence of the sum of reciprocals of all prime numbers.
Citation - WoS: 2
Citation - Scopus: 2
Integral Characteristics by Keyspace Partitioning
(Springer, 2022-02) Demirbaş, Fatih; Kara, Orhun; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
In this work, we introduce a new method we call integral by keyspace partitioning to construct integral characteristics for some block ciphers by introducing new integral properties. We introduce the concepts of active with constant difference and identically active integral properties. Then, we divide the key space into equivalence classes and construct integral characteristics for each equivalence class individually by using these integral properties. We exploit the binary diffusion layer and key schedule algorithm of a block cipher to propagate these integral properties through rounds. We apply the new method to the Byte-oriented Substitution-Permutation Network (BSPN) cipher and Midori64 to show its effectiveness. We construct the first iterative integral characteristic for a block cipher to the best of our knowledge. We extend this iterative characteristic for the (M, n)-(BSPN) block cipher where each block of BSPN contains M number of n× n S-Boxes with the block and key sizes M· n. Using at most (M-12)+1 (only 106 when M= 16) chosen plaintexts, we mount key recovery attacks for the first time on BSPN and recover the key for the full round. The time complexity of the key recovery is almost independent of the number of rounds. We also use our method to construct an integral characteristic for Midori64, which can be utilized for a key recovery attack on 11-round Midori64. Our results impose a new security criteria for the design of the key schedule algorithm for some block ciphers.
Citation - WoS: 2
Citation - Scopus: 2
On simple-injective modules
(World Scientific Publishing, 2022) Alagöz, Yusuf; Benli Göral, Sinem; Büyükaşık, Engin; 01. Izmir Institute of Technology; 04.02. Department of Mathematics; 04. Faculty of Science
For a right module M, we prove that M is simple-injective if and only if M is min-N-injective for every cyclic right module N. The rings whose simple-injective right modules are injective are exactly the right Artinian rings. A right Noetherian ring is right Artinian if and only if every cyclic simple-injective right module is injective. The ring is QF if and only if simple-injective right modules are projective. For a commutative Noetherian ring R, we prove that every finitely generated simple-injective R-module is projective if and only if R = A × B, where A is QF and B is hereditary. An abelian group is simple-injective if and only if its torsion part is injective. We show that the notions of simple-injective, strongly simple-injective, soc-injective and strongly soc-injective coincide over the ring of integers.
Citation - WoS: 1
Citation - Scopus: 1
Plaintext Recovery and Tag Guessing Attacks on Authenticated Encryption Algorithm Colm
(Elsevier, 2022-11) Ulusoy, Sırrı Erdem; Kara, Orhun; Efe, Mehmet Önder; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
There are three main approaches related to cryptanalysis of Authenticated Encryption with Associated Data (AEAD) algorithms: Simulating the encryption oracle (universal forgery attack), simulating the decryption oracle (plaintext recovery attack) and producing the valid tag of a given ciphertext (tag guessing attack). In this work, we analyze the security of COLM in these approaches. COLM is one of the AEAD algorithms chosen in the final portfolio for defense-in-depth use case of the CAESAR competition. The ciphers in this portfolio are supposed to provide robust security with their multiple layered defense mechanisms. The main motivation of this work is to examine if COLM indeed satisfies defense-in-depth security. We make cryptanalysis of COLM, particularly in the chosen ciphertext attack (CCA) scenario, once its secret whitening parameter L=EK(0) is recovered. To the best of our knowledge, we give the first example of querying an EME/EMD (Encrypt-linearMix-Encrypt/Decrypt) AEAD scheme in its decryption direction for arbitrary ciphertexts, not produced previously by the oracle, namely either a forgery or tag guessing attack. We construct SEBC/SDBC (Simulation models of the Encryption/Decryption oracles of the underlying Block Cipher) of COLM, thereby forming the first examples of these models of an authenticated EME scheme simultaneously. The combination of our SEBC/SDBC is a powerful tool to mount a universal forgery attack, a tag guessing attack and a plaintext recovery attack. All of these attacks have polynomial time complexities once L is recovered in the offline phase, indicating that the security of COLM against plaintext recovery and tag guessing attacks is limited by the birthday bound. Apart from exploiting SEBC/SDBC, we mount a pair of plaintext recovery attacks and another universal forgery attack. Finally, we make some suggestions to prevent our attacks.
A Reliable and Fast Mesh-Free Solver for the Telegraph Equation
(Springer, 2022-07) İmamoğlu Karabaş, Neslişah; Korkut, Sıla Övgü; Gürarslan, Gürhan; Tanoğlu, Gamze; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
In the presented study, the hyperbolic telegraph equation is taken as the focus point. To solve such an equation, an accurate, reliable, and efficient method has been proposed. The developed method is mainly based on the combination of a kind of mesh-free method and an adaptive method. Multiquadric radial basis function mesh-free method is considered on spatial domain and the adaptive fifth-order Runge–Kutta method is used on time domain. The validity and the performance of the proposed method have been checked on several test problems. The approximate solutions are compared with the exact solution, it is shown that the proposed method has more preferable to the other methods in the literature.
Citation - WoS: 1
Citation - Scopus: 2
A Reliable Explicit Method To Approximate the General Type of the Kdv–burgers’ Equation
(Springer, 2022-02) Korkut, Sıla Övgü; İmamoğlu Karabaş, Neslişah; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
This study aims to propose a reliable, accurate, and efficient numerical approximation for a general compelling partial differential equation including nonlinearity (uδ∂u∂x), dissipation (∂2u∂x2), and dispersion (∂3u∂x3) which arises in many fields of engineering as well as applied sciences. The novel proposed method has been developed combining a kind of mesh-free method called the Taylor wavelet method with the Euler method. The convergence result of the method has been presented theoretically. Moreover, the validation and applicability of the method have been also confirmed computationally on benchmark problems such as KdV–Burgers’ equation and modified-KdV equation. The numerical results have been compared both to the exact solution and to those in the existing literature. All presented figures and tables guarantee that the proposed method is highly accurate, efficient, and compatible with the nature of the specified equation physically. Furthermore, the recorded errors are evidence that the proposed method is the best approximation compared to those in the existing methods.
Citation - WoS: 6
Citation - Scopus: 5
Taylor Wavelets Collocation Technique for Solving Fractional Nonlinear Singular Pdes
(Springer, 2022-07) Aghazadeh, Nasser; Mohammadi, Amir; Tanoğlu, Gamze; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
A novel technique has been introduced to solve the Emden-Fowler equations. It has been derived from the Taylor wavelets collocation method. The proposed scheme has been successfully implemented in order to solve the singular equations. The singular problem converts to a system of algebraic equations that can be solved numerically. Moreover, the technique is very effective to remove the strong singularity point at x = 0. The numerical experiments have been checked out with the exact and approximate solutions that have been achieved by others including the Adomian decomposition method (Wazwaz in Appl Math Comput 166:638-651, 2005), Modified Homotopy Perturbation Method (Singh et al. J Math Chem 54(4):918-931, 2016). Also, the error analysis of the technique has been considered.
Unique decompositions into regular ideals for Marot rings
(Taylor & Francis, 2022) Ay Saylam, Başak; Gürbüz, Ezgi; 04.02. Department of Mathematics; 04. Faculty of Science; 01. Izmir Institute of Technology
Let R be a commutative ring. We say that R has the unique decomposition into regular ideals (UDRI) property if, for any R-module which decomposes into a finite direct sum of regular ideals, this decomposition is unique up to the order and isomorphism class of the regular ideals. In this paper, we will prove some preliminary results for Marot rings whose regular ideals are finitely generated and give a necessary and sufficient condition for these rings to satisfy the UDRI property.

Browse

Browsing Mathematics / Matematik by Access Right "info:eu-repo/semantics/embargoedAccess"