English
Related papers

Related papers: Swan-like reducibility for Type I pentanomials ove…

200 papers

In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…

Mathematical Physics · Physics 2019-01-01 Andrey V. Sokolov

We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

Combinatorics · Mathematics 2022-12-09 Megha M. Kolhekar , Harish K. Pillai

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Number Theory · Mathematics 2025-09-03 Richard Ehrenborg

Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers…

Number Theory · Mathematics 2019-02-20 Philip Dittmann

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six…

Information Theory · Computer Science 2016-05-23 Kangquan Li , Longjiang Qu , Chao Li , Shaojing Fu

We study the function field analogue of Shanks bias. For Liouville function $\lambda(f)$, we compare the number of monic polynomials $f$ with $\lambda(f) \chi_m(f) = 1$ and $\lambda(f) \chi_m(f) = -1$ for a nontrivial quadratic character…

Number Theory · Mathematics 2025-12-22 Seewoo Lee

Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…

Number Theory · Mathematics 2012-10-03 Xiang-dong Hou

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

Representation Theory · Mathematics 2016-11-02 Juan Tirao , Ignacio Zurrián

It has been proved several times in the literature that a polynomial map from $C^2$ to $C$ with irreducible rational fibers cannot be a component of a counterexample to the Jacobian Conjecture. This note points out that this result is…

Algebraic Geometry · Mathematics 2007-05-23 Walter D. Neumann , Paul Norbury

The class B of lacunary polynomials f(x) := -1 + x + x^n + x^{m_1} + x^{m_2} + ... + x^{m_s}, where s >= 0, m_1 - n >= n - 1, m_{q+1} - m_{q} >= n - 1 for 1 <= q < s, n >= 3 is studied. A polynomial having its coefficients in {0, 1} except…

Number Theory · Mathematics 2020-02-20 Denys Dutykh , Jean-Louis Verger-Gaugry

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

Commutative Algebra · Mathematics 2021-05-14 Devendra Prasad

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

Number Theory · Mathematics 2025-06-18 Lara Du

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

Number Theory · Mathematics 2019-07-09 Vefa Goksel

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Number Theory · Mathematics 2026-02-26 Artyom Radomskii

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

Combinatorics · Mathematics 2013-02-12 Milan Janjic

Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a…

Formal Languages and Automata Theory · Computer Science 2017-01-19 Dominik D. Freydenberger , Pawel Gawrychowski , Juhani Karhumäki , Florin Manea , Wojciech Rytter
‹ Prev 1 8 9 10 Next ›