English
Related papers

Related papers: Blocks of monodromy groups in Complex Dynamics

200 papers

Let $A = \mathbb{F}_p$ or $\mathbb{Z}_p$, and let $R = A[[x_1]][[x_2; \sigma_2, \delta_2]]\dots[[x_n;\sigma_n,\delta_n]]$, an iterated local skew power series ring over $A$. Under mild conditions, we show that (multiplicative) monomial…

Rings and Algebras · Mathematics 2023-09-22 Billy Woods

We compute the Poisson bracket relations for the monodromy matrix of the auxiliary linear problem. If the basic Poisson bracket relations of the model contain derivatives, this computation leads to a peculiar type of symmetry breaking which…

High Energy Physics - Theory · Physics 2008-02-03 M. A. Semenov-Tian-Shansky

A log generic hypersurface in $\mathbb{P}^n$ with respect to a birational modification of $\mathbb{P}^n$ is by definition the image of a generic element of a high power of an ample linear series on the modification. A log very-generic…

Algebraic Geometry · Mathematics 2021-10-26 Nero Budur , Robin van der Veer

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

Commutative Algebra · Mathematics 2025-11-11 Ezra Miller

We give a construction which produces irreducible complex rigid local systems on $\Bbb{P}_{\Bbb{C}}^1-\{p_1,\dots,p_s\}$ via quantum Schubert calculus and strange duality. These local systems are unitary and arise from a study of vertices…

Algebraic Geometry · Mathematics 2021-12-10 Prakash Belkale

We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…

Combinatorics · Mathematics 2018-02-16 Vladimir Bondarenko , Andrei Nikolaev , Dzhambolet Shovgenov

We prove structure theorems for the moduli stack of elliptic curves equipped with $G$-structures, where $G$ is a finite 2-generated metabelian group. In particular, we show that if $G$ has exponent $e$, then there is a subgroup $H\le…

Algebraic Geometry · Mathematics 2017-10-17 William Yun Chen , Pierre Deligne

We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…

Combinatorics · Mathematics 2009-08-29 Jacob Steinhardt

Given a field $K$, a polynomial $f \in K[x]$, and a suitable element $t \in K$, the set of preimages of $t$ under the iterates $f^{\circ n}$ carries a natural structure of a $d$-ary tree. We study conditions under which the absolute Galois…

Number Theory · Mathematics 2020-03-05 Borys Kadets

We discuss a class of selection rules which i) do not come from group actions on fields, ii) are exact at tree level in perturbation theory, iii) are increasingly violated as the loop order is raised, and iv) eventually reduce to selection…

High Energy Physics - Theory · Physics 2025-01-09 Justin Kaidi , Yuji Tachikawa , Hao Y. Zhang

Let X be a polyhedral complex with finitely many isometry classes of links. We establish a restriction on the covolumes of uniform lattices acting on X. When X is two-dimensional and has all links isometric to either a complete bipartite…

Group Theory · Mathematics 2007-05-23 Anne Thomas

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

Combinatorics · Mathematics 2026-03-17 César Bautista-Ramos , Carlos Guillén-Galván , Paulino Gómez-Salgado

Polynomial invariants of a group action often appear only in high degree, and in many representations the invariant ring imposes severe degree constraints before any nontrivial invariants can occur. In contrast, the larger class of unitary…

Representation Theory · Mathematics 2026-02-17 Josh Katz

A large class of real $3$-dimensional nilpotent polynomial vector fields of arbitrary degree is considered. The aim of this work is to present general properties of the discrete and continuous dynamical systems induced by these vector…

Dynamical Systems · Mathematics 2022-09-16 Álvaro Castañeda , Salomón Rebollo-Perdomo

We consider a large family of dynamical Belyi maps of arbitrary degree and study the arithmetic monodromy groups attached to the iterates of such maps. Building on the results of Bouw-Ejder-Karemaker on the geometric monodromy groups of…

Number Theory · Mathematics 2022-01-25 Ozlem Ejder

This paper gives an explicit structure theorem for the symmetric group acting on the symmetric algebra of its natural module. Let $G$ be the symmetric group on $x_1,..., x_n$ and let $d_i$ be the $i^{\text{th}}$ elementary symmetric…

Rings and Algebras · Mathematics 2013-01-08 Robert Mckemey

The Prym map $\mathcal{P}_6$ in genus 6 is dominant and generically finite of degree 27. When restricted to the divisor of curves with an odd semicanonical pencil $\mathcal{T}_6^o$, it is still generically finite, but of degree strictly…

Algebraic Geometry · Mathematics 2025-05-29 Martí Lahoz , Juan Carlos Naranjo , Andrés Rojas , Irene Spelta

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…

Group Theory · Mathematics 2016-06-28 Laurent Bartholdi , Volodymyr V. Nekrashevych

We determine the generic complete eigenstructures for $n \times n$ complex symmetric matrix polynomials of odd grade $d$ and rank at most $r$. More precisely, we show that the set of $n \times n$ complex symmetric matrix polynomials of odd…

Numerical Analysis · Mathematics 2019-11-05 Fernando De Terán , Andrii Dmytryshyn , Froilán M. Dopico

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over…

Discrete Mathematics · Computer Science 2022-01-21 Abhishek Bhowmick , Shachar Lovett
‹ Prev 1 4 5 6 7 8 10 Next ›