English
Related papers

Related papers: Compositions and collisions at degree p^2

200 papers

The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…

Rings and Algebras · Mathematics 2015-03-17 Bettina Eick , Simon King

We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.

Algebraic Geometry · Mathematics 2020-04-29 Zhenjian Wang

It is known that, if all the real-valued irreducible characters of a finite group have odd degree, then the group has normal Sylow $2$-subgroup. We generalize this result for Sylow $p$-subgroups, for any prime number $p$, while assuming the…

Group Theory · Mathematics 2024-01-17 Nicola Grittini

Let K<X> be a free associative algebra over a field K of characteristic 0 and let each of the noncommuting polynomials f,g generate its centralizer in K<X>. Assume that the leading homogeneous components of f and g are algebraically…

Rings and Algebras · Mathematics 2008-06-04 Vesselin Drensky , Jie-Tai Yu

In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a…

Rings and Algebras · Mathematics 2018-04-25 X. -F. Mao , X. -D. Gao , Y. -N. Yang , J. -H. Chen

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

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

Let $F$ be an algebraically closed field and consider the Lie algebra ${\mathfrak g}=\langle x\rangle\ltimes {\mathfrak a}$, where $\mathrm{ad}\, x$ acts diagonalizably on the abelian Lie algebra ${\mathfrak a}$. Refer to a ${\mathfrak…

Representation Theory · Mathematics 2014-08-12 Leandro Cagliero , Fernando Szechtman

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Algebraic Geometry · Mathematics 2015-12-29 Ada Boralevi , Jan Draisma , Emil Horobet , Elina Robeva

An algorithm is presented here, for discovering Hopf-Bifurcation varieties of polynomial dynamical systems. It is based on the expression of specific polynomials, as sums of products of first degree polynomials, with parametrical…

Chaotic Dynamics · Physics 2008-07-29 Stelios Kotsios

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we…

Classical Analysis and ODEs · Mathematics 2015-02-03 Alex Rice

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

Numerical Analysis · Mathematics 2018-10-30 Sharif Rahman

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

Number Theory · Mathematics 2022-10-27 Benjamin Fraser , Patrick Ingram

We describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $\mathbb{Q}$, up to conjugacy over $\text{PGL}_2(\bar{\mathbb{Q}})$. We describe normal forms that classify equivalence classes…

Number Theory · Mathematics 2020-06-18 Jacqueline Anderson , Michelle Manes , Bella Tobin

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

Symbolic Computation · Computer Science 2016-10-03 Matthew England , James H. Davenport

Let $A$ be a Poisson Hopf algebra over an algebraically closed field of characteristic zero. If $A$ is finitely generated and connected graded as an algebra and its Poisson bracket is homogeneous of degree $d \geq 0$, then $A$ is…

Quantum Algebra · Mathematics 2017-09-07 Ken A. Brown , James J. Zhang

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

Algebraic Geometry · Mathematics 2019-11-19 Macarena Ansola , Antonio Díaz-Cano , M. Angeles Zurro

Irreducible trinomials of given degree n over $F_2$ do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we…

Rings and Algebras · Mathematics 2014-01-30 Ryul Kim , Wolfram Koepf

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…

Combinatorics · Mathematics 2023-10-25 Tony Zeng