Related papers: On the Periodic Orbits of the Dual Logarithmic Derivative Operator

On the Periodic Orbits of the Dual Logarithmic Derivative Operator

URL: http://arxiv.org/abs/2511.21283v1
Date: Wed, 26 Nov 2025 11:14:32 GMT
Title: On the Periodic Orbits of the Dual Logarithmic Derivative Operator
Authors: Xiaohang Yu, William Knottenbelt,
Abstract summary: We study the periodic behaviour of the dual logarithmic derivative operator $mathcalA[f]=mathrmdln f/mathrmdln x$ in a complex analytic setting.<n>We show that $mathcalA$ admits genuinely nondegenerate period-$2$ orbits and identify a canonical explicit example.
Score: 2.6498598849144464
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We study the periodic behaviour of the dual logarithmic derivative operator $\mathcal{A}[f]=\mathrm{d}\ln f/\mathrm{d}\ln x$ in a complex analytic setting. We show that $\mathcal{A}$ admits genuinely nondegenerate period-$2$ orbits and identify a canonical explicit example. Motivated by this, we obtain a complete classification of all nondegenerate period-$2$ solutions, which are precisely the rational pairs $(c a x^{c}/(1-ax^{c}),\, c/(1-ax^{c}))$ with $ac\neq 0$. We further classify all fixed points of $\mathcal{A}$, showing that every solution of $\mathcal{A}[f]=f$ has the form $f(x)=1/(a-\ln x)$. As an illustration, logistic-type functions become pre-periodic under $\mathcal{A}$ after a logarithmic change of variables, entering the period-$2$ family in one iterate. These results give an explicit description of the low-period structure of $\mathcal{A}$ and provide a tractable example of operator-induced dynamics on function spaces.

Related papers

What Trace Powers Reveal About Log-Determinants: Closed-Form Estimators, Certificates, and Failure Modes [0.0]
We study access to trace powers $p_k = tr(Ak)$, natural when matrix powers are available.<n>We prove a fundamental limit: no continuously positive moments can be uniformly accurate over unbounded conditioning.
arXiv Detail & Related papers (2026-01-18T23:04:17Z)
Discrete symmetries in classical and quantum oscillators [51.56484100374058]
We show the eigenfunctions $_n=zn$ of the quantum Hamiltonian in the complex Bargmann-Fock-Segal representation.<n>The superposition $=sum_n c_n_n$ arises only with incomplete knowledge of the initial data for solving the Schrdinger equation.
arXiv Detail & Related papers (2026-01-05T10:04:39Z)
Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination [65.37519531362157]
We show that any efficient Statistical Query algorithm for this task requires VSTAT complexity at least $tildeOmega(d1/2/alpha2)$.
arXiv Detail & Related papers (2025-10-12T15:42:44Z)
Towards verifications of Krylov complexity [0.0]
I present the exact and explicit expressions of the moments $mu_m$ for 16 quantum mechanical systems which are em exactly solvable both in the Schr"odinger and Heisenberg pictures.
arXiv Detail & Related papers (2024-03-11T02:57:08Z)
A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
arXiv Detail & Related papers (2023-09-25T17:54:19Z)
Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization [54.29685789885059]
We introduce efficient $(1+varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem. The goal is to approximate $mathbfA$ as a product of low-rank factors. Our techniques generalize to other common variants of the BMF problem.
arXiv Detail & Related papers (2023-06-02T18:55:27Z)
Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
arXiv Detail & Related papers (2022-06-17T17:55:43Z)
Low-degree learning and the metric entropy of polynomials [44.99833362998488]
We prove that any (deterministic or randomized) algorithm which learns $mathscrF_nd$ with $L$-accuracy $varepsilon$ requires at least $Omega(sqrtvarepsilon)2dlog n leq log mathsfM(mathscrF_n,d,|cdot|_L,varepsilon) satisfies the two-sided estimate $$c (1-varepsilon)2dlog
arXiv Detail & Related papers (2022-03-17T23:52:08Z)
Reality from maximizing overlap in the periodic complex action theory [0.0]
We present two theorems stating that $langle hatmathcal O rangle_mathrmperiodicmathrmtime$ becomes real for $hatmathcal O$ being Hermitian. The latter proven via a number-theoretical argument suggests that, if our universe is periodic, then even the period could be determined in such an operator.
arXiv Detail & Related papers (2022-03-15T11:22:24Z)
Learning low-degree functions from a logarithmic number of random queries [77.34726150561087]
We prove that for any integer $ninmathbbN$, $din1,ldots,n$ and any $varepsilon,deltain(0,1)$, a bounded function $f:-1,1nto[-1,1]$ of degree at most $d$ can be learned.
arXiv Detail & Related papers (2021-09-21T13:19:04Z)
Algorithms and Hardness for Linear Algebra on Geometric Graphs [14.822517769254352]
We show that the exponential dependence on the dimension dimension $d in the celebrated fast multipole method of Greengard and Rokhlin cannot be improved. This is the first formal limitation proven about fast multipole methods.
arXiv Detail & Related papers (2020-11-04T18:35:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.