Commutative Algebra
Cohen-Macaulay and Gorenstein Properties of Bi-Amalgamated Algebras with Applications to Algebroid Curves
Efe Gürel and Abuzer Gündüz
Let $A \bowtie^{f,g} (J,J')$ be the bi–amalgamation of a commutative ring $A$ with $(B,C)$ along the ideals $(J,J')$ with respect to the ring homomorphisms $(f,g)$. In this article, we study the basic homological properties of the bi–amalgamated
algebra construction. We first calculate the dimension and depth of the bi–amalgamated
algebra under fairly general circumstances and derive necessary and sufficient conditions for Cohen–Macaulayness in terms of maximal and big Cohen–Macaulay modules of $A$. Furthermore, we characterize the Gorenstein property of the bi–amalgamated
algebra through the canonical modules of $f(A)+J$ and $g(A)+J'$. We apply our results to the theory of curve singularities by constructing Gorenstein algebroid curves through bi–amalgamated and amalgamated
algebras. We also give a brief remark concerning the universally catenary property of $A\bowtie^{f,g}(J,J')$.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Learning to Shuffle: Block Reshuffling and Reversal Schemes for Stochastic Optimization
Lam M. Nguyen, Dzung T. Phan and Jayant Kalagnanam
Shuffling strategies for
stochastic gradient descent (SGD), including incremental gradient, shuffle-once, and random reshuffling, are supported by rigorous convergence analyses for arbitrary within-epoch permutations. In particular, random reshuffling is known to improve optimization constants relative to cyclic and shuffle-once schemes. However, existing theory offers limited guidance on how to design new data-ordering schemes that further improve optimization constants or stability beyond random reshuffling. In this paper, we design a pipeline using a large
language model (LLM)-guided program
evolution framework to discover an effective shuffling rule for without-replacement SGD. Abstracting from this instance, we identify two fundamental structural components: block reshuffling and paired reversal. We analyze these components separately and show that block reshuffling strictly reduces prefix-gradient variance constants within the unified shuffling framework, yielding provable improvements over random reshuffling under mild conditions. Separately, we show that paired reversal symmetrizes the epoch map and cancels the leading order-dependent second-order term, reducing order sensitivity from quadratic to cubic in the step size. Numerical experiments with the discovered
algorithm validate the theory and demonstrate consistent gains over standard shuffling schemes across convex and nonconvex
benchmarks.
Read the full abstract ▾
Dynamical Systems
Smoothness of Markov Partitions for Expanding Toral Endomorphisms
Chayce Hughes and Huub de Jong
We show that an expanding toral endomorphism admits a Markov partition with a piecewise smooth boundary if and only if some power of the inducing
matrix is diagonalizable and all of its
eigenvalues are integers. Moreover, such a piecewise smooth boundary must in fact be piecewise linear. In dimension 2, we make some more subtle observations about the smoothness of the boundary. We also provide an upper bound on the Hausdorff dimension.
Read the full abstract ▾
Group Theory
The Mereon System, the 600-Cell, and the Exceptional Algebras $E_6$, $E_7$, $E_8$: Exact Correspondence via $H_3 \subset H_4$ Symmetry and the Eigenform Loop
Robert W. Gray, Lynnclaire Dennis and Louis H. Kauffman
This work concerns how the three-dimensional polyhedral Mereon structure (the 120 polyhedron) is the precise projection from four-space of the 600-
cell, an analogue in four-dimensional space of a regular solid. The 600-
cell is made from 120 copies of a dodecahedron that are fitted together so that each dodecahedral face is matched to the face of another dodecahedron (much as the pentagonal faces of the dodecahedron are matched along their edges). Thus this essential part of the Mereon structure is a projection from a higher-dimensional space of an even more symmetrical entity. The theme that three-dimensional structures, earthly structures, networked structures, structures involved in our understanding and communication, would be or should be seen as projections from a higher-dimensional whole is part of perennial philosophy. Here we are seeing an instantiation of this theme and the dreams with which it is allied. The 600-
cell and its associated geometries have been studied for some time by mathematicians and by physicists for relations with geometry,
topology,
knot theory, particle physics and even cosmology and string theory. It is more than exciting that there is a direct connection of the Mereon System with the 600-
cell and the wide-ranging conversation with which it is associated. We expect much more from this connection as the search goes on. The present paper makes this connection precise. We establish the exact correspondence between the Mereon System and the 600-
cell, and show how the nested architecture realises all three exceptional Lie
algebras $E_6$, $E_7$, $E_8$.
Read the full abstract ▾
Mathematical Physics · Cross-listed from eess.SY
Dissipation-assisted stabilization of periodic orbits via actuated exterior impacts in hybrid mechanical systems with symmetry
William Clark, Leonardo Colombo and Anthony Bloch
Impulsive mechanical systems exhibit discontinuous jumps in their state, and when such jumps are triggered by spatial events, the geometry of the impact surface carries information about the controllability of the hybrid dynamics. For mechanical systems defined on principal $G$-bundles, two qualitatively distinct types of impacts arise: interior impacts, associated with events on the shape space, and exterior impacts, associated with events on the fibers. A key distinction is that interior impacts preserve the mechanical connection, whereas exterior impacts generally do not. In this paper, we exploit this distinction by allowing actuation through exterior impacts. We study the pendulum-on-a-cart system, derive controlled reset laws induced by moving-wall impacts, and analyze the resulting periodic motions. Our results show that reset action alone does not provide a convincing stabilizing regime, whereas the addition of dissipation in the continuous flow yields exponentially stable periodic behavior for suitable feedback gains.
Read the full abstract ▾
Analysis of PDEs
Applications of renormalisation to orthonormal Strichartz estimates and the NLS system on the circle
Sonae Hadama and Andrew Rout
In this paper, we introduce a renormalisation procedure for the density associated with the system of nonlinear Schrödinger equations (NLSS) on a circle. We show that this renormalised density satisfies better orthonormal Strichartz estimates than the non-renormalised density, which was considered in Nakamura (2020). As an application, we determine the critical Schatten exponent below which the cubic renormalised NLSS on the circle is globally well-posed and above which it is ill-posed. Finally, we show that the improvement for orthonormal Strichartz estimates satisfied by the renormalised density on $\mathbb{T}^d$ for $d \ge 2$ is minimal.
Read the full abstract ▾
Combinatorics
Deficit and $(q,t)$-symmetry in triangular partitions
Viviane Pons and Loïc Le Mogne
We study the $(q,t)$-enumeration of triangular Dyck paths considered by Bergeron and Mazin. To do so, we introduce the notion of triangular and sim-sym tableaux and the deficit statistic which is a new interpretation of the dinv. We use it to obtain new results and proofs on triangular $2$-partitions and an interesting
conjecture for a certain
lattice interval $(q,t,r)$-enumeration.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
Softmax gradient policy for variance minimization and risk-averse multi armed bandits
Gabriel Turinici
Algorithms for the Multi-Armed Bandit (MAB) problem play a central role in sequential decision-making and have been extensively explored both theoretically and numerically. While most classical approaches aim to identify the arm with the highest expected reward, we focus on a risk-aware setting where the goal is to select the arm with the lowest variance, favoring stability over potentially high but uncertain returns. To model the decision process, we consider a softmax parameterization of the policy; we propose a new
algorithm to select the minimal variance (or minimal risk) arm and prove its convergence under natural conditions. The
algorithm constructs an unbiased estimate of the objective by using two independent draws from the selected arm's distribution. We provide numerical experiments that illustrate the practical behavior of these
algorithms and offer guidance on implementation choices. The setting also covers general risk-aware problems where there is a trade-off between maximizing the average reward and minimizing its variance.
Read the full abstract ▾
Mathematical Physics
Local Rank-One Logarithmic Instability for the Mixed Hessian of the Dispersionless Toda $\tau$-Function
Oleg Alekseev
We study a weighted renormalization of the mixed Hessian of the dispersionless Toda $\tau$-function associated with
polynomial conformal maps. The starting point is an explicit logarithmic-kernel representation, which yields a decomposition of the Hessian into
symmetry blocks and reduces the spectral analysis to the inverse-map generating function $U(x;\zeta)$ and the geometry of its dominant singularities. Near a transversal subcritical approach to a simple analytic critical point, we identify a rank-one logarithmic spectral instability: in each renormalized
symmetry block, exactly one variational
eigenvalue diverges logarithmically, whereas the remaining variational
eigenvalues stay bounded. The proof isolates the analytic mechanism behind this transition in the emergence of a dominant $s$-orbit of simple square-root branch points of the Taylor branch of the inverse map. We then apply the same framework to reduced
Laplacian-growth trajectories and show that the same spectral transition occurs there under the same local continuation hypotheses. If, in addition, the reduced map remains univalent at the spectral crossing, then this transition occurs before
geometric breakdown. The result is local and conditional: it identifies the mechanism of the first instability and formulates an abstract criterion for extensions beyond the
polynomial class.
Read the full abstract ▾
Optimization and Control
Deception in Linear-Quadratic Control
Yerin Kim, Haosheng Zhou, Alexander Benvenuti et al. (+2 more)
Systems operating in
adversarial environments may inadvertently leak sensitive information to adversaries. To address this challenge, we revisit the linear-quadratic control framework and introduce deception to actively mislead adversaries. Specifically, we consider a blue-team
agent, observed by a red-team
agent, that seeks to minimize a quadratic cost while introducing perturbations to its trajectories over time. These perturbations are designed to corrupt the red team's observations and, consequently, any downstream inferences, while remaining undetected by a red team using sequential hypothesis testing. We implement this idea by augmenting the blue team's quadratic cost with a likelihood ratio statistic. Under this augmented control problem, we derive a semi-explicit solution for the optimal deceptive control law and establish corresponding well-posedness results. In addition, we provide both numerical approximations and analytical bounds for the probability that the red team detects the blue team's deceptive strategies. Numerical results demonstrate the effectiveness of the proposed framework in deceiving the red team while remaining undetected with probability near 1.
Read the full abstract ▾
All authors Yerin Kim, Haosheng Zhou, Alexander Benvenuti, Ruimeng Hu, Matthew Hale
Optimization and Control
Risk-averse optimization under distributional uncertainty with Rockafellian relaxation
Harbir Antil, Alonso J. Bustos, Sean P. Carney et al. (+1 more)
A framework for risk-averse optimization problems is introduced that is resilient to ambiguities in the true form of the underlying probability distribution. The focus is on problems with partial differential equations (PDEs) as constraints, although the formulation is more broadly applicable. The framework is based on combining risk measures with problem relaxation techniques, and it builds off of previous advances for risk-neutral problems. This work advances the existing theory with strengthened $\Gamma$-convergence results, novel existence results and first-order optimality criteria. In particular, the theoretical approach naturally accommodates infinite-dimensional probability spaces; no finite-dimensional noise assumption is needed. The framework blends aspects of both distributionally robust optimization (DRO) and distributionally optimistic optimization (DOO) approaches. The DRO aspect facilitates strong out-of-sample performance, while the DOO aspect takes care of
adversarial and outlier data, as illustrated with numerical examples.
Read the full abstract ▾
All authors Harbir Antil, Alonso J. Bustos, Sean P. Carney, Benjamín Venegas
Optimization and Control
Parametric Region Search: A Mixed-Integer Bilevel Optimization Problem Primal Heuristic
Meng-Lin Tsai, Parth Brahmbhatt and Styliani Avraamidou
Bilevel optimization is a mathematical modeling formulation for hierarchical systems and two-player interactions, with wide-ranging applications in environmental, energy, and control engineering. Despite its utility, the mixed-integer bilevel optimization (MIBO) problem is exceptionally challenging to solve. While numerous exact and metaheuristic methods exist, the development of specialized primal heuristics for MIBO, aimed at quickly identifying high-quality feasible solutions, remains an underexplored area. This paper introduces the Parametric Region Search (PRS), a new primal heuristic for MIBO. The PRS method leverages insights from multi-parametric optimization by iteratively exploring regions defined by the lower-level problem's critical regions. We formally define the MIBO structure and the necessary parametric region formulations, and then detail the proposed heuristic's initialization and iterative search mechanism. Computational results demonstrate that the PRS heuristic consistently locates high-quality primal solutions compared to established derivative-free metaheuristics, including DOMINO-COBYLA and DOMINO-ISRES. Furthermore, we illustrate how the PRS can be effectively integrated with other heuristics like DOMINO-COBYLA to enhance the overall solution discovery process for MIBO.
Read the full abstract ▾
Numerical Analysis
An unfitted HDG method for a distributed optimal convection-diffusion control problem
Esteban Henríquez and Manuel Solano
We analyze a high order unfitted hybridizable discontinuous Galerkin (HDG) method for an optimal control problem governed by a convection-
diffusion equation posed in a domain with piecewise-wise $\mathcal{C}^2$ boundary $\partial \Omega$. The computational domain $\Omega_h$ does not necessarily fit $\Omega$ and the Transfer Path Method (TPM) is used to transfer the boundary data from $\partial \Omega$ to $\partial \Omega_h$ through segments of direction $\boldsymbol{m}$. Under closeness conditions between $\partial \Omega_h$ and $\partial \Omega$ and on the transfer vector $\boldsymbol{m}$, we prove optimal order of convergence in the $L^2$-norm for all variables of the state and adjoint problems. We also show numerical examples to complement the theory.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
Query Learning Nearly Pauli Sparse Unitaries in Diamond Distance
Zahra Honjani and Mohsen Heidari
We study the problem of learning nearly $(s,\epsilon)$-sparse
unitaries, meaning that the Pauli spectrum is concentrated on at most $s$ components with at most $\epsilon$ residual mass in Pauli $\ell_1$-norm. This class generalizes well-studied families, including sparse
unitaries,
quantum $k$-juntas, $2^k$-Pauli dimensional channels, and compositions of depth $O(\log\log n)$
circuits with near-Clifford
circuits. Given query access to an unknown nearly sparse
unitary $U$, our goal is to efficiently (both in time and query complexity) construct a
quantum channel that is close in diamond distance to $U$. We design a learning
algorithm achieving this guarantee using $\tilde{O}(s^6/\epsilon^4)$ forward queries to $U$, and running time
polynomial in relevant parameters. A key contribution is an efficient
quantum algorithm that, given query access to an arbitrary unknown
unitary $U$, estimates all Pauli coefficients (up to a shared global phase) whose magnitude exceeds a given threshold $\theta$, extending existing sparse recovery techniques to general
unitaries. We also study the broader class of
unitaries with bounded Pauli $\ell_1$-norm. For that class, we prove an exponential query lower bound $\Omega(2^{n/2})$. We introduce a more relaxed accuracy metric which is the diamond distance restricted to a set of input states. Then, we show that, under this metric,
unitaries with Pauli $\ell_1$-norm uniformly bounded by $L_1$ are learnable with $\tilde{O}(L_1^8/\epsilon^{16})$.
Read the full abstract ▾
Statistics Theory
One-step TMLE for weighted average treatment effects
Yang Liu, Patrick Lopatto and Ivana Malenica
We consider Targeted Maximum Likelihood Estimation (TMLE) of weighted average treatment effects (WATEs), a class of causal estimands that reweight the
covariate distribution using a specified function of the propensity score. This class includes the average treatment effect and average treatment effect on the treated, as well as various overlap-based targets. We provide a comprehensive analysis of the one-step TMLE along the universal least favorable path for such parameters. Under explicit regularity conditions on the weight function and initialization, we show that the targeting procedure is well-defined, reaches a solution of the estimating equation in finite time, and yields an asymptotically efficient
estimator. In particular, convergence of the targeting dynamics and control of the second-order remainder are derived from these conditions rather than imposed as separate assumptions on the output of the
algorithm.
Read the full abstract ▾
Logic
Marby Zuley Bolaños Ortiz, Luz Victoria De La Pava and Ciro Russo
We propose a point-free approach to MV-topological spaces in the wake of previous works on both classical and fuzzy
topology. In order to do that, we introduce suitable frame-type structures and a class of fuzzy topological spaces which includes and suitably extends the one of MV-topological spaces. Then we show an adjoint situation between such structures, and restrict such an adjointness to a duality between the corresponding classes of “spatial frames” and “sober spaces”. We also use neighbourhood systems to characterize sobriety in this context.
Read the full abstract ▾
Differential Geometry
Gradient systems and asymmetric relaxations in view of Riemannian geometry
Alessandro Bravetti, Miguel Ángel García Ariza and José Roberto Romero-Arias
In dually flat
manifolds, there is a deep connection between gradient flows and pregeodesics. This was one of the many important contributions of Amari to information geometry. In this paper, we extend the study of this relationship to general Riemannian
manifolds. Our result does not impose conditions of flatness on the connection or
symmetry on its non-metricity tensor, thus broadening the
geometric setting beyond Hessian
manifolds. Within this framework, we provide a criterion for comparing relaxation along two different gradient descent curves of a function, formulated in terms of the non-metricity tensor of a connection for which the gradient curves are pregeodesics. We use it to study Gaussian chains, whose relaxation trajectories coincide with gradient descent curves in the space of Gaussian distributions.Thus, we recover a recent result that establishes a universal asymmetry: warming up is faster than cooling down. Our work illustrates how
geometric insights rooted in Amari's legacy offer new perspectives for optimization problems and
stochastic processes.
Read the full abstract ▾
Probability
Stochastic control with dividend payments and capital injections for Markov additive processes
Kei Noba
Motivated by de Finetti's optimal dividend problem with capital injections, we study a
stochastic control problem for the additive component of a Markov additive process (MAP). In contrast to previous studies, the modulating component is allowed to be a general right process on a Radon space, so the model is not restricted to finite-state regime switching and cannot in general be reduced to a finite collection of Lévy process control problems. Capital injections are allowed at arbitrary times. We first consider the case in which dividend payments are allowed only at prescribed discrete times and establish necessary and sufficient conditions for the optimality of a strategy. These conditions then yield the optimality of a class of Markov-modulated periodic–classical barrier strategies. Combining this optimality result with an approximation argument, we obtain insight into the possible form of optimal strategies in the case where dividend payments, like capital injections, may be made at arbitrary times. Because of the generality of the MAPs considered here, the proof techniques used in previous studies of similar problems are not directly applicable. We therefore develop an alternative argument based on the additive structure of MAPs and dynamic programming between dividend opportunities. The argument also suggests a possible approach to other
stochastic control problems involving general MAPs.
Read the full abstract ▾
Combinatorics
Two-Orbit Polytopes
Isabel Hubard and Egon Schulte
Abstract polytopes are combinatorial structures with distinctive
geometric, algebraic, or topological characteristics, that generalize (the face
lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on abstract polytopes with the highest possible
symmetry, in particular those that are regular or
chiral. In this paper we study two-orbit polytopes, that is, abstract polytopes whose
automorphism groups have exactly two orbits on flags. Such polytopes of rank $n$ fall into $2^n-1$ classes, determined by their local flag configuration. We develop a general structural theory of two-orbit polytopes of arbitrary rank. In particular, we determine their face- and section-transitivity properties and describe the structure of their
automorphism groups via distinguished generating sets and face stabilizer subgroups. These results yield a characterization of the partial order { on the polytope} in terms of the
automorphism group. Two-orbit polytopes in different classes behave quite differently. Our approach extends the group-theoretic framework for regular and
chiral polytopes and provides a systematic foundation for the study of polytopes with two flag orbits.
Read the full abstract ▾
Number Theory
Supersingular isogeny graphs and Hecke modules with level structure
Leonardo Colò and David Kohel
We study supersingular isogeny graphs with level structure and their associated Galois representations.
Algebraic Geometry
Conformal blocks in algebraic geometry
Chiara Damiolini
These notes survey the theory of (twisted) conformal blocks from an algebro-
geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator
algebras, and to describe their fundamental properties – such as factorization and sewing – which imply that conformal blocks define vector bundles on
moduli spaces of curves whose ranks and Chern classes can be computed explicitly. The second aim is to describe how line bundles on
moduli of principal bundles over a curve – and their sections – can be understood via (twisted) conformal blocks for (twisted) affine Lie
algebras.
Read the full abstract ▾
Optimization and Control
Sparse Copositive Polynomial Optimization
Suhan Zhong, Jinling Zhou, Jiawang Nie et al. (+1 more)
This paper studies the copositive optimization problem whose objective is a sparse
polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions are shown for these relaxations to be tight. In particular, we prove they are tight under the cop-SOS convexity assumption. Compared to the traditional dense ones, the sparse Moment-SOS relaxations are more computationally efficient. Numerical experiments are given to show the efficiency.
Read the full abstract ▾
All authors Suhan Zhong, Jinling Zhou, Jiawang Nie, Xindong Tang
Optimization and Control
Stratified adaptive sampling for derivative-free stochastic trust-region optimization
Giovanni Amici, Sara Shashaani and Pranav Jain
There is emerging evidence that trust-region (TR)
algorithms are very effective at solving derivative-free nonconvex
stochastic optimization problems in which the objective function is a Monte Carlo (MC) estimate. A recent strand of methodologies adaptively adjusts the sample size of the MC estimates by keeping the estimation error below a measure of stationarity induced from the TR radius. In this work we explore stratified adaptive sampling strategies to equip the TR framework with accurate estimates of the objective function, thus optimizing the required number of MC samples to reach a given {\epsilon}-accuracy of the solution. We prove a reduced sample complexity, confirm a superior efficiency via numerical tests and applications, and explore inexpensive implementations in high dimension.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.flu-dyn
Distinct transverse-response signatures of retained-spin, eliminated-spin, and polynomial Burnett-type surrogate closures
Satori Tsuzuki
High-
curvature observables in incompressible flows, including $k^4$-weighted spectra, can arise from explicit internal rotation, elimination of a fast
spin variable, or
polynomial higher-gradient closure. Building on a retained-
spin micropolar closure derived separately from the Boltzmann–Curtiss equation, we show that these mechanisms are dynamically distinguishable in transverse linear response. In a fast-
spin regime the retained-
spin theory reduces to a one-field model with a rational $k$-dependent kernel whose low-$k$ expansion generates $k^4$ and $k^6$ terms, while preserving the large-$k$ roll-off of the eliminated degree of freedom. We compare four closures: incompressible Navier–Stokes, a
polynomial Burnett-type surrogate, the explicit-
spin micropolar theory, and the eliminated-
spin rational-kernel theory. The explicit-
spin theory has two poles, the eliminated-
spin theory retains only the slow pole, and finite
polynomial truncations fail qualitatively: a strict $k^4$ truncation becomes over-damped, while a matched $k^6$ truncation develops near-critical amplification and finite-$k$ instability. Many-particle event-driven simulations of perfectly rough spheres show that these observables are measurable and, in targeted campaigns, discriminating at the microscopic level: fixed-$k$ and multi-$k$ harmonic forcing resolve a finite
spin-to-vorticity phase lag that strongly favors retained-
spin dynamics over instantaneous adiabatic elimination, while the stronger-drive multi-$k$ vorticity response rejects a pure $k^2$ closure and favors the rational eliminated-
spin kernel over a
polynomial surrogate. Transverse response thus provides a practical diagnostic for separating retained rotational microphysics, eliminated-
spin effective dynamics, and ordinary
polynomial higher-gradient closures.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Thermodynamics of dynamical black holes beyond perturbation theory
Abhay Ashtekar, Daniel E. Paraizo and Jonathan Shu
The close similarities of the three laws of black hole mechanics, discovered by Bardeen, Carter and Hawking, with the laws of thermodynamics led to the identification of a multiple of the area of the event horizon with
entropy. However, developments over the past two decades have shown that this paradigm has some important limitations, especially because of the teleological nature of event horizons. After a brief review of these limitations, we will show that they can be overcome using quasi-local horizons. Specifically, the new first law applies to black holes in general relativity that can be arbitrarily far from
equilibrium and refers to finite changes that occur due to physical processes at the horizon. The second law is now a quantitative statement that relates the change in the area of a dynamical horizon segment due to fluxes of energy falling into the black hole. Together, they lead one to identify black hole
entropy with the area of marginally trapped surfaces in quasi-local horizons, generalizing recent perturbative findings that it should be identified not with the area of the event horizon but with the area of a marginally trapped surface inside it.
Read the full abstract ▾
Mathematical Physics
Symmetric Nonlinear Cellular Automata as Algebraic References for Rule 30
E. Chan-López and A. Martín-Ruiz
A comparative algebraic framework for elementary cellular automata is developed, centered on the role of spatial
symmetry. The primary object of study is Rule 22, the elementary cellular automaton with algebraic normal form $g(a,b,c)=a\oplus b\oplus c\oplus abc$ over $\mathrm{F}_2$, the simplest rule combining full $S_3$
symmetry with genuine nonlinearity. It is proved that the single-seed orbit of Rule 22 admits the closed form $Q_{2j}(x)=(x^2+x^{-2})^j$ and $Q_{2j+1}(x)=(x^{-1}+1+x)(x^2+x^{-2})^j$ for the row generating
polynomials over $\mathrm{F}_2$. Three consequences follow: an exact support-set cardinality $|S_m|=2^{\mathrm{popcount}(\lfloor m/2\rfloor)}\cdot 3^{m\bmod 2}$, a two-step recursive construction of the support sets, and, in a formal continuum approximation, a
parabolic reaction–
diffusion equation $\partial_m u=u_{xx}+2u+u^3$. Rule~22 is then used as a symmetric reference for Rule 30. The
symmetry-breaking deviation $\epsilon(m)=|S_m^{(30)}|-|S_m^{(22)}|$ between full-row support cardinalities is empirically consistent with a power law $m^b$ ($b\approx 1.11$), and is non-positive exactly at the Mersenne indices $m=2^k-1$. A mechanism for the apparent randomness of Rule~30's center column is identified through the left-permutive structure and asymmetric Boolean sensitivity profile.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Sine-Gordon solitons in AdS, dS and other hyperbolic spaces
E.T. Akhmedov and D.V. Diakonov
We find infinitely many
soliton-like solutions in a deformation of the sine-Gordon theory in $(d+1)$-dimensional $AdS_{d+1}$ (anti-de Sitter) spacetime for $d \geq 2$, as well as single solitonic solutions in $dS_{d+1}$ (de Sitter) and $\mathrm{H}{d+1}$ (Lobachevsky) spaces for $d \geq 1$ and in $AdS_2$. We also find a deformation of the kink solution in scalar field theory with a
polynomial potential in $AdS_2$. The deformation of the sine-Gordon theory strikingly resembles the bosonic part of the flat-space supersymmetric sine-Gordon theory. In the infinite radius limit, single
soliton solutions reduce to
solitons in flat space. Meanwhile, the multisoliton solution of $AdS{d+1}$, $d\geq 2$ for certain values of the parameters reduces in the same limit to a single
soliton solution boosted in the normal direction. However, there are also multisoliton solutions in $AdS_{d+1}$, $d \geq 2$ that do not have a flat space limit.
Read the full abstract ▾
Numerical Analysis · Cross-listed from physics.optics
Bent optical waveguide finite element analysis with a 3D envelope Maxwell model
Jaime Mora-Paz, Stefan Henneking, Leszek Demkowicz et al. (+1 more)
With the goal of accurately extracting the optical field losses in a three-dimensional (3D), circularly coiled waveguide (e.g., bent optical fiber), this effort presents the numerical methodologies that are implemented for an envelope Maxwell model that propagates electromagnetic fields as an entirely boundary value problem. Our unique modeling approach includes an ultraweak variational formulation of the envelope Maxwell model in the curved geometry of the bending, which is discretized by the discontinuous Petrov-Galerkin (DPG) method, which permits residual-driven mesh and
polynomial-order adaptivity. This also, then, requires a unique approach for constructing perfectly matched layers (PMLs) as absorbing boundary conditions in both the direction of optical field propagation and in the tangential directions, where unguided energy escapes the waveguide. Our coiled waveguide modeling technology extracts the mode confinement losses from the propagation of the coherent optical field through the bent waveguide. We verify our simulations against the semi-analytical results from the analogous bent slab waveguide problem, and we successfully demonstrate stable convergence to loss values for the 3D coiled optical fiber problem, which has never been done previously for our specific modeling approach.
Read the full abstract ▾
All authors Jaime Mora-Paz, Stefan Henneking, Leszek Demkowicz, Jacob Grosek
Numerical Analysis
The high-order finite element Duffy de Rham complex and low-order-refined preconditioning
Will Pazner
In this work, we construct high-order finite element spaces for the $L^2$ de Rham complex on triangular meshes amenable to low-order-refined preconditioning. The spaces are constructed using the Duffy transformation, by pulling back appropriately chosen
polynomial spaces defined on the unit square; in addition to piecewise
polynomials, these spaces also contain certain rational functions, and they reduce to the standard Lagrange, Nédélec, and discontinuous finite elements in the lowest-order case. We establish spectral equivalence, independent of the
polynomial degree, of the stiffness
matrices defined on these spaces with the lowest-order stiffness
matrices defined on refined meshes, constructed using a Gauss-Lobatto triangular
lattice. Spectral equivalence of the operators is a consequence of norm equivalences in Jacobi-weighted $L^2$ norms, which are established by proving stability of the Jacobi-Gauss-Lobatto interpolation operator in shifted norms. The low-order-refined preconditioners can also be used to precondition the standard piecewise
polynomial finite element spaces using a fictitious space approach. The low-order-refined system can in turn be preconditioned effectively using algebraic multigrid methods. The analytical estimates are confirmed by numerical results on a variety of high-order problems, including on mixed meshes and surface meshes.
Read the full abstract ▾
Geometric Topology
Monodromy Representations of Mixed Braid Groups
Chitrabhanu Chaudhuri and Saswati Mukherjee
We explicitly describe
unitary representations of mixed braid groups on the
cohomology of Abelian branched covers of $\mathbf{CP}^1$ . We show that the image of the representation is generated by complex reflections and relate it to the multivariate Burau representation.