English
Related papers

Related papers: A finiteness result for post-critically finite pol…

200 papers

Consider the Grothendieck group of finite type projective modular representations of the symmetric groups on n letters, or more generally, of its wreath product with a finite group. They form a graded group, with a product defined using…

Representation Theory · Mathematics 2017-10-13 Hélène Pérennou

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…

Dynamical Systems · Mathematics 2015-08-18 Rafe Jones

We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitation of rational maps and the effective Nullstellensatz over a variety. Our treatment…

Algebraic Geometry · Mathematics 2012-10-23 Carlos D'Andrea , Teresa Krick , Martin Sombra

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Number Theory · Mathematics 2010-03-23 Bas Edixhoven , Jean-Marc Couveignes , Robin de Jong , Franz Merkl , Johan Bosman

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

Number Theory · Mathematics 2020-07-07 Wade Hindes

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

We first extend the results of Chatterjee,Kumar,Shi,Volk(Computational Complexity 2022) by showing that the degree $d$ elementary symmetric polynomials in $n$ variables have formula lower bounds of $\Omega(d(n-d))$ over fields of positive…

Computational Complexity · Computer Science 2026-02-10 Ian Orzel

Let $f$ be a generically finite polynomial map $f: \mathbb{C}^n\to \mathbb{C}^m$ of algebraic degree $d$. Motivated by the study of the Jacobian Conjecture, we prove that the set $S_f$ of non-properness of $f$ is covered by parametric…

Algebraic Geometry · Mathematics 2019-06-12 Zbigniew Jelonek , Michał Lasoń

An endomorphism $f:\mathbb{P}^k\to\mathbb{P}^k$ of degree $d\geq2$ is said to be postcritically finite (or PCF) if its critical set $\mathrm{Crit}(f)$ is preperiodic, i.e. if there are integers $m>n\geq0$ such that…

Dynamical Systems · Mathematics 2025-12-22 Thomas Gauthier , Johan Taflin , Gabriel Vigny

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Data Structures and Algorithms · Computer Science 2018-09-28 Giovanni Paolini

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to…

Complex Variables · Mathematics 2019-08-29 Michael Dougherty , Jon McCammond

The present note is devoted to an amendment to a recent paper of Ellenberg, Lawrence and Venkatesh. Roughly speaking, the main result here states the subpolynomial growth of the number of integral points with bounded height of a variety…

Number Theory · Mathematics 2022-05-31 Yohan Brunebarbe , Marco Maculan

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Commutative Algebra · Mathematics 2010-05-11 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most…

Group Theory · Mathematics 2014-03-07 Yves Cornulier

In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…

Commutative Algebra · Mathematics 2008-07-21 Michael Kunte

We describe all special curves in the parameter space of complex cubic polynomials, that is all algebraic irreducible curves containing infinitely many post-critically finite polynomials. This solves in a strong form a conjecture by Baker…

Dynamical Systems · Mathematics 2016-06-21 Charles Favre , Thomas Gauthier

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle

We give a classification of the degrees of the points with rational $j$-invariant on the modular curves $X_{0}(n)$ and $X_{1}(n)$. The degrees which occur infinitely often are computed unconditionally, while those which occur finitely often…

Number Theory · Mathematics 2025-07-18 Kenji Terao

Let $S$ be a polynomial ring in $n$ variables over a field $K$ of characteristic $0$. A numerical characterization of all possible extremal Betti numbers of any graded submodule of a finitely generated graded free $S$-module is given.

Commutative Algebra · Mathematics 2016-07-12 Marilena Crupi