Related papers: Dynamical GCD Problems and a Variant of the Dynami…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
The purpose of this paper is to initiate a theory concerning the dynamics of asymptotically holomorphic polynomial-like maps. Our maps arise naturally as deep renormalizations of asymptotically holomorphic extensions of $C^r$ ($r>3$)…
This work explores the tensor and combinatorial constructs underlying the linearised higher-order variational equations of a generic autonomous system along a particular solution. The main result of this paper is a compact yet explicit and…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…
Upper bounds for GCD sums of the form [\sum_{k,{\ell}=1}^N\frac{(\gcd(n_k,n_{\ell}))^{2\alpha}}{(n_k n_{\ell})^\alpha}] are proved, where $(n_k)_{1 \leq k \leq N}$ is any sequence of distinct positive integers and $0<\alpha \le 1$; the…
For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…
Motivated by obtaining a consistent mathematical description for the radiation reaction of point charged particles in linear classical electrodynamics, a theory of generalized higher order tensors and differential forms is introduced. The…
We prove potential automorphy results for a single Galois representation $G_F \rightarrow GL_n(\overline{\mathbb{Q}}_l)$ where $F$ is a CM number field. The strategy is to use the $p,q$ switch trick and modify the Dwork motives employed in…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
Juhasz has proved that the automorphism group of a group G of maximal class of order p^n, with p\ge 5 and n>p+1, has order divisible by $p^{\lceil(3n-2p+5)/2\rceil}$. We show that by translating the problem in terms of derivations, the…
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
We outline the proof of a conjecture of Kontsevich on the isomorphism between the group of polynomial symplectomorphisms in $2n$ variables and the group of automorphisms of the $n$-th Weyl algebra over complex numbers. Our proof uses…
Consider a dominant rational self-map $f$ on a smooth projective variety $X$ defined over $\overline{\mathbb{Q}}$. We prove that \begin{align} \lim_{n \to \infty} \frac{h_{Y}(f^{n}(x))}{h_{H}(f^{n}(x)) } = 0, \end{align} where $h_{Y}$ is a…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…
Let $G$ be a connected reductive subgroup of a complex connected reductive group $\hat{G}$. Fix maximal tori and Borel subgroups of $G$ and $\hat{G}$. Consider the cone $LR^\circ(\hat{G},G)$ generated by the pairs $(\nu,\hat{\nu})$ of…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
Inspired by rational canonical forms, we introduce and analyze two decompositions of dynamic programming (DP) problems for systems with linear dynamics. Specifically, we consider both finite and infinite horizon DP problems in which the…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…