Ariane M. Masuda

activity

20072026

most citedOne- and Two-Point Codes over Kummer Extensions

19 citations · 53 across the 16 of their papers we have counts for

collaborators

Showing math.NTShow all

10 papers · 1 filter

math.NT2021★ 8 cited

Rédei permutations with the same cycle structure

Juliane Capaverde, Ariane M. Masuda, Virgínia M. Rodrigues

Let $F_{q}$ be the finite field of order $q$ , and $P^{1} (F_{q}) = F_{q} \cup {\infty}$ . Write $(x + y)^{m}$ as $N (x, y) + D (x, y) y$ . For $m\in\mathb…

math.NT2020

Permutation binomials of the form $x^{r} (x^{q - 1} + a)$ over $F_{q^{e}}$

Ariane M. Masuda, Ivelisse Rubio, Javier Santiago

We present several existence and nonexistence results for permutation binomials of the form $x^{r} (x^{q - 1} + a)$ , where $e \geq 2$ and $a \in F_{q^{e}}^{*}$ . As a consequence, we ob…

math.NT2020★ 5 cited

Rédei permutations with cycles of the same length

Juliane Capaverde, Ariane M. Masuda, Virgínia M. Rodrigues

Let $F_{q}$ be a finite field of odd characteristic. We study Rédei functions that induce permutations over $P^{1} (F_{q})$ whose cycle decomposition contains o…

math.NT2018★ 1 cited

Mean Row Values in $(u, v)$ -Calkin-Wilf Trees

Sandie Han, Ariane M. Masuda, Satyanand Singh +1

We fix integers $u, v \geq 1$ , and consider an infinite binary tree $T^{(u, v)} (z)$ with a root node whose value is a positive rational number $z$ . For every vertex $a / b$ ,…

math.NT2017

Maximal entries of elements in certain matrix monoids

Sandie Han, Ariane M. Masuda, Satyanand Singh +1

Let $L_{u} = [1 u 01]$ and $R_{v} = [10 v 1]$ be matrices in $S L_{2} (Z)$ with $u, v \geq 1$ . Since the monoid generated…

math.NT2015★ 1 cited

Orphans in Forests of Linear Fractional Transformations

Sandie Han, Ariane M. Masuda, Satyanand Singh +1

This paper studies the set of orphans in certain Calkin-Wilf trees generated by linear fractional transformations.

math.NT2014★ 9 cited

The (u,v)-Calkin-Wilf Forest

Sandie Han, Ariane M. Masuda, Satyanand Singh +1

In this paper we consider a refinement, due to Nathanson, of the Calkin-Wilf tree. In particular, we study the properties of such trees associated with the matrices $L_u=\begin{bma…

math.NT2007

Nonexistence of permutation binomials of certain shapes

Ariane M. Masuda, Michael E. Zieve

Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that eithe…

math.NT2007★ 1 cited

Permutation binomials over finite fields

Ariane M. Masuda, Michael E. Zieve

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed…

math.NT2007

Rational functions with linear relations

Ariane M. Masuda, Michael E. Zieve

We find all polynomials f,g,h over a field K such that g and h are linear and f(g(x))=h(f(x)). We also solve the same problem for rational functions f,g,h, in case the field K is a…

Rédei permutations with the same cycle structure

Permutation binomials of the form xr(xq−1+a) over Fqe​

Rédei permutations with cycles of the same length

Mean Row Values in (u,v)-Calkin-Wilf Trees

Maximal entries of elements in certain matrix monoids

Orphans in Forests of Linear Fractional Transformations

The (u,v)-Calkin-Wilf Forest

Nonexistence of permutation binomials of certain shapes

Permutation binomials over finite fields

Rational functions with linear relations

Permutation binomials of the form $x^{r} (x^{q - 1} + a)$ over $F_{q^{e}}$

Mean Row Values in $(u, v)$ -Calkin-Wilf Trees