Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 23 February

Statistics Theory · Cross-listed from stat.ME

Zero Variance Portfolio

When the number of assets is larger than the sample size, the minimum variance portfolio interpolates the training data, delivering pathological zero in-sample variance. We show that if the weights of the zero variance portfolio are learned by a novel “Ridgelet” estimator, in a new test data this portfolio enjoys out-of-sample generalizability. It exhibits the double descent phenomenon and can achieve optimal risk in the overparametrized regime when the number of assets dominates the sample size. In contrast, a “Ridgeless” estimator which invokes the pseudoinverse fails in-sample interpolation and diverges away from out-of-sample optimality. Extensive simulations and empirical studies demonstrate that the Ridgelet method performs competitively in high-dimensional portfolio optimization.
Read the full abstract

All authors Jinyuan Chang, Yi Ding, Zhentao Shi, Bo Zhang

Information Theory

Toward a Quiet Wireless World: Multi-Cell Pinching-Antenna Transmission

Conventional-antenna-based multi-cell interference management can lead to excessive power consumption. For example, in order to serve those users which are close to the cell edge, base stations often must transmit at very high power levels to overcome severe large-scale path-loss, i.e., the base stations have to “shout" at the users to realize the users' target quality of service (QoS). This letter focuses on the application of pinching antennas to multi-cell interference management and demonstrates that the use of multi-cell pinching-antenna transmission leads to a quiet wireless world. In particular, each transceiver pair can be positioned in close proximity, and hence the users' QoS requirements can be met with only low transmit power, i.e., via “whispering" rather than high-power transmission.
Read the full abstract

Numerical Analysis

Optimal Error Estimates of a new Multiphysic Finite Element Method for Nonlinear Poroelasticity model with Hencky-Mises Stress Tensor

In this paper, we develop a new multiphysics finite element method for a nonlinear poroelastic model with Hencky-Mises stress tensor. By introducing some new notations, we reformulate the original model into a fluid-fluid coupling problem, which is viewed as a generalized nonlinear Stokes sub-problem combined with a reaction-diffusion sub-problem. Then, we establish the existence and uniqueness of the weak solution for the reformulated problem, and propose a stable, fully discrete multiphysics finite element method which employs Lagrangian finite element pairs for spatial discretization and a backward Euler scheme for temporal discretization. By ensuring the parameters $\kappa_1$ and $\kappa_3$ remain bounded and non-zero even as $\lambda$ tends to infinity, the proposed method maintains stability for a wide range of Lagrangian element pairs. Based on the continuity and monotonicity of the nonlinear term $\mathcal{N}(\varepsilon(\mathbf{u}_h^{n}))$, we give the stability analysis and derive optimal error estimates for the displacement vector $\mathbf{u}$ and the pressure $p$ in both $L^2$-norm and $H^1$-norm. In particular, the $L^2$-norm error estimate for the displacement $\mathbf{u}$, which was not present in previous literature, is established here through an auxiliary problem and a Poincar$\acute{e}$ inequality. Also, we present numerical tests to verify the theoretical analysis, and the results confirm the optimal convergence rates. Finally, we draw conclusions to summarize the work.
Read the full abstract

Analysis of PDEs

An isoperimetric inequality for the second Robin eigenvalue of the Weighted Laplacian

In this paper, we investigate a shape optimization problem for the second Robin eigenvalue of the weighted Laplacian on bounded Lipschitz domains symmetric about the origin. Our main theorem states that the ball centered at the origin maximizes the second Robin eigenvalue among all Lipschitz bounded domains of prescribed weighted measure and symmetric about the origin for a range of negative Robin parameters.
Read the full abstract

Numerical Analysis

Dekker's floating point number system and compensated summation algorithms

The recent hardware trend towards reduced precision computing has reignited the interest in numerical techniques that can be used to enhance the accuracy of floating point operations beyond what is natively supported for basic arithmetic operations on the hardware. In this work, we study the behavior of various compensated summation techniques, which can be used to enhance the accuracy for the summation operation, particularly in situations when the addends are not known a priori. Complete descriptions of the error behavior are provided for these techniques. In particular, the relationship between the intermediate results at two consecutive summing steps is provided, which is used to identify the operation that limits accuracy and guide the design of more nuanced techniques. The analysis relies on the work of Dekker [Numerische Mathematik, 1971], which uses a special floating point number system that does not require uniqueness in the number representation. Despite this seemingly strange attribute, Dekker's system is very convenient for the analysis here and allows general statements to be expressed succinctly compared to a number system that requires uniqueness. To prepare the foundation for discussion, we start by giving a thorough exhibition of Dekker's number system and supply the details that were omitted in Dekker [Numerische Mathematik, 1971]. Numerical examples are designed to explain the inner workings of these compensated summation techniques, illustrate their efficacy, and empirically verify the analytical results derived. Discussions are also given on application scenarios where these techniques can be beneficial.
Read the full abstract

Geometric Topology

Coordinates for ${\rm SL}_3$-web basis elements in closed surfaces

The ${\rm SL}_3$-skein algebra of a closed surface $\Sigma_g$ is a quantization of the ${\rm SL}_3$ character variety of $\Sigma_g$, where $g$ denotes the genus of the surface. This algebra admits a basis consisting of non-elliptic web diagrams in $\Sigma_g$ after Sikora–Westbury. In this paper, we introduce explicit ${\rm SL}_3$ version of Dehn–Thurston coordinates for non-elliptic web diagrams on $\Sigma_g$, yielding a parametrization by a submonoid of $\mathbb Z^{d}$. The idea is to tropicalize the Fenchel–Nielsen coordinates for the ${\rm SL}_3$-Hitchin component. Here $d = 16g - 16$ for $g \ge 2$ and $d = 4$ in the torus case $g = 1$, coinciding with the dimension of the corresponding character variety.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

OptiRepair: Closed-Loop Diagnosis and Repair of Supply Chain Optimization Models with LLM Agents

Supply chain optimization models frequently become infeasible because of modeling errors. Diagnosis and repair require scarce OR expertise: analysts must interpret solver diagnostics, trace root causes across echelons, and fix formulations without sacrificing operational soundness. Whether AI agents can perform this task remains untested. We decompose this task into two phases: a domain-agnostic feasibility phase that iteratively repairs any LP using IIS-guided diagnosis, and a domain-specific validation phase that enforces five rationality checks grounded in inventory theory. We test 22 API models from seven families on 976 multi-echelon supply chain problems and train two 8B-parameter models with self-taught reasoning and solver-verified rewards. The trained models reach 81.7% Rational Recovery Rate (RRR) – the fraction of problems resolved to both feasibility and operational rationality – versus 42.2% for the best API model and 21.3% on average. The gap concentrates in Phase 1 repair, where API models average 27.6% recovery rate versus 97.2% for trained models. Two gaps separate current AI from reliable model repair: solver interaction, as API models restore only 27.6% of infeasible formulations; and operational rationale, as roughly one in four feasible repairs violate supply chain theory. Each gap requires a different intervention – targeted training closes the solver interaction gap, while explicit specification as solver-verifiable checks closes the rationality gap. For organizations adopting AI in operational planning, formalizing what 'rational' means in their context is the higher-return investment.
Read the full abstract

Dynamical Systems

Certified spectral approximation of transfer operators and the Gauss map

We prove that the full spectral picture of a transfer operator (every isolated eigenvalue, eigenvector, and Riesz projector outside the essential spectral radius) can be approximated to arbitrary precision by finite-rank discretizations, with no spectral pollution. The method is a~posteriori: once a computable approximation bound is available (from compactness or a Doeblin–Fortet–Lasota–Yorke inequality, which may require hyperbolicity constants and adapted Banach spaces), the spectral gap and multiplicity are certified from computed data via a resolvent perturbation bound, with no further dynamical input. This applies both to compact operators on a single Banach space and to quasi-compact operators satisfying a Doeblin–Fortet–Lasota–Yorke inequality, extending Li's resolution of the Ulam conjecture from the invariant density to the entire discrete spectrum with certified error bounds at every finite truncation. As a benchmark, we certify the first $50$ nonzero eigenvalues of the Gauss–Kuzmin–Wirsing operator to at least $90$ rigorous decimal digits, together with their eigenvectors, Riesz projectors, and spectral gap, yielding a certified spectral expansion for Gauss–Kuzmin distributions with explicit error bounds and providing a rigorous answer to the Gauss–Babenko–Knuth problem on the spectral data of the Gauss map.
Read the full abstract

Functional Analysis

$L_1$-distortion of Earth Mover Distances and Transportation Cost Spaces on High Dimensional Grids

We prove that the distortion of any embedding into $L_1$ of the transportation cost space or earth mover distance over a $d$-dimensional grid $\{1,\dots m\}^d$ is $\Omega(\log N)$, where $N$ is the number of vertices and the implicit constant is universal (in particular, independent of dimension). This lower bound matches the universal upper bound $O(\log N)$ holding for any $N$-point metric space. Our proof relies on a new Sobolev inequality for real-valued functions on the grid, based on random measures supported on dyadic cubes.
Read the full abstract

All authors Chris Gartland, Mikhail Ostrovskii, Yuval Rabani, Robert Young

Combinatorics

The half-monochromatic colorings of plane graphs with even polygonal faces

On the maximum number of colors for proper anti-rainbow colorings on a planar quadrangulation, an upper bound was given by Enami-Ozeki-Yamaguchi in terms of the independence number. In this paper, as an extension, we introduce the half-monochromatic coloring on a plane graph with even polygonal faces, and give an upper bound on the maximum number of colors for such colorings in terms of the independence number.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Convergence of Nekrasov instanton sum with adjoint matter

The Nekrasov instanton partition function of the 4d $\mathcal{N}=2^*$ $U(N)$ gauge theory (a mass deformation of 4d $\mathcal{N}=4$ super-Yang-Mills theory), which is a generating series of equivariant integrals over instanton moduli spaces, is given by a sum over colored partitions weighted by a counting parameter $\mathfrak{q}$. This note proves convergence of the series in the unit disk $|\mathfrak{q}|<1$ for generic parameters. Specifically, the absolute convergence radius of this sum is determined, assuming that mass and Coulomb branch parameters avoid some lattice. If the ratio $b^2=\epsilon_1/\epsilon_2$ of equivariant parameters is in $\mathbb{C}\setminus[0,+\infty)$, the radius is $1$, as expected. If $b^2$ is non-negative, three cases arise: the radius is finite if $b^2$ has finite exponential type (a generalization of Brjuno numbers), namely there exists $C>0$ such that $|b^2-p/q|>\exp(-Cq)$ for all integers $p,q\neq 0$; the series diverges if $b^2$ is super-exponentially well approximable by rationals; and if $b^2$ is rational some terms are singular. The AGT correspondence translates these results to convergence of torus one-point conformal blocks of the Virasoro and $W_N$ algebras with non-real $b$, within the unit disk. For the Virasoro algebra this corresponds to a central charge in $\mathbb{C}\setminus[25,+\infty)$.
Read the full abstract

Optimization and Control

Enhancing network resilience through topological switching

This work studies how to preemptively increase the resilience of a network by means of time-varying topological actuation. To do this, we focus on linear dynamical systems that are compatible with a given network, and consider policies that switch periodically between the given one and an alternative, topologically-compatible dynamics. In particular, we seek to solve design problems aimed at finding a) the optimal switching schedule between two preselected topologies, and b) an optimal topology and optimal switching schedule. By imposing periodicity, we first provide a metric of resilience in terms of the spectral abscissa of the averaged linear time-invariant dynamics. By restricting our policies to commutative networks, we then show how the optimal scheduling problem reduces to a convex optimization, providing a bound on the net resilience that can be achieved. After this, we find that the optimal, sparse commutative network to switch with is fully disconnected and allocates the spectral sum among the nodes of the network equally. We then impose additional restrictions on topology edge selection, which leads to a biconvex optimization for which certain matrix rank conditions guide the choice of weighting parameters to obtain desirable solutions. Finally, we provide two methods to solve this problem efficiently (based on a McCormick relaxation, and alternating minimization), and illustrate the results in simulations.
Read the full abstract

Algebraic Geometry

Rational chain connectedness in the complex analytic setting

We extend Hacon–M\textsuperscript{c}Kernan's rational chain connectedness theorem to the complex analytic setting. As a consequence, we prove that the fibers of any resolution of singularities of complex analytic kawamata log terminal singularities are rationally chain connected. In contrast to the original approach, we avoid the use of extension theorems and instead rely on the minimal model program.
Read the full abstract

Algebraic Geometry

Classification of double octic Calabi-Yau threefolds defined by an arrangement of eight planes II

We present a complete classification of all arrangements of eight planes in projective threespace that give rise to double octic Calabi-Yau threefolds. Building on earlier work, we determine all 455 combinatorial types and describe the projective automorphism groups associated with each arrangement. These automorphisms allow us to identify geometrically distinguished subfamilies and elements, and to construct a rich collection of elliptic and K3 fibrations arising naturally from the singularities of the arrangements. As applications, we exhibit two one-parameter families of Calabi-Yau threefolds that each possess three pairwise non-equivalent maximally unipotent monodromy points-phenomena that are rare in known examples. We further construct two Calabi-Yau threefolds whose third cohomology decomposes, via complex multiplication, into complementary two-dimensional Hodge structures of types (1,0,1,0) and (0,1,0,1). This decomposition yields new instances of modularity not previously observed in the Calabi-Yau setting.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

LEVDA: Latent Ensemble Variational Data Assimilation via Differentiable Dynamics

Long-range geophysical forecasts are fundamentally limited by chaotic dynamics and numerical errors. While data assimilation can mitigate these issues, classical variational smoothers require computationally expensive tangent-linear and adjoint models. Conversely, recent efficient latent filtering methods often enforce weak trajectory-level constraints and assume fixed observation grids. To bridge this gap, we propose Latent Ensemble Variational Data Assimilation (LEVDA), an ensemble-space variational smoother that operates in the low-dimensional latent space of a pretrained differentiable neural dynamics surrogate. By performing four-dimensional ensemble-variational (4DEnVar) optimization within an ensemble subspace, LEVDA jointly assimilates states and unknown parameters without the need for adjoint code or auxiliary observation-to-latent encoders. Leveraging the fully differentiable, continuous-in-time-and-space nature of the surrogate, LEVDA naturally accommodates highly irregular sampling at arbitrary spatiotemporal locations. Across three challenging geophysical benchmarks, LEVDA matches or outperforms state-of-the-art latent filtering baselines under severe observational sparsity while providing more reliable uncertainty quantification. Simultaneously, it achieves substantially improved assimilation accuracy and computational efficiency compared to full-state 4DEnVar.
Read the full abstract

Combinatorics

Gale-Robinson Quivers and Principal Coefficients

In this paper, we provide a combinatorial interpretation for Laurent polynomials obtained by iteratively mutating a certain periodic quiver that has been framed with frozen vertices. This yields a family of cluster variables with principal coefficients associated to a family of integer sequences known as Gale-Robinson sequences. The work of this paper completes arguments for preliminary results announced in earlier work of Jeong-Musiker-Zhang, and relates to works of Bousquet-Mélou-Propp-West, Speyer, Vichitkunakorn, and of Eager-Franco.
Read the full abstract

Dynamical Systems

Subdiagrams and invariant measures for generalized Bratteli diagrams

The results of this paper contribute to the study of invariant measures of Borel dynamical systems that can be modeled using generalized Bratteli diagrams. In this context, we study tail invariant measures on the path spaces of generalized Bratteli diagrams, allowing countably infinite vertex sets at each level. Our main focus is on subdiagrams of generalized Bratteli diagrams and the problem of extending tail invariant probability measures from vertex and edge subdiagrams to the ambient diagram. We establish necessary and sufficient conditions for the finiteness of such extensions, formulated in terms of incidence matrices and associated stochastic matrices. Several classes of generalized Bratteli diagrams and their subdiagrams are analyzed in detail, including simple, stationary, and bounded size diagrams. We develop constructive, step-by-step procedures for measure extension and for approximating invariant measures by measures supported on suitable subdiagrams. In addition, we provide explicit examples of generalized Bratteli diagrams that admit no probability tail invariant measures, a phenomenon absent for standard Bratteli diagrams with finite vertex sets. Finally, we address convergence questions for sequences of invariant measures arising from approximations by subdiagrams, clarifying the relationship between combinatorial structure and measure-theoretic behavior.
Read the full abstract

All authors Sergey Bezuglyi, Palle Jorgensen, Olena Karpel, Thiago Raszeja, Shrey Sanadhya

Sunday 22 February

Optimization and Control

Discrete Quantization on Spherical Geometries: Explicit Models, Computations, and Didactic Exposition

We present an analytically explicit study of optimal discrete quantization on spherical geometries equipped with the geodesic metric, focusing on highly symmetric configurations on the unit sphere $\mathbb S^2$. Three discrete uniform models are analyzed and closed-form expressions for optimal quantizers and mean-square errors are derived. (I) For $N$ equally spaced points on the equator, exact error formulas are obtained for both divisible and non-divisible cases, showing that optimal Voronoi cells form contiguous arcs with midpoint representatives. (II) For two antipodally symmetric small circles at latitudes $\pm\phi_0$, each with $M$ longitudes, we establish a no-cross-circle Voronoi phenomenon, symmetry-preserving optimality, and finite-sum error formulas with curvature-dependent bounds and asymptotics. (III) For a single small circle at latitude $\phi_0$, analogous formulas are proved and curvature is shown to reduce distortion by a factor $\cos^2\phi_0$ while preserving the $n^{-2}$ decay rate. Across all models we rigorously formulate the block-midpoint principle: optimal Voronoi cells are contiguous azimuthal blocks whose representatives are azimuthal midpoints. These explicit benchmark models clarify curvature effects and support further developments in quantization on curved manifolds.
Read the full abstract

Information Theory · Cross-listed from cs.LG

LWM-Temporal: Sparse Spatio-Temporal Attention for Wireless Channel Representation Learning

LWM-Temporal is a new member of the Large Wireless Models (LWM) family that targets the spatiotemporal nature of wireless channels. Designed as a task-agnostic foundation model, LWM-Temporal learns universal channel embeddings that capture mobility-induced evolution and are reusable across various downstream tasks. To achieve this objective, LWM-Temporal operates in the angle-delay-time domain and introduces Sparse Spatio-Temporal Attention (SSTA), a propagation-aligned attention mechanism that restricts interactions to physically plausible neighborhoods, reducing attention complexity by an order of magnitude while preserving geometry-consistent dependencies. LWM-Temporal is pretrained in a self-supervised manner using a physics-informed masking curriculum that emulates realistic occlusions, pilot sparsity, and measurement impairments. Experimental results on channel prediction across multiple mobility regimes show consistent improvements over strong baselines, particularly under long horizons and limited fine-tuning data, highlighting the importance of geometry-aware architectures and geometry-consistent pretraining for learning transferable spatiotemporal wireless representations.
Read the full abstract

All authors Sadjad Alikhani, Akshay Malhotra, Shahab Hamidi-Rad, Ahmed Alkhateeb

Dynamical Systems · Cross-listed from nlin.CD

Predicting the onset of period-doubling bifurcations via dominant eigenvalue extracted from autocorrelation

Predicting the occurrence of transitions in the qualitative dynamics of many natural systems is crucial, yet it remains a challenging task. Generic early warning signals like variance and lag-1 autocorrelation identify critical slowing down near tipping points but lack practical thresholds for predicting imminent transitions. More recent studies found that the dynamical eigenvalue is rooted in the framework of empirical dynamical modeling and then estimates the dominant eigenvalue of a system from time series, providing a threshold ($|$DEV$|$ = 1) to predict bifurcations and classify their types. However, its application requires careful calibration of the hyperparameters and focuses on reconstructing system dynamics directly from data. Here, we employ Ornstein-Uhlenbeck process to derive analytic approximations for the lag-$\tau$ autocorrelation function prior to period-doubling bifurcation thereby estimating the dominant eigenvalue of dynamical systems, named dominant eigenvalue extracted from autocorrelation (DE-AC), and revealing its dynamic behaviour when approaching a period-doubling bifurcation. Theoretically, dominant eigenvalue tends to $-1$ when the system approaches a period-doubling bifurcation. In particular, we evaluated DE-AC on simulation data from cardiac alternans model and on experimental data from chick heart aggregates undergoing a period-doubling bifurcation. DE-AC reliably detected the beginning of the cardiac arrhythmia (period-doubling bifurcation) in most cases. Moreover, it demonstrated superior sensitivity and specificity as an early warning signal compared to the three widely used indicators – variance, lag-1 autocorrelation, and dynamical eigenvalue. Our theoretical and empirical results suggest that DE-AC represents a quantitative measure for predicting the onset of potentially dangerous alternating rhythms in the heart.
Read the full abstract

All authors Zhiqin Ma, Chunhua Zeng, Ting Gao, Jinqiao Duan

General Mathematics

Sums of three Fibonacci numbers as concatenations of three repdigits in base $b$

In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist, and we determine all of them explicitly. Among these solutions, the largest occurs for $b=4$ and is given by $$ F_{42}+F_{29}+F_{20}=268435290=\overline{33333333331122}_4. $$
Read the full abstract

All authors Passimzouwé Dagou, Pagdame Tiebekabe, Kouèssi Norbert Adédji, Kokou Tchariè

Combinatorics

Skeletal Snub Polyhedra in Ordinary Space, I

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present paper describes the blueprint for the snub construction and shows that it can be applied to both regular and chiral skeletal polyhedra in ordinary space. The resulting skeletal snub polyhedra are vertex-transitive and highly locally symmetric. Their properties - from a combinatorial, topological, and geometric perspective - are described and illustrated on some particularly interesting examples. We examine when the construction yields uniform skeletal polyhedra and discuss the completeness of our list of generated structures.
Read the full abstract

Number Theory

Moduli of $G$-bundles on rigid gerbes over affine curves

We geometrize the basic cohomology set $H^{1}(\text{Kal}_{F}, G)_{\text{basic}}$ for a global function field $F$. We do this by constructing a v-stack $\text{Bun}_{G,F}^{e}$ which has localization maps to Fargues' analogous stack $\text{Bun}_{G,F_{v}}^{e}$ for all places $v$ of $F$ and whose semistable locus is the disjoint union of $\text{Bun}_{G_{b},F}$ for all $b \in H^{1}(\text{Kott}_{F} \times_{F} \text{Kal}_{F},G)_{\text{basic}}$. We also prove a version of Tate-Nakayama duality for $H^{1}(\text{Kott}_{F} \times_{F} \text{Kal}_{F},G)_{\text{basic}}$, which lets us state a conjectural multiplicity formula for discrete automorphic representations of $G(\mathbb{A}_{F})$ adapted to this new cohomology set.
Read the full abstract

Analysis of PDEs

Regularity of Second-Order Elliptic PDEs in Spectral Barron Spaces

We establish a regularity theorem for second-order elliptic PDEs on $\mathbb{R}^{d}$ in spectral Barron spaces. Under mild ellipticity and smallness assumptions, the solution gains two additional orders of Barron regularity. As a corollary, we identify a class of PDEs whose solutions can be approximated by two-layer neural networks with cosine activation functions, where the width of the neural network is independent of the spatial dimension.
Read the full abstract

All authors Ziang Chen, Liqiang Huang, Mengxuan Yang, Shengxuan Zhou

Information Theory

Physics-Compliant Modeling and Optimization of MIMO Systems Aided by Microwave Linear Analog Computers

Microwave linear analog computer (MiLAC) has emerged as a promising architecture for implementing linear multiple-input multiple-output (MIMO) processing in the analog domain, with radio frequency (RF) signals. Existing studies on MiLAC-aided communications rely on idealized channel models and neglect antenna mutual coupling. However, since MiLAC performs processing at RF, mutual coupling becomes critical and alters the implemented operation, not only the channel characteristics. In this paper, we develop a physics-compliant model for MiLAC-aided MIMO systems accounting for mutual coupling with multiport network theory. We derive end-to-end system models for scenarios with MiLACs at the transmitter, the receiver, or both, showing how mutual coupling impacts the linear transformation implemented by the MiLACs. Furthermore, we formulate and solve a mutual coupling aware MiLAC optimization problem, deriving a closed-form globally optimal solution that maximizes the received signal power. We establish the fundamental performance limits of MiLAC with mutual coupling, and derive three analytical results. First, mutual coupling is beneficial in MiLAC-aided systems, on average. Second, with mutual coupling, MiLAC performs as digital architectures equipped with a matching network, while having fewer RF chains. Third, with mutual coupling, MiLAC always outperforms digital architectures with no matching network. Numerical simulations confirm our theoretical findings.
Read the full abstract

Numerical Analysis

Parametric charge-conservative mixed finite element method for 3D incompressible inductionless MHD equations on curved domains

This paper develops a charge-conservative mixed finite element method with optimal convergence rates for the stationary incompressible inductionless MHD equations on three-dimensional curved domains. The discretization employs the isoparametric Taylor-Hood elements with grad-div stabilization for the velocity-pressure pair, and parametric Brezzi-Douglas-Marini elements for the current density. For sufficiently small meshsize, the discrete inf-sup conditions for both the velocity-pressure and current density-electric potential finite element pairs are established on curved meshes. Utilizing the Piola's transformation, the discrete current density is exactly divergence-free. By employing suitable extensions and projections, optimal a priori error estimates are derived in both the energy norm and the $L^2$-norm. Numerical experiments are presented to confirm the theoretical results.
Read the full abstract

Analysis of PDEs

High-order long-time asymptotics for small solutions to the one-dimensional nonlinear Schrödinger equation

We investigate the global well-posedness and modified scattering for the one-dimensional Schrödinger equation with gauge-invariant polynomial nonlinearity. For small localized initial data of finite energy in a low-regularity class, we establish global existence of solution together with persistence of the localization of the associated profile. We further provide a rigorous derivation of the asymptotic expansion at arbitrary order of such solutions, taking into account long-range effects induced by the cubic component of the nonlinearity. Our analysis relies on the space-time resonance method.
Read the full abstract

Geometric Topology

Construction of a Closed Hyperbolic Surface of Arbitrarily Small Eigenvalue of Prescribed Serial Number

In this paper we construct, for given any small positive number $\epsilon$ and given natural number $n$, and given any closed hyperbolic surface $M$, a closed hyperbolic covering surface $\widetilde{M}$, such that its $n$-th eigenvalue is less than $\epsilon$. An application of this result will also be discussed. The main result follows from the techniques used in B.Randol's paper in 1974 [Ran]. Here I give a new and geometric proof of the main result.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Self-Configurable Mesh-Networks for Scalable Distributed Submodular Bandit Optimization

We study how to scale distributed bandit submodular coordination under realistic communication constraints in bandwidth, data rate, and connectivity. We are motivated by multi-agent tasks of active situational awareness in unknown, partially-observable, and resource-limited environments, where the agents must coordinate through agent-to-agent communication. Our approach enables scalability by (i) limiting information relays to only one-hop communication and (ii) keeping inter-agent messages small, having each agent transmit only its own action information. Despite these information-access restrictions, our approach enables near-optimal action coordination by optimizing the agents' communication neighborhoods over time, through distributed online bandit optimization, subject to the agents' bandwidth constraints. Particularly, our approach enjoys an anytime suboptimality bound that is also strictly positive for arbitrary network topologies, even disconnected. To prove the bound, we define the Value of Coordination (VoC), an information-theoretic metric that quantifies for each agent the benefit of information access to its neighbors. We validate in simulations the scalability and near-optimality of our approach: it is observed to converge faster, outperform benchmarks for bandit submodular coordination, and can even outperform benchmarks that are privileged with a priori knowledge of the environment.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

The extremely-tilted fluid regime near asymptotically Kasner big bang singularities

In this paper, we solve the relativistic Euler equations with a linear barotropic equation of state on a large class of background spacetimes with Kasner big bang asymptotics. Building on previous work in the asymptotically non-tilted regime, which applies when the speed of sound of the fluid is large in comparison to the Kasner exponents, we now consider the asymptotically extremely-tilted regime when the speed of sound is small. We solve the Cauchy problem for the Euler equations towards the big bang singularity and prove, without any symmetry assumptions or smallness conditions on the Cauchy data, that the solutions exist globally in time provided the mean curvature of the initial hypersurface is sufficiently large. Finally, we prove that the solutions exhibit the asymptotics expected from standard heuristic arguments in this regime; in particular, fluid particles are driven towards the speed of light in the direction of the largest Kasner exponent as the big bang singularity is approached.
Read the full abstract