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)

Saturday 28 February

Mathematical Physics · Cross-listed from quant-ph

Lissajous coherent states via projection

We construct stationary coherent states concentrated on Lissajous figures of the isotropic and anisotropic harmonic oscillators, the latter having coprime frequencies, by projecting products of ordinary coherent states (one coherent state for each degree of freedom) onto sets of degenerate states. By performing these projections, we are deriving our states from sets of coherent states that are known to follow the classical motion of a two-dimensional harmonic oscillator for arbitrary frequencies. We clarify the nature of any singularities present in the phase of the wavefunction for each of the states we derive, and we establish a rigorous connection between the laminar flow of probability current and the emergence of quantum interference. Through this analysis, we are able to provide a clear and quantifiable definition for a vortex state of the two-dimensional harmonic oscillator (2DHO). In an appendix, we show that our stationary states are true coherent states as they can be used to resolve the relevant identity operators (the above mentioned projection operators) on their respective degenerate subspaces. In the special case of the isotropic oscillator, the states obtained are the SU(2) coherent states, and we derive from our formalism the familiar resolution of unity for these states.
Read the full abstract

All authors Errico J. Russo, James Schneeloch, Edwin E. Hach III, Richard J. Birrittella, Wanda Vargas, Christopher C. Gerry

Probability

On the time a diffusion process spends along a line

For an arbitrary diffusion process $X$ with time-homogeneous drift and variance parameters $\mu(x)$ and $\sigma^2(x)$, let $V_\varepsilon$ be $1/\varepsilon$ times the total time $X(t)$ spends in the strip $[a+bt-(1/2)\varepsilon,a+bt+(1/2)\varepsilon]$.The limit $V$ as $\varepsilon\rightarrow0$ is the full halfline version of the local time of $X(t)-a-bt$ at zero, and can be thought of as the time $X$ spends along the straight line $x=a+bt$. We prove that $V$ is either infinite with probability 1 or distributed as a mixture of an exponential and a unit point mass at zero, and we give formulae for the parameters of this distribution in terms of $\mu(\cdot)$, $\sigma(\cdot)$, $a$, $b$, and the starting point $X(0)$. The special case ofa Brownian motion is studied in more detail, leading in particular to a full process $V(b)$ with continuous sample paths and exponentially distributed marginals. This construction leads to new families of bivariate and multivariate exponential distributions. Truncated versions of such `total relative time' variables are also studied. A relation is pointed out to a second order asymptotics problem in statistical estimation theory, recently investigated in Hjort and Fenstad (1992a, 1992b).
Read the full abstract

2603.00784 · 28 Feb · 16 pages, 0 figures; Statistical Research Report, Department of Mathematics, University of Oslo, October 1992, but now arXiv'd in March 2026. The paper is published, in essentially this form, in Stochastic Processes and their Applications, 1993, vol. 47, pages 229-247, and may be found at this url: www.sciencedirect.com/science/article/pii/030441499390016W

Optimization and Control · Cross-listed from physics.space-ph

Areostationary Satellite Station Keeping Via a Natural Motion Trajectory and Predictive Control

Areostationary Mars orbit (AMO) satellites will play an important role in future expeditions to the Martian surface due to their strength as navigation and communication satellites. Perturbative forces experienced by an AMOR satellite will cause it to drift from its nominal orbit, necessitating station keeping. This note presents a novel approach to AMO station keeping that bridges the gap seen in prior predictive control methods between fuel-efficiency and computational-efficiency. The method proposed in this notes involves the discovery and use of a fuel-free natural motion trajectory that maintains the satellite within one degree of longitude from a areostationary orbit. Two of these natural motion trajectories exist as limit cycles about Mars' stable equilibrium longitudes. They are the resulting motion in the presence of Mars' non-homogeneous gravitational field, accounting for Keplerian and higher-order gravitational perturbations. The proposed MPC policy uses a linear time-varying (LTV) dynamic model that is derived by linearizing the satellite's dynamics relative to the appropriate natural motion trajectory. The result is a station keeping policy that minimizes the fuel consumed, maintains thrust and station-keeping constraints, and is computationally tractable for on-board implementation as a quadratic program.
Read the full abstract

Algebraic Geometry

Minimal Non-Weierstrass Semigroups

Let p in X be a point on a compact Riemann surface. The Weierstrass semigroup of p is the semigroup of pole orders of meromorphic functions on X that are regular at all but p. Hurwitz asked in 1892 whether all numerical semigroups occur as Weierstrass semigroups. In this paper we give a new method for showing that certain numerical semigroups are not Weierstrass, including some of every genus g in which non-Weierstrass examples could possibly exist, except g=18. Our example for g=13 has at once the smallest possible genus, multiplicity and number of generators of any possible non-Weierstrass semigroup.
Read the full abstract

Analysis of PDEs

A Unified Model for Blood and Lymph Flow with Coupled Nonsmooth Biochemical Dynamics

We present a unified mathematical framework for modeling blood and lymph flow in biological vessels, with a particular focus on lymph transport through lymphangions. Starting from first principles, we rigorously derive a system of partial differential equations (PDEs) that govern the fluid dynamics using perturbative methods. To capture the active regulation of lymphangion valves, we couple these PDEs with a system of two nonlinear ordinary non-smooth differential equations (ODEs) describing the chemical kinetics of calcium ions and nitric oxide. These biochemical species play a critical role in valve opening and closing, influencing lymph propulsion. We further analyze a reduced model consisting of two non-smooth ODEs, identifying parameter regimes that guarantee the existence of a stable limit cycle. This oscillatory behavior aligns with experimental observations of lymphatic pumping, providing theoretical validation and new insights into lymphatic physiology. Our results offer a comprehensive mathematical description of lymph flow regulation and open possibilities for future studies on pathological conditions and therapeutic interventions.
Read the full abstract

Optimization and Control

Characterization of measures on the real line that are critically unstable under small shifts

We study the perturbation of a measure $\mu \in \mathscr{P}(\mathbb{R})$ consisting in superposing two copies of $\mu$, each slightly shifted by a small distance $\pm h$. The difference between $\mu$ and its perturbation is measured with a Wasserstein distance. For any $\mu$, this distance is bounded from above by $h$. We show that measures for which this critical rate is achieved when $h$ goes to 0 are characterized as the ones giving most of their mass to some particular porous sets. This is used to identify which measures $\mu$ on the real line have a 2-Wasserstein tangent cone equal to the set of directions inducing curves with maximal initial speed.
Read the full abstract

Probability

Long-time $L^p$ Wasserstein contraction for diffusion processes without global dissipativity

The fact that a Markov diffusion semi-group on $\mathbb R^d$ contracts the $L^p$ Wasserstein distance, which has been extensively used to establish uniform-in-time stability estimates (e.g. with respect to numerical discretization errors), is a well-studied question in the case where the distances are in fact deterministically contracted by the drift (global dissipativity condition) or in the case $p=1$ (with reflection couplings). This work focuses on the non-globally dissipative case with $p>1$. This situation was previously considered in \cite{MonmarcheBruit}, but only for elliptic processes, and with a restriction on the diffusivity coefficient (which had to be large enough). Here, we extend this analysis to non-elliptic processes and provide sharper conditions to get contractions along synchronous coupling, including negative results, lower bounds and a characterization (at least in dimension 1) in terms of the maximal eigenvalue of a Feynman-Kac operator.
Read the full abstract

Geometric Topology

Hyperbolicity of Staked Links and Lower Bounds on Their Volumes

We define a class of links in handlebodies called “charm bracelets," which are a subset of staked links. We provide tools to construct infinitely many such hyperbolic links and bound the corresponding volumes from below in terms of volumes corresponding to the individual charms.
Read the full abstract

All authors Colin Adams, Francisco Gomez-Paz, Jiachen Kang, Lukas Krause

Optimization and Control

An Inexact Alternating Direction Method of Multipliers for Constrained Parabolic Optimal Distributed Control Problems

Solving parabolic optimal control problems can be inherently challenging in the field of science and engineering, especially with constraints on the nonsmooth distributed control. Motivated by the extensive applicability of the alternating direction method of multipliers, in this paper we develop a novel inexact algorithmic framework for parabolic optimal distributed control problems with control constraints. By decoupling the control constraint and possible nonsmooth objective from the optimal control problem, our aim is to efficiently solve the subproblem constrained by the parabolic state equation, for which computing a sufficiently accurate numerical solution can be prohibitively expensive. Given this high computational cost, we consider that it may not always be justifiable to compute a highly accurate solution of the subproblem at every iteration. Hence, we propose an inexact strategy for solving the parabolic equation constrained subproblem. Under mild and flexible conditions on the parameters, we prove global convergence and a linear convergence rate for the resulting algorithmic framework. In practice, our inexact algorithmic framework is easily implementable with applicable nested iterations. Numerical experiments are performed on different cases, and the results demonstrate the validity and trustworthy performance of the proposed methods.
Read the full abstract

All authors Haiming Song, Jinda Yang, Yuran Yang, Jianhua Yuan

Number Theory

On bilinear sums with modular square roots and applications II

In this article, we continue our recent investigations on bilinear sums and additive energies with modular square roots. Here we improve our recent results for the case when the ranges of variables are large. We use these results to make further partial progress on the large sieve for square moduli.
Read the full abstract

Analysis of PDEs

Geometric Estimates for Solutions of Semilinear Equations with Singular Potentials

In this work, we study local minimizers of elliptic functionals with strong absorption terms and unbounded, sign-changing sources. These problems naturally interpolate between two classical free boundary problems: Bernoulli-type (cavity) and obstacle-type. While previous studies have focused on bounded and strictly positive sources, we extend sharp regularity and nondegeneracy estimates to the unbounded, sign-changing setting, providing a comprehensive analysis of how the underlying nonlinearity interacts with minimal integrability assumptions on the source.
Read the full abstract

Dynamical Systems

Conformally symplectic Dynamics

Dynamists have been studying Hamiltonian systems for a long time. However, many physical systems are dissipative and do not preserve a symplectic form. This is the case, for example, with systems involving friction, which multiply the symplectic form by a constant smaller than 1. We will prove that almost every point is in the unstable set of infinity for these systems and we will illustrate different situations that may arise with examples. We will also study invariant manifolds by such dynamics. We will provide an example where an invariant proper submanifold is not isotropic and give different conditions that imply that a given invariant submanifold is isotropic. In particular, we will outline a strange link between isotropy and entropy. Examples demonstrate that some systems have a global attractor, while others do not. We will give a sufficient condition for a conformally Hamiltonian dynamics of a cotangent bundle to have a global attractor. Then we will introduce two very classical examples : Ma$\tilde{\text{n}}$é example and damped mechanical systems. After that, we introduce the notion of locally symplectic manifold. Unlike symplectic manifolds, these manifolds carry conformally symplectic dynamics that have a conservative part and a dissipative part. For conformally Hamiltonian flow, we will describe dissipative and conservative orbits using their number of rotation. Notes of a course given at CIME school at Cetraro, june 2025
Read the full abstract

Commutative Algebra

Composite Linear Quotient Orderings of Ideals and Modified Anticycles

In this paper we give a construction for a linear quotient ordering of a class of products of two ideals which have linear quotients. We apply this construction to give a class of modified anticycle graphs whose square and cube have linear quotients.

Statistics Theory

A simple integral representation of single-event scoring rules

A simple integral representation involving no derivatives or continuity assumptions is given for proper single-event scoring rules.

Analysis of PDEs

Convergence of semilinear parabolic flows with general initial data

We analyze the long-time behavior of solutions to semilinear parabolic equations in Euclidean space that arise as gradient flows of an energy functional. We prove that, for general initial data (including data without compact support) the flow converges to a unique ground state. The argument relies on a sharp stability estimate for almost critical points of the energy, providing a flexible framework for establishing convergence of gradient flows associated with constrained minimization problems in R^n. As an application, we strengthen previous convergence results of Cortazar (1999) and Feireisl (1997).
Read the full abstract

Classical Analysis and ODEs

On uniqueness sets and coefficients of multiple Walsh series converging over cubes

We study problems on uniqueness sets ($U$-sets) for multiple Walsh series converging over cubes and the properties of the coefficients of such series. New broad classes of $U$-sets are constructed. In particular, it is proved that hyperplanes parallel to the coordinate ones are $U$-sets. For the coefficients of multiple Walsh series converging over cubes, both the index sets on which they can be made arbitrarily large and the index sets on which these coefficients tend to zero are described.
Read the full abstract

Optimization and Control · Cross-listed from q-fin.PM

Exploratory Randomization for Discrete-Time Risk-Sensitive Benchmarked Investment Management with Reinforcement Learning

This paper bridges reinforcement learning (RL) and risk-sensitive stochastic control by introducing a tractable exploration mechanism for policy search in risk-sensitive portfolio management, with known and unknown model parameters, that yields an endogenous relative-entropy regularization. We construct a discrete-time risk-sensitive benchmarked investment model. This model combines a factor-based asset universe with periodic portfolio rebalancing. Exploration is incorporated through user-specified Gaussian perturbations to baseline (exploitative) controls. The risk-sensitive stochastic control problem is solved analytically using the Free Energy-Entropy Duality. The Duality recasts the control problem as a linear-quadratic-Gaussian game and introduces a natural penalty for exploration. This approach yields simple sufficiency conditions for optimality. It also induces intuitive bounds on exploration based on risk sensitivity, asset covariance, and rebalancing frequency. Additionally, the optimal investment strategy can be interpreted through the lens of fractional Kelly strategies. By connecting risk-sensitive control theory and RL, this work provides a principled parametric family for policy-gradient implementations, guiding the design of RL methods.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Robust Power and Sample Size Calculations in Quasi-likelihood Models: Methods and Practice

Accurate power and sample size (PSS) calculations are essential for designing studies that use quasi-likelihood (QL) models, which extend generalized linear models (GLMs) to settings where the full distribution of the outcome is not specified. Traditional PSS approaches often rely on restrictive distributional assumptions, limiting their applicability when responses have non-standard distributions, variance functions are misspecified, or when predictors exhibit complex dependence structures. Building on recent advances in effect size measures for PSS - specifically, 2 Standard Deviations in the Linear Predictor (2SLiP) and Pseudo-Partial $R^2$ (P2R2) - developed with interpretability in mind, this paper extends and evaluates these effect size measures in the QL framework, keying in particular on their utility in PSS. We assess their empirical performance for the Wald test and then extend to the score test through extensive simulations across diverse outcome types, link functions, and variance structures. To illustrate practical utility, we applied these effect size measures to survey data on frontline health care workers from \citet{cahill2022occupational} to quantify the association between perceived personal protective equipment adequacy and mental health outcomes during the COVID-19 pandemic, adjusting for covariates. Our findings demonstrate that both 2SLiP and P2R2 provide robust and interpretable alternatives to traditional methods, maintaining accuracy with minimal distributional assumptions and enhancing the flexibility of PSS for realistic study designs.
Read the full abstract

Algebraic Topology

Local structure of smooth \texorpdfstring{$p$}{p}-adic analytic Artin stacks

We prove \cite[Conjecture~5.17]{Clausen} on the local light–profinite structure of smooth $p$-adic analytic Artin stacks. The argument proceeds in several reductions. First, by proving a generalization of van~Dantzig theorem for groupoids, we reduce the conjecture to the compact Hausdorff case. This reduces the conjecture to the statement that the geometric realization of a groupoid object whose object and morphism spaces are light profinite and whose source and target maps are open is light profinite. Next, we simplify the groupoid by constructing a closed skeleton; after quotienting by a clopen subgroupoid, the remaining problem reduces to proving that a profinite family of finite groups can be presented as an inverse limit of finite families of finite groups. As observed by Clausen immediately after \cite[Conjecture~5.17]{Clausen}, our result implies in particular that smooth $p$-adic analytic Artin stacks are \emph{$!$-good}.
Read the full abstract

Algebraic Geometry

Torsion cycles on Fermat varieties

A theorem of Manin and Drinfeld states that any divisor of degree $0$ on the cusps of a modular curve is torsion in the Jacobian. An elegant proof of this result was provided by Elkik using mixed Hodge theory. Rohrlich proved a generalization of this to Fermat curves. In this paper we reprove his results along the lines of the work of Elkik. We then use the same methods to generalize it to higher Chow cycles. We introduce a notion of `ambient decomposability' - essentially cycles coming from the ambient ${\mathbb P}^{n+1}$ and the base field - and show that higher Chow cycles determined by coordinate sections are necessarily of this type. This is a revised and accepted version of the earlier manuscript of the same name and is to appear in Indagationes Mathematicae. The results are stronger than the results in the earlier manuscript.
Read the full abstract

Combinatorics

Turán problems for multilinear maps

We study Turán-type extremal problems for alternating and unrestricted multilinear maps. For alternating order-$d$ multilinear maps $T: (\mathbb F^n)^d\to \mathbb{F}^m$, we determine, over algebraically closed fields of arbitrary characteristic, the largest $k$ such that every $T$ vanishes identically on $\mathbb{V}^d$ for some $k$-dimensional subspace $\mathbb{V}$. This extends the bilinear formula of Buhler, Gupta, and Harris [J. Algebra, 1987] to arbitrary order and resolves a question of Qiao [Discrete Anal., 2023]. We also solve the analogous problem for arbitrary, not necessarily alternating, multilinear maps by determining the largest $k$ such that every $T$ vanishes on $\mathbb{V}_1\times\cdots\times \mathbb{V}_d$ for some $k$-dimensional subspaces $\mathbb{V}_1,\dots,\mathbb{V}_d$. These results yield exact values, over algebraically closed fields, of the Feldman–Propp number [Adv. Math., 1992], the Turán number [Discrete Anal., 2023], and the Gow–Quinlan number [Linear Multilinear Algebra, 2006] associated with alternating multilinear maps. Finally, motivated by the Erdős box problem, we give a purely algebraic derivation of the Conlon–Pohoata–Zakharov lower bound [Discrete Anal., 2021] by combining analytic and partition rank estimates with an incidence count. In the relevant parameter range, we further show that every multilinear map defined over a finite field has many isotropic tuples of $2$-dimensional subspaces over extensions of sufficiently divisible degree. This rules out the natural route to improving the Conlon–Pohoata–Zakharov exponent by selecting multilinear maps with substantially fewer bad isotropic configurations.
Read the full abstract

Optimization and Control

Trading in residential energy systems with storage: a kinetic mean-field approach

We study a stochastic optimal control problem motivated by the operation of a large ensemble of residential storage devices coordinated by an energy aggregator. The aggregator remunerates prosumers in exchange for direct control of their batteries and seeks to jointly (i) reduce local supply-demand imbalances and (ii) exploit intraday price fluctuations through energy arbitrage. The core modeling feature is a kinetic mean-field formulation: the state of charge is treated as a position, the charging/discharging power as a velocity, and the control as an acceleration, thus encoding ramp-rate limitations and producing smooth power trajectories. This leads to a controlled McKean-Vlasov Langevin-type system in which both the drift and the objective functional depend on the time-marginal law of the state, allowing one to capture endogenous interaction effects and population-level stabilization incentives. The performance criterion combines the cost of grid exchange with convex penalties representing degradation and control effort, and includes mean-field terms that promote alignment with the population average; terminal contributions account for residual energy value and end-of-horizon coordination. The resulting control problem is Markovian and hypoelliptic, and naturally connects mean-field control with ultraparabolic operators of kinetic type. This viewpoint provides a coherent bridge between physically constrained storage actuation and law-dependent incentives in large-scale energy management. Numerical experiments based on deep learning solvers are presented to validate the model. From a computational standpoint, the problem is particularly challenging, as it yields a fully coupled forward-backward stochastic system associated with a five-dimensional Hamilton-Jacobi-Bellman equation.
Read the full abstract

Dynamical Systems

A Closed-loop Framework to Discriminate Models Using Optimal Control

Predicting the response of an observed system to a known input is a fruitful first step to accurately control the system's dynamics. Despite the recent advances in fully data-driven algorithms, the most interpretable way to reach this goal is through mechanistic mathematical modeling. Here, we leverage optimal control and propose a closed-loop iterative method to choose among a set of candidate models the one that most accurately predicts an observed system. We assume that one has control over an input of the observed system and access to measurements of its response. Our approach is to identify the input control that maximally discriminates the response of the candidate models, allowing us to determine which model is best by comparing such responses with the observed data. We demonstrate our proposed framework in numerical simulations before applying it during an electrophysiology experiment, successfully discriminating between different models for photocurrents produced via opsin dynamics.
Read the full abstract

All authors Laurent Pagnier, Melvyn Tyloo, Akshita Jindal, Pragati Thakur, Kyle C. A. Wedgwood

Probability

$L^2$-cutoff for the averaging process on random regular graphs

We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree $d=10$: for small degrees, i.e., $d\le 10$, the averaging process mixes as fast as the corresponding random walk on the same graph, whereas for $d> 10$ its $L^2$-mixing is governed by a different, slower mechanism. Our proof relies on a detailed asymptotic analysis of an auxiliary biased birth-and-death chain with a slow bond. We also briefly discuss an analogous phase transition for the $L^1$-mixing.
Read the full abstract

Combinatorics

Counting $\ell$-interval Fubini rankings through their parking outcome

Fubini rankings with $n$ competitors are $n$-tuples with entries in $[n]=\{1,2,3,\ldots, n\}$ that encode the conclusion of a race that allows ties. Since Fubini rankings are parking functions, we can study their parking outcomes, which are permutations encoding the final parking order of the cars using the Fubini ranking as a preference list. We establish that the number of Fubini rankings with $n$ competitors having a fixed parking outcome $\pi$ is given by $2^{n-k}$, where $k$ denotes the number of runs in $\pi$. We then use this formula to give a new proof for the number of Fubini rankings, which is given by the Fubini numbers. We also consider the set of $\ell$-interval Fubini rankings with $n$ competitors, which are Fubini rankings where at most $\ell+1$ competitors tie at any rank. We show that the number of $\ell$-interval Fubini rankings with $n$ competitors having a fixed parking outcome $\pi$ is given by a product of a power of two and a product of $\ell$-Pingala numbers, where these factors depend only on the lengths of the runs that make up the parking outcome $\pi$. The $1$-interval Fubini rankings are known as unit Fubini rankings, and we show that the number of unit Fubini rankings having a fixed parking outcome $\pi$ is given by a product of Fibonacci numbers indexed by the lengths of the runs in $\pi$. We use these results to give a formula for the number of $\ell$-interval Fubini rankings with $n$ competitors for all $\ell\in[n]$. We conclude with some directions for further study.
Read the full abstract

All authors Bjorn Andreas Ager-Hart, Melissa Beerbower, Pamela E. Harris, Joakim Jakovleski, Matt McClinton

Combinatorics

Parameterized complexity of $r$-Hop, $r$-Step, and $r$-Hop Roman Domination

The Dominating Set problem is a classical and extensively studied topic in graph theory and theoretical computer science. In this paper, we examine the algorithmic complexity of several well-known exact-distance variants of domination, namely \textsc{$r$-Step Domination}, \textsc{$r$-Hop Domination}, and \textsc{$r$-Hop Roman Domination}. Let $G$ be a graph and let $r \geq 2$ be an integer. A set $S \subseteq V(G)$ is an \emph{$r$-hop dominating set} if every vertex in $V(G)\setminus S$ is at distance exactly $r$ from some vertex of $S$. Similarly, $S$ is an \emph{$r$-step dominating set} if every vertex of $G$ lies at distance exactly $r$ from at least one vertex of $S$. An \emph{$r$-hop Roman dominating function} on $G$ is a function $f \colon V(G)\to\{0,1,2\}$ such that for every vertex $v$ with $f(v)=0$, there exists a vertex $u$ at distance exactly $r$ from $v$ with $f(u)=2$. The weight of $f$ is defined as $f(V)=\sum_{v\in V(G)} f(v)$. The \textsc{$r$-Hop Domination} (respectively, \textsc{$r$-Step Domination}) problem asks whether $G$ admits an $r$-hop dominating set (respectively, $r$-step dominating set) of size at most $k$, while the \textsc{$r$-Hop Roman Domination} problem asks whether $G$ admits an $r$-hop Roman dominating function of weight at most $k$. It is known that for every $r\ge 2$, the problems \textsc{$r$-Step Domination}, \textsc{$r$-Hop Domination}, and \textsc{$r$-Hop Roman Domination} are NP-complete. First we prove that for all $r\ge 2$, \textsc{$r$-Hop Roman Domination} is W[2]-complete. Furthermore, for every $r\ge 2$, \textsc{$r$-Step Domination} and \textsc{$r$-Hop Domination} remain W[2]-hard even when restricted to bipartite graphs and chordal graphs. Unless the ETH fails, none of these problems admits an algorithm running in time $2^{o(n+m)}$ on graphs with $n$ vertices and $m$ edges.
Read the full abstract

Information Theory

Local Differential Privacy for Molecular Communication Networks

Molecular communication (MC) enables information exchange in nanoscale sensor networks operating in biological environments, yet privacy remains largely unaddressed. We integrate local differential privacy (LDP) into diffusion-based MC by privatizing each user's measurement at the transmitter and conveying the resulting randomized report over the MC channel. To our knowledge, this is the first systematic LDP implementation for diffusion-based MC, enabling privacy-preserving aggregate data analysis for in-body health monitoring and other population-scale sensing applications. We benchmark major LDP mechanisms under a realistic channel model. Simulation results show that Optimized Local Hashing (OLH) achieves the lowest average $\ell_1$ distribution-estimation error under the MC channel when channel resources are sufficient and the number of possible user values (alphabet size) $k$ is moderate to large, whereas k-ary Randomized Response (KRR) and, for privacy budget $\epsilon=1$, Binary Local Hashing (BLH), which have shorter reports, are more robust as the MC transmission quality deteriorates. We further propose RLIM-LDP, which combines run-length-limited ISI-mitigation (RLIM) coding with LDP coding. Extensive simulation results demonstrate that RLIM-LDP improves end-to-end reliability and reduces the final distribution-estimation error when time and molecule resources are limited.
Read the full abstract

Dynamical Systems

Hausdorff dimension of the limit sets of Tree Iterated Function Systems

We investigate Tree Iterated Function Systems (TIFSs), which we introduce in this paper. TIFSs are the generalizations of Iterated Function Systems in which we take the maps independently at each step and each block. In this paper, we give the definition of TIFSs and the limit sets of them. We show a formula for the Hausdorff dimension of the limit sets of TIFSs, which is a generalization of Bowen's formula. Moreover, we give an example which emphasizes the difference between TIFSs and non-autonomous IFSs.
Read the full abstract

Analysis of PDEs

Asymptotic behavior of ground state solutions to nonlinear elliptic problems with the fractional Laplacian

In this paper, we consider the asymptotic behavior of the ground state solution $u_s$ of the nonlinear fractional Laplacian equation \begin{equation}\label{eq:0.1a} (-\Delta)^su+Vu=|u|^{p-2}u\quad x\in \mathbb{R}^n \end{equation} by taking $s$ as a parameter, where $n\geq 4$, $2<p<\frac{2n}{n-2}$, $V$ is a potential function. We show that for a fixed $p$, there exists $s_0\in(0,1)$ such that equation \eqref{eq:0.1a} admits a ground state solution $u_s$ if and only if $s_0<s<1$. Our main results give a description of the asymptotic behavior of $u_s$ as $s\uparrow1$ and $s\downarrow s_0$: $u_s$ converges to a function as $s\uparrow1$, and it blows up as $s\downarrow s_0$. Particularly, we prove that $u_s$ concentrates at a minimum point of the function $V$ as $s\downarrow s_0$. The local uniqueness of $u_s$ is also given.
Read the full abstract

Number Theory

T-Fermat integers

We introduce the concept of a T-Fermat integer, which generalizes the notion of a prime number. We show that any composite T-Fermat integer, if one exists, must be a Carmichael number. We prove several properties of T-Fermat integers and conjecture that there are infinitely many composite T-Fermat integers. Together with a further structural conjecture, this suggests a possible route toward proving the infinitude of primes $p$ such that $\omega(p-1)\leq 2$.
Read the full abstract