Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
Y. Miyashita gave characterizations of a separable polynomial and a Hirata separable polynomial in skew polynomial rings. In the previous paper, the author and S. Ikehata gave direct and elementary proofs of Miyashita's theorems in skew polynomial rings of automorphism type $B[X;\rho]$ and derivation type $B[X;D]$, respectively. The purpose of this paper is to give proofs for them in the general skew polynomial ring $B[X;\rho,D]$.
Analysis of PDEs
On a Problem Posed by Brezis and Mironescu
The purpose of this note is to present a positive answer to an open problem proposed in the recent book \cite{Brezis-Mironescu} by H. Brezis and P. Mironescu. It has been stated in this book Sobolev Maps to the Circle as Proposition 4.3. We demonstrate, in particular, the value of the least mass of the area minimizing integral rectifiable currents with a given boundary equals to the infimum of areas among smoothly immersed submanifolds with the same boundary, under the assumption that the boundary is that of a smooth submanifold.
Read the full abstract
Geometric Topology
A Generalization of Pretzel Links via Spatial Graphs
In this paper, we introduce graph-pretzel links, a generalization of classical pretzel links based on spatial graph projections. As our main result, we investigate a subfamily associated with the complete graph on four vertices to construct an infinite family of distinct ribbon knots. Furthermore, although they all share a trivial Alexander polynomial, they can be distinguished from one another by their Jones polynomials.
Read the full abstract
Combinatorics
Graded Ehrhart Theory of Unimodular Zonotopes
Graded Ehrhart theory is a new $q$-analogue of Ehrhart theory based on the orbit harmonics method. We study the graded Ehrhart theory of unimodular zonotopes from a matroid-theoretic perspective. Generalizing a result of Stanley (1991), we prove that the graded lattice point count of a unimodular zonotope is a $q$-evaluation of its Tutte polynomial. We conclude that the graded Ehrhart series of a unimodular zonotope is rational and obeys graded Ehrhart–Macdonald reciprocity. In an algebraic direction, we prove that the harmonic algebra of a unimodular zonotope is a coordinate ring of its associated arrangement Schubert variety. Using the geometry of arrangement Schubert varieties, we prove that the harmonic algebra of a unimodular zonotope is finitely generated and Cohen–Macaulay. We also give an explicit presentation of the harmonic algebra of a unimodular zonotope in terms of generators and relations. We conclude by classifying which unimodular zonotopes have Gorenstein harmonic algebras. Our work answers, in the special case of unimodular zonotopes, two conjectures of Reiner and Rhoades (2024).
Read the full abstract
Analysis of PDEs
Keller-Segel-Navier-Stokes systems involving general sensitivities with Signal-Dependent Power-Law Decay
This paper investigates a two-dimensional Keller–Segel–Navier–Stokes system with a tensor-valued chemotactic sensitivity $S(x,n,c)$. Under a signal-dependent power-decay condition $|S(x,n,c)| \le s_0 (s_1+c)^{-\gamma}$, we establish the global existence and uniform-in-time boundedness of classical solutions for both fluid-coupled ($\gamma > 1/2$) and fluid-free ($\gamma > 0$) systems. The proof relies on a sequence of localized energy estimates, including the $L^{2}_{\rm loc}$-smallness of the weighted gradient of the signal concentration, to overcome the mathematical difficulties arising from signal production and fluid transport. Furthermore, under specific structural assumptions on the sensitivity tensor, we prove that solutions of the fluid-free system converge exponentially to the spatially homogeneous steady state. To this end, we establish an interpolation inequality involving the Hölder norm, which is of independent interest and seems to have broad applications.
Read the full abstract
Number Theory
On the de Rham flip-flopping in dual towers
We prove a version of de Rham and Hyodo-Kato flip-flopping for dual towers of rigid analytic spaces including those coming from dual basic local Shimura varieties. The main tool are comparison theorems expressing the two cohomologies as pro-étale cohomology of corresponding relative period sheaves that, by definition, satisfy pro-étale descent. As an application, we show that de Rham and Hyodo-Kato cohomologies of finite level coverings of the Drinfeld space of any dimension $d$ over $K$ are admissible as representations of $\mathbb{GL}_{d+1}(K)$.
Read the full abstract
Dynamical Systems
Threshold Dynamics of Voter Radicalization on the Probability Simplex
We analyse two coupled ODE models of political competition on invariant probability simplices with a conserved electorate. The baseline three-group model tracks left-radical, centrist, and right-radical voter shares. We characterise the unique interior equilibrium by a Perron–Frobenius threshold, establish global asymptotic stability in the symmetric and asymmetric cases, and exclude periodic orbits unconditionally via the Dulac criterion. A structural consequence is that the baseline model cannot produce irreversible centrist decline, history-dependent long-run floors, or multiple attractors. We then extend the model with a disengaged voter compartment and distinguish pure state shocks from permanent structural parameter shifts. The post-shock dynamics are governed by the same spectral threshold: below it the centrist state is globally asymptotically stable; above it every trajectory with a nonzero radical seed converges to the unique radicalised equilibrium. Cumulative sub-threshold structural shifts can cross the threshold and produce staircase dynamics absent from the baseline; the symmetric reduction yields closed-form expressions for the critical shock amplitude and the radicalization window.
Read the full abstract
Mathematical Physics · Cross-listed from physics.optics
Explicit Construction of Floquet-Bloch States from Arbitrary Solution Bases of the Hill Equation
For the Hill equation describing one-dimensional periodic systems, a constructive formulation is developed for generating Floquet-Bloch states directly from arbitrary pairs of linearly independent solutions. One-dimensional photonic crystals are used as a concrete illustration. Explicit closed-form formulas map an arbitrary fundamental system to the corresponding Floquet-Bloch basis via the monodromy matrix, including the generic Jordan band-edge case, without reliance on canonically normalized solutions. The construction can be expressed directly in terms of the transfer matrix, making the residual representation freedom transparent and providing an implementation-ready framework for analytical and numerical studies of periodic systems.
Read the full abstract
Algebraic Topology
On the stable Hopf invariant
We provide a simplified approach to the the stable Hopf invariant. We provide short elementary proofs of the Cartan Formula, the Composition Formula, and the Transfer formula. In addition, when $\pi$ is a discrete group, we show how to extend these results to the stable category of $\pi$-spaces. We also consider the extent to which the stable Hopf invariant is unique.
Read the full abstract
Sunday 8 March
Dynamical Systems
Analysis of a Stochastic Energy Supply and Demand Model with Renewable Integration
In this work, a stochastic energy supply-demand model with renewable integration is developed and analyzed. The basic nonlinear deterministic model describing the relationship among regional demand, external supply, energy imports, and renewable resource integration is extended to an Ito-type stochastic system that captures the uncertainties due to market volatility, climatic variation, policy interventions, and technical changes. Also, the noise structure is multiplicative, ensuring proportional fluctuations and preservation of nonnegativity of the state variables. Global existence, uniqueness of positive solutions, moment boundedness, and stochastic persistence are established rigorously. Furthermore, the deterministic system is analyzed, and stochastic stability is examined using matrix inequality criteria to guarantee almost sure exponential stability of the system in the stochastic setting. Among other results, stochastic perturbations significantly alter the effective system capacity compared to the deterministic case; however, under suitable parameter conditions, boundedness and stability cases are preserved. The Euler-Maruyama scheme is employed to perform numerical simulations to illustrate various dynamical behaviors and highlight the effects of uncertainty on system dynamics.The numerical reliability of the proposed model is further confirmed by additional numerical experiments via the Milstein scheme and parameter sensitivity analysis. Moreover, the results indicate that stochastic effects should be considered for capturing complex energy systems' behavior under uncertainty and its implications for renewable integration.
Read the full abstract
Rings and Algebras
Morita Transport, Marked Projective Loci, and Dedekind Classification for C4-Type Conditionss
Objectwise Morita invariance of $\Cfour$ is known. We prove the corresponding statements for $\Cfourstar$, semi-weak-CS, and strongly $\Cfourstar$, including the chain joins in the definition of semi-weak-CS. For a module property $\mathcal Q$ preserved and reflected by equivalences, we consider the subset $\Vmon_{\mathcal Q}(R)$ of the finitely generated projective monoid $\Vmon(R)$. This marked pair is transported by Morita equivalence. The associated regular-module ring property is Morita invariant if and only if membership in $\Vmon_{\mathcal Q}(R)$ is constant on the order units. The matrix profile satisfies $\mu_{\mathcal Q}(M_m(R))=\{n\geq1:mn\in\mu_{\mathcal Q}(R)\}$. For a nondivision right Ore domain, the profiles of $\Cfour$, $\Cfourstar$, and strongly $\Cfourstar$ are $\{1\}$, whereas the semi-weak-CS profile is $\mathbb N_{\geq1}$. Over a nonfield Dedekind domain $D$, the first three marked loci consist of the projectives of rank at most one, while every finitely generated projective is semi-weak-CS. For a finitely generated $D$-module $M$, we prove that every $\Cfour$ defect at rank at most one can be transferred between $M$ and $\tau(M)$, and we construct a defect when the rank is at least two. Hence $M$ is $\Cfour$ if and only if $\operatorname{rank}_D M\leq1$ and $\tau(M)$ is $\Cfour$; the analogous criterion holds for $\Cfourstar$. Combined with the finite-length torsion criterion, these reductions give invariant-factor tests for the four conditions and criteria for their behaviour under direct sums.
Read the full abstract
Information Theory
Beam-aware Kernelized Contextual Bandits for User Association and Beamforming in mmWave Vehicular Networks
Timely channel information is necessary for vehicles to determine both the serving base station (BS) and the beamforming vector, but frequent estimation of fast-fading mmWave channels incurs significant overhead. To address this challenge, we propose a Beam-aware Kernelized Contextual Upper Confidence Bound (BKC-UCB) algorithm that estimates instantaneous transmission rates without additional channel measurements by exploiting historical contexts such as vehicle location and velocity, together with past observed transmission rates. Specifically, BKC-UCB leverages kernel methods to capture the nonlinear relationship between context and transmission rate by mapping contexts into a reproducing kernel Hilbert space (RKHS), where linear learning becomes feasible. Rather than treating each beam as an independent arm, the beam index is embedded into the context, enabling BKC-UCB to exploit correlations among beams to accelerate convergence. Furthermore, an event-triggered information sharing mechanism is incorporated into BKC-UCB, enabling information exchange only when significant explorations are conducted to improve learning efficiency with limited communication overhead.
Read the full abstract
Complex Variables
Sharp Estimates of Logarithmic Coefficients for a Certain Class of Starlike Functions
In this article, we investigate the extremal properties of logarithmic coefficients for the class $\mathcal{S}_{ch}^*$ of starlike functions associated with the hyperbolic cosine function. We establish the sharp upper bounds for the initial logarithmic coefficients $\gamma_n$ for $n=1, 2, 3$, and determine the precise bound for the second Hankel determinant $H_{2,1}(F_f/2)$ within this class. Furthermore, we extend our analysis to the inverse functions, deriving sharp estimates for the logarithmic inverse coefficients and the corresponding second Hankel determinant $|H_{2,1}(F_{f^{-1}}/2)|$. Additionally, we provide sharp bounds for the moduli differences of both logarithmic and inverse logarithmic coefficients. The sharpness of all obtained inequalities is verified through the construction of specific extremal functions.
Read the full abstract
General Mathematics
A Vector Generalization of Euler's Quadrilateral Theorem
In this paper, we develop a unified algebraic framework for Euler-type identities in real and complex inner product spaces. Starting from the parallelogram identity, we derive Apollonius' identity and recover Euler's classical theorem. We then establish a general Euler-type identity valid for every finite collection of $n\geq 4$ vectors. The proof is based on a combinatorial analysis of pairwise distances. The resulting identity recovers Euler's theorem when $n=4$. Several previously known identities thus arise naturally within a single algebraic framework.
Read the full abstract
Numerical Analysis
A 3D sharp and conservative VOF method for modeling the contact line dynamics with hysteresis on complex boundaries
We propose a sharp and conservative 3D numerical method for simulating moving contact lines on complex geometries, developed within a coupled geometric Volume-of-Fluid (VOF) and embedded boundary framework. The first major contribution is a modified VOF advection and reconstruction scheme specifically designed for mixed cells containing liquid, gas, and solid phases. This formulation ensures strict local mass conservation in the presence of arbitrarily shaped embedded boundaries. To overcome the severe time-step limitation caused by small cut cells, a redistribution advection strategy is introduced, which completely removes the CFL constraint while preserving both local and global volume conservation. The second key contribution is a novel 3D contact angle imposition technique built upon the height function framework. By incorporating a pre-fitting paraboloid procedure, the method achieves robust curvature estimation and accurate enforcement of contact angle conditions on irregular solid surfaces. In addition, contact angle hysteresis is modeled to capture more realistic wetting dynamics. A series of challenging benchmark tests have been conducted to demonstrate the accuracy, robustness, and superiority of the proposed method compared with existing sharp-interface approaches. This study, for the first time, establishes a fully geometric and conservative VOF-based scheme capable of accurately resolving contact line dynamics on arbitrarily complex 3D surfaces.
Read the full abstract
Metric Geometry
On the intrinsic geometry of polyhedra: Convex polygon coordinates
There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space in its own right, with its own intrinsic geometry. Our attention is focused on the complete set of all the coordinate systems that serve to locate a point of the polytope; divorced, for example, from the smoothness issues that are of concern for applications in numerical analysis. We use the efficient and appropriate algebraic language of barycentric algebras to elicit the convex structure of the set of polytope coordinate systems. Specializing to convex polygons, we examine the chordal coordinate systems that are determined by the triangulations of the polygon. An algorithm to compute the coordinates of a point within such a system is presented. The algorithm relies on a coalgebra structure that transports a probability distribution on one side of a triangle to distributions on each of the remaining two sides. The Catalan number enumeration of the polygon triangulations (well-known within combinatorics) is then obtained in a natural geometric fashion from the parsing trees of the coalgebra structure of our algorithm.
Read the full abstract
Numerical Analysis
PDE propagation, sampling, and the Fourier ratio
We study recovery from incomplete random spatial samples for discretized fields arising as fixed-time snapshots of partial differential equations. The organizing parameter is the Fourier ratio $$ FR(g)=\frac{\|\widehat g\|_1}{\|\widehat g\|_2}, $$ which quantifies effective spectral dimension and governs stable $\ell^1$ recovery in bounded orthonormal sampling models. Our main observation is that fixed-time PDE propagation can strictly improve Fourier ratio bounds relative to the discretized initial data. In dimension three, the wave snapshot operator introduces additional high-frequency decay, leading after discretization to Fourier ratio bounds that are uniformly controlled in the grid size (up to discretization errors), whereas the corresponding bounds for the initial discretization are typically polynomial in $N$. For the heat equation in any dimension, Gaussian frequency damping yields Fourier ratio bounds that are essentially independent of grid resolution for fixed positive time. Combining these deterministic Fourier ratio improvements with standard $\ell^1$ recovery guarantees yields explicit sampling-rate bounds for stable reconstruction from missing spatial samples. Numerical experiments confirm that PDE propagation acts as a spectral preconditioner that lowers effective sampling complexity in practice.
Read the full abstract
Number Theory · Cross-listed from cs.MS
A Lock-Free, Fully GPU-Resident Architecture for the Verification of Goldbach's Conjecture
We present a device-resident, multi-GPU architecture for the large-scale computational verification of Goldbach's conjecture. In prior work, a segmented double-sieve eliminated monolithic VRAM bottlenecks but remained constrained by host-side sieve construction and PCIe transfer latency. Here we migrate the entire segment generation pipeline to the GPU using shared-memory tiling, leaving per-segment host-device communication small and independent of segment size, and schedule work across devices through a lock-free atomic counter, scaling near-linearly to two GPUs (speedup 2.03 at $N = 10^{12}$). On the same hardware, the architecture is $13.1\times$ faster than its host-coupled predecessor at $N = 10^{10}$. It verifies Goldbach's conjecture to $10^{12}$ in 145 seconds of computation and to $10^{13}$ in 3246 seconds on a single NVIDIA RTX 5090, and to $10^{13}$ in 1577 seconds on a second machine with two. Sieve cost grows as $N\pi(\sqrt{N})$, which we analyse and which sets the practical limit on the design and identifies where further optimisation must act. This version corrects two concurrency defects in the implementation described in version~1: the affected timings are re-measured with the corrected release, the four-GPU results are withdrawn, and the range is re-verified with the corrected release. The source code is open-source, the measurement logs and the tests for both defects are archived with it, and the experiments are reproducible on commercially available hardware.
Read the full abstract
Mathematical Physics
Finite group actions on genus two $SL(2, \mathbb{C})$-character variety and applications to SCFTs
We investigate irreducible components of the fixed point sets of $ SL(2,\mathbb{C}) $-character variety of the genus two surface group under orientation preserving actions of the finite groups of the $ Mod(\Sigma_{2}) $. We work in the $ \mathcal{O} $-generator presentation of the genus two DAHA and its classical limit $ \mathcal{A}_{q=1,t} $, where we observe nontrivial coincidences between fixed loci attached to different subgroups and establish genus/irregularity transitions. The subvarieties obtained in this way provide novel geometric candidates for symmetry-reduced moduli spaces relevant to $ 4d $ $ \mathcal{N} = 2 $ SCFTs.
Read the full abstract
Category Theory
Proto-exact categories and injective Banach modules
Probability
Factorizing random sets and type III Arveson systems
We develop a representative-level framework for the Liebscher-Tsirelson random-set construction of Arveson systems from stationary factorizing measure types. We introduce the notion of a measurable factorizing family of probability measures on hyperspaces of closed subsets of time intervals and prove that every such family canonically generates an Arveson system. Within this framework we obtain a purely measure-theoretic characterization of spatiality: positive normalized units correspond exactly to dominated families of measures that factorize strictly. We then present a general mechanism for constructing type III Arveson systems via infinite products of measurable factorizing families. Starting from a type II$_0$ seed satisfying a quantitative Hellinger-smallness condition, we form a marked infinite product indexed by $[0,1]\times\mathbb N$ and show, using Kakutani's criterion, that the resulting product system admits no units. This yields a robust construction principle for type III random-set systems. As an application we analyze zero sets of Brownian motion. After anchor-adapted localization and Palm-type uniformization, the Brownian seed satisfies the required overlap estimates, and the associated infinite-product construction produces explicit examples of type III random-set systems, as anticipated in the work of Tsirelson and Liebscher.
Read the full abstract
Information Theory
Spectral-Domain Spreading via Hadamard Transform for Robust Downlink Non-Orthogonal Multiple Access
Non-orthogonal multiple access (NOMA) systems allowing multiple users sharing the same resource block offer significant gains in spectral efficiency which can enable the required massive access in future wireless systems. However, they face several challenges due to their sensitivity to power allocation coefficients, fading effects, and imperfect channel state information (CSI). To address these limitations, this paper proposes Hadamard-NOMA, an approach leveraging the Hadamard Transform (HT) at the source level prior to modulation. By introducing HT, the system mitigates the adverse impact of fading and CSI imperfections, reducing bit error rates (BER) and enhancing overall system reliability. Theoretical analysis and Monte Carlo simulations validate the effectiveness of this technique, demonstrating robust NOMA transmission in dynamic wireless environments. The proposed method offers a promising solution for next-generation wireless networks, ensuring more reliable performance under diverse transmission conditions. Simulation results confirm analytical predictions, demonstrating significant performance improvements over state-of-the-art T-NOMA and Usman-NOMA schemes. Specifically, for the Near user, a gain of 15 dB is achieved at a Bit Error Rate (BER) of $10^{-2}$, while the Far user benefits from a 10 dB gain at a BER of $10^{-1}$. Compared to Usman-NOMA, the proposed method provides an improvement of 15 dB for the Far user at BER $10^{-1}$. Additionally, in a two-user scenario with imperfect Successive Interference Cancelation (SIC), user 1 requires an SNR at least 14 dB lower than user 2 to achieve a BER of $10^{-3}$. These findings highlight the effectiveness of applying HT at the source stage, significantly mitigating CSI errors and making NOMA more resilient for next-generation wireless networks.
Read the full abstract
Optimization and Control · Cross-listed from cs.CV
Transferable Optimization Network for Cross-Domain Image Reconstruction
We develop a novel transfer learning framework to tackle the challenge of limited training data in image reconstruction problems. The proposed framework consists of two training steps, both of which are formed as bi-level optimizations. In the first step, we train a powerful universal feature-extractor that is capable of learning important knowledge from large, heterogeneous data sets in various domains. In the second step, we train a task-specific domain-adapter for a new target domain or task with only a limited amount of data available for training. Then the composition of the adapter and the universal feature-extractor effectively explores feature which serve as an important component of image regularization for the new domains, and this leads to high-quality reconstruction despite the data limitation issue. We apply this framework to reconstruct under-sampled MR images with limited data by using a collection of diverse data samples from different domains, such as images of other anatomies, measurements of various sampling ratios, and even different image modalities, including natural images. Experimental results demonstrate a promising transfer learning capability of the proposed method.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.soft
Force Dipole Interactions in Membranes with Odd Viscosity
We develop a hydrodynamic framework for the interactions and collective dynamics of force dipoles embedded in a compressible fluid membrane supported by a shallow viscous subphase. Starting from the generalized two-dimensional Stokes equations with shear, dilatational, and odd (Hall) viscosities, we derive an exact real-space Green tensor using Hankel transforms. The resulting tensor is characterized by three hydrodynamic screening scales associated with shear, compressional, and odd-viscous modes, and smoothly reduces to the standard limiting cases of incompressible membranes and compressible parity-symmetric membranes, while also capturing the chiral response generated by odd viscosity. Using this Green tensor we obtain the velocity and vorticity fields generated by a force dipole and formulate the dynamical system governing interacting dipoles. The analysis reveals several distinct dynamical regimes and identifies observables that isolate the antisymmetric odd-viscous contribution to dipole interactions, including transverse drift and chiral relative motion.
Read the full abstract
Combinatorics
Walks in the quadrant with interacting boundaries : genus zero case
The study of lattice walks restricted to the first quadrant has shed a lot of interest in the past twenty years. In particular, there has been an important effort to classify models of weighted walks with small steps with respect to the algebraic-differential nature of their generating function. The techniques that were developed in the course of this work are now applied to different extensions of those walks. One of these extensions, called walks with interacting boundaries, consists in accounting for the number of contacts of the walk with the axes, with motivation coming from statistical physics. These contacts are encoded as two additional parameters for the generating function, the Boltzmann weights. For one notable family of models, called genus zero models, we establish in this paper the complete classification of their generating function, for all real values of the parameters. We do this by adapting to this more general case a method due to Dreyfus, Hardouin, Roques and Singer, used in the former classification, and which consists in studying the rational solutions to a $q$-difference equation. In almost all cases, we show that the generating function is hypertranscendental, regardless of the values of the weights. In the remaining cases, we prove that specific algebraic relations between the Boltzmann weights make the generating function $\mathbb{N}$-algebraic or $\mathbb{N}$-rational, contrasting with the interaction-less case.
Read the full abstract
Optimization and Control
Column Generation for the Micro-Transit Zoning Problem
Along with the rapid development of new urban mobility options like ride-sharing over the past decade, on-demand micro-transit services stand out as a middle ground, bridging the gap between fixed-line mass transit and single-request ride-hailing, balancing ridership maximization and travel time minimization. Micro-transit adoption can have significant social impact. It improves urban sustainability, through lower energy consumption and reduced emissions, while enhancing equitable mobility access for disadvantaged communities, thanks to its lower vehicle miles per passenger, flexible schedules, and affordable pricing. However, effective operation of micro-transit services requires planning geo-fenced zones in advance, which involves solving a challenging combinatorial optimization problem. Existing approaches enumerate candidate zones first and selects a fixed number of optimal zones in the second step. In this paper, we generalize the Micro-Transit Zoning Problem (MZP) to allow a global budget rather than imposing a size limit for candidate zones. We also design a Column Generation (CG) framework to solve the problem and several pricing heuristics to accelerate computation. Extensive numerical experiments across major U.S. cities demonstrate that our approach produces higher-quality solutions more efficiently and scales better in the generalized setting.
Read the full abstract
Combinatorics
Infinite Words with very Low Factor Complexity: an introduction to Combinatorics on Words
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following guiding questions: What is the minimal complexity of a non-trivial infinite word over a binary, ternary, or more generally finite alphabet? How should ”non-triviality” be formalized? Which words achieve this minimal complexity? Are there many? Are they interesting? In exploring these questions, we introduce classical objects and tools from combinatorics on words – such as Sturmian words and Rauzy graphs – as well as little-known and new results. In particular, the third chapter is devoted to a theorem by R. Tijdeman from 1999, which generalizes a seminal result of M. Morse and G. Hedlund from 1938. We provide a new, algebraic proof of this theorem (due to J. Cassaigne and the author, 2022) and develop its consequences.
Read the full abstract
Analysis of PDEs
Learning embeddings of non-linear PDEs: the Burgers' equation
Embeddings provide low-dimensional representations that organize complex function spaces and support generalization. They provide a geometric representation that supports efficient retrieval, comparison, and generalization. In this work we generalize the concept to Physics Informed Neural Networks. We present a method to construct solution embedding spaces of nonlinear partial differential equations using a multi-head setup, and extract non-degenerate information from them using principal component analysis (PCA). We test this method by applying it to viscous Burgers' equation, which is solved simultaneously for a family of initial conditions and values of the viscosity. A shared network body learns a latent embedding of the solution space, while linear heads map this embedding to individual realizations. By enforcing orthogonality constraints on the heads, we obtain a principal-component decomposition of the latent space that is robust to training degeneracies and admits a direct physical interpretation. The obtained components for Burgers' equation exhibit rapid saturation, indicating that a small number of latent modes captures the dominant features of the dynamics.
Read the full abstract
Combinatorics
An Efficient Triangulation of $\mathbb{R}P^5$
We present a $6$-dimensional centrally symmetric simplicial polytope for which the antipodal quotient of its boundary forms a $24$-vertex triangulation of the $5$-dimensional real projective space. This $6$-polytope is highly symmetric with an automorphism group of order $192$, and is of independent interest. We conjecture that our construction uses the fewest number of vertices among all triangulations of $\mathbb{R}P^5$. Our method also produces two triangulations of $\mathbb{R}P^6$ on $45$ and $49$ vertices; both improve the previously best known construction in dimension $6$ that used $53$ vertices.
Read the full abstract
Geometric Topology
Manifold models for hyperbolic graph braid groups on three strands
Given a finite graph $\Gamma$, the associated graph braid group $B_n(\Gamma)$ is the fundamental group of the unordered $n$-point configuration space of $\Gamma$. Genevois classified which graph braid groups are Gromov hyperbolic and asked the question: When do these groups arise as $3$-manifold groups? In this paper, we give a partial answer for $B_3(\Theta_m)$, where $\Theta_m$ is the generalized $\Theta$-graph, a suspension of $m$-points. We show that $B_3(\Theta_5)$ is a $3$-manifold group while $B_3(\Theta_m)$ is not even quasi-isometric to a $3$-manifold group for $m \geq 7$.