Jun-ichi Tamura’s research while affiliated with Tsuda University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (14)


Arithmetical independence of certain uniform sets of algebraic integers
  • Preprint

August 2023

·

15 Reads

·

Jun-ichi Tamura

·

We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here, ``almost uniformity'' means that the elements of a finite set are distributed almost equidistantly in the unit interval, while ``arithmetical independence'' means that the number fields generated by the elements of a set do not have a mutual inclusion relation each other. Furthermore, we reveal to what extent the algebraic number fields generated by the elements of the four sets can cover quadratic or cubic fields.


[z] 3 continued fraction algorithm with 3 ≤ the degree of z ≤ 6
Multidimensional p-adic continued fraction algorithms
  • Article
  • Full-text available

April 2019

·

92 Reads

·

7 Citations

Mathematics of Computation

Download


Continued fraction algorithms and Lagrange's theorem in ${\mathbb Q}_p

January 2017

·

193 Reads

·

4 Citations

We present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of Qp{\mathbb Q}_p over Q{\mathbb Q} and gives a finite expansion for every rational number. We also give, for each of our algorithms, the complete characterization of elements having purely periodic expansions.


True orbit simulation of piecewise linear and linear fractional maps of arbitrary dimension using algebraic numbers

June 2015

·

25 Reads

·

3 Citations

We introduce a true orbit generation method enabling exact simulations of dynamical systems defined by arbitrary-dimensional piecewise linear fractional maps, including piecewise linear maps, with rational coefficients. This method can generate sufficiently long true orbits which reproduce typical behaviors (inherent behaviors) of these systems, by properly selecting algebraic numbers in accordance with the dimension of the target system, and involving only integer arithmetic. By applying our method to three dynamical systems—that is, the baker's transformation, the map associated with a modified Jacobi-Perron algorithm, and an open flow system—we demonstrate that it can reproduce their typical behaviors that have been very difficult to reproduce with conventional simulation methods. In particular, for the first two maps, we show that we can generate true orbits displaying the same statistical properties as typical orbits, by estimating the marginal densities of their invariant measures. For the open flow system, we show that an obtained true orbit correctly converges to the stable period-1 orbit, which is inherently possessed by the system.


Figure 2: The commutative diagram with respect to A proj and A f rac . 
A New Multidimensional Slow Continued Fraction Algorithm and Stepped Surface

October 2013

·

62 Reads

·

11 Citations

Experimental Mathematics

·

Shunji Ito

·

·

[...]

·

We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling substitutions) for any stepped surface for any cubic direction.




Continued fractions for quadratic elements in formal power series

December 2011

·

14 Reads

The Ramanujan Journal

There exist certain quadratic elements α∈ℚ((t −1)) over the rational function field ℚ(t) having nonperiodic continued fraction expansion, see W.M. Schmidt in (Acta Arith. 95(2):139–166, 2000). Hence we need a modification of Lagrange’s theorem with regard to function fields instead of number fields. In this paper, we introduce a class of continued fractions and describe Lagrange’s theorem as a conjecture related to quadratic elements over ℚ(t). We give some examples which support our conjecture.


New algorithm of continued fractions related to real algebraic number fields of degree ≤5

January 2011

·

12 Reads

·

2 Citations

In an earlier paper [Math. Comput. 78, No. 268, 2209–2222 (2009; Zbl 1217.11067)], we introduced a new algorithm which is something like the modified Jacobi-Perron algorithm, and gave some computer experiments by which we can expect that the expansion obtained by our algorithm for α ̲=(α 1 ,...,α s )∈K s (with some natural conditions on α) becomes periodic for any real number field K as far as s+1=deg ℚ (K)≤4. But, it seems very likely that the algorithm will not work well if deg ℚ (K)=5. In this paper we give a new algorithm and discuss some properties and experimental results by which we can expect that the expansion of αby the new algorithm always becomes periodic for any real number field K with deg ℚ (K)≤5.


Citations (11)


... In the very last years, other multidimensional continued fractions algorithms have been defined in Q p . In particular, in [60] and [79] the authors introduced two different algorithms trying to generalize, respectively, Browkin's and Schneider's approach (see also [70]). In [61], the authors deepened the study of the algorithm defined in [60], by exploring its properties of finiteness. ...

Reference:

Continued fractions in the field of 𝑝-adic numbers
Multidimensional p-adic continued fraction algorithms

Mathematics of Computation

... As noted in the previous section, any term of the sequence { } =0,1,2,... , defined by the recurrence relation (2) with the initial condition 0 = 1, is rational, and thus one can exactly evaluate using arbitrary precision arithmetic on rational numbers or integers. Unlike computing a true orbit of a linear or linear fractional map, the cost required to compute a true orbit of is extremely high (see [18]). However, in order to obtain a reasonably long pseudorandom binary sequence, it is sufficient to iterate several dozen times (for example, the number of iterations of required to generate a pseudorandom sequence of length 2 36 − 2, which is discussed in Subsection 7.3, is 36). ...

True orbit simulation of piecewise linear and linear fractional maps of arbitrary dimension using algebraic numbers
  • Citing Article
  • June 2015

... In the last few years, other multidimensional continued fractions algorithms have been defined in Q p . In particular, in [60] and [79] the authors introduced two different algorithms trying to generalize, respectively, Browkin and Schneider's approach (see also [70]). In [61], the authors deepened the study of the algorithm defined in [60] by exploring its properties of finiteness. ...

Some aspects of multidimensional continued fraction algorithms
  • Citing Article
  • January 2012

... Moreover, we show that the continued fraction expansions of an arbitrary rational number always terminate by our algorithms. It is worth mentioning that our algorithms have a common background with those proposed in [11,12,13,14,3] in the design of continued fraction algorithms. ...

New algorithm of continued fractions related to real algebraic number fields of degree ≤5
  • Citing Article
  • January 2011

... The semigroup of multidimensional backward mappings D s was introduced and studied in [1,6]. Previously, the one-dimensional backward mappings had been applied in the theory of dynamical systems [7,8], and two-dimensional backward mappings had been used for checking the periodicity of expansions of cubic roots [9] and for approximation of cubic irrationalities [6]. ...

A New Multidimensional Slow Continued Fraction Algorithm and Stepped Surface

Experimental Mathematics

... Our multidimensional continued fractions are produced using the Jacobi-Perron type algorithms which have previously been studied by Jun-Ichi Tamura and Shin-Ichi Yasutomi. In [12], Tamura introduces the Jacobi-Perron Algorithm and then in [13], [14], and [15], Tamura and Yasutomi discuss modified versions of Jacobi-Perron Algorithm, such as the Jacobi-Perron-Parusnikov Algorithm and Algebraic Jacobi-Perron Algorithm, and their connections with higher dimensional continued fractions. In particular, in [14], Tamura proved that certain types of elements in number fields can be expanded as periodic continued fractions. ...

Algebraic Jacobi-Perron algorithm for biquadratic numbers
  • Citing Article
  • July 2010

... Periodicity of the Jacobi-Perron algorithm was proven for certain classes of cubic numbers in [3]. It is interesting to notice that cubic periodicity is also unknown for various modifications of the Jacobi-Perron algorithm (subtractive algorithms by Brun [5] and Selmer [29], fully subtractive algorithm by Schweiger [26] and [27], generalized subtractive algorithm [25], Tamura-Yasutomi algorithm [30], heuristic algebraic periodicity detecting algorithm [14], etc.). ...

A new multidimensional continued fraction algorithm

Mathematics of Computation