Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 8 April

Numerical Analysis

Interpolation and approximation of piecewise smooth functions with corner discontinuities on sigma quasi-uniform grids

This paper provides approximation orders for a class of nonlinear interpolation procedures for univariate data sampled over $\sigma$ quasi-uniform grids. The considered interpolation is built using both essentially nonoscillatory (ENO) and subcell resolution (SR) reconstruction techniques. The main target of these nonlinear techniques is to reduce the approximation error for functions with isolated corner singularities and in turn this fact makes them useful for applications to other fields, such as shock capturing computations or image processing. We start proving the approximation capabilities of an algorithm to detect the presence of isolated singularities, and then we address the approximation order attained by the mentioned interpolation procedure. For certain nonuniform grids with a maximum spacing between nodes $h$ below a critical value $h_c$, the optimal approximation order is recovered, as it happens for uniformly smooth functions \cite{ACDD}.
Read the full abstract

Category Theory

On the normal functor in the category of smooth vector bundles

This article is dedicated to the study of the normal functor in the category of smooth real vector bundles. Particularly, we focus on a symmetry phenomena which occurs after iterating two times the normal functor on a commutative square of smooth immersions. To do so, a theory of pullback and quotient is developed for double vector bundles but also for some classes of morphisms. These two operations turn out to be the key ingredients in order to study the naturality of the normal functor. The expected symmetry is then obtained thanks to the universal behavior and the mutual compatibility of these operations.
Read the full abstract

Analysis of PDEs

Coarse-graining and quantitative stochastic homogenization of parabolic equations in high contrast

We prove quantitative homogenization results for high contrast parabolic equations with random coefficients depending on both space and time. In particular, we prove that under a sufficient decorrelation assumption the homogenization length scale is bounded by $\exp(C\log^2(1+\Lambda/\lambda)) + C\sqrt{\lambda}$. The proof is based on a parabolic coarse-graining framework which generalizes the results of Armstrong and Kuusi in the elliptic setting.
Read the full abstract

Algebraic Geometry

A one-step counterexample to the normalized Nash blowup conjecture

We construct an explicit normal singular affine toric variety X of dimension five over an algebraically closed field of characteristic three such that the normalized Nash blowup of X already contains an open affine subset isomorphic to X. Combined with previously known examples, this yields one-step counterexamples in every dimension greater than or equal to five and every characteristic. The characteristic-three case is the most delicate: the previously known counterexample in dimension four requires a two-step iteration of the normalized Nash blowup, and our example demonstrates that in dimension five and higher the minimal number of iterations needed to produce a loop is one.
Read the full abstract

Representation Theory

Lifting banal representations of classical groups

Let $\mathrm{G}$ be a symplectic, a split orthogonal, or an unramified unitary group over a local non-archimedean field $\mathrm{F}$. A prime $\ell$ is called banal with respect to $\mathrm{G}$ if it does not divide the cardinality of the $k$-points of $\mathrm{G}$, where $k$ is the residue field of $\mathrm{F}$. In this paper we show that for every banal prime $\ell$, any smooth irreducible $\overline{\mathbb{F}}_\ell$-representation of $\mathrm{G}(\mathrm{F})$ admits a lift to $\overline{\mathbb{Q}}_\ell$. We also state similar results for more general classical groups of symplectic, orthogonal or unitary type. As an application we prove Howe-duality in the strongly banal case for symplectic-orthogonal or unitary dual pairs.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Super-Grassmannians for $\mathcal{N}=2$ to $4$ SCFT$_3$: From AdS$_4$ Correlators to $\mathcal{N}=4$ SYM scattering Amplitudes

We construct a Super-Grassmannian for $n-$point functions in $\mathcal{N}=2$ to $4$ SCFT$_3$. The constraints imposed by super-conformal invariance and $R-$symmetry are completely manifest in this formalism through (operator-valued) delta functions. We test our formalism in $\mathcal{N}=2$ and $\mathcal{N}=4$ AdS$_4$ super Yang-Mills theories. In the $\mathcal{N}=2$ case, for instance, we reproduce the four-gluon correlator using the four-point scalar correlator as input. For $\mathcal{N}=4$, we construct the super-operator in two distinct ways. In one approach, the super-operator has a lowest component of spin zero and includes all states up to spin two. In the other approach, we build the super-operator in a CPT self-conjugate manner, which contains only operators with spin zero, spin half, and spin one mimicking flat space $\mathcal{N}=4$ SYM super-field constructions. The latter construction is particularly interesting, as it matches directly with the $\mathcal{N}=4$ SYM amplitudes in the flat space limit, thereby demonstrating the non-triviality and usefulness of our framework. It is interesting to note that the $R-$symmetry group enhances from $SO(\mathcal{N})$ to $SU(\mathcal{N})$ in the flat space limit.
Read the full abstract

All authors Aswini Bala, Sachin Jain, Dhruva K.S., Adithya A Rao

Probability

The Three-Dimensional Stochastic EMHD System: Local Well-Posedness and Maximal Pathwise Solutions

We study the three-dimensional stochastic electron magnetohydrodynamics (EMHD) system with fractional dissipation on the torus, driven by Stratonovich transport noise acting through divergence-free first-order operators. The noise generates an Itô correction while preserving the transport structure of the Hall nonlinearity. Since the Hall term contains one more derivative, in the stochastic setting it must be controlled together with commutators arising from the transport operators. We develop a high-order Sobolev energy method based on Littlewood–Paley analysis and refined commutator estimates, which yields uniform bounds for Galerkin approximations in $H^s$ with $s > \tfrac{5}{2}$ together with suitable time regularity. Using stochastic compactness and identification of limits, we construct martingale solutions for initial data in $L^2(\Omega; H^s)$. Pathwise uniqueness follows from cancellations in the Hall term combined with a stochastic Grönwall argument. An application of a Yamada–Watanabe type result then yields local pathwise well-posedness and the existence of maximal pathwise solutions.
Read the full abstract

Analysis of PDEs

Lipschitz regularity for fractional $p$-Laplacian with coercive gradients

In this article we study nonlinear nonlocal equations with coercive gradient nonlinearity of the form \[ (-\Delta_{p})^{s}u(x)+H(x,\nabla u)=f , \] where $f$ is Lipschitz continuous and the Hamiltonian $H$ satisfies the coercivity condition \[ H(x,\xi)\;\geq\;\theta|\xi|^{m}-\theta_{1} \qquad\text{for all } x,\xi\in\mathbb{R}^n, \] for some constants $\theta,\theta_{1}>0$ and $m>1$. Under an additional local Lipschitz assumption on $H$, we show that every viscosity solution $u$ is locally Lipschitz continuous provided that \[ \text{either}\; sp>p-2\; \text{or}\; 1<p<m+1. \] We also establish Hölder and Lipschitz continuity of subsolutions, for which boundedness of $f$ alone suffices. Furthermore, when $f=0$ and $H$ is independent of $x$, we prove that the equation admits only the trivial solution within the class of bounded solutions, for all $m,p\in(1,\infty)$.
Read the full abstract

Optimization and Control

Linearly Solvable Continuous-Time General-Sum Stochastic Differential Games

This paper introduces a class of continuous-time, finite-player stochastic general-sum differential games that admit solutions through an exact linear PDE system. We formulate a distribution planning game utilizing the cross-log-likelihood ratio to naturally model multi-agent spatial conflicts, such as congestion avoidance. By applying a generalized multivariate Cole-Hopf transformation, we decouple the associated non-linear Hamilton-Jacobi-Bellman (HJB) equations into a system of linear partial differential equations. This reduction enables the efficient, grid-free computation of feedback Nash equilibrium strategies via the Feynman-Kac path integral method, effectively overcoming the curse of dimensionality.
Read the full abstract

Probability

Mixing Times and Cutoff for the Rook's Walk

We study the mixing time of the Rook's Walk Markov chain on a $d$-dimensional chess board of side length $n\geq 3$, where a rook moves by first selecting an axis uniformly at random and then selecting a new position along that axis uniformly from among the $n-1$ unoccupied alternatives. Our method is to lump the state space of the Rook's Walk by Hamming distance, yielding a birth-death Markov chain. We prove that this lumped birth-death chain has the same mixing time as the Rook's Walk and identify all eigenvalues and eigenfunctions of the projected chain. We then combine the eigenfunction lower bound approach of Wilson (2004) with an $L^2$ upper bound to obtain new sharpened bounds on the mixing time of the Rook's Walk. As a consequence, we show that the Rook's Walk Markov chain exhibits cutoff.
Read the full abstract

Number Theory

On Lower Bounds for sums of Fourier Coefficients of Twist-Inequivalent Newforms

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier coefficients, the largest prime factor of $a_f(p)+a_g(p)$ satisfies $P(a_f(p)+a_g(p)) > (\log p)^{1/14} (\log \log p)^{3/7-\epsilon}$ for almost all primes $p$ and for any $\epsilon > 0$. Beyond primes, we apply Brun's sieve to show that a similar phenomenon holds for a set of positive integers with natural density one. The main result is further strengthened under the Generalized Riemann Hypothesis, where we establish exponential growth for the absolute value of $a_f(p)+a_g(p)$ in terms of $p$.Additionally, we derive an interesting result related to the multiplicity one theorem, demonstrating that if the sum $a_f(p)+a_g(p)$ is small for a positive-density subset of primes, then $f$ and $g$ must be twist-equivalent by a quadratic character.
Read the full abstract

Commutative Algebra

An Integrally Closed Reduced Ring with McCoy Localizations That Is Neither McCoy nor Locally a Domain

We construct an explicit commutative ring $R$ that is reduced and integrally closed, such that $R_{\mathfrak p}$ is an integrally closed McCoy ring for every maximal ideal $\mathfrak p$ of $R$, while $R$ itself is not a McCoy ring and is not locally a domain. This gives an affirmative answer to Problem~9 in Open Problems in Commutative Ring Theory. The construction combines Akiba's Nagata-type example, which already yields an integrally closed reduced ring with integrally closed domain localizations and a finitely generated ideal of zero-divisors with zero annihilator, with an explicit local integrally closed McCoy ring that is not a domain. Taking the direct product of these two rings preserves the required local McCoy property while retaining the global failure of the McCoy condition. As a consequence, $R[X]$ is integrally closed by Huckaba's criterion.The proof presented in this note was completed by Rethlas \cite{Rethlas2604}, a natural-language automated reasoning system; the author was responsible for reviewing and checking the argument.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

The $\mathcal{N}=1$ Super-Grassmannian for CFT$_3$ and a Foray on AdS and Cosmological Correlators

We construct a Super-Grassmannian integral representation for $n-$point functions in $\mathcal{N}=1$ SCFT$_3$. In this formalism, conformal invariance, supersymmetry, and special superconformal invariance are implemented manifestly through (operator-valued) delta function constraints. An important feature of this framework is the fact that we obtain simple algebraic relations among component correlators, which enable us to determine any component correlator in terms of just one of the component correlators. In particular, this formalism enables us to construct (A)dS$_4$ boundary correlators with contact diagrams from those that receive contributions purely from particle exchanges. We illustrate this by determining the (A)dS$_4$ Yang-Mills gluon four-point function from its gluino counterpart. Further, we establish the flat-space limit in super-space, finding a perfect agreement with existing flat-space results.
Read the full abstract

All authors Aswini Bala, Sachin Jain, Dhruva K.S., Adithya A Rao

Mathematical Physics · Cross-listed from hep-th

Resurgence of high-energy string amplitudes

We analyze the fixed-angle high-energy ($\alpha' \to \infty$) structure of $n$-point tree-level string amplitudes from complementary perspectives: locally via saddle-point expansions, algebraically via difference equations and their asymptotic structure, analytically via Aomoto-Gauss-Manin connection and Mellin-Barnes representation, and geometrically via twisted intersection theory and Lefschetz thimbles. Using, in turn, saddle-point analysis and finite-difference equations in the kinematic variables, we show that the perturbative coefficients in the resulting asymptotic series in $1/\alpha'$ are organized by Bernoulli-number data, rather than by the multiple zeta values characteristic of the low-energy $\alpha' \to 0$ regime. Resurgence theory allows upgrading these divergent series to transseries whose Stokes data capture the analytic continuation between unphysical and physical kinematic regions in the form of non-perturbative monodromy contributions. We derive the transseries for four-point open string amplitudes explicitly. We also construct a differential and Mellin formulation which place their low- and high-energy expansions in a common analytic framework and unifies them as asymptotic sectors of the same underlying object. We extend the difference-equation analysis to $n \geq 5$, where it yields perturbative high-energy asymptotic expansions and leads naturally to a higher-rank connection problem. Finally, translating our asymptotic analysis into the language of twisted de Rham theory, we derive an alternative double-copy representation of the high-energy limit of closed-string amplitudes in terms of Lefschetz thimbles for any $n$.
Read the full abstract

Combinatorics

Successive vertex orderings of graphs

A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and connectivity-preserving constructions, where vertices are added sequentially and must attach to the existing structure. We derive an exact formula for the number of successive vertex orderings of any finite connected graph. The formula is obtained via an inclusion–exclusion argument over independent sets and depends on two explicit combinatorial parameters, one of which is defined recursively. The result applies to all finite connected graphs without requiring regularity or symmetry assumptions. We also express the enumeration as a weighted generating polynomial over independent sets; its value at $x = -1$ recovers the total count of successive orderings, and the $k$-th derivative at this point encodes the number of orderings in which exactly $k$ non-first vertices appear before all of their neighbours.
Read the full abstract

Analysis of PDEs · Cross-listed from cond-mat.stat-mech

Score Shocks: The Burgers Equation Structure of Diffusion Generative Models

We analyze the score field of a diffusion generative model through a Burgers-type evolution law. For VE diffusion, the heat-evolved data density implies that the score obeys viscous Burgers in one dimension and the corresponding irrotational vector Burgers system in $\R^d$, giving a PDE view of speciation transitions as the sharpening of inter-mode interfaces. For any binary decomposition of the noised density into two positive heat solutions, the score separates into a smooth background and a universal $\tanh$ interfacial term determined by the component log-ratio; near a regular binary mode boundary this yields a normal criterion for speciation. In symmetric binary Gaussian mixtures, the criterion recovers the critical diffusion time detected by the midpoint derivative of the score and agrees with the spectral criterion of Biroli, Bonnaire, de~Bortoli, and Mézard (2024). After subtracting the background drift, the inter-mode layer has a local Burgers $\tanh$ profile, which becomes global in the symmetric Gaussian case with width $\sigma_\tau^2/a$. We also quantify exponential amplification of score errors across this layer, show that Burgers dynamics preserves irrotationality, and use a change of variables to reduce the VP-SDE to the VE case, yielding a closed-form VP speciation time. Gaussian-mixture formulas are verified to machine precision, and the local theorem is checked numerically on a quartic double-well.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Quasinormal-mode residues and pole coalescence in hypergeometric black-hole models

We study source-normalized quasinormal-mode residues in radial boundary-value problems reducible to the Gauss hypergeometric equation. Hypergeometric connection coefficients separate the spectral condition from the normalization and spatial dependence of the frequency-domain Green function. We illustrate this construction for Dirichlet modes of the rotating Bañados–Teitelboim–Zanelli black hole and mixed boundary conditions in two-dimensional anti-de Sitter spacetime, and then apply it to the Pöschl–Teller/Nariai problem. Near pole coalescence, we obtain finite-position residues for the two simple poles, while at the critical point both coefficients of the second-order Laurent expansion are reduced to closed finite sums. The subleading coefficient depends explicitly on the frequency derivative of the Green-function numerator and is therefore not determined by the spectral function alone. We also identify the range in which the usual vanishing-discriminant criterion characterizes the Pöschl–Teller coalescence: it holds for the positive barrier considered here, whereas other double zeros or cancellations can occur outside that regime. These results provide a normalization-controlled analytic benchmark for relating spectral coalescence to sourced quasinormal response.
Read the full abstract

Information Theory · Cross-listed from cs.LG

A Graph Foundation Model for Wireless Resource Allocation

The aggressive densification of modern wireless networks necessitates judicious resource allocation to mitigate severe mutual interference. However, classical iterative algorithms remain computationally prohibitive for real-time applications requiring rapid responsiveness. While recent deep learning-based methods show promise, they typically function as task-specific solvers lacking the flexibility to adapt to different objectives and scenarios without expensive retraining. To address these limitations, we propose a graph foundation model for resource allocation (GFM-RA) based on a pre-training and fine-tuning paradigm to extract unified representations, thereby enabling rapid adaptation to different objectives and scenarios. Specifically, we introduce an interference-aware Transformer architecture with a bias projector that injects interference topologies into global attention mechanisms. Furthermore, we develop a hybrid self-supervised pre-training strategy that synergizes masked edge prediction with negative-free Teacher-Student contrastive learning, enabling the model to capture transferable structural representations from massive unlabeled datasets. Extensive experiments demonstrate that the proposed framework achieves state-of-the-art performance and scales effectively with increased model capacity. Crucially, leveraging its unified representations, the foundation model exhibits exceptional sample efficiency, enabling robust few-shot adaptation to diverse and unsupervised downstream objectives in out-of-distribution (OOD) scenarios. These results demonstrate the promise of pre-trained foundation models for adaptable wireless resource allocation and provide a strong foundation for future research on generalizable learning-based wireless optimization.
Read the full abstract

All authors Yucheng Sheng, Jiacheng Wang, Le Liang, Hao Ye, Shi Jin

Statistics Theory · Cross-listed from stat.ME

Poisson-response Tensor-on-Tensor Regression and Applications

We introduce Poisson-response tensor-on-tensor regression (PToTR), a novel regression framework designed to handle tensor responses composed element-wise of random Poisson-distributed counts. Tensors, or multi-dimensional arrays, composed of counts are common data in fields such as international relations, social networks, epidemiology, and medical imaging, where events occur across multiple dimensions like time, location, and dyads. PToTR accommodates such tensor responses alongside tensor covariates, providing a versatile tool for multi-dimensional data analysis. We propose algorithms for maximum likelihood estimation under a canonical polyadic (CP) structure on the regression coefficient tensor that satisfy the positivity of Poisson parameters and then provide an initial theoretical error analysis for PToTR estimators. We also demonstrate the utility of PToTR through three concrete applications: longitudinal data analysis of the Integrated Crisis Early Warning System database, positron emission tomography (PET) image reconstruction, and change-point detection of communication patterns in longitudinal dyadic data. These applications highlight the versatility of PToTR in addressing complex, structured count data across various domains.
Read the full abstract

Numerical Analysis · Cross-listed from astro-ph.IM

Spectral Difference Method with a Posteriori Limiting: III- Navier-Stokes Equations with Arbitrary High-Order Accuracy

We incorporate an arbitrarily high-order method for the Laplacian operator into the Spectral Difference method (SD). The resulting method is capable of capturing shocks thanks to its a-posteriori limiting methodology, and therefore it is able to survive scenarios in which the dissipative scales (viscous and diffusive) are not properly described. Moreover, it is capable of capturing these scales at lower resolution compared to lower-order methods and therefore attains convergence at lower resolution. We show that the method at hand has exponential convergence when describing smooth solutions and is able to recover a high-order solution when solving the dissipative scales.
Read the full abstract

Number Theory

$p$-adic Theory for Partial Toric Exponential Sums

Wan proved the rationality of partial toric $L$-functions using $\ell$-adic techniques. In this paper, we present a $p$-adic proof in the spirit of Dwork. We demonstrate that partial $L$-functions can be expressed as an alternating product of twisted Fredholm determinants. These twisted determinants appear to be intrinsic to the analytic structure of partial $L$-functions, and unlike their classical counterparts, twisted Fredholm determinants of completely continuous operators are not automatically $p$-adic entire functions. However, for partial $L$-functions they will be $p$-adic meromorphic. After proving rationality, we construct a $p$-adic cohomology theory and give a $p$-adic cohomological formula for partial toric $L$-functions. Last, we show they have a unique $p$-adic unit root which may be explicitly written in terms of $A$-hypergeometric series.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Conformal Prediction with Time-Series Data via Sequential Conformalized Density Regions

We propose a new conformal prediction method for time-series data with a guaranteed asymptotic conditional coverage rate, Sequential Conformalized Density Regions (SCDR), which is flexible enough to produce both prediction intervals and disconnected prediction sets, signifying the emergence of bifurcations. Our approach uses existing estimated conditional highest density predictive regions to form initial predictive regions. We then use a quantile random forest conformal adjustment to provide guaranteed coverage while adaptively changing to take the non-exchangeable nature of time-series data into account. We show that the proposed method achieves the guaranteed coverage rate asymptotically under certain regularity conditions. In particular, the method is doubly robust – it works if the predictive density model is correctly specified and/or if the scores follow a nonlinear autoregressive model with the correct order specified. Simulations reveal that the proposed method outperforms existing methods in terms of empirical coverage rates and set sizes. We illustrate the method using two real datasets, the Old Faithful geyser dataset and the Australian electricity usage dataset. Prediction sets formed using SCDR for the geyser eruption durations include both single intervals and unions of two intervals, whereas existing methods produce wider, less informative, single-interval prediction sets.
Read the full abstract

Classical Analysis and ODEs

The quantitative Beurling-Helson Theorem

We show that for any $\varepsilon>0$ if $\phi:\mathbb{T} \rightarrow \mathbb{T}$ is continuous and $\|\exp(-2\pi i z \phi)\|_{A(\mathbb{T})} =O_{|z|\rightarrow \infty}(\log^{\frac{1}{8}-\varepsilon} |z|)$ then $\phi(x)=wx+t$ for some $w \in\mathbb{Z}$ and $t \in \mathbb{T}$.

Probability · Cross-listed from stat.ML

Gaussian Approximation for Asynchronous Q-learning

In this paper, we derive rates of convergence in the high-dimensional central limit theorem for Polyak-Ruppert averaged iterates generated by the asynchronous Q-learning algorithm with a polynomial stepsize $k^{-\omega},\, \omega \in (1/2, 1]$. Assuming that the sequence of state-action-next-state triples $(s_k, a_k, s_{k+1})_{k \geq 0}$ forms a uniformly geometrically ergodic Markov chain, we establish a rate of order up to $n^{-1/6} \log^{4} (nS A)$ over the class of hyper-rectangles, where $n$ is the number of samples used by the algorithm and $S$ and $A$ denote the numbers of states and actions, respectively. To obtain this result, we prove a high-dimensional central limit theorem for sums of martingale differences, which may be of independent interest. Finally, we present bounds for high-order moments for the algorithm's last iterate.
Read the full abstract

All authors Artemy Rubtsov, Sergey Samsonov, Vladimir Ulyanov, Alexey Naumov

Optimization and Control

Negative curvature obstructs the existence of good barriers for interior-point methods

Interior-point methods (IPMs) are a cornerstone of Euclidean convex optimization, due to their strong theoretical guarantees and practical performance. Motivated by scaling problems, recent work by Hirai and the last two authors (FOCS'23) extended IPMs to geodesically convex optimization on Hadamard manifolds. Crucially, the complexity of IPMs (both in Euclidean and Hadamard spaces) is governed by the barrier parameter of the domain. Here we prove that already in hyperbolic space, several natural domains – including geodesic balls and triangles – have a barrier parameter that grows polynomially with the domain's diameter. By extension, the same holds for the positive-definite matrices and other symmetric Hadamard spaces. This growth implies a fundamental limitation: interior-point methods relying on barriers for a ball cannot efficiently solve challenging scaling problems, such as tensor scaling, where the domain's diameter can be exponentially large in the input size. Our results are partially inspired by, and complement, lower bounds on the condition number of geodesically convex functions established by Hamilton and Moitra (NeurIPS'21).
Read the full abstract

Numerical Analysis

Slip optimization on arbitrary 3D microswimmers: a reduced-dimension and boundary-integral framework

This article presents a computational framework for determining the optimal slip velocity of a microswimmer with arbitrary three-dimensional geometry suspended in a viscous fluid. The objective is to minimize the hydrodynamic power dissipation required to maintain unit speed along the net swimming direction. By exploiting the linearity of the Stokes equations and the Lorentz reciprocal theorem, we derive an explicit linear operator that maps the tangential surface slip velocity to the resulting rigid-body translational and rotational velocities, effectively decoupling the hydrodynamic boundary value problem from the optimization loop. The a priori infinite-dimensional search space for the slip optimization is reduced to the finite dimension $r$ of rigid-body motions by finding an appropriate subspace of the operator's domain. This reduces the PDE-constrained optimization to a low-dimensional programming problem that can be solved at negligible computational cost once the system matrices are assembled. The optimization algorithm requires 2$r$ auxiliary flow problems that are solved numerically using a high-order boundary integral method. We validate the accuracy of the proposed method and present optimal slip profiles and swimming trajectories for a variety of microswimmer shapes. We investigate the effect of some common geometrical symmetries of the swimmer shape on the resulting optimal motion, and in particular present a modified version of the slip optimization algorithm for axisymmetric shapes, where tangential rigid-body velocities may occur
Read the full abstract

All authors Marc Bonnet, Kausik Das, Shravan Veerapaneni, Hai Zhu

Information Theory · Cross-listed from eess.SP

Delay-Doppler Channel Estimation using Arbitrarily Modulated Data Transmissions

Conventional delay-Doppler (DD) communication and sensing systems require transmitting pilot frames at every channel coherence time interval in order to keep track of channel variations at the cost of spectral efficiency. In this paper, we propose an approach to utilize data transmissions that modulate arbitrary waveforms with zero-mean, unit average energy symbols for DD channel estimation without requiring pilot transmissions in every coherence time interval. Numerical evaluation over practical doubly-selective channel models demonstrate $\sim 1.8 \times$ improvement in uncoded spectral efficiency with our proposed data-based approach over conventional pilot-based approaches across various $6$G modulation schemes.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

Improved Implementation of Approximate Full Mass Matrix Inverse Methods into Material Point Method Simulations

Approximate full mass matrix methods for the material point method, known as FMPM(k) of order k, can improve the calculation of grid velocities from grid momentum. It can be implemented in any MPM code by inserting a new calculation task whenever grid velocities are needed. The implementation recommended in this paper only needs these calculations once per time step just before when updating particle positions and velocities. FMPM implementation issues arise, however, when its methods are mixed with other MPM feature that rely on lumped mass calculations. Some common lumped-mass MPM features are grid-based, velocity boundary condition, multimaterial contact calculations, crack contact calculations, and imperfect interfaces. This paper first derives a revised FMPM(k) implementation that both simplifies and clarifies the "FMPM Loop" that can be added to MPM codes. Next, that loop is modified to allow FMPM(k) to work well even in simulations that need other MPM features that previously caused conflicts. Two other FMPM(k) issues are apparent loss of stability at very higher order k and inherent computational cost. These issues are discussed in an analysis of temporal stability as a function of order k and in consideration of options to improve efficiency.
Read the full abstract

Number Theory

On a conjecture of Deines

Two elliptic curves defined over $\mathbb{Q}$ are called discriminant twins if they have the same minimal discriminant and the same conductor. Deines, in 2014, conjectured that there exist infinitely many semi-stable non-isogenous discriminant twins. In this article we present an explicit infinite family of semi-stable non-isogenous discriminant twins, providing a proof for Deines' conjecture.
Read the full abstract

Number Theory

On the cohomology of negative Tate twists via cyclotomic descent

We show that the Galois cohomology of negative Tate twists can be organized by a single universal cyclotomic complex over the cyclotomic tower of $\mathbb{Q}$. Using cyclotomic descent and Teichmüller branch decomposition, we prove that a negative twist contributes only on the corresponding branch and is recovered by specializing the Iwasawa variable at a single point; equivalently, it is computed as the fiber of $\gamma-u^{-m}$, or $T=u^{-m}-1$ in Iwasawa coordinates. In the case $\mathbb{Q}_p/\mathbb{Z}_p$, this gives explicit descriptions of $H^1$ and $H^2$ in terms of the quotient and torsion of the $S$-ramified Iwasawa module.
Read the full abstract