This content will become publicly available on March 18, 2025
 Award ID(s):
 1913119
 NSFPAR ID:
 10513583
 Editor(s):
 Jha, Sangita; Roychowdhury, Mrinal; Verma, Saurabh
 Publisher / Repository:
 American Mathematical Society
 Date Published:
 Journal Name:
 Contemporary Mathematics
 Volume:
 797
 ISSN:
 9781470472160
 Page Range / eLocation ID:
 2024
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

null (Ed.)Let $f:X\rightarrow X$ be a continuous dynamical system on a compact metric space $X$ and let $\unicode[STIX]{x1D6F7}:X\rightarrow \mathbb{R}^{m}$ be an $m$ dimensional continuous potential. The (generalized) rotation set $\text{Rot}(\unicode[STIX]{x1D6F7})$ is defined as the set of all $\unicode[STIX]{x1D707}$ integrals of $\unicode[STIX]{x1D6F7}$ , where $\unicode[STIX]{x1D707}$ runs over all invariant probability measures. Analogous to the classical topological entropy, one can associate the localized entropy $\unicode[STIX]{x210B}(w)$ to each $w\in \text{Rot}(\unicode[STIX]{x1D6F7})$ . In this paper, we study the computability of rotation sets and localized entropy functions by deriving conditions that imply their computability. Then we apply our results to study the case where $f$ is a subshift of finite type. We prove that $\text{Rot}(\unicode[STIX]{x1D6F7})$ is computable and that $\unicode[STIX]{x210B}(w)$ is computable in the interior of the rotation set. Finally, we construct an explicit example that shows that, in general, $\unicode[STIX]{x210B}$ is not continuous on the boundary of the rotation set when considered as a function of $\unicode[STIX]{x1D6F7}$ and $w$ . In particular, $\unicode[STIX]{x210B}$ is, in general, not computable at the boundary of $\text{Rot}(\unicode[STIX]{x1D6F7})$ .more » « less

null (Ed.)Dynamical equations form the basis of design for manufacturing processes and control systems; however, identifying governing equations using a mechanistic approach is tedious. Recently, Machine learning (ML) has shown promise to identify the governing dynamical equations for physical systems faster. This possibility of rapid identification of governing equations provides an exciting opportunity for advancing dynamical systems modeling. However, applicability of the ML approach in identifying governing mechanisms for the dynamics of complex systems relevant to manufacturing has not been tested. We test and compare the efficacy of two whitebox ML approaches (SINDy and SymReg) for predicting dynamics and structure of dynamical equations for overall dynamics in a distillation column. Results demonstrate that a combination of ML approaches should be used to identify a full range of equations. In terms of physical law, few terms were interpretable as related to Fick’s law of diffusion and Henry’s law in SINDy, whereas SymReg identified energy balance as driving dynamics.more » « less

We investigate the computability (in the sense of computable analysis) of the topological pressure P_top(ϕ) on compact shift spaces X for continuous potentials ϕ:X→R. This question has recently been studied for subshifts of finite type (SFTs) and their factors (sofic shifts). We develop a framework to address the computability of the topological pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on Sgap shifts, generalised gap shifts, and particular betashifts. We also construct shift spaces which, depending on the potential, exhibit computability and noncomputability of the topological pressure. We further prove that the generalised pressure function (X,ϕ) ↦P_top(X,ϕ_X) is not computable for a large set of shift spaces X and potentials ϕ . In particular, the entropy map X↦h_top(X) is computable at a shift spacemore » « less
X if and only if X has zero topological entropy. Along the way of developing these computability results, we derive several ergodictheoretical properties of coded shifts which are of independent interest beyond the realm of computability. 
ABSTRACT We analyse how drag forces modify the orbits of objects moving through extended gaseous distributions. We consider how hydrodynamic (surface area) drag forces and dynamical friction (gravitational) drag forces drive the evolution of orbital eccentricity. While hydrodynamic drag forces cause eccentric orbits to become more circular, dynamical friction drag can cause orbits to become more eccentric. We develop a semianalytic model that accurately predicts these changes by comparing the total work and torque applied to the orbit at periapse and apoapse. We use a toy model of a radial powerlaw density profile, ρ ∝ r−γ, to determine that there is a critical γ = 3 power index, which separates the eccentricity evolution in dynamical friction: orbits become more eccentric for γ < 3 and circularize for γ > 3. We apply these findings to the infall of a Jupiterlike planet into the envelope of its host star. The hydrostatic envelopes of stars are defined by steep density gradients near the limb and shallower gradients in the interior. Under the influence of gaseous dynamical friction, an infalling object’s orbit will first decrease in eccentricity and then increase. The critical separation that delineates these regimes is predicted by the local density slope and is linearly dependent on polytropic index. More broadly, our findings indicate that binary systems may routinely emerge from common envelope phases with nonzero eccentricities that were excited by the dynamical friction forces that drove their orbital tightening.

Hirschfeldt and Jockusch (2016) introduced a twoplayer game in which winning strategies for one or the other player precisely correspond to implications and nonimplications between [Formula: see text] principles over [Formula: see text]models of [Formula: see text]. They also introduced a version of this game that similarly captures provability over [Formula: see text]. We generalize and extend this gametheoretic framework to other formal systems, and establish a certain compactness result that shows that if an implication [Formula: see text] between two principles holds, then there exists a winning strategy that achieves victory in a number of moves bounded by a number independent of the specific run of the game. This compactness result generalizes an old prooftheoretic fact noted by H. Wang (1981), and has applications to the reverse mathematics of combinatorial principles. We also demonstrate how this framework leads to a new kind of analysis of the logical strength of mathematical problems that refines both that of reverse mathematics and that of computabilitytheoretic notions such as Weihrauch reducibility, allowing for a kind of finestructural comparison between [Formula: see text] principles that has both computabilitytheoretic and prooftheoretic aspects, and can help us distinguish between these, for example by showing that a certain use of a principle in a proof is “purely prooftheoretic”, as opposed to relying on its computabilitytheoretic strength. We give examples of this analysis to a number of principles at the level of [Formula: see text], uncovering new differences between their logical strengths.more » « less