Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 19 April
In high-contrast composites, the electric (or stress) field may exhibit significant amplification in the narrow region between inclusions. The behavior of the solution depends on the distance $\epsilon$ between the inclusions, which tends to $0$. The purpose of this paper is to provide a simple proof of optimal pointwise estimates for the insulated conductivity problem in any dimension, including the case of flat inclusions. Our approach is based on two fundamental tools: the maximum principle and the Hopf lemma. A key feature of this method is that it avoids the flattening techniques commonly used in the literature, such as those in \citet{dong2021optimal,dong2022gradient}, which require transforming the narrow region into an n-dimensional cuboid. We show that the solution of the insulated problem is $\alpha$-order ($\alpha\in[0,1)$) polynomial growth for $n\geq2$ near the origin. Moreover, when the boundaries near the origin are flat, we prove that the gradient of the solution remains uniformly bounded.
Probability
Elephant random walk with attributed steps and extractions of random sizes
We study a model of market economics wherein the $(n+1)$-st customer, for each $n\geqslant N$, with $N$ being a prespecified positive integer, draws a sample of (random) size $K_{n}$, either with replacement or without, from the customers of the past. Each sampled customer is queried as to which of the two products, A and B, available in the oligopolistic market, they chose, and whether they are satisfied or not with their choice. The $(n+1)$-st customer now employs a stochastic rule, based on the information collected from the sampled customers, to decide which of the two products to buy. The probability that a customer is satisfied with the product they have purchased equals $q_{1}$ when the product is A, and $q_{2}$ when it is B, independent of all else. The resulting stochastic process may be represented as a variant of the celebrated elephant random walk, with the relative performance (in terms of sale) of A with respect to B, up to and including the $n$-th sale, captured by the position $S_{n}$ of the walker at time $n$. We study the almost sure convergence of $S_{n}/n$, as well as the convergence in distribution of suitably scaled versions of $S_{n}$ (where the scaling depends on the regime we are in).
Read the full abstract
Logic
Strict potentialism in modal mirrors
Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the generation of objects, another for truths becoming determined. The result is a classical bimodal logic. We obtain simpler and more user-friendly theories by invoking so-called mirroring theorems to “switch off” one or both modalities, in return for a less classical logic. When the modality of object generation is switched off, we obtain a restricted plural logic. When the modality of truth determination is switched off, the logic becomes intuitionistic. Finally, the value of this general approach to strict potentialism is illustrated by applications to a Weyl-inspired predicative set theory, Cantor's domain principle, and strict potentialism about Cantorian sets.
Read the full abstract
Functional Analysis
On Fixed Points of Nonlinear Monotone and Strongly Concave Operators Acting in Normal Cones
We introduce and study a new class of nonlinear monotone operators acting in normal cones of real Banach spaces and possessing the property of strong concavity. We establish new constructive principles for the existence of nonzero fixed points for this class of operators. Further, we prove that the corresponding iterative process converges to the fixed point at geometric rate. We also establish the uniqueness of the fixed point in a sufficiently wide conical segment. These results are applied to Hammerstein-type and Urysohn-type nonlinear integral operators acting in non-reflexive Banach spaces, as well as to the Cauchy problem for a nonlinear heat equation.
Read the full abstract
Differential Geometry
Flat Lorentzian Lie groups: A complete description
In this paper, we establish a complete structural description of flat Lorentzian Lie groups, i.e., Lie groups endowed with a flat left invariant Lorentzian metric, thereby resolving a long-standing open problem in the theory of pseudo-Riemannian Lie groups. Our main result shows that any flat Lorentzian Lie group either admits a timelike parallel left-invariant vector field or is of Kundt type, and that in both cases the underlying Lie algebra falls into one of six explicit classes. A key ingredient of the proof is a refined analysis of the double extension process, which reveals that all flat Lorentzian Lie algebras arise - directly or in a generalized sense - from flat Euclidean ones. As a consequence, we obtain easily a complete classification in dimensions three and four, recovering and unifying several previously known partial results.
Read the full abstract
Analysis of PDEs
Fučik spectrum for the operator with rapidly increasing weight and applications
In this paper, we study the Fučik spectrum for the operator with rapidly increasing weight, which is defined as a set $\Sigma$ comprising those $(\alpha, \beta) \in \mathbb{R}^2$ such that \begin{equation*} \left\{\begin{array}{l} L u:=-\Delta u-\frac{1}{2}(x \cdot \nabla u)=\alpha u^{+}-\beta u^{-}, \text{in}\ \mathbb{R}^N,\\ u\in X, \end{array}\right. \end{equation*} has a non-trivial solution $u$, where, $N\geq1$, $u^{ \pm}=\max ( \pm u, 0)$, $u=u^{+}-u^{-}$. The existence of a first nontrivial curve $\mathcal{C}$ of this spectrum, along with some of its properties (e.g., Lipschitz continuity, strict decrease and asymptotic behavior) is investigated in this paper. Our difficulty is that the problem is defined on the whole space $\mathbb{R}^N$, and therefore certain estimates do not carry over from the Fučik problem on bounded domains. As an application, we establish the multiplicity of solutions to the following problem \begin{equation*} \left\{\begin{array}{l} -\Delta u-\frac{1}{2}(x \cdot \nabla u)=f(x,u), \text{in}\ \mathbb{R}^N,\\ u\in X, \end{array}\right. \end{equation*} where, $N\geq1$ and the nonlinearity $f$ is asymptotically linear at zero and at infinity.
Read the full abstract
Optimization and Control
Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
We study the two-set feasibility problem of finding a point in the intersection $X\cap Y$ of closed convex sets in a Hilbert space. We propose a generalized composed alternating relaxed projection algorithm (gCARPA) that blends Douglas-Rachford-type and projection-reflection-type dynamics via an outer averaging step $\mu$ and an internal relaxation $(\gamma,\theta,\eta)$. The algorithm contains several classical projection methods as special cases. We also introduce its non-stationary variant, in which $(\gamma_k,\theta_k,\eta_k)$ vary over iterations, and establish its convergence. For the subspace feasibility model, we derive an explicit spectral characterization via principal-angle block decompositions, yielding computable subdominant-eigenvalue factors and a minimax parameter-selection recipe in a symmetric regime that targets critical damping on principal-angle planes. Numerical experiments illustrate that the generalized relaxation and its non-stationary tuning can improve or match baseline methods in problem-dependent regimes.
Read the full abstract
Optimization and Control · Cross-listed from cs.LO
Solving Stochastic Constraints by Oracle-based Gradient Descent and Interval Arithmetic
Stochastic constraints, which incorporate both deterministic parameters and random variables, extend classical deterministic constraints by explicitly accounting for uncertainty. These constraints are increasingly prevalent in data science, artificial intelligence, and bioinformatics; however, solving them requires addressing quantitative satisfaction problems that remain a significant challenge in computer science. In this paper, we propose a novel framework for deciding deterministic parameters that maximize the satisfaction probability. Our approach features a unique synergy between stochastic optimization and symbolic techniques: at the high level, it employs oracle-based stochastic gradient descent to identify high-quality parameter candidates, while at the low level, it utilizes interval arithmetic to compute rigorously certified lower bounds. This framework produces a sequence of sound and increasingly tight lower bounds for the true maximum satisfaction probability, supported by a high-probability convergence guarantee. We demonstrate the effectiveness and efficiency of our approach through its application to Stochastic Satisfiability Modulo Theories (SSMT) problems and a stochastic trajectory planning task.
Read the full abstract
Probability
Large Deviations for the Nonlinear Schrödinger Equation with Randomized Quasi-Periodic Initial Data in Higher Dimensions: Subcritical Case
We study the cubic weakly nonlinear Schrödinger equation with randomized spatially quasi-periodic initial data in higher dimensions. Under a polynomial decay assumption in Fourier space, we establish a Large Deviations Principle for rogue waves in the so-called subcritical time regime. The proof proceeds in two main steps. We first characterize the distribution of the linear solution and establish the corresponding linear large deviations principle. The lower bound is obtained via pointwise estimates, while the upper bound follows from a combination of truncation and probabilistic arguments. {The method used in this step appears to be new; compare with \cite{GGKS23}.} We then perform a detailed combinatorial analysis of the Picard iteration, deriving an effective bound for the Duhamel term and thereby establishing the nonlinear large deviations principle.
Read the full abstract
Combinatorics
Generalized spectral Turán problems for disjoint cliques
The generalized Turán number $\text{ex}(n, H, F)$ denotes the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Let $kK_{r+1}$ be the disjoint union of $k$ copies of the complete graph $K_{r+1}$. Recently, Gerbner determined $\text{ex}(n, K_{t},kK_{r+1})$ for all sufficiently large $n$. In this paper, we study a spectral analogue of this problem via the $t$-clique tensor of a graph. We prove that if an $n$-vertex $kK_{r+1}$-free graph $G$ maximizes the $t$-clique spectral radius, then for sufficiently large $n$, $G$ is the join of a complete graph $K_{k-1}$ and the $r$-partite Turán graph $T_{r}(n-k+1)$. This establishes a spectral counterpart of Gerbner's Theorem. Moreover, in the case $t=2$, our result recovers a theorem of Ni, Wang, and Kang on the maximum spectral radius of $kK_{r+1}$-free graphs.
Read the full abstract
Statistics Theory
Bootstrap consistency for general double/debiased machine learning estimators
Double/debiased machine learning (DML) provides a general framework for inference with high-dimensional or otherwise complex nuisance parameters by combining Neyman-orthogonal scores with cross-fitting, thereby circumventing classical Donsker-type conditions in many modern machine-learning settings. Despite its strong empirical performance, bootstrap inference for DML estimators has received little theoretical justification. This is particularly noteworthy since bootstrap methods are suggested ad used for inference on DML estimators, even though bootstrap procedures can fail for estimators that are root-$n$ consistent and asymptotically normal. This paper fills this gap by establishing bootstrap validity for DML estimators under general exchangeably weighted resampling schemes, with Efron's bootstrap as a special case. Under exactly the same conditions required for the validity of DML itself, we prove that the bootstrap law converges conditionally weakly to the sampling law of the original estimator.
Read the full abstract
Statistics Theory
Learning Mixtures of Nonparametric and Convolutional Measures on Effectively Low-dimensional Affine Spaces
In this paper, we develop a finite mixture of convolutional distributions, a statistical model to analyze continuous data distributed approximately on a mixture of low-dimensional affine subspaces. The observations are assumed independent and identically distributed from the mixture of distributions, where each component arises from a convolution of a distribution supported on a low-dimensional subspace with a suitable noise kernel. We discuss theoretical properties of such class of models, including identifiability under very general conditions - in particular, showing that the minimal representation for such mixtures is uniquely identifiable in a semi-parametric setting. We further study the posterior contraction rates for the parameters for a parametrized class of such models where the supports of the component mixing measures are assumed to be convex polytopes under a suitable well-specified Bayesian regime. This still requires developing novel inverse bounds for problems involving a nested mixture structure, where the mixture kernel is itself another continuous mixture. Our approach for both the identifiability theory and posterior contraction rates is to exploit the geometric structure of the underlying support of the latent measures. Apart from applications in end-member analysis, spectral unmixing and topic models, this study provides a grounded framework for subspace clustering with the goal of exploring conditions for learning multiple latent low-dimensional structures. We illustrate our findings through careful simulation study, which also includes developing new algorithms for such class of models
Read the full abstract
Group Theory
Alternating and Symmetric Separability of Free Products
Let $F \ast G$ be a free product of a free group $F$ and a LERF group $G$. In this note, we provide sufficient conditions for a subgroup $H$ of $F \ast G$ to be $\mathcal{A} \cup \mathcal{S}$-separable, that is, for any finite set $\{\gamma_1, \ldots, \gamma_n\} \subset (F \ast G) \setminus H$, there is a surjection $f$ from $F \ast G$ to an alternating or symmetric group such that $f(\gamma_i) \notin f(H)$ for all $i$. As a corollary, any finitely generated infinite-index subgroup of a free group is $\mathcal{A} \cup \mathcal{S}$-separable in the free product of the free group and an arbitrary LERF group, generalizing a result of Wilton.
Read the full abstract
Combinatorics
Separating Matchings in Cubic Graphs
We study separating matchings in graphs, that is, matchings whose removal increases the number of connected components, and focus on determining the maximum size of such a matching in a graph $G$, denoted by $\mathrm{mms}(G)$. We show that every subcubic graph admits a separating matching, except for exactly eight graphs, which allows us to focus on bounding $\mathrm{mms}(G)$ for cubic graphs. Our main results show that every cubic graph $G$ on $n$ vertices that admits a separating matching satisfies $\mathrm{mms}(G) \ge n/2 - 2$. For bipartite cubic graphs, assuming a conjecture of Funk, the problem reduces to a recursively defined class $\mathcal{F}$, for which we prove that $\mathrm{mms}(G) \ge n/2 - 1$, up to four exceptional graphs. In contrast, we show that every claw-free cubic graph satisfies $\mathrm{mms}(G) = n/2$. These results extend previous work on matching cuts and disconnected $2$-factors, and provide the first systematic study of maximum separating matchings.
Read the full abstract
Analysis of PDEs
Transonic shocks for steady Euler flows with rotating effect in two-dimensional almost flat nozzles
We address the existence and stability of transonic shocks for the two-dimensional steady rotating Euler system in an almost flat nozzle. Under the influence of the Coriolis force, we first establish a class of special transonic shock solutions in a flat nozzle, whose states depend on the vertical variable. It is shown that these solutions exist if and only if the upstream Mach number satisfies certain conditions, while the shock position is arbitrary. We then determine the shock position and establish the existence of the transonic shock solution under small perturbations of the incoming supersonic flow, the exit pressure, and the upper nozzle wall. The problem is formulated as a free boundary problem for a hyperbolic-elliptic mixed nonlinear system. We decompose the hyperbolic and elliptic modes in terms of the deformation and vorticity, and analyze the solvability condition to determine the admissible shock positions. Starting from the obtained initial approximation of the shock solution, a nonlinear iteration scheme can be constructed to derive a transonic shock solution in which the shock front is close to the initial approximating position.
Read the full abstract
Dynamical Systems · Cross-listed from eess.SY
Bilinear Input Modulation for Mamba: Koopman Bilinear Forms for Memory Retention and Multiplicative Computation
Selective State Space Models (SSMs), notably Mamba, employ diagonal state transitions that limit both memory retention and bilinear computational capacity. We propose a factorized bilinear input modulation that augments the SSM with a state-input product, interpretable as a finite-dimensional Koopman bilinear form. After introducing a shared state across channels (Coupled SSM), the modulation admits three implementations. Coupled Bilinear Input Modulation (seq-BIM) retains the full bilinear product on the input side at the cost of sequential computation, Coupled Gated Modulation (GM) linearizes it into a gate modulation that is compatible with the parallel scan, and Parallel Bilinear Input Modulation (p-BIM) places the same bilinear product on the state transition while remaining parallel-scannable. Experiments on a multiple input-delay pendulum (memory retention) and NARMA-10 (bilinear computation) reveal a clear dissociation. GM substantially improves memory retention but not bilinear computation, while both seq-BIM and p-BIM improve both. A pathway ablation confirms that the two downstream routes of the bilinear signal serve complementary roles. The improvement is statistically robust, with the bilinear variants consistently outperforming the other variants on bilinear computation. Furthermore, only the bilinear variants benefit from increasing the SSM state dimension, while coupling or gate modulation alone show no improvement, establishing the bilinear mechanism as uniquely capable of exploiting larger state spaces.
Read the full abstract
Optimization and Control
Symplectic Inductive Bias for Data-Driven Target Reachability in Hamiltonian Systems
Inductive bias refers to restrictions on the hypothesis class that enable a learning method to generalize effectively from limited data. A canonical example in control is linearity, which underpins low sample-complexity guarantees for stabilization and optimal control. For general nonlinear dynamics, by contrast, guarantees often rely on smoothness assumptions (e.g., Lipschitz continuity) which, when combined with covering arguments, can lead to data requirements that grow exponentially with the ambient dimension. In this paper we argue that data-efficient nonlinear control demands exploiting inductive bias embedded in nature itself, namely, structure imposed by physical laws. Focusing on Hamiltonian systems, we leverage symplectic geometry and intrinsic recurrence on energy level sets to solve target reachability problems. Our approach combines the recurrence property with a recently proposed class of policies, called chain policies, which composes locally certified trajectory segments extracted from demonstrations to achieve target reachability. We provide sufficient conditions for reachability under this construction and show that the resulting data requirements depend on explicit geometric and recurrence properties of the Hamiltonian rather than the state dimension.
Read the full abstract
Dynamical Systems
Functional correlation bound for random Lasota–Yorke maps with holes and its applications to conditional normal approximations
This paper investigates the statistical properties of random open dynamical systems generated by families of Lasota–Yorke maps. Open systems, in which trajectories may escape through `holes', model transient phenomena and present additional difficulties for statistical analysis because the underlying ensemble loses mass over time. We show that the framework of functional correlation bounds (FCB), originally developed for closed systems, can also be adapted to this random open setting. The extension requires new ingredients based on Lasota–Yorke type inequalities in order to control the effect of escaping trajectories. We establish an FCB with exponential decay and combine it with the abstract normal-approximation results of \cite{LNN25,LS20} to obtain a conditional CLT with rates in Wasserstein distance and a conditional functional CLT with a rate in an integral distance over Barbour's class of smooth test functions. Additionally, we adapt Tikhomirov's method to obtain a bound in Kolmogorov distance for the conditional CLT.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Map-Dependent Quantum Characteristic Functions and CP-Divisibility in Non-Markovian Quantum Dynamics
We introduce map-dependent quantum characteristic functions constructed from the normalized Choi operator of quantum dynamical maps. We prove a Bochner–Choi positivity theorem establishing that the positive-type condition of the associated Gram matrix is equivalent to complete positivity of the underlying quantum channel. Applying the construction to intermediate dynamical maps, we obtain a characterization of CP-divisibility in terms of positivity of two-time characteristic functions. Numerical examples for amplitude damping and pure dephasing models demonstrate that negativity of the Gram matrix coincides with the breakdown of CP-divisibility and the emergence of information backflow. The proposed framework provides a new bridge between characteristic-function methods in quantum statistics and structural properties of quantum dynamical maps.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Intent-aligned Autonomous Spacecraft Guidance via Reasoning Models
Future spacecraft operations require autonomy that can interpret high-level mission intent while preserving safety. However, existing trajectory optimization still relies heavily on expert-crafted formulations and does not support intent-conditioned decision-making. This paper proposes an intent-aligned spacecraft guidance framework that links high-level reasoning and safe trajectory optimization through explicit intermediate abstractions, based on behavior sequences and waypoint constraints. A foundation model first predicts an intent-aligned behavior plan, a waypoint generation model then converts it into waypoint constraints, and the safe trajectory is computed via optimization. This decomposition enables scalable supervision without sacrificing safety. Numerical experiments in close-proximity operation scenarios demonstrate that the proposed pipeline achieves over 90% SCP convergence and yields a $1.5\times$ higher rate of generating trajectories that satisfy the top intent-prioritized performance criteria than heuristic decision-making. These results support the use of intermediate behavior abstraction as a practical interface between foundation-model reasoning and safety-critical onboard spacecraft autonomy.
Read the full abstract
Saturday 18 April
Functional Analysis
Extension of hypercyclic and frequently hypercyclic subspaces
We focus on the existence of large linear structures within the sets of hypercyclic and frequently hypercyclic vectors. For operators $T$ satisfying Kitai's Criterion or the Frequent Hypercyclicity Criterion, we analyze the fundamental linear space $\{f(T)x | f \in H(\mathbb{C})\}$, studied by Herrero, Bourdon, Bès, Wengenroth, and many others. We show that the set $\{f(T)x | f \in H(\mathbb{C})\}$ can be extended within $HC(T) \cup \{0\}$ or $FHC(T) \cup \{0\}$ if $x \in HC(T)$ or $x \in FHC(T)$, respectively. The extension is such that the quotient of the new space with $\{ f(T)x \mid f \in H(\mathbb{C}) \}$ has dimension $\mathfrak{c}$ (the cardinality of the continuum). Second, we prove that generically a finite-dimensional subspace contained in $HC(T) \cup \{0\}$ can be enlarged to a subspace of dimension $\mathfrak{c}$. Third, we establish sufficient conditions for extending arbitrary linear subspaces both from $HC(T) \cup \{0\}$ and $FHC(T) \cup \{0\}$ to larger subspaces of dimension $\mathfrak{c}$.
Read the full abstract
Complex Variables
Sharp Coefficient and Inverse Problems for Holomorphic Semigroup Generators
In this paper, we study extremal problems for coefficient functionals associated with a distinguished subclass of holomorphic semigroup generators, denoted by $\mathcal{A}_{\beta}$ ($0 \le \beta \le 1$), defined on the unit disk $\mathbb{D}$. This class forms a natural filtration of the class $\mathcal{G}_0$ of infinitesimal generators, with the class $\mathcal{R}$ of functions of bounded turning arising as its minimal element. We obtain sharp bounds for the initial logarithmic coefficients $\gamma_n$, the inverse coefficients $A_n$, and the logarithmic inverse coefficients $\Gamma_n$ for $n = 1,2,3$ within the class $\mathcal{A}_{\beta}$. In addition, we address the successive coefficient problem by deriving sharp upper and lower estimates for the differences $|A_{n+1}| - |A_n|$ for $n = 1,2$. Furthermore, we establish sharp bounds for a generalized Fekete–Szegö functional in the class $\mathcal{R}$. The extremality of the obtained results is demonstrated by explicit constructions, including functions related to Gauss hypergeometric functions. Our results unify and extend several earlier contributions in geometric function theory and reveal a structural connection between coefficient problems for functions of bounded turning and the dynamics of holomorphic semigroup generators.
Read the full abstract
General Mathematics
A Limit-Free Algebraic-Geometric Construction of the Derivative with a Foundational Model in the Class of Polynomial Functions
This paper presents an algebraic-geometric construction of the derivative developed initially within the class of polynomial functions without introducing limits at the initial stage. Tangency is characterized by an algebraic condition: the difference between a function and a linear approximation has a double root at a given point. On this basis, the derivative is defined as a functional correspondence assigning to each point the slope of the tangent. Within the class of polynomials, the existence, uniqueness, and fundamental rules of differentiation are established purely algebraically. The constructed model is then extended conceptually to elementary functions and connected to the linear decomposition of functions, from which the classical limit representation of the derivative naturally emerges. Thus, the limit appears not as a starting point but as an analytic expression of an already constructed concept.
Read the full abstract
Information Theory
Quantifying Spacetime Integration across a Partition with Synergy
In service to the mathematical underpinnings of the Information Integration Theory of Consciousness (IIT), we introduce four principled measures of integration based on the partial information decomposition framework. We compare our measures to current IIT practice in simple deterministic networks. Our measures are the first IIT-related state-dependent integration measures to naturally obey standard info-theoretic lower and upper bounds. Matching IIT4, the four measures are non-Shannon, but outside IIT they work just as well as standard Shannon-based measures of irreducibility in discrete dynamical systems.
Read the full abstract
General Mathematics
Multivariate Laguerre polynomials: new results and insights
In this paper, we study various properties of Erdélyi's multivariate Laguerre polynomials $L_{n_1,\cdots,n_k}^{(\alpha)}(x_1,\cdots,x_k)$ including their generating functions, product formulas and fractional integral representations. Many useful consequences are derived. New insights into various classical results including the relationships of the multivariate Laguerre polynomials with Oshima's fractional calculus operator and with an integral formula of Srivastava and Niukkanen are also mentioned. We further present an interesting evaluation for a generating function of the main diagonal sequence $L_{n,\cdots,n}^{(-\beta-kn)}(x_1,\cdots,x_k)$ which involves in a natural way the well-known Le Roy function ([Darboux Bull. 24 (2) (1899), 245–268]; [Toulouse Ann. 2 (2) (1900), 317–430]). The significance of the multivariate Laguerre polynomials $L_{n_1,\cdots,n_k}^{(\alpha)}(x_1,\cdots,x_k)$ is demonstrated by observing that this class not only includes the generalized Hardy-Hille formula and the product formula but also contains the multiple Laguerre polynomials of the second kind as its important special cases. We briefly indicate also possible lines of future work.
Read the full abstract
Combinatorics
Computational Approach to the $SC_{231}$ Consecutive-Pattern-Avoiding Stack Sort
Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum sort-number of a length $n$ permutation under $SC_{231}$. In this paper, we compute sort-numbers for each permutation of length up to $14$, and we estimate the average sort-numbers up to length $1000$. Our results suggest the maximum and average sort-numbers grow faster than linear with respect to $n$ for the tested ranges, though the long-term behavior remains unclear. We also prove properties of $SC_{231}$ mathematically, such as a $n-1$ lower bound and a $\frac{(n+1)(n-2)}{2}$ upper bound for the maximum sort-number of length $n$ permutations.
Read the full abstract
Number Theory
Optimal Shifting Method in Dirichlet's divisor problem
In this paper, a new method for investigating Dirichlet's divisor problem is developed. For this purpose, integer points under the graph of a hyperbola are studied. Since many investigations in this direction focus on direct estimates of trigonometric sums and are not suitable for studying means, we shall consider shifts with respect to various parameters to define an optimal one. The method allows for obtaining the best possible estimates in the classical divisor problem.
Read the full abstract
Probability
CaTherine wheels from trees and Liouville quantum gravity
A CaTherine wheel is a space-filling curve $f : S^1\to S^2$ such that for every closed interval $J\subset S^1$, $f(J)$ is homeomorphic to a closed disk and $f(\partial J)$ is contained in $\partial f(J)$. A CaTherine wheel gives rise to a pair of disjoint, dense topological trees in $S^2$ which roughly speaking lie to the left and right of $f$. We give necessary and sufficient conditions for a topological tree in $S^2$ to arise as one of these trees for some CaTherine wheel $f$. We apply this result to show that there is a unique CaTherine wheel corresponding to the geodesic tree rooted at $\infty$ for the $\gamma$-Liouville quantum gravity (LQG) metric, for $\gamma \in (0,2)$. In other words, we construct the space-filling curve which is the contour exploration of the LQG geodesic tree.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
On the Unification of Optimal Current Reference Theory for Wound Rotor Synchronous Machines
Controllers for motor drives typically require a current reference which will satisfy the requested torque subject to system constraints. This work generalizes existing current reference theory to the case of the Wound Rotor Synchronous Machine (WRSM). By incorporating the additional rotor-current degree-of-freedom, along with magnetic saturation, cross-coupling, and speed-dependent core losses, the problem of finding an optimal current reference is formulated within affine flux regions as a quadratically constrained quadratic program using a piecewise-affine approximation derived from finite-element data. The solution is characterized according to the active constraint regime, yielding closed-form or low-dimensional polynomial solutions in several cases, and a small semidefinite program in the voltage constrained regime. The proposed framework extends unified optimal current reference theory beyond the permanent-magnet setting to three degree-of-freedom WRSMs while remaining computationally tractable. Results on a physical WRSM prototype illustrate the effectiveness of the approach across the torque-speed operating envelope.
Read the full abstract
General Topology
A topological characterization of end space of infinite graphs via games, subspaces and products
In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological characterization of end spaces using a hereditarily complete special subbase. In this paper, we present an alternative topological characterization of end spaces, in which we employ a special subbase and a topological game. Furthermore, we provide several applications of this characterization: we show that every end space is hereditarily Baire, that $G_{\delta}$ subspaces of end spaces are also end spaces, and that the product of end spaces is not always an end space.