Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 29 March

General Mathematics

The Collision Invariant

For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We prove four results about this function. First, the gate width theorem: exactly b-1 multipliers satisfy C(g) = 0, given by the explicit family g = -u/(b-u) mod p for u = 1, ..., b-1. Second, the finite determination theorem: the collision deviation S at lag l depends only on p mod b^(l+1). Third, the reflection identity: S(a) + S(m-a) = -1 for m = b^(l+1), implying a grand mean of -1/2 and a pairing symmetry across the group of units. Fourth, the half-group theorem: for every non-trivial good slice n, the wrapping set W_n has size exactly phi(m)/2. The bilateral symmetry a -> m-a swaps wrapping with non-wrapping.
Read the full abstract

Number Theory

Truncated Plethystic Exponentials Preserve Power Sum Constraints

Given an arbitrary sequence $(\alpha_1, \ldots, \alpha_n) \in \mathbb{C}^n$, we show that the degree-$n$ truncation of the formal exponential $\exp\bigl(-\sum_{k=1}^{\infty} \frac{\alpha_k}{k} x^k\bigr)$ produces a polynomial whose roots $\rho_1, \ldots, \rho_n$ satisfy $\sum_{i=1}^n \rho_i^{-k} = \alpha_k$ exactly for $k = 1, \ldots, n$. This truncation-exactness property is an algebraic identity in the ring of formal power series, proved by coefficient matching. It defines a natural embedding of sequences into multisets of complex numbers and yields an $O(n^2)$ algorithm for computing the polynomial from the prescribed power sums. We apply the result to the polylogarithm family $\alpha_k = k^{1-s}$, where the associated exponential $\exp(-\mathrm{Li}_s(x))$ produces factorial-integer coefficient sequences for $s \leq 0$ and encodes values of the Riemann zeta function through $\lim_{n\to\infty} P_n^{(s)}(1) = \exp(-\zeta(s))$ for $\mathrm{Re}(s) > 1$.
Read the full abstract

General Mathematics

A Symmetric Polynomial Approach to Poncelet Triangles Inscribed in a circle and circumscribed about Central Conics

We develop a symmetric-polynomial framework for the study of one-parameter families of Poncelet triangles. For triangles inscribed in the unit circle and circumscribed about a central conic, we show that the elementary symmetric polynomials of the vertices depend linearly on a single complex parameter. It follows that every symmetric rational function of the vertices is a rational function of this parameter, providing a unified algebraic approach to the investigation of geometric invariants. As applications, we recover several known invariance results and establish new ones involving angles, orthic triangles, tangential triangles, polar circles, and other classical constructions. We also obtain explicit formulas and loci for several associated geometric objects, leading to new invariance phenomena within Poncelet families.
Read the full abstract

Probability

Marked GUE-corners process in doubly periodic dimer models

We study a family of periodically weighted Aztec diamond dimer models near their turning points. We establish that, asymptotically, as $N\rightarrow\infty$, their fluctuations there, scaled by $\sqrt{N}$, are described by a marked GUE-corners process. This limiting point process is constructed by assigning a Bernoulli mark independently to each particle in a realization of the GUE-corners process. The Bernoulli parameters associated with the random marks reflect the periodicity of the model in the limit. To prove this result we use a double-contour integral representation of the inverse Kasteleyn matrix on a higher-genus Riemann surface, which is well-suited for asymptotic analysis.
Read the full abstract

Mathematical Physics · Cross-listed from stat.ML

Persistence diagrams of random matrices via Morse theory: universality and a new spectral diagnostic

We prove that the persistence diagram of the sublevel set filtration of the quadratic form f(x) = x^T M x restricted to the unit sphere S^{n-1} is analytically determined by the eigenvalues of the symmetric matrix M. By Morse theory, the diagram has exactly n-1 finite bars, with the k-th bar living in homological dimension k-1 and having length equal to the k-th eigenvalue spacing s_k = \lambda_{k+1} - \lambda_k. This identification transfers random matrix theory (RMT) universality to persistence diagram universality: for matrices drawn from the Gaussian Orthogonal Ensemble (GOE), we derive the closed-form persistence entropy PE = log(8n/\pi) - 1, and verify numerically that the coefficient of variation of persistence statistics decays as n^{-0.6}. Different random matrix ensembles (GOE, GUE, Wishart) produce distinct universal persistence diagrams, providing topological fingerprints of RMT universality classes. As a practical consequence, we show that persistence entropy outperforms the standard level spacing ratio \langle r \rangle for discriminating GOE from GUE matrices (AUC 0.978 vs. 0.952 at n = 100, non-overlapping bootstrap 95% CIs), and detects global spectral perturbations in the Rosenzweig-Porter model to which \langle r \rangle is blind. These results establish persistence entropy as a new spectral diagnostic that captures complementary information to existing RMT tools.
Read the full abstract

Logic

Dense Chains, Antichains, and Universal Partial Orders Inside a Bounded Finite-One Degree

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order \((\mathbb Q,\le)\). Motivated by a recent preprint of Richter, Stephan, and Zhang, which shows that bounded finite-one degrees can be as rigid as a discrete \(\omega\)-chain and asks whether there are bounded finite-one degrees consisting exactly of a dense linearly ordered set of \(1\)-degrees, we introduce a block-density profile method for controlling one-one reducibility inside a single bounded finite-one degree. As further applications, in the same bounded finite-one degree we obtain an infinite antichain of \(1\)-degrees and, more generally, an embedded copy of every countable partial order. A single bounded finite-one degree can already exhibit dense, incomparable, and universal order-theoretic behaviour. Our main technical tool is a profile theorem based on computable block-density codings. The witness set constructed here is not \(m\)-rigid, so the phenomena obtained in this paper arise from a mechanism different from earlier \(m\)-rigidity-based constructions. Although our results do not settle the exact realization problem posed by Richter, Stephan, and Zhang, we show that density itself is not the obstruction: a single bounded finite-one degree may already contain a copy of \((\mathbb Q,\le)\), an infinite antichain, and embeddings of all countable partial orders.
Read the full abstract

Dynamical Systems

Uniqueness of a topological Furstenberg system

Given a semigroup $G$ and a bounded function $f: G \to \mathbb{C}$, a topological Furstenberg system of $f$ is a topological dynamical system $\mathbb{X}=(X, (T_g)_{g \in G})$ that encodes the dynamical behaviour of $f$. We show that $\mathbb{X}$ is unique up to topological isomorphism, thus providing a topological analogue of the measurable case established by Bergelson and Ferré Moragues for amenable semigroups. We also provide necessary and sufficient conditions for subsets of a group to have isomorphic Furstenberg systems. In addition, we study sets with minimal Furstenberg systems and identify them as a special subclass of dynamically syndetic sets. Moreover, we use this notion to obtain a new characterization of sets of topological recurrence.
Read the full abstract

Logic

Determining the normal subgroups of the automorphism groups of ultrahomogeneous structures via stabilisers

We show the simplicity of the automorphism groups of the generic $n$-hypertournament and the semigeneric tournament, and determine the normal subgroups of the automorphism groups of several other ultrahomogeneous oriented graphs. We also give a new proof of the simplicity of the automorphism group of the dense $\frac{2\pi}{n}$-local order $\mathbb{S}(n)$ for $n \geq 2$ (a result due to Droste, Giraudet and Macpherson). Previous techniques of Li, Macpherson, Tent and Ziegler involving stationary weak independence relations (SWIRs) cannot be applied directly to these structures; our approach involves applying these techniques to a certain expansion of each structure, where the expansion has a SWIR and its automorphism group is isomorphic to a stabiliser subgroup of the automorphism group of the original structure.
Read the full abstract

All authors Thomas Bernert, Rob Sullivan, Jeroen Winkel, Shujie Yang

Algebraic Geometry

Log-concavity from enumerative geometry of planar curve singularities

We propose a log-concavity conjecture for BPS invariants arising in the enumerative geometry of planar curve singularities, identified with the local Euler obstructions of Severi strata in their versal deformations. We further extend this conjecture to ruling polynomials of Legendrian links and to E-polynomials of character varieties. We establish these conjectures for irreducible weighted-homogeneous singularities (torus knots) and for ADE singularities, and prove a multiplicative property for ruling polynomials compatible with log-concavity.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards

We study safe reinforcement learning in finite-horizon linear mixture constrained Markov decision processes (CMDPs) with adversarial rewards under full-information feedback and an unknown transition kernel. We propose a primal-dual policy optimization algorithm that achieves regret and constraint violation bounds of $\widetilde{O}(\sqrt{d^2 H^3 K})$ under mild conditions, where $d$ is the feature dimension, $H$ is the horizon, and $K$ is the number of episodes. To the best of our knowledge, this is the first provably efficient algorithm for linear mixture CMDPs with adversarial rewards. In particular, our regret bound is near-optimal, matching the known minimax lower bound up to logarithmic factors. The key idea is to introduce a regularized dual update that enables a drift-based analysis. This step is essential, as strong duality-based analysis cannot be directly applied when reward functions change across episodes. In addition, we extend weighted ridge regression-based parameter estimation to the constrained setting, allowing us to construct tighter confidence intervals that are crucial for deriving the near-optimal regret bound.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Kernel Dynamics under Path Entropy Maximization

We propose a variational framework in which the kernel function k : X x X -> R, interpreted as the foundational object encoding what distinctions an agent can represent, is treated as a dynamical variable subject to path entropy maximization (Maximum Caliber, MaxCal). Each kernel defines a representational structure over which an information geometry on probability space may be analyzed; a trajectory through kernel space therefore corresponds to a trajectory through a family of effective geometries, making the optimization landscape endogenous to its own traversal. We formulate fixed-point conditions for self-consistent kernels, propose renormalization group (RG) flow as a structured special case, and suggest neural tangent kernel (NTK) evolution during deep network training as a candidate empirical instantiation. Under explicit information-thermodynamic assumptions, the work required for kernel change is bounded below by delta W >= k_B T delta I_k, where delta I_k is the mutual information newly unlocked by the updated kernel. In this view, stable fixed points of MaxCal over kernels correspond to self-reinforcing distinction structures, with biological niches, scientific paradigms, and craft mastery offered as conjectural interpretations. We situate the framework relative to assembly theory and the MaxCal literature, separate formal results from structured correspondences and conjectural bridges, and pose six open questions that make the program empirically and mathematically testable.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Stability and Sensitivity Analysis of Relative Temporal-Difference Learning: Extended Version

Relative temporal-difference (TD) learning was introduced to mitigate the slow convergence of TD methods when the discount factor approaches one by subtracting a baseline from the temporal-difference update. While this idea has been studied in the tabular setting, stability guarantees with function approximation remain poorly understood. This paper analyzes relative TD learning with linear function approximation. We establish stability conditions for the algorithm and show that the choice of baseline distribution plays a central role. In particular, when the baseline is chosen as the empirical distribution of the state-action process, the algorithm is stable for any non-negative baseline weight and any discount factor. We also provide a sensitivity analysis of the resulting parameter estimates, characterizing both asymptotic bias and covariance. The asymptotic covariance and asymptotic bias are shown to remain uniformly bounded as the discount factor approaches one.
Read the full abstract

History and Overview of Mathematics

90+ years of the Scottish Book

Inspired by the recent 90th anniversary of the Scottish Book we present some reflections about its impact. First we discuss new areas of mathematics it helped launch. Then we argue that it was actively used in stimulating the interests and results of junior mathematicians and students. Also, we summarize the progress during the decade that has passed since the publication of [55], which contained a review of solved problems from the Scottish Book. We also provide an overview of collections of open problems related in one way or another to the Scottish Book. All formulations of the Scottish Book problems in English are cited here from Mauldin, Richard Daniel (ed.) 2015: The Scottish Book. Mathematics from the Scottish Café. With selected problems from the New Scottish Book. 2nd updated and enlarged edition. Cham: Birkhäuser/Springer
Read the full abstract

Analysis of PDEs

On the Dirichlet-Neumann operator for nearly spherical domains

We consider the Dirichlet-Neumann operator for a nearly spherical domain in R^n, and prove sharp analytic and tame estimates in Sobolev class. The novelty of this paper concerns technical improvements, the most important of which are the independence of the analyticity radius on the high norms and the regularity loss of one in the elevation function. These properties are expectable but nontrivial to prove. The result is obtained by introducing local charts and a convenient class of non-isotropic Sobolev spaces of high, possibly fractional tangential regularity and integer, limited regularity in the normal direction.
Read the full abstract

2603.27865 · 29 Mar · Comments: This article contains the results of Sections 5 and 7 of arXiv:2408.02333v1 (the first version of arXiv:2408.02333), which are here improved and presented as a separate article. The improvements concern the loss of regularity for the elevation function and the generalization to any dimension

Numerical Analysis

Long-Time H1-Stability of the Cauchy One-Leg Theta-Method for the Navier-Stokes Equations

In this paper we study the long-time stability of the Cauchy one-leg theta-methods for the two-dimensional NavierStokes equations. We establish the uniform dissipativity in H^1, in the sense that the semi-discrete-in-time approximations possess a global attractor for a small enough time step, using the discrete Gronwall lemma and the discrete uniform Gronwall lemma.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CL

KazByte: Adapting Qwen models to Kazakh via Byte-level Adapter

Large language models fragment Kazakh text into many more tokens than equivalent English text, because their tokenizers were built for high-resource languages. This tokenizer tax inflates compute, shortens the effective context window, and weakens the model's grip on Kazakh morphology. We propose to bypass the tokenizer entirely by feeding raw bytes through a small adapter that learns to speak the internal language of a frozen Qwen2.5-7B. Once the adapter is trained, we freeze it and fine-tune only the attention layers of Qwen on Kazakh text. Our central hypothesis is that this two-stage process – first teach the interface, then adapt the model – should match or exceed the accuracy of the original Qwen2.5-7B on standard Kazakh benchmarks. This report describes the ByteKaz architecture and training protocol. Empirical validation is ongoing; this version stakes the design and hypotheses for the record.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

Hierarchical Search of Tree Tensor Networks for High-Dimensional Data

Tensor network methods provide a scalable solution to represent high-dimensional data. However, their efficacy is often limited by static, expert-defined structures that fail to adapt to evolving data correlations. We address this limitation by formalizing the structural rounding problem for tree tensor networks and introducing a hierarchical search algorithm HIST, which automatically identifies optimized structures with index reshaping for input tree tensor networks. To navigate the combinatorial explosion of the structural search space, HIST integrates stochastic sub-network sampling with hierarchical refinement. This approach utilizes entropy-guided index clustering to reduce dimensionality and targeted reshaping to expose latent data correlations. Numerical experiments on analytical functions and real-world physics applications, including thermal radiation transport, neutron diffusion, and computational fluid dynamics, demonstrate that HIST exhibits empirical polynomial scaling with dimensionality relative to the sampling budget, bypassing the scalability barriers in prior work. HIST achieves compression ratios $2.5\times$ to $100\times$ higher than standard fixed formats such as Tensor Trains and Hierarchical Tuckers (peaking at $1000\times$). Furthermore, HIST discovers structures that generalize effectively: applying a structure optimized for one data instance to a related target data typically maintains compression performance within $10\%$ of the result obtained by performing structure search on that target data. These results highlight HIST as a robust, automated tool for adaptive data representation and high-dimensional simulation compression with tensor network methods.
Read the full abstract

All authors Zheng Guo, Aditya Deshpande, Xinyu Wang, Brian C. Kiedrowski, Alex A. Gorodetsky

Numerical Analysis · Cross-listed from cs.NI

Fronthaul Network Planning for Hierarchical and Radio-Stripes-Enabled CF-mMIMO in O-RAN

The deployment of ultra-dense networks (UDNs), particularly cell-free massive MIMO (CF-mMIMO), is mainly hindered by costly and capacity-limited fronthaul links. This work proposes a two-tiered optimization framework for cost-effective hybrid fronthaul planning, comprising a Near-Optimal Fronthaul Association and Configuration (NOFAC) algorithm in the first tier and an Integer Linear Program (ILP) in the second, integrating fiber optics, millimeter-wave (mmWave), and free-space optics (FSO) technologies. The proposed framework accommodates various functional split (FS) options (7.2x and 8), decentralized processing levels, and network configurations. We introduce the hierarchical scheme (HS) as a resilient, cost-effective fronthaul solution for CF-mMIMO and compare its performance with radio-stripes (RS)-enabled CF-mMIMO, validating both across diverse dense topologies within the open radio access network (O-RAN) architecture. Results show that the proposed framework achieves better cost-efficiency and higher capacity compared to traditional benchmark schemes such as all-fiber fronthaul network. Our key findings reveal fiber dominance in highly decentralized deployments, mmWave suitability in moderately centralized scenarios, and FSO complements both by bridging deployment gaps. Additionally, FS7.2x consistently outperforms FS8, offering greater capacity at lower cost, affirming its role as the preferred O-RAN functional split. Most importantly, our study underscores the importance of hybrid fronthaul effective planning for UDNs in minimizing infrastructural redundancy, and ensuring scalability to meet current and future traffic demands.
Read the full abstract

All authors Anas S. Mohammed, Krishnendu S. Tharakan, Hussein A. Ammar, Hesham ElSawy, Hossam S. Hassanein

Functional Analysis

A new criterion for the normalized Haar measure to be a Pietsch measure

In this paper we present a new criterion to determine when the normalized Haar measure on a compact topological group is a Pietsch measure for nonlinear summing mappings. As a consequence, we provide a partial answer to a problem raised by Botelho et al. in \cite{haar botelho} motivated by a question posed to the authors by J. Diestel. It is explicitly shown that this criterion encompasses recent and new results as particular cases.
Read the full abstract

Analysis of PDEs

The Willmore Flow of Graphs with Boundary Data: Low-Regularity Initial Data and Global Convergence

We study the Willmore flow for graphs over a bounded domain in $\mathbb{R}^2$ with Dirichlet (clamped) boundary conditions, a still little-studied setting that also serves as a prototype for higher-order flows with fixed boundary data. We develop a low-regularity theory that avoids the classical fourth-order compatibility condition at $t=0$. Combining a reformulation of the graphical equation, which isolates the quasilinear fourth-order principal part from the lower-order terms, with time-weighted parabolic Hölder spaces, we prove short-time existence for initial data in $C^{1+\alpha}(\overline\Omega)$ and, under a smallness assumption, also for Lipschitz data in $C^{0,1}(\overline\Omega)$, even when the initial Willmore energy is not defined. In the Hölder regime, uniqueness is obtained. In the small-data Lipschitz regime, we also prove global existence, uniform gradient bounds, and exponential convergence to a stationary solution of the elliptic Willmore equation with the prescribed boundary data. A key ingredient is an $L^2$-smallness criterion for graphical surfaces with small Willmore energy and small boundary values. The approach is mainly analytic and extends naturally to related higher-order geometric flows and other boundary conditions.
Read the full abstract

Analysis of PDEs

Equivariant critical point theory and bifurcation of $3d$ gravity-capillary Stokes waves

We establish novel existence results of $3d$ gravity-capillary periodic traveling waves. In particular we prove the bifurcation of multiple, geometrically distinct truly $3d$ Stokes waves having the same momentum of any non-resonant $2d$ Stokes wave. This unexpected clustering phenomenon of Stokes waves, observed in physical fluids, is a fundamental consequence of the Hamiltonian nature of the water waves equations, their symmetry groups, and novel topological arguments. We employ a variational Lyapunov-Schmidt reduction combined with equivariant Morse-Conley theory for a functional defined on a joined topological space invariant under a $2$-torus action. Although the reduction is a priori singular near the hyperplanes of $2d$-waves, we circumvent this difficulty by exhaustive use of the symmetry groups. This approach yields a complete bifurcation picture of $3d $ gravity-capillary Stokes waves.
Read the full abstract

Statistics Theory

Empirical Bayes Estimation and Inference via Smooth Nonparametric Maximum Likelihood

The empirical Bayes $g$-modeling approach based on the nonparametric maximum likelihood estimator (NPMLE) has been central to large-scale estimation and inference in the normal means problem. However, theoretical guarantees for uncertainty quantification remain scarce. A key obstacle is that the NPMLE is necessarily discrete, which yields discrete posterior credible sets and a slow logarithmic deconvolution rate. We address both limitations by introducing a hierarchical Gaussian smoothing layer that restricts the mixing distribution to a Gaussian location mixture. Our smooth NPMLE inherits the favorable properties of the classical NPMLE: it is computable via convex optimization and achieves nearly parametric denoising performance. Moreover, it achieves a polynomial deconvolution rate that is asymptotically minimax over the corresponding class. Our procedure also leads to estimated smooth posteriors that converge to the true posteriors at a polynomial rate. Further, we characterize marginal coverage sets that are optimal in expected length, construct plug-in estimators of these sets, and establish theoretical guarantees for the estimated sets in terms of both coverage probability and expected length. We also extend the theory to settings with model misspecification and heteroscedastic Gaussian observations, and study identifiability of the proposed hierarchical model.
Read the full abstract

Differential Geometry

$Pin^{-}(2)$ Bauer-Furuta invariants

Adapting Bauer and Furuta's constructions of the refinement of the Seiberg-Witten invariants, we establish the analogous stable cohomotopy refinement of the $Pin^{-}(2)$ monopole invariants proposed by Nakamura \cite{nakamura2015pin}, and give the corresponding connected sum formula.
Read the full abstract

Optimization and Control

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization

In simulation-based engineering, design choices are often obtained following the optimization of complex blackbox models. These models frequently involve mixed-variable domains with quantitative and categorical variables. Unlike quantitative variables, categorical variables lack an inherent structure, which makes them difficult to handle, especially in the presence of constraints. This work proposes a systematic approach to structure and model categorical variables in constrained mixed-variable blackbox optimization. Surrogate models of the objective and constraint functions are used to induce problem-specific categorical pseudo-distances. From these pseudo-distances, surrogate-based neighborhoods are constructed using notions of dominance from bi-objective optimization, jointly accounting for information from both the objective and the constraint functions. This study addresses the lack of automatic and constraint-aware categorical neighborhood construction in mixed-variable blackbox optimization. As a proof of concept, these neighborhoods are employed within CatMADS, an extension of the MADS algorithm for categorical variables. The surrogate models are Gaussian processes, and the resulting method is called CatMADS-GP. The method is benchmarked on the Cat-Suite collection of 60 mixed-variable optimization problems and compared with two external mixed-variable solvers. Data profiles indicate that CatMADS-GP achieves the best performance on this collection of problems.
Read the full abstract

All authors Charles Audet, Youssef Diouane, Edward Hallé-Hannan, Sébastien Le Digabel, Christophe Tribes

Combinatorics

Geometry of ample/lopsided sets

Lopsided sets were introduced by Jim Lawrence in 1983 when he studied the subsets of $\{-1,+1\}^E$ that encode the intersection pattern of a convex set $K$ with the orthants of ${\mathbb R}^E$. Lopsided sets have been independently rediscovered by several other authors, in particular by Andreas Dress in 1995, who called them ample sets. Dress defined ample sets as the set families satisfying equality in a combinatorial inequality, which holds for all set families. In a previous article we characterized ample sets in various combinatorial and graph-theoretical ways. In this paper we study geometric realizations of ample sets as cubihedra (cube complexes), which yields several new characterizations. One such characterization establishes that the cubihedra of ample sets endowed with the intrinsic $\ell_1$-metric are exactly the isometric subspaces of $\ell_1$-spaces (which we call, weakly convex sets). We also view the barycenter maps of faces of cubihedra of ample sets as collections of $\{ \pm 1, 0\}$-sign vectors and, in analogy with the characterization of oriented matroids by the covectors and the cocircuits. Moreover, we characterize the collections of $\{ \pm 1, 0\}$-sign vectors corresponding to barycenter maps of all faces and all maximal faces of an ample set. Furthermore, we show that any ample set $\covectors\subseteq \{ -1,+1\}^E$ is realizable as the intersection pattern of a weakly convex set $K$ with the orthants of ${\mathbb R}^E$. All this testifies that the concept of ample sets is quite natural in the context of cube complexes.
Read the full abstract

All authors Hans–Jürgen Bandelt, Victor Chepoi, Andreas Dress, Jack Koolen

Optimization and Control

Separation is Optimal for LQR under Intermittent Feedback

We study finite-horizon linear-quadratic regulation of a scalar linear system with intermittent state feedback under an average communication-rate constraint. In this setting, the scheduling policy and controller are generally coupled through the dual effect: transmission decisions shape future estimation errors, while control actions influence the information available for scheduling. Existing treatments often recover tractability by restricting attention to symmetric scheduling policies, but the optimality of this restriction has remained unclear. We show that, for i.i.d. zero-mean disturbances, symmetric policies are optimal. Consequently, the communication-constrained LQR problem admits a separation structure. The optimal controller is a linear feedback law independent of the scheduling policy, while the optimal scheduler is obtained from a dynamic program. We further show that the optimal scheduling rule is a symmetric threshold policy in the accumulated disturbance since the most recent update.
Read the full abstract

Numerical Analysis · Cross-listed from physics.plasm-ph

From molecular dynamics to kinetic models: data-driven generalized collision operators in 1D3V plasmas

We present a data-driven approach for constructing generalized collisional kinetic models for inhomogeneous plasmas in one-dimensional physical space and three-dimensional velocity space (1D-3V). The collision operator is directly learned from micro-scale molecular dynamics (MD) and accurately accounts for the unresolved particle interactions over a broad range of plasma conditions. Unlike the standard Landau operator, the present operator takes an anisotropic, non-stationary form that captures the heterogeneous collisional energy transfer arising from the many-body interactions, which is crucial for plasma kinetics beyond the weakly coupled regime. Efficient numerical evaluation is achieved through a low-rank tensor representation with $O(N \log N)$ computational complexity. The constructed kinetic equation strictly preserves conservation laws and physical constraints and therefore, enables us to develop an explicit second-order, energy-conserving scheme that ensures fully discrete conservation of mass and total energy. Numerical results demonstrate that the present model accurately predicts both transport coefficients and several 1D-3V kinetic processes compared with MD simulations across a broad range of densities and temperatures in spatially inhomogeneous settings. This work provides a systematic pathway for bridging micro-scale MD and inhomogeneous plasma kinetic descriptions where empirical models show limitation.
Read the full abstract

Combinatorics

Unboundedness of the Heesch Number for Hyperbolic Convex Monotiles

A homogeneous (also known as semi-regular) tiling is an edge-to-edge tiling by regular polygons in which every vertex has the same cyclic type. We resolve the Heesch problem in the hyperbolic plane both for such tilings and for convex monotiles, in the latter case without any edge-to-edge restriction. We also construct an infinite family of weakly aperiodic convex monotiles whose interior angles are rational multiples of $\pi$.
Read the full abstract

Mathematical Physics

Resonances in a Dirichlet quantum waveguide coupled to a cavity

We consider a Dirichlet waveguide in $\mathbb{R}^n$ ($n = 2,3$) with an attached cavity. We show that if the cavity admits a small gap, then the original embedded eigenvalues turn into resonances. The main question we address is how the size of the gap affects the resonant properties, in particular the imaginary part of the resonant pole. For example, in the case of a two dimensional waveguide with a gap of size $\varepsilon$, we show that the leading order term of the resonance behaves as $\mathcal O (\varepsilon^2)$. In the three-dimensional case, if the aperture is defined by a rectangular opening with volume proportional to $\varepsilon^2$, the resonant component behaves as $\mathcal{O}(\varepsilon^4)$. This shows that, in the analyzed class of models, the characteristic time scale associated with the resonances is generically of order $\mathcal{O}((\mathrm{vol}_\varepsilon)^{-2})$, where $\mathrm{vol}_\varepsilon$ denotes the volume of the aperture inducing the resonance.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Higher-spin composites and emergent AdS$_3$ geometry in the $(1+1)$-dimensional Gross-Neveu model

We study the $(1+1)$-dimensional Gross-Neveu (GN) model with $N$ fermion species and derive from it an emergent AdS$_3$ geometry together with the leading entries of a holographic dictionary. We use a Bargmann-Wigner fusion scheme to generate an infinite tower of higher-spin composite fields from fundamental fermions and study their relative dynamics. A key feature is that the competition between spin-0 (chiral) condensation and spin-1 pairing defines the radial coordinate $z$ of the bulk geometry. Local fluctuations of this ratio measured by a comoving derivative generate the AdS$_3$ line element, and the large-$N$ species sum promotes $z$ from a parameter to a genuine bulk dimension. The $SO(2,2)$ bulk isometry group, whose special conformal generators mix $z$ with the boundary GN coordinates, emerges from local symmetries of the condensates. Our construction admits two dual holographic frames related by the $\mathbb{Z}_2$ exchange of the spin-0 and spin-1 condensates, covering complementary halves of the GN phase diagram. Significantly, projection onto the spin-2 sector reproduces the linearized Einstein-Hilbert action with Newton's constant $G_3 = \ell_\mathrm{AdS}/4\pi N^2$. We suggest throughout how the string-theoretic sector of the correspondence may emerge.
Read the full abstract