English
Related papers

Related papers: Compositions and collisions at degree p^2

200 papers

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

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

For $G = \mathrm{GL}_2, \mathrm{SL}_2, \mathrm{PGL}_2$ we compute the intersection E-polynomials and the intersection Poincar\'e polynomials of the $G$-character variety of a compact Riemann surface $C$ and of the moduli space of $G$-Higgs…

Algebraic Geometry · Mathematics 2021-01-13 Mirko Mauri

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

Number Theory · Mathematics 2015-03-19 Dijana Kreso , Robert F. Tichy

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

Given a set $\Gamma$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects…

Algebraic Geometry · Mathematics 2015-10-28 Larry Guth

We study genus $g$ hyperelliptic curves with reduced automorphism group $A_5$ and give equations $y^2=f(x)$ for such curves in both cases where $f(x)$ is a decomposable polynomial in $x^2$ or $x^5$. For any fixed genus the locus of such…

Algebraic Geometry · Mathematics 2012-09-11 T. Shaska , D. Sevilla

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

Number Theory · Mathematics 2023-10-20 S. Rajagopal , P. Vanchinathan

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Number Theory · Mathematics 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

We study Hoeffding decomposable exchangeable sequences with values in a finite set D. We provide a new combinatorial characterization of Hoeffding decomposability and use this result to show that, if the cardinality of D is strictly greater…

Probability · Mathematics 2012-05-24 Omar El-Dakkak , Giovanni Peccati , Igor Prünster

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

Probability · Mathematics 2025-07-30 Ritik Jain , Han-Bom Moon , Peter Wu

In this paper we use the deformation procedure introduced in former work on deformed defects to investigate several new models for real scalar field. We introduce an interesting deformation function, from which we obtain two distinct…

High Energy Physics - Theory · Physics 2008-11-26 D. Bazeia , M. A. González León , L. Losano , J. Mateos Guilarte

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…

Algebraic Geometry · Mathematics 2011-11-28 E. Arrondo , A. Bernardi

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Discrete Mathematics · Computer Science 2025-09-29 Mehul Bafna , Shaghik Amirian

We study a natural stratification of certain affine slices of univariate hyperbolic polynomials. We look into which posets of strata can be realized and show that the dual of the poset of strata is a shellable simplicial complex and in…

Algebraic Geometry · Mathematics 2024-02-09 Arne Lien , Robin Schabert

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

Let G be a semisimple group over an algebraically closed field of characteristic p>0. We give a (partly conjectural) simple, closed formula for the character of many indecomposable tilting rational G-modules, assuming that p is large.

Representation Theory · Mathematics 2015-02-18 George Lusztig , Geordie Williamson

Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…

Combinatorics · Mathematics 2017-01-24 Leyla Işık , Alev Topuzoğlu
‹ Prev 1 8 9 10 Next ›