English
Related papers

Related papers: On Ritt's polynomial decomposition theorems

200 papers

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…

Number Theory · Mathematics 2014-11-03 Alina Ostafe

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Symbolic Computation · Computer Science 2017-03-01 Dongming Wang , Rina Dong , Chenqi Mou

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…

Combinatorics · Mathematics 2020-03-24 Gohar Kyureghyan , Shuxing Li , Alexander Pott

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

Information Theory · Computer Science 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

In 1923 Schur considered the following problem. Let f(X) be a polynomial with integer coefficients that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of…

Group Theory · Mathematics 2019-07-30 Robert M. Guralnick , Peter Müller , Jan Saxl

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

Commutative Algebra · Mathematics 2009-07-02 Joachim von zur Gathen

Let $\mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$. Let $(u_1, \dots, u_n)$ be a sequence of $n$ algebraically independent elements in $\mathbb{K}[x_1, \dots, x_n]$. Given a polynomial $f$ in…

Symbolic Computation · Computer Science 2022-06-01 Thi Xuan Vu

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…

Combinatorics · Mathematics 2014-02-18 Serban Barcanescu

Let $R$ be the homogeneous coordinate ring of the Grassmannian $\mathbb{G}=Gr(2,n)$ defined over an algebraically closed field $k$ of characteristic $p \geq \max\{n-2,3\}$. In this paper we give a description of the decomposition of $R$,…

Algebraic Geometry · Mathematics 2019-01-31 Theo Raedschelders , Špela Špenko , Michel Van den Bergh

Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this…

Symbolic Computation · Computer Science 2017-05-30 Luiz E. Allem , Juliane Capaverde , Mark van Hoeij , Jonas Szutkoski

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

We consider the ring of coinvariants for modular representations of cyclic groups of prime order. For all cases for which explicit generators for the ring of invariants are known, we give a reduced Gr\"obner basis for the Hilbert ideal and…

Commutative Algebra · Mathematics 2007-05-23 Müfit Sezer , R. James Shank

Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…

Representation Theory · Mathematics 2018-02-23 András Cristian Lőrincz

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Representation Theory · Mathematics 2019-06-05 Vladimir V Kornyak