Information Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 17 March
The integration of satellite communication networks with next-generation (NG) technologies is a promising approach towards global connectivity. However, the quality of services is highly dependant on the availability of accurate channel state information (CSI). Channel estimation in satellite communications is challenging due to the high propagation delay between terrestrial users and satellites, which results in outdated CSI observations on the satellite side. In this paper, we study the downlink transmission of multiple satellites acting as distributed base stations (BS) to mobile terrestrial users. We propose a multi-agent reinforcement learning (MARL) algorithm which aims for maximising the sum-rate of the users, while coping with the outdated CSI. We design a novel bi-level optimisation, procedure themes as dual stage proximal policy optimisation (DS-PPO), for tackling the problem of large continuous action spaces as well as of independent and non-identically distributed (non-IID) environments in MARL. Specifically, the first stage of DS-PPO maximises the sum-rate for an individual satellite and the second stage maximises the sum-rate when all the satellites cooperate to form a distributed multi-antenna BS. Our numerical results demonstrate the robustness of DS-PPO to CSI imperfections as well as the sum-rate improvement attached by the use of DS-PPO. In addition, we provide the convergence analysis for the DS-PPO along with the computational complexity.
Dynamical Systems
Yet another characterization of Birkhoff Billiards inside discs
In this short paper, we show a characterization of Birkhoff Billiards inside discs which is related to the expansion of the formal Lazutkin conjugacy at the boundary.
Read the full abstract
Dynamical Systems
Tangent measures of self-similar sets satisfying the strong separation condition
This paper investigates tangent measures in the sense of Preiss for self-similar sets on ${{\mathbb{R}}^d}$ that satisfy the strong separation condition. Through the dynamics of “zooming in” on any typical point, we derive an explicit and uniform formula for the tangent measures associated with this category of self-similar sets on ${{\mathbb{R}}^d}$. Furthermore, for any self-similar set $C\subset{{\mathbb{R}}^d}$ under the open set condition instead of the strong separation condition, we find that the support of any tangent measure at each point $x\in C$ is one of the limit models at that point. Conversely, any limit model at each point $x\in C$ is the support of one of the tangent measures at that point.
Read the full abstract
Complex Variables
Recurrence relations for the Maclaurin coefficients of products of elementary functions and Hypergeometric functions
In this paper, we investigate the recurrence relations for the Maclaurin coefficients of the products of elementary functions and hypergeometric functions. Specifically, we focus on the confluent hypergeometric function $\mathcal{M}(z) = h(z) M(a,c;z)$ and the Gaussian hypergeometric function $\mathcal{F}(z) = h(z) F(a,b;c;z)$, considering several specific choices for the function $h(z)$. In particular, we explore cases where $h(z)$ is chosen as $e^{pz}$, $(1-\theta z)^p$, $e^{-p \arctan z}$, $\sin(pz)$, $\cos(pz)$, $\sinh(pz)$, $\cosh(pz)$, $\arcsin(pz)$, and $\arccos(pz)$.
Read the full abstract
Classical Analysis and ODEs
Sparse Bounds for Rough Fourier Integral Operators
We prove pointwise bounds for rough Fourier integral operators by the $L^p$ Hardy-Littlewood maximal function. We assume the Fourier integral operators have amplitudes in $L^\infty S^m_\rho$ and phases $\varphi$ such that $\varphi(x,\xi) - x\cdot\xi \in L^\infty \Phi^1$, and assume a non-degeneracy condition on the matrix $\partial^2_\xi\varphi(x,\xi)$. The pointwise bound holds when \begin{equation*} m < -\frac{\rho}{2}(n-1) - \frac{\rho}{p} - \frac{n}{p}(1-\rho), \end{equation*} which is known to a be sharp condition on $m$ when $\rho=1$, modulo the end-point. Making use of this pointwise bound and known $L^p$ boundedness results when the phase satisfies an additional non-degeneracy condition, we go on to prove sparse form bounds for these operators.
Read the full abstract
Combinatorics
The largest $K_r$-free set of vertices in a random graph
For $r \ge 2$ and a graph $G$, let $\alpha_{{r}}(G)$ be the maximum number of vertices in a $K_r$-free subgraph of $G$. We investigate the value $\alpha_{r}(G)$ when $G$ is the random graph $G \sim G_{n, 1/2}$ and discover the following phenomenon: with high probability, $\alpha_r(G)$ lies in an interval of constant length that varies in a non-monotonic fashion from $1$ to $\lfloor r/2\rfloor+1$ depending on the value of $n$. The special case $r=2$ corresponds to the independence number of random graphs which is well-known to have two-point concentration; our results therefore extend and generalize this basic fact in random graph theory, showing more complicated behavior when $r>2$. We also prove similar results where $K_r$ is replaced by any color critical graph like $C_5$.
Read the full abstract
Numerical Analysis
The peak heat flux conjecture for the first Dirichlet eigenmode of convex planar domains
In this paper, we study the scale-invariant quantity \[\mathcal{G}(\Omega)=\frac{\|\partial_n u_1\|_{L^\infty(\partial\Omega)}}{\lambda_1},\]where $u_1$ is the first $L^2$-normalized Dirichlet Laplace eigenfunction of a Euclidean domain $\Omega$ and $\lambda_1$ is its eigenvalue. This is related to the peak boundary heat flux in the long time limit. For convex domains we prove that $\|\partial_n u_1\|_{L^\infty(\partial\Omega)}$ is upper-bounded by a (domain-independent) constant multiple of $\lambda_1$. Using layer potentials, we derive shape-derivative formulae for efficient gradient computations. When combined with high-order Nyström discretization, a fast boundary integral equation solver, and eigenvalue rootfinding, this allows us to numerically optimize $\mathcal{G}$ over a class of rounded polygonal discretized domains. Based on extensive numerical experiments, we then conjecture that, over the set of convex domains, $\mathcal{G}$ is maximized by the semidisk, with the peak flux at the center of the diameter. To lend analytical support to this conjecture, we prove that the semidisk is a critical point of $\mathcal{G}$ under infinitesimal perturbations of its circular arc.
Read the full abstract
Analysis of PDEs
On the stabilization of $L^2$ and $H^1$ norms for the Zakharov-Kuznetsov equation with damping
In this paper we establish exponential decay results for solutions of the damped $n$-dimensional Zakharov–Kuznetsov equation for $2 \le n \le 3$. More precisely, we prove the exponential decay of the $L^2(\mathbb{R}^n)$ norm when the damping is localized. In addition, when the dissipative mechanism acts on the whole space $\mathbb{R}^n$, we prove the exponential decay of the $H^1(\mathbb{R}^n)$ norm. Our strategy of proof combines a Kato's type smoothing effect, unique continuation and an observability inequality.
Read the full abstract
Combinatorics
Double Italian domination in trees
Let $G$ be a graph with vertex set $V=V(G)$. A double Roman dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the conditions that if $f(v) = 0$, then vertex $v$ must have at least two neighbors in $V_2$ or one neighbor in $V_3$, if $f(v) = 1$, then vertex $v$ must have at least one neighbor in $V_2 \cup V_3$. The weight of a double Roman dominating function $f$ is the sum $f(V) = \sum_{v \in V} f(v)$, and the double Roman domination number $\gamma_{dR}(G)$ is the minimum weight of a double Roman dominating function on $G$. A double Italian dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the condition that for every vertex $u \in V$, if $f(u) \in \{0,1\}$, then $\sum_{v \in N[u]} f(v) \ge 3$. The double Roman domination number $\gamma_{dI}(G)$ is the minimum weight of a double Italian dominating function on $G$. Mojdeh and Volkmann [D.A. Mojdeh and L. Volkmann, Roman {3}-domination (double Italian domination), Discrete Appl. Math. 283 (2020), 555–564] proved that $\gamma_{dI}(T) = \gamma_{dR}(T)$ for any tree $T$. However, we find that there is a minor issue in the proof. In this paper, we first prove that $\gamma_{dI}(T) \neq \gamma_{dR}(T)$. Subsequently, we present a sharp bound on the double Italian domination number of any non-trivial tree $T$, and characterize the trees attaining this bound.
Read the full abstract
Category Theory · Cross-listed from cs.PL
Dimensional Type Systems and Deterministic Memory Management
We present a dimensional type system whose annotations remain available through the stages that require them, allowing numeric representation and deterministic memory management to be resolved within a single Program Semantic Graph (PSG). Based on Andrew Kennedy's Units of Measure, dimensions constrain admissible operations and the application of domain laws, forming our Native Type Universe (NTU). Range analysis combines those constraints with values, guards, and declared boundaries. A covering representation then determines word width and memory footprint, which participate in allocation and transfer decisions alongside lifetime and target constraints. Our Dimensional Type System (DTS) extends Hindley-Milner inference with abelian-group unification. Within that algebraic fragment, inference is decidable and admits principal types. Measures form part of source-level type identity, while numeric width and storage layout are coeffects resolved from context. A known range that exceeds every available representation produces an error at representation commitment. During program elaboration, unresolved facts can remain pending while further context is supplied. Deterministic Memory Management (DMM) uses the same graph to relate escape paths to storage lifetimes. Closure capture, return, and by-reference use supply different lifetime requirements. Allocation follows the lifetime classification and the platform's declared storage capabilities. Our unique implementation of a posit quire illustrates the interaction: exact accumulation requires a suitable numeric format, adequate capacity, and storage that persists across the accumulation. We also examine how these constraints would apply to automatic differentiation. A shared graph would allow language services to present dimensional resolution and proof status alongside the reasons for representation and placement decisions.
Read the full abstract
Probability
On central limit theorems for Ewens-Pitman model
We establish a quenched functional central limit theorem for the total number of components of random partitions induced by a Chinese restaurant process with parameters $(\alpha,\theta), \alpha\in(0,1), \theta>-\alpha$. With $P_j$ denoting the asymptotic frequency of the $j$-th table, it is well-known that the component count has the same law as the occupancy count of an infinite urn scheme with sampling frequencies being $(P_j)_{j\in\mathbb N}$. Our analysis follows this approach and is based on earlier results of Karlin (1967) and Durieu and Wang (2016). In words, our result reveals that the fluctuations of the component count consist of two parts, one due to the sampling effect given the asymptotic frequencies $(P_j)_{j\in\mathbb N}$, the other due to the fluctuations of the random asymptotic frequencies, and in the limit the fluctuations of the two parts are conditionally independent given the $\alpha$-diversity. Our result strengthens a recent central limit theorem obtained by Bercu and Favaro (2024) via a different method.
Read the full abstract
Numerical Analysis · Cross-listed from cs.RO
Early-Terminable Energy-Safe Iterative Coupling for Parallel Simulation of Partitioned Port-Hamiltonian Systems
Parallel simulation of robotic systems requires partitioning the dynamics into coupled subsystems. Finite-iteration coupling across the partition boundary can inject spurious energy, even when each subsystem is passive. We propose an early-terminable, energy-safe coupling interface for port-Hamiltonian subsystems based on Douglas–Rachford splitting in wave (scattering) coordinates. The wave-domain formulation reduces passivity to norm inequalities and coupling to orthogonality. Within this setting, the deep correspondence between monotone operator theory and discrete passivity can be exploited to construct a Douglas–Rachford inner iteration whose Fejér monotonicity provides algorithmic dissipation. Under passivity of the subsystem integrators and an impedance-tuning condition, the proposed method guarantees discrete passivity of the augmented storage for any finite inner-iteration budget and converges to the monolithic discretization as the budget increases. Experiments on a linear–Duffing coupled-oscillator benchmark support the finite-iteration energy inequality at numerical roundoff (1e-14 in double precision), with state-error metrics decreasing over the tested inner-iteration budgets.
Read the full abstract
Algebraic Topology
Topological simplification guided by forbidden regions
Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders cells of the input complex in a way which eliminates some persistent homological features, without affecting the rest. We present a new approach to simplification based on the concept of forbidden regions and combinatorial dynamics. It allows us to reorder and cancel critical values, whose cancellation is not possible using existing methods because they are not consecutive in the total order. Each such cancellation takes O(c$\cdot$n) time in the worst case, where c is the number of birth-death pairs and n is the size of the input complex.
Read the full abstract
Analysis of PDEs
Global well-posedness of 2-D incompressible anisitropic Navier-Stokes equations with variable density
We establish the global well-posedness for two-dimensional inhomogeneous, incompressible, anisotropic Navier-Stokes systems. Two specific models are analyzed: one with partial dissipation (referred to as (AINS)) and one with only horizontal dissipation (referred to as (HINS)), under the assumption that the initial density is bounded away from zero and infinity. For the (AINS) system posed in the whole plane $\mathbb{R}^2$, we prove the existence and uniqueness of global solutions for finite-energy initial data, employing time-weighted energy estimates and a duality argument. For the (HINS) system on the domain $\mathbb{T} \times \mathbb{R}$, global well-posedness is established for sufficiently small initial velocity and sufficiently small density variation. By exploiting the anisotropic dissipation structure, employing Poincaré-type inequalities to obtain exponential decay for the oscillatory part of the velocity field, and carefully balancing the growth of the density gradient, we overcome the principal analytical challenges.
Read the full abstract
Probability
Critical Self-Similar Markov Trees
Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888. Borrowing techniques from branching random walk, in particular the recent result of Aïdékon–Hu–Shi arXiv:2409.01048, we can complete the picture by constructing critical ssMt, computing their fractal dimension and studying their associated harmonic and length measures using spinal decomposition.
Read the full abstract
Probability
Fast random sampling and small noise analysis for stochastic control models
In this paper, we study a linear control system with a given state feedback law. The system is influenced by rapid random sampling occurring at frequency $\frac 1n, n \in \mathbb N$, as well as by white noise of small intensity $\varepsilon \in (0, 1]$. We study the behavior of the system as $n \to \infty$ and $\varepsilon \searrow 0$ jointly, and prove that it converges to its ideal deterministic analogue. For the random fluctuations around its analogous deterministic trajectory, we obtain either stochastic differential equations or an ordinary differential equation depending on the joint behavior of $\varepsilon$ and $n$. Further, we extend this problem to a nonlinear system driven by multiplicative white noise, where the noise intensity is scaled by a small parameter. In this case, we again perform a similar analysis as in the linear case.
Read the full abstract
Combinatorics
An Infinite Family of 6_Regular B-Cayley Graphs from the Petersen Graph
We construct an infinite family of 6-regular graphs $\{G_n\}_{n\ge 3}$ by taking $n$ copies of the Petersen graph and wiring corresponding vertices according to an $n$-cycle permutation. Each $G_n$ has $10n$ vertices, $30n$ edges, and automorphism group $D_{5n}$ of order $10n$, acting with two vertex orbits of size $5n$. The graphs have girth $4$ and diameter $\lfloor n/2\rfloor+2$. We prove that $G_3$ and $G_4$ are Ramanujan graphs, satisfying $|\lambda_2| \le 2\sqrt{5}$. The first five members ($n=3,\dots,7$) have been deposited in the House of Graphs database as entries 56324–56328. This construction provides new examples of highly symmetric regular graphs and contributes two new Ramanujan graphs to the literature. All computational scripts are available online for full reproducibility.
Read the full abstract
Dynamical Systems · Cross-listed from quant-ph
Bridging Classical Sensitivity and Quantum Scrambling: A Tutorial on Out-of-Time-Ordered Correlators
In classical dynamical systems, chaotic behavior is often associated with exponential sensitivity to initial conditions together with global phase-space structure. Translating this geometric concept to the strictly linear framework of quantum mechanics presents a conceptual puzzle. The out-of-time-ordered correlator (OTOC) is often motivated as the quantum analogue of the classical butterfly effect, but this slogan can hide important mathematical distinctions. This tutorial bridges the gap between applied mathematics and quantum information by detailing the mathematical machinery of the OTOC. We explore how classical sensitivity translates to operator non-commutativity, why standard two-point correlation functions fail to cleanly detect this sensitivity, and how the delocalization of quantum observables relates to classical notions of mixing. Crucially, we outline what the OTOC can and cannot diagnose, distinguishing between local instability and global chaos. Ultimately, we provide a precise and usable conceptual map, exploring how the Koopman-von Neumann formalism offers a framework to view classical and quantum dynamics through a shared linear perspective.
Read the full abstract
Numerical Analysis
Robust Physics-Guided Diffusion for Full-Waveform Inversion
We develop a robust physics-guided diffusion framework for full-waveform inversion that combines a score-based generative prior with likelihood guidance computed through wave-equation simulations. We adopt a transport-based data-consistency potential (Wasserstein-2), incorporating wavefield enhancement via bounded weighting and observation-dependent normalization, thereby improving robustness to amplitude imbalance and time/phase misalignment. On the inference side, we introduce a preconditioned guided reverse-diffusion scheme that adapts the guidance strength and spatial scaling throughout the reverse-time dynamics, yielding a more stable and effective data-consistency guidance step than standard diffusion posterior sampling (DPS). Numerical experiments on OpenFWI datasets demonstrate improved reconstruction quality over deterministic optimization baselines and standard DPS under comparable computational budgets.
Read the full abstract
Complex Variables
Pre-Schwarzian and Schwarzian norm estimates for certain classes of analytic and harmonic mappings
Let $\mathcal{A}$ denote the class of all analytic functions $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}: |z|<1\}$ such that $f(0)=f'(0)-1=0$. In this paper, we introduce a new subclass $\mathcal{C}_\theta(\gamma)$ of $\mathcal{A}$ consisting of functions $f$ that satisfy the relation \[ \textrm{Re}\left(e^{i\theta}\left(1+\frac{zf''(z)}{f'(z)}\right)\right)<\left(1+\frac{\gamma}{2}\right)\cos\theta,~ z\in\mathbb{D},~ \gamma>0, ~\text{and}~|\theta|<\frac{\pi}{2},\] and investigate the Schwarzian derivative and Schwarzian norm for functions $f$ belonging to the class $\mathcal{C}_\theta(\gamma)$. We establish sharp estimates for the Schwarzian norm $\|S_f\|$ of functions $f$ in the class $\mathcal{C}_{\theta}(\gamma)$ and derive univalence criteria using both pre-Schwarzian and Schwarzian norm estimates. We also introduce a corresponding harmonic class $\mathcal{HC}_{\theta}(\gamma)$ consisting of mappings $f = h+\overline{g}$ with $h\in\mathcal{C}_{\theta}(\gamma)$ and dilatation $\omega=g'/h'\in\mathrm{Aut}(\mathbb{D})$. For this harmonic class, we derive bounds for both the pre-Schwarzian and Schwarzian norms, including sharp results in special cases.
Read the full abstract
Mathematical Physics
BC Toda chain II: symmetries. Dual picture
In the previous paper we derived Gauss-Givental integral representation for the wave functions of quantum BC Toda chain and also introduced Baxter operators for this model. In the present paper we prove commutativity of Baxter operators, as well as show that the constructed wave functions are symmetric with respect to signed permutations of spectral parameters and diagonalize Baxter operators. Furthermore, we derive Mellin-Barnes integral representation for the wave functions. With its help we show that wave functions satisfy dual system of difference equations with respect to spectral parameters and coincide with hyperoctahedral Whittaker functions. Finally, we give heuristic proofs of orthogonality and completeness of the wave functions.
Read the full abstract
Optimization and Control
Exact Cost-Increment Formula for Optimal Control of Semilinear Evolution Equations
We address optimal control of semilinear evolution equations on Banach spaces with finitely many control channels, a framework encompassing a broad class of infinite-dimensional dynamical systems, arising in many applications. For this setting, we derive an exact and global formula quantifying the increment of the cost functional with respect to an arbitrary reference control. This identity enables the design of monotone descent algorithms that require no linearization or step-size tuning. We further establish the existence of optimal controls and propose a practical sample-and-hold realization of the descent step suitable for numerical implementation. The effectiveness of the method is demonstrated on a controlled reaction-diffusion equation.
Read the full abstract
Mathematical Physics
BC Toda chain I: reflection operator and eigenfunctions
We obtain Gauss-Givental integral representation for the eigenfunctions of quantum Toda chain with boundary interaction of BC type. For this we introduce reflection operator satisfying reflection equation with DST chain Lax matrices. Besides, we define Baxter operators for BC Toda chain, prove their commutativity with Hamiltonians and derive the corresponding Baxter equation.
Read the full abstract
Commutative Algebra · Cross-listed from cs.SC
A complexity analysis of the F4 Gröbner basis algorithm with tracer data
We provide a new complexity bound for the computation of grevlex Gröbner bases in the generic zero-dimensional case, relying on Moreno-Socías' conjecture. We first formalize a property of regular sequences that implies a well-known folklore consequence, which we call the increasing degree property. We then derive a new understanding of the selection of pairs in the F4 algorithm based on Moreno-Socías' conjecture. Moreover, we obtain an exact formula for the number of elements in the grevlex Gröbner basis of a given degree, for half of the relevant degrees. Combining these results, we derive a precise complexity formula for the F4 Tracer algorithm, together with its asymptotic behavior when the number of variables tends to infinity. These results yield an improvement over the state-of-the-art complexity bounds by a factor which is exponential in the number of variables.
Read the full abstract
Category Theory · Cross-listed from cs.LO
Monoidal categories graded by partial commutative monoids
Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal category. This suggests seeing morphisms of an effectful category as carrying a grade that combines under the monoidal product in a partially defined manner. We axiomatize this idea with the notion of monoidal category graded by a partial commutative monoid (PCM). Monoidal categories arise as the special case of grading by the singleton PCM, and effectful categories arise from grading by a two-element PCM. Further examples include grading by powerset PCMs, modelling non-interfering parallelism for programs accessing shared resources, and grading by intervals, modelling bounded resource usage. We show that effectful categories form a coreflective subcategory of PCM-graded monoidal categories; introduce cartesian structure, recovering Freyd categories; and describe PCM-graded monoidal categories as monoids by viewing a PCM as a thin promonoidal category.
Read the full abstract
Complex Variables
Bohr phenomenon for certain integral operators and transforms in complex Banach spaces
In this paper, we investigate several Bohr radii associated with the Cesáro operator, Bernardi integral operator, $\beta$-Cesáro operator, and discrete Fourier transform, all defined on a set of holomorphic mappings from the unit ball of a complex Banach space into the closure of the unit polydisc $\mathbb{D}^n$ within the space $\mathbb{C}^n$.
Read the full abstract
Number Theory
Infinite extensions with finitely many CM moduli
We show that there are uncountably many algebraic extensions of $\mathbb{Q}$ containing at most finitely many moduli of CM simple principally polarized abelian varieties of any fixed dimension $g\geqslant1$, generalizing a result of Hultberg in dimension 1.
Representation Theory
On the depth of the adjoint representations
Let $F$ be a non-archimedean local field of odd residual characteristic $p$. The depth of a smooth representation of ${\rm GL}_n(F)$ is an invariant of Local Langlands Correspondence (LLC). The analogous notion on the Galois side of LLC is known as the slope of a local Galois representation. The slope is well related to the Swan conductor for irreducible Galois representations, whereas its behavior is subtle for reducible Galois representations. In this article, we provide an explicit formula for the slope of the adjoint of a Carayol representation of the local Galois group.
Read the full abstract
Probability
Upper tail large deviations for extremal eigenvalues of the real, complex and symplectic elliptic Ginibre matrices
We consider the elliptic Ginibre ensembles in the real, complex and symplectic symmetry classes. As the matrix size tends to infinity, we derive the asymptotic behaviour of the upper tail large deviation probabilities for both the spectral radius and the rightmost eigenvalue. More generally, we obtain asymptotic formulas for the probability that an eigenvalue is found in a prescribed region outside the support of the elliptic law, thereby providing a unified framework in which the results for the spectral radius and the rightmost eigenvalue appear as special cases. The key ingredient of our analysis is the precise asymptotic behaviour of the associated one-point functions, which is of independent interest.
Read the full abstract
Analysis of PDEs
Wavenumber-explicit analytic regularity of the heterogeneous Maxwell equations with impedance boundary conditions
We consider the time-harmonic Maxwell equations at a nonzero wavenumber $k\in\mathbb{C}$ on a bounded and simply connected Lipschitz domain $\Omega$ with an analytic boundary $\Gamma$, on which we impose impedance boundary conditions. We suppose that the (possibly complex-valued) permeability and permittivity tensor fields $\boldsymbol{\mu}^{-1}$ and $\boldsymbol{\varepsilon}$ are piecewise analytic in $\Omega$ and discontinuous only across certain mutually disjoint analytic surfaces inside of $\Omega$. We show that under these circumstances, any weak solution of Maxwell's equations is piecewise analytic in $\Omega$ and that the growth of its derivatives can be controlled explicitly in the wavenumber $k$.