Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 26 February
We investigate compactness and spectral properties of multiplier operators associated with the Walsh system in the spaces $L^p[0,1]$, $1<p<\infty$. Building upon previously established criteria for boundedness of Walsh multipliers, we prove an exact compactness criterion in the $L^p\to L^p$ regime for all $1<p<\infty$(assuming boundedness of the multiplier), and also in the $L^p\to L^2$ regime for $2<p<\infty$. The key result states that compactness is equivalent to the condition $a_n\to 0$ for the multiplier symbol. We also examine in detail the point spectrum and derive strict spectral inclusions; in the Hilbert space case $p=2$ we obtain a complete description of the spectrum. For $p\neq 2$, we emphasize the limitations of transferring "diagonal" arguments and formulate results in a form that does not admit incorrect generalizations.
Numerical Analysis · Cross-listed from cs.AI
The AI Research Assistant: Promise, Peril, and a Proof of Concept
Can artificial intelligence truly contribute to creative mathematical research, or does it merely automate routine calculations while introducing risks of error? We provide empirical evidence through a detailed case study: the discovery of novel error representations and bounds for Hermite quadrature rules via systematic human-AI collaboration. Working with multiple AI assistants, we extended results beyond what manual work achieved, formulating and proving several theorems with AI assistance. The collaboration revealed both remarkable capabilities and critical limitations. AI excelled at algebraic manipulation, systematic proof exploration, literature synthesis, and LaTeX preparation. However, every step required rigorous human verification, mathematical intuition for problem formulation, and strategic direction. We document the complete research workflow with unusual transparency, revealing patterns in successful human-AI mathematical collaboration and identifying failure modes researchers must anticipate. Our experience suggests that, when used with appropriate skepticism and verification protocols, AI tools can meaningfully accelerate mathematical discovery while demanding careful human oversight and deep domain expertise.
Read the full abstract
Analysis of PDEs
Long-time propagation of coherent states in a normally hyperbolic setting
We present a method to find asymptotics for the evolution of coherent states (or Gaussian wavepackets with standard deviation $\sqrt{h}$) under semiclassical Schrödinger's equation for a given Hamiltonian. These results extend the work of Combescure and Robert, in which the evolution of coherent states can be approximated in the limit $h\to 0$ with deformed Gaussian wavepackets called squeezed coherent states. The description with squeezed states holds for times $t$ that can go to infinity as $h\to 0$, under the constraint $|t|\leq |\log h|/(6\lambda_0)$ where $\lambda_0$ is the maximal Lyapunov exponent of the classical dynamics. The breakdown of this approximation at time $|\log h|/(6\lambda_0)$ is related to the bending of evolved wavepackets: once propagated states spread at a scale $h^{1/3}$, squeezed states no longer provide an appropriate description. To obtain a representation of propagated states valid up to times $|t|\leq C|\log h|$ with a larger $C$ (for instance, up to Ehrenfest's time $|\log h|/(2\lambda_0)$ where spreading on macroscopic scales is allowed), we make additional assumptions on the flow $\Phi_t$ associated to the classical dynamics, imposing constraints on directions of elongation. Namely, we work in a neighborhood of a normally hyperbolic $\Phi_t$-invariant submanifold $K$, on which the dynamics is considered as slow in comparison with its transverse directions, along which $\Phi_t$ is assumed to be hyperbolic. In this context, we describe the propagated state as a WKB state in transverse directions and a squeezed state along $K$. This description emphasizes the fact that propagated states should no longer be thought of as microlocalized on a point, but rather on an isotropic submanifold (corresponding to transverse unstable directions). Guillemin, Uribe, and Wang presented a similar class of wavefunctions microlocalized on an isotropic submanifold.
Read the full abstract
Analysis of PDEs
Long finite time bubble trees for two co-rotational wave maps
We show that the energy critical Wave Maps equation from $\mathbb{R}^{2+1}$ into $\mathbb{S}^2$, restricted to the $k=2$ co-rotational setting, admits arbitrarily large numbers of concentrating concentric $n$ bubble profiles. For any $n\in\mathbb{N}$, we construct an $n$-bubble solution concentrating at scales $\lambda_1(t)\gg \lambda_2(t)\gg \ldots\gg \lambda_n(t)$, where $\lambda_n(t)=t^{-1}\vert \log t\vert^\beta$, and $\lambda_j(t)\gtrsim \exp( \int_t^{t_0} \lambda_{j+1}(s)ds)$, for any $j<n$. Here $\beta>\tfrac32$ is a parameter that can be chosen arbitrarily. This shows that, as far as finite time blow-up case is concerned, the entirety of cases postulated in the soliton resolution theorem indeed occur, provided the concentric collapsing bubbles have alternating signs.
Read the full abstract
Representation Theory
The Mackey bijection as a stratified equivalence
This paper is about the Mackey analogy between the tempered representation theory of a real reductive group and that of its Cartan motion group. We consider the embedding of reduced C*-algebras constructed recently in connection with the Mackey bijection, and study its behavior on certain natural stratifications of the tempered duals. We formulate our result using a notion of stratified equivalence inspired by the study of the smooth dual of $p$-adic groups via the structure of Hecke algebras, in particular by the work of Aubert, Baum, Plymen and Solleveld. We derive related new topological properties of the Mackey bijection. We also analyze the behavior of the Mackey embedding on a stratification of reduced C*-algebras attached to a partition of the tempered dual into particularly elementary pieces, introduced in recent work of Bradd, Higson and Yuncken.
Read the full abstract
Dynamical Systems
Resonant grazing bifurcations revisited
In vibro-impact mechanics, the division between an impact and a near miss is a zero-velocity grazing event. Grazing bifurcations of stable periodic motions often produce complicated attractors when grazing generates a square-root term in the Poincaré map. This paper concerns codimension-two scenarios for which the square-root term vanishes in some iterate of the Poincaré map. For forced one-degree-of-freedom oscillators, this occurs when the forcing frequency is a certain rational multiple of the damped natural frequency, i.e., the system is in resonance. In two-parameter bifurcation diagrams, curves of saddle-node and period-doubling bifurcations of single-impact periodic motions emanate from the codimension-two points. In this paper we prove these curves are quadratically tangent to the curve of grazing bifurcations, and derive explicit formulas for their quadratic coefficients. This is achieved by modifying the Poincaré map in a way that circumvents the square-root singularity, enabling us to use the implicit function theorem to demonstrate smoothness and perform asymptotic calculations of the saddle-node and period-doubling bifurcation curves. In doing so we resolve a long-standing conjecture on the admissibility of single-impact periodic motions by supplementing raw asymptotic computations with geometric and topological arguments. We illustrate the results with a linear impact oscillator model, matching the theoretical unfolding to numerically computed bifurcation curves. The results explain why previously reported physical experiments reveal an absence of chaos shortly past the grazing bifurcation.
Read the full abstract
Information Theory
Multi-modal Data Driven Virtual Base Station Construction for Massive MIMO Beam Alignment
Massive multiple-input multiple-output (MIMO) is a key enabler for the high data rates required by the sixth-generation networks, yet its performance hinges on effective beam management with low training overhead. This paper proposes an interpretable framework to tackle beam alignment in mixed line-of-sight (LoS) and non-line-of-sight (NLoS) propagation environments. Our approach utilizes multi-modal data to construct virtual base stations (VBSs), which are geometrically defined as mirror images of the base station across reflecting surfaces reconstructed from 3D LiDAR points. These VBSs provide a sparse and spatial representation of the dominant features of the wireless environment. Based on the constructed VBSs, we develop a VBS-assisted beam alignment scheme comprising coarse channel reconstruction followed by partial beam training. Numerical results demonstrate that the proposed method achieves near-optimal performance in terms of spectral efficiency.
Read the full abstract
Algebraic Topology
It's All About Covers: Persistent Homology of Cover Refinements
The computational cost of persistent homology is often dominated by the growth of the underlying simplicial filtrations. Many different filtrations exist, each with its own assumptions and trade-offs, but all face some form of this growth which can be exponential in the worst case, as for the Vietoris-Rips. We recast this problem at the level of covers, developing a framework in which filtrations and persistence modules can be constructed, analyzed, and compared through simple relations between covers rather than at the level of simplicial complexes. The guarantees propagate through any functor that preserves the contiguity of refinement maps, we give the example of two such functors: the Nerve and the Co-Nerve. Working at this level is drastically simpler, with stronger, more general consequences. We explore this perspective and show how it can be used to construct a robust approximation of the Vietoris-Rips filtration that is orders of magnitude smaller, while maintaining a log 3-interleaving unconditionally for any metric space. The resulting filtration restores near-linear scaling in the number of data points and enable us to efficiently capture homology at high degrees.
Read the full abstract
Probability
Branching random walks with ageing
Branching processes are models used to describe populations that reproduce and die over time. In the classical setting, an individual's reproductive capacity remains constant throughout its lifetime. However, in real-world situations, reproductive capacity typically undergoes ageing - that is, after reaching a peak, it decreases over time. In this work, we study the influence of ageing on the behaviour of the process and how modifying its parameters, along with reproduction rates, affects the destiny of the process.
Read the full abstract
Combinatorics
Most probably trangle-free graphs
The celebrated Mantel's theorem states that any triangle-free graph on $n$ vertices contains at most $\left\lfloor n^2/4\right\rfloor$ edges. It is natural to ask how many triangles must exist in a graph with more than $\left\lfloor n^2/4\right\rfloor$ edges–a problem known as the Erdős-Rademacher problem. In this paper, we propose a probabilistic variant of this classic problem. Specifically, given an $n$-vertex graph $G$ with $\left\lfloor n^2/4\right\rfloor+i$ ($i>0$) edges, we choose the edges of $G$ independently with probability $p$, and the resulting new graph is triangle-free with a certain probability. Our goal is to maximize this probability by choosing $G$ appropriately. For the case where $G$ has $ \left\lfloor n^2/4\right\rfloor +1$ edges, we determine the exact maximum probability.
Read the full abstract
Combinatorics
Ordered trees with distinguished children
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that has children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients can be done using the Lagrange inversion formula. Various parameters that are commonly studied for ordered trees can also be addressed here, like degree of the root, number of leaves, number of old leaves, height, height of leftmost leaf, and pathlength. We go through these instances and leave further parameters to later research, by either the author or some readers. Dealing with cubic equations is essential. Finally, ordered trees are replaced by marked ordered trees; they are then combined with the concept of distinguished children. Only the basic enumeration is provided at that stage.
Read the full abstract
Functional Analysis
A class of bilateral weighted shift operators, and linear dynamics
This article aims to initiate a study of bilateral weighted backward shift operators defined on the spaces $\ell^p_{a,b}(\Omega_{r,R})$ and $c_{0,a,b}(\Omega_{r,R})$ which are Banach spaces of analytic functions on a suitable annulus in the complex plane, having a normalized Schauder basis of the form, $$ f_n(z):= (a_n+b_{n}z)z^{n},\hskip 0.5cm n\in \mathbb{Z}. $$ We obtain necessary and sufficient conditions for a weighted shift $B_w$ to be bounded, and find conditions so that $B_w$ is similar to a compact perturbation of a weighted shift on $\ell^p(\mathbb{Z})$. In addition, we study when $B_w$ is hypercyclic, supercyclic, and chaotic. It shown that the zero-one law of orbital limit points does not hold for $B_w$, which is in contrast to the case of weighted shifts on $\ell^p(\mathbb{Z})$. Most of our results are obtained using the matrix form of $B_w$.
Read the full abstract
Analysis of PDEs
The regularity of the boundary of vortex patches for the quasi-geostrophic shallow-water equations
We prove the persistence of boundary smoothness of vortex patches for the quasi-geostrophic shallow-water (QGSW) equations. The QGSW equations generalize the Euler equations by including an additional parameter, the Rossby radius $\varepsilon^{-1}$, which modifies the relationship between the streamfunction and the (potential) vorticity. In addition, we prove that solutions of the QGSW equations converge locally in time to the corresponding Euler solutions as $\varepsilon \to 0$ in little Hölder spaces.
Read the full abstract
Combinatorics
Are sparse graphs typically determined by their spectrum?
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erdős-Rényi graph is cospectral when the average degree is sufficiently small. The proof relies on the existence of a specific pendant tree, combined with a method by Schwenk that swaps trees to construct a cospectral mate. It seems possible that pendant trees are essentially the only obstruction, meaning that the giant should become characterized by spectrum with high probability if one prunes these by considering the 2-core. The majority of the paper is devoted to theoretical and numerical evidence supporting this concept. Our main theorem in this direction establishes that local switching methods can not cause the 2-core to be cospectral. We also discuss R-cospectrality and rational cospectrality at fixed level.
Read the full abstract
Analysis of PDEs
Generically sharp decay and blowing up at infinity for a weak null wave system
We study a system of semilinear wave equations satisfying the weak null condition, which can be regarded as a simplified model for the Einstein vacuum equations. The main objective is to establish precise pointwise decay estimates, as both lower and upper bounds of decay, for small data solutions. Specifically, we show that the difference between the solution and its leading-order term is dominated by lower-order terms that decay faster in the retarded time variable $u=t-r$. Moreover, we prove that these pointwise decay estimates are sharp for a generic class of small initial data decaying sufficiently fast. As applications of these estimates, we demonstrate that the energy of one component of the solution admits a lower bound that generically grows to infinity as $t\to +\infty$, which can be interpreted as “blowing up at infinity." Furthermore, we verify that this component generically exhibits an energy cascade from high to low frequencies.
Read the full abstract
K-Theory and Homology
Uniformly elliptic boundary value problems
We study boundary conditions for elliptic operators on non-compact manifolds with boundary via uniform K-homology, a version of K-homology sensitive to the large-scale geometry of the manifold. To that end, we develop the theory of relative uniform K-homology. We show that boundary conditions for uniformly elliptic differential operators define classes in the relative and non-relative uniform K-homology of the manifold, depending on the assumed regularity of the boundary condition. Moreover, we define and study a relative index map on relative uniform K-homology that combines uniform coarse information on the interior with secondary information on the boundary. As an application, we compute that on a spin manifold with product structure and uniformly positive scalar curvature on the boundary the image of the relative uniform K-homology class of the Dirac operator under this relative index map is closely connected to a uniform version of the higher $\rho$-invariant of the boundary. In particular, a delocalized APS-index theorem of Piazza and Schick is proved in the uniform setting.
Read the full abstract
Differential Geometry
On the first eigenvalue of the area Jacobi operator for complex curves in Kähler surfaces
In this paper, we investigate the first eigenvalue $\Lambda_1$ of the area Jacobi operator for complex curves in Kähler surfaces, establishing an extrinsic counterpart to the classical Lichnerowicz theorem for the Laplace-Beltrami operator. By analyzing the second variation of a conformally invariant Willmore-type functional, we derive the lower bound $\Lambda_1 \geq 2\,\mathfrak{Ric}$, where $\mathfrak{Ric}$ denotes the infimum of the ambient Ricci curvature. For Kähler-Einstein surfaces with positive Einstein constant $\mathfrak{c}>0$, this bound reduces to $\Lambda_1 \geq 2\mathfrak{c}$. We then explore the equality case, computing the exact dimension of the corresponding first eigenspace in terms of the area, genus, and the dimension of a space of holomorphic sections. This analysis shows that the equality is achieved for all curves of genus $g \leq 1$.
Read the full abstract
Optimization and Control
Generalized fluctuation bounds for stochastic algorithms in the presence of compactness
We provide a convergence result for sequences of random variables taking values in a metric space that satisfy a stochastic quasi-Fejér monotonicity condition, in the context of a (local) compactness assumption. Our result is quantitative in that we derive an explicit and effective construction which, in terms of only a few moduli representing quantitative witnesses to key properties of the sequence of random variables and the underlying metric space involved, provides a metastable rate of pointwise convergence, a type of generalized fluctuation bound. That quantitative result in particular relies on the development of a finitary theory of martingales, culminating in a fully finitary Robbins-Siegmund theorem. We outline how this result particularises to the circumstances of the seminal work of Combettes and Pesquet on stochastic quasi-Fejér monotone sequences in separable Hilbert spaces, and we provide an initial application by illustrating how these results can be used to provide a metastable rate of pointwise convergence for a stochastic Krasnoselskii-Mann scheme solving a stochastic common fixed point problem for nonexpansive maps over proper Hadamard spaces. This work is set in the context of recent applications of the logic-based methodology of proof mining to probability theory, and represents its most sophisticated case study to date.
Read the full abstract
Number Theory
An Explicit Result for the Sum of Two Almost Primes
We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation and optimisation.
Operator Algebras
Mayer–Vietoris and Twisted Čech Spectral Sequences for C$^*$-Algebras with Free Quantum Group Coefficients
We formulate a Mayer–Vietoris/Čech viewpoint on $K$-theory for crossed products by discrete quantum groups, emphasizing how local-to-global gluing data interacts with quantum-group coefficients. Starting from a $G$-equivariant ideal cover and the associated Mayer–Vietoris six-term exact sequence, we package the resulting $K$-theoretic computation into a Čech-type spectral sequence whose $E^1$-page is explicitly described by iterated intersections. We then introduce a minimal “twisted” gluing mechanism controlled by a $\mathbb Z/2$-valued Čech $2$-cocycle and an involutive automorphism of the coefficient algebra. Under a Kirchberg–UCT hypothesis on the quantum-group crossed-product coefficient, the twist produces a nontrivial differential $d_2$ identified as $\varphi_*-\mathrm{id}$ on coefficient $K$-theory. In a concrete regime where the coefficient $K$-groups are cyclic (e.g.\ order $3$), the differential becomes an isomorphism and forces a $K$-theoretic obstruction to Morita triviality. This yields a conceptual mechanism for producing non-Morita-trivial twisted C$^*$-algebras with quantum-group crossed-product fibers, detected purely by Mayer–Vietoris/Čech data.
Read the full abstract
Rings and Algebras
The Solvabilizers and Solvable Graphs in Lie Superalgebras
In this paper, we introduce the solvabilizer and the solvable graph for a Lie superalgebra and establish their basic properties. Then we define a category which links Lie superalgebras to their solvable substructures. Afterwards, we prove that the solvable graph is one of the isomorphic invariants of the Lie superalgebras. Furthermore, we introduce the solvability measure, which can reflect the degree of solvability of Lie superalgebras.
Read the full abstract
Numerical Analysis
Error Analysis of Parameter Prediction via Gaussian Process Regression and Its Application to Weighted Jacobi Iteration
In this paper, we introduce a novel theoretical framework for Gaussian process regression error analysis, leveraging a function-space decomposition. Based on this framework, we develop a weighted Jacobi iterative method that utilizes Gaussian process regression for parameter prediction and provide a corresponding convergence analysis. Moreover, the convergence conditions are designed to be compatible with other error bounds, enabling a more general analysis. Experimental results show that the parameters predicted based on Gaussian process regression significantly accelerate the convergence speed of Jacobi iterations.
Read the full abstract
Analysis of PDEs
Circle-like concentrated solutions for two-component Bose-Einstein condensates
We investigate the normalized solutions of the following two-component Bose-Einstein condensates (BEC) system \begin{equation}\left\{ \begin{split} -\Delta u + (\lambda+P(x))u &= \alpha u^3 +\beta uv^2, && \text{in } \mathbb{R}^2,\\-\Delta v + (\lambda+Q(x))v &= \gamma v^3 +\beta u^2 v, && \text{in } \mathbb{R}^2, \end{split} \right.\end{equation} with $L^2$-constraint $$\int_{\mathbb{R}^2}(u^2+v^2)\,dx = 1.$$ For any $\alpha>0$, $\gamma > 0$ and $\ \beta \in (-\sqrt{\alpha\gamma},0)\cup(0,\min \{\alpha,\gamma\})\cup \left(\max \{\alpha,\gamma\} , + \infty\right)$, we establish the existence of synchronized solutions concentrating on high-dimensional subsets of $\mathbb{R}^2$ by employing a finite-dimensional reduction method combined with some local Pohozaev identities. More precisely, we construct vector radial solutions that concentrate on circles when $ \frac{\alpha + \gamma - 2\beta}{\alpha\gamma - \beta^2}$ tends to zero. Our results fill the blank in the system for high-dimensional concentrated normalized solutions.
Read the full abstract
Optimization and Control
Robust Distributed Nonconvex Optimization Enabling Communication Acceleration and Privacy Protection
This paper addresses a distributed nonconvex optimization problem over multi-agent networks, where each agent exchanges its local information solely with its neighbors. Given that most existing distributed nonconvex optimization algorithms are susceptible to information leakage during inter agent communications, we propose a Robust Proximal Primal dual algorithm, referred to as RPP, to enhance the security of information transmission. In contrast to many existing approaches that directly transmit local variables throughout the network, we introduce carefully designed random noises to obfuscate sensitive local information. This not only preserves privacy but also demonstrates the noise robustness of our proposed algorithm. We establish a sublinear rate at which RPP converges to a stationary solution. Moreover, by incorporating Chebyshev acceleration, an accelerated variant of RPP is developed and achieves the optimal communication complexity bound for the algorithms that allow for exchanging local deci sions at each iteration. The superior convergence performance of RPP is validated through a few numerical experiments, which also indicate that, within an appropriate range, the introduced perturbations do not impede the convergence speed of RPP.
Read the full abstract
Operator Algebras
Structural Chirality from Inverse Semigroups to Twisted Groupoid $C^*$-Algebras
We develop a structural theory of chirality for inverse semigroups and show how it propagates canonically to étale groupoids and twisted groupoid $C^*$-algebras. Starting from inverse semigroup data equipped with admissible twist information, we construct a canonical twisted universal groupoid in the sense of Paterson and introduce a mirror correspondence encoding intrinsic asymmetry. Our main result identifies a structural obstruction to mirror self-duality at the level of twisted universal groupoids and shows that this obstruction descends to an obstruction for the associated reduced twisted groupoid $C^*$-algebra to be isomorphic to its opposite. The framework is representation-independent, yet compatible with concrete germ groupoid models, and provides a unified bridge between partial symmetries, groupoid structures, and analytic invariants in noncommutative operator algebras.
Read the full abstract
Analysis of PDEs
Uniform Stability of Oscillatory Shocks for KdV-Burgers Equation
We study viscous-dispersive shock waves with infinite oscillations of the Korteweg-de Vries-Burgers (KdVB) equation. First, we establish detail structures of the shock waves, including the rates at which the local extrema converge to the left end state towards the left far field. Then, by exploiting the structural properties of the shocks, we show the $L^2$-contraction property of the shock profiles under arbitrarily large perturbations, up to time-dependent shifts. This property implies both time-asymptotic stability and uniform stability with respect to the viscosity and dispersion coefficients. This uniformity yields the existence of zero viscosity-dispersion limits, on which Riemann shocks are orbitally stable.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
A General (Non-Markovian) Framework for Covariate Adaptive Randomization: Achieving Balance While Eliminating the Shift
Emerging applications increasingly demand flexible covariate adaptive randomization (CAR) methods that support unequal targeted allocation ratios. While existing procedures can achieve covariate balance, they often suffer from the shift problem. This occurs when the allocation ratios of some additional covariates deviate from the target. We show that this problem is equivalent to a mismatch between the conditional average allocation ratio and the target among units sharing specific covariate values, revealing a failure of existing procedures in the long run. To address it, we derive a new form of allocation function by requiring that balancing covariates ensures the ratio matches the target. Based on this form, we design a class of parameterized allocation functions. When the parameter roughly matches certain characteristics of the covariate distribution, the resulting procedure can balance covariates. Thus, we propose a feasible randomization procedure that updates the parameter based on collected covariate information, rendering the procedure non-Markovian. To accommodate this, we introduce a CAR framework that allows non-Markovian procedure. We then establish its key theoretical properties, including the boundedness of covariate imbalance in probability and the asymptotic distribution of the imbalance for additional covariates. Ultimately, we conclude that the feasible randomization procedure can achieve covariate balance and eliminate the shift.
Read the full abstract
Dynamical Systems
Topological entropy, mean dimension, and weakly equivalent flows
In this paper, we mainly revisit a nice theory for topological entropy of weakly equivalent flows, which was originally investigated by Ohno in 1980. We will develop a new approach, being more straightforward and elementary than the measure-theoretic one provided by Ohno, to the theory for weak equivalence of flows, and as a novelty, we study both topological entropy and mean dimension with a highly unified process in relation to such objects. In particular, for weakly equivalent flows without fixed points we recover Ohno's theorem for topological entropy relation with a substantially different method, and moreover, carry out an analogue within the framework of mean dimension; while for weakly equivalent flows with fixed points, our technique refines the procedure suggested in Ohno's construction, and strengthens Ohno's example with a view towards topological complexity of dynamical systems. Essentially, our method is topological. For this purpose, we first introduce a modification to the definition of topological entropy, by relating a spanning set inside the state space to a finite set outside, which comes to be a tiny but key difference, via a map, and further, show that it leads eventually to the same value as the topological entropy. Although to an intermediate extent, the modified quantity generally does not coincide with the one appearing in the classical definition, it has some basic combinatorial feature, which not only applies flexibly to topological entropy, but also adapts directly to the mean dimension context. Using this alternative, we are allowed to re-establish and enrich Ohno's theory.
Read the full abstract
Optimization and Control
Efficient exact sequential lifting algorithm for binary knapsack set
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. We first propose an exact sequential lifting algorithm for the binary knapsack set, which employs the dominance list structure to remove redundant storage and computation in the dynamic programming (DP) array. This structure preserves scale invariance and effectively handles constraints with non-integer coefficients. Then, a reduction method is developed for the lifting procedure under some conditions, further enhancing computational efficiency. Finally, numerical experiments demonstrate that the proposed algorithm outperforms DP with arrays in terms of both efficiency and stability, particularly for large-scale and large-capacity instances. Moreover, it enables exact sequential lifting for binary knapsack sets with non-integer weights and large capacities, making it directly applicable in modern MIP solvers.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CV
QuadSync: Quadrifocal Tensor Synchronization via Tucker Decomposition
In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover $n$ cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,~4,~4,~4) independent of $n$. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.