English
Related papers

Related papers: Dynamical GCD Problems and a Variant of the Dynami…

200 papers

We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…

Dynamical Systems · Mathematics 2023-02-27 Christopher Cabezas

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

Representation Theory · Mathematics 2007-05-23 Valentin Vankov Iliev

We give an alternative proof of Faltings's theorem (Mordell's conjecture): a curve of genus at least two over a number field has finitely many rational points. Our argument utilizes the set-up of Faltings's original proof, but is in spirit…

Number Theory · Mathematics 2019-10-29 Brian Lawrence , Akshay Venkatesh

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…

Combinatorics · Mathematics 2019-11-04 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…

Algebraic Geometry · Mathematics 2017-02-22 Dragos Ghioca , Holly Krieger , Khoa Nguyen , Hexi Ye

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this…

Combinatorics · Mathematics 2026-03-26 Bilal Ahmad Rather

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

Numerical Analysis · Mathematics 2018-04-06 Sharif Rahman

Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…

Chaotic Dynamics · Physics 2022-12-08 Andrei A. Elistratov , Dmitry V. Savin , Olga B. Isaeva

We study a class of aggregate-join queries with multiple aggregation operators evaluated over annotated relations. We show that straightforward extensions of standard multiway join algorithms and generalized hypertree decompositions (GHDs)…

Databases · Computer Science 2015-12-11 Manas Joglekar , Rohan Puttagunta , Christopher Ré

In this article, we further explore the nature of a connection between the groups of automorphisms of full shift spaces and the groups of outer automorphisms of the Higman--Thompson groups $\{G_{n,r}\}$. We show that the quotient of the…

Group Theory · Mathematics 2021-11-02 James Belk , Collin Bleak , Peter J. Cameron , Feyishayo Olukoya

We survey Vojta's higher-dimensional generalizations of the $abc$ conjecture and Szpiro's conjecture as well as recent developments that apply them to various problems in arithmetic dynamics. In particular, the "$abcd$ conjecture" implies a…

Number Theory · Mathematics 2024-04-24 Robin Zhang

Dynamic mode decomposition (DMD) is a powerful data-driven technique for construction of reduced-order models of complex dynamical systems. Multiple numerical tests have demonstrated the accuracy and efficiency of DMD, but mostly for…

Numerical Analysis · Mathematics 2021-07-28 Hannah Lu , Daniel M. Tartakovsky

This report summarizes progress made towards a new approach for enlarging the dynamic aperture of particle accelerators. Unlike prior methods which attempted to move the location of select resonances outward in phase space, our approach…

Accelerator Physics · Physics 2018-09-11 Herman D. Schaumburg , Bela Erdelyi

We prove that the existence of an automorphism of finite order on a (defined over a number field) variety X implies the existence of algebraic linear relations between the logarithm of certain periods of X and the logarithm of special…

Number Theory · Mathematics 2007-05-23 V. Maillot , D. Roessler

We propose a new method for computing Dynamic Mode Decomposition (DMD) evolution matrices, which we use to analyze dynamical systems. Unlike the majority of existing methods, our approach is based on a variational formulation consisting of…

Numerical Analysis · Mathematics 2019-05-24 Omri Azencot , Wotao Yin , Andrea Bertozzi

Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…

Computational Complexity · Computer Science 2010-11-08 Peter Buergisser , Christian Ikenmeyer

Let $X$ be a smooth projective variety defined on a finite field $\mathbb{F}_q$. On $X$ there is a special morphism $Fr_X$, which raises coordinates to exponent $q$: $t\mapsto t^q$. The two main results in this paper are: Result 1: If…

Dynamical Systems · Mathematics 2025-12-09 Tuyen Trung Truong

We make progress on a generalization of the road (colouring) problem. The road problem was posed by Adler-Goodwyn-Weiss and solved by Trahtman. The generalization was posed, and solved in certain special cases, by Ashley-Marcus-Tuncel. We…

Combinatorics · Mathematics 2023-07-17 Sophie MacDonald

We revisit the concepts of acyclic orderings and number of acyclic orderings of acyclic digraphs in terms of dispositions and counters for arbitrary multidigraphs. We prove that when we add a sequence of nested directed paths to a directed…