English
Related papers

Related papers: Finiteness for degenerate polynomials

200 papers

Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…

Rings and Algebras · Mathematics 2020-07-09 Dimas J. Gonçalves , Dalton C. Silva

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…

Group Theory · Mathematics 2024-08-28 Dominik Francoeur , Alejandra Garrido

Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We apply this result to address a fundamental question in…

Optimization and Control · Mathematics 2026-01-22 Julius A. Zeiss , Gereon Koßmann , René Schwonnek , Martin Plávala

We prove several rigidity results on multiplier spectrum and length spectrum. For example, we show that for every non-exceptional rational map $f:\mathbb{P}^1(\mathbb{C})\to\mathbb{P}^1(\mathbb{C})$ of degree $d\geq2$, the…

Dynamical Systems · Mathematics 2026-03-26 Zhuchao Ji , Junyi Xie , Geng-Rui Zhang

We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…

Rings and Algebras · Mathematics 2019-02-05 Vladimir I. Chernousov , Andrei S. Rapinchuk , Igor A. Rapinchuk

Let $f\colon X\to Y$ be a perfect surjective map of metrizable spaces. It is shown that if $Y$ is a $C$-space (resp., $\dim Y\leq n$ and $\dim f\leq m$), then the function space $C(X,\uin^{\infty})$ (resp., $C(X,\uin^{2n+1+m})$) equipped…

General Topology · Mathematics 2007-05-23 H. Murat Tuncali , Vesko Valov

We introduce deformations of the space of (multi-diagonal) harmonic polynomials for any finite complex reflection group of the form W=G(m,p,n), and give supporting evidence that this space seems to always be isomorphic, as a graded…

Combinatorics · Mathematics 2010-11-17 François Bergeron , Nicolas Borie , Nicolas M. Thiéry

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

Let $M_d$ be the moduli space of one-dimensional complex polynomial dynamical systems. The escape rates of the critical points determine a critical heights map $G: M_d \to \mathbb{R}^{d-1}$. For generic values of $G$, each connected…

Dynamical Systems · Mathematics 2009-12-03 Laura DeMarco , Kevin Pilgrim

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

Machine Learning · Computer Science 2024-10-23 Alexandros Eskenazis , Paata Ivanisvili , Lauritz Streck

We provide an explicit infinite family of integers $m$ such that all the polynomials of ${\mathbb F}_{2^n}[x]$ of degree $m$ have maximal differential uniformity for $n$ large enough. We also prove a conjecture of the third author in these…

Number Theory · Mathematics 2018-07-12 Yves Aubry , Fabien Herbaut , Jose Felipe Voloch

Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…

Number Theory · Mathematics 2023-06-16 Jeffrey Hatley , Mayah Teplitskiy

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…

Dynamical Systems · Mathematics 2009-03-10 Nicolai T A Haydn

We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.

Combinatorics · Mathematics 2011-02-19 Cheng Yeaw Ku , K. B. Wong

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Number Theory · Mathematics 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

Let d be any number greather than or equal to 3. We show that the intersection of the set mdeg(Aut(C^3))\ mdeg(Tame(C3)) with {(d_1,d_2,d_3) : d=d_1 =< d_2 =< d_3} has infinitely many elements, where mdeg h = (deg h_1,...,deg h_n) denotes…

Algebraic Geometry · Mathematics 2012-09-25 Marek Karaś , Jakub Zygadło