English
Related papers

Related papers: Orbit length generating functions of automorphisms…

200 papers

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok , Kevin Woods

We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…

Mathematical Physics · Physics 2022-09-26 Jon Harrison , Tori Hudgins

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

Formal Languages and Automata Theory · Computer Science 2020-11-25 Joost Engelfriet

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

Dynamical Systems · Mathematics 2023-09-11 Junho Peter Whang

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

Formal Languages and Automata Theory · Computer Science 2020-05-22 Giuseppa Castiglione , Gabriele Fici , Antonio Restivo

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

Numerical Analysis · Mathematics 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

Let $Q$ be the matrix $\displaystyle \begin{pmatrix} a & b \\ 1 & 0 \end{pmatrix}$ in $GL_2(\mathbb{F}_q)$ where $\mathbb{F}_q$ is a finite field, and let $G$ be the finite cyclic group generated by $Q$. We consider the action of $G$ on the…

Number Theory · Mathematics 2024-08-20 Chatchawan Panraksa , Naveen Somasunderam

We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…

High Energy Physics - Theory · Physics 2007-05-23 Sergey Fomin , Andrei Zelevinsky

In this work, a sequence of orthonormal rational functions that is also biorthogonal to another sequence of rational functions arising from recurrence relations of $R_{II}$ type is constructed. The biorthogonality is proved by a procedure…

Classical Analysis and ODEs · Mathematics 2021-04-13 Kiran Kumar Behera , A. Swaminathan

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given…

Artificial Intelligence · Computer Science 2011-06-10 J. F. Baget , M. L. Mugnier

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

Combinatorics · Mathematics 2014-11-14 Jacob P. Dyer

We study the WKB expansion of $2\times 2$ system of linear differential equations with four fuchsian singularities. The main focus is on the generating function of the monodromy symplectomorphism which, according to a recent paper is…

Mathematical Physics · Physics 2023-05-05 Marco Bertola , Fabrizio Del Monte , Dmitry Korotkin

We study the involution of the real line induced by the outer automorphism of the extended modular group PGL(2,Z). This `modular' involution is discontinuous at rationals but satisfies a surprising collection of functional equations. It…

Number Theory · Mathematics 2015-09-09 A. Muhammed Uludağ , Hakan Ayral

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Number Theory · Mathematics 2018-03-13 Dragos Ghioca , Junyi Xie , with an appendix written by Michael Wibmer

Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a…

Operator Algebras · Mathematics 2017-09-28 Sebastien Palcoux

Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called the automorphism orbits of $G$, and their number is denoted by $\omega(G)$. Let $\mathbb{F}$ be an infinite field, and let $UT_n(\mathbb{F})$ denote the…

Group Theory · Mathematics 2025-10-13 Emerson de Melo , Júlia Kato

We study the automorphisms \phi of a finitely generated free group F. Building on the train-track technology of Bestvina, Feighn and Handel, we provide a topological representative f:G\to G of a power of \phi that behaves very much like the…

Group Theory · Mathematics 2007-05-23 Martin R. Bridson , Daniel Groves

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

Formal Languages and Automata Theory · Computer Science 2023-04-19 Thomas Colcombet , Gaëtan Douéneau-Tabot , Aliaume Lopez