Ideal factorization method and its applications

2019-01-01
Kurt, Sibel
Yayla, Oğuz
© Springer Nature Switzerland AG 2019.In this work the unsolvability of certain equations is studied in the case of cyclotomic number fields whose ring of integers is not a principal ideal domain. Winterhof et al. considered the equations for (Formula presented). We first extend this result to (Formula presented) by using a new method from algebraic number theory. Then we present its applications to ᵧ -Butson-Hadamard matrices, ᵧ -Conference matrices and type ᵧ nearly perfect sequences for (Formula presented).

Suggestions

Polynomial solutions of the Mie-type potential in the D-dimensional Schrodinger equation
IKHDAİR, SAMEER; Sever, Ramazan (2008-04-30)
The polynomial solution of the D-dimensional Schrodinger equation for a special case of Mie potential is obtained with an arbitrary l not equal 0 states. The exact bound state energies and their corresponding wave functions are calculated. The bound state (real) and positive (imaginary) cases are also investigated. In addition, we have simply obtained the results from the solution of the Coulomb potential by an appropriate transformation.
Value sets of Lattes maps over finite fields
Küçüksakallı, Ömer (Elsevier BV, 2014-10-01)
We give an alternative computation of the value sets of Dickson polynomials over finite fields by using a singular cubic curve. Our method is not only simpler but also it can be generalized to the non-singular elliptic case. We determine the value sets of Lattes maps over finite fields which are rational functions induced by isogenies of elliptic curves with complex multiplication.
Conservative finite difference schemes for cosymmetric systems
Karasözen, Bülent (2001-09-26)
We consider the application of computer algebra for the derivation of the formula for the preservation of the cosymmetry property through discretization of partial differential equations. The finite difference approximations of differential operators for both regular and staggered grids are derived and applied to the planar filtration-convection problem.
On decoding interleaved reed-solomon codes
Yayla, Oğuz; Özbudak, Ferruh; Department of Cryptography (2011)
Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher-Kiayias-Yung is extended to the polynomials whose degrees are allowed to be distinct. Furthermore, it is observed that probability of the algorithm can be increased. Specifically, for a finite field $\F$, we present a probabilistic algorithm which can recover polynomials $p_1,\ldots, p_r \in \F[x]$ of degree less than $k_1,k_2,\ldots,k_r$, respectively with given field evaluations $p_l(z_i) = y_{i,l}$ for all $i \in I$, $
Additive polynomials and primitive roots over finite fields
Özbudak, Ferruh (2001-01-01)
We prove existence of primitive roots with a prescribed nonzero image using the arithmetic of algebraic function fields for a class of polynomials over sufficiently large finite fields.
Citation Formats
S. Kurt and O. Yayla, “Ideal factorization method and its applications,” 2019, vol. 276, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/69853.