Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 18 April
Let Ah = k[x][t; d] be the differential Ore extension. We study the action of the automorphism group of Ah on the derivations of Ah and explicitly describe, using Nowicki's decomposition of the derivations of Ah, the isotropy groups of this action. More precisely, we first obtain an explicit description of the automorphism group of Ah for deg(h) >= 1. Then we determine the isotropy groups of derivations of the form D = ad_w + Delta_s(x), which exhaust all derivations in the square-free case, that is, when gcd(h,h') = 1. In the singular case, where gcd(h,h') is not equal to 1 and special derivations of type EH appear, we show that the isotropy problem is governed by a suitable localization and by the element w* = w + psi^(-1)H, where psi = gcd(h,h'). This yields a general criterion for the isotropy of a derivation of the form D = ad_w + EH + Delta_s(x). Finally, we provide explicit examples illustrating the new phenomena that arise in this setting.
Statistics Theory
Bayesian analysis for a generalised Dirichlet process prior
A family of random probabilities is defined and studied. This family contains the Dirichlet process as a special case, corresponding to an inner point in the appropriate parameter space. The extension makes it possible to have random means with larger or smaller skewnesses as compared to skewnesses under the Dirichlet prior, and also in other ways amounts to additional modelling flexibility. The usefulness of such random probabilities for nonparametric Bayesian statistics is discussed. The posterior distribution is complicated, but inference can nevertheless be carried out via simulation, and some exact formulae are derived for the case of random means. The class of nonparametric priors provides an instructive example where the speed with which the posterior forgets its prior with increasing data sample size depends on special aspects of the prior, which is a different situation from that of parametric inference.
Read the full abstract
Mathematical Physics
On the asymptotic duality of spectral variances in random matrix theory and the "1/6" formula
A "mysterious" relation between the number variance and the variance of the $L$-th ordered eigenvalue, first suggested by French et al. [Ann. Phys. 113, 277 (1978)], is revisited and proven to be asymptotically exact for the $\beta=2$ Dyson symmetry class. Central to the proof is a previously unknown sum rule for the level spacing auto-covariances. Its derivation hinges on our previous work on the power spectrum description of eigenvalue fluctuations in random matrix theory. Analytical results for $\beta=2$ are complemented by conjectural extensions to the $\beta=1$ and $\beta=4$ symmetry classes. Our findings are corroborated by a comprehensive numerical analysis.
Read the full abstract
Combinatorics
Partial degenerate Stirling numbers
In this paper, we study some combinations of the degenerate and incomplete Stirling numbers of the second kind. We use a combinatorial approach and provide some asymptotic results.
Optimization and Control
Negative Momentum for Convex-Concave Optimization
This paper revisits momentum in the context of min-max optimization. Momentum is a celebrated mechanism for accelerating gradient dynamics in settings like convex minimization, but its direct use in min-max optimization makes gradient dynamics diverge. Surprisingly, Gidel et al. 2019 showed that negative momentum can help fix convergence. However, despite these promising initial results and progress since, the power of momentum remains unclear for min-max optimization in two key ways. (1) Generality: is global convergence possible for the foundational setting of convex-concave optimization? This is the direct analog of convex minimization and is a standard testing ground for min-max algorithms. (2) Fast convergence: is accelerated convergence possible for strongly-convex-strong-concave optimization (the only non-linear setting where global convergence is known)? Recent work has even argued that this is impossible. We answer both these questions in the affirmative. Together, these results put negative momentum on more equal footing with competitor algorithms, and show that negative momentum enables convergence significantly faster and more generally than was known possible.
Read the full abstract
Number Theory
On the normality of the concatenated Fibonacci constant
We study the concatenated Fibonacci constant $\mathcal{F} := 0.F_{1}F_{2}F_{3}\cdots = 0.11235813\cdots$, obtained by concatenating the Fibonacci numbers in the fractional part, and ask whether it is normal. We show that several classical sufficient conditions for normality by concatenation do not apply to the Fibonacci sequence because of its exponential growth, while a criterion of Pollack and Vandehey implies that the normality of $\mathcal{F}$ in base $10$ would follow if almost all Fibonacci numbers were $(\varepsilon,k)$-normal in base $10$. The Benford bias of leading digits and the Pisano periodicity of trailing digits are shown to contribute asymptotically negligible fractions of the total digits, isolating the distribution of the deep digits of large Fibonacci numbers as the remaining obstruction. Large-scale numerical experiments on the first $500{,}000$ Fibonacci numbers in bases $10$ and $2$ indicate that global single-digit counts and $k$-block statistics for $k = 2, 3, 4$ are compatible with i.i.d.-like fluctuations at the scales tested, and that a positional decomposition concentrates the visible structured deviation at the boundaries between consecutive Fibonacci numbers, while pooled interior blocks remain close to uniform. Our computations suggest that any obstruction to normality lies in the asymptotic behavior of the deep digits of $F_{n}$.
Read the full abstract
Dynamical Systems
Bucket Brigades: Uniqueness of the Fixed Point and Three-Worker Asymptotics
A standard organization of production lines exhibiting self-balancing behavior is given by bucket brigades. Their study in operations research was initiated by the foundational work of Bartholdi and Eisenstein (Operations Research, 1996), where a simplified version of the model is considered. Their main result shows that when workers are ordered from the slowest to the fastest, the system is stable and converges to a “fixed point,” where each worker oscillates between two limiting positions. They also observe that the dynamics can become highly complex when this ordering condition is not satisfied. The no-station setting, in which work is distributed continuously and uniformly along the production line, is given special attention in their work. In a subsequent paper with Bunimovich (Operations Research, 1999), they characterize all stable behaviors of this setting for up to three workers. In this work, we extend their analysis for three workers beyond the stable regime, providing a complete description when workers are ordered from the fastest to the slowest. We also show that, due to their restrictive notion of stability, some of their conclusions must be revisited. Finally, for an arbitrary number of workers, we prove that the fixed point is always unique in the no-station setting.
Read the full abstract
Information Theory
Dynamic Parameter Scheduling in Soft-Hard BPGD for Lossy Source Coding
We investigate lossy source coding based on a soft-decision belief propagation guided decimation (BPGD) encoder for low-density generator matrix (LDGM) codes, referred to as soft-hard BPGD. The performance of this encoder is highly sensitive to the choice of “softness” parameters, typically denoted by $(\beta,\mu)$, which are conventionally tuned via exhaustive empirical sweeps. To reduce this burden and to better align the algorithm with the evolving graphical structure during decimation, we introduce a dynamic scheduling framework in which $(\beta,\mu)$ are not fixed globally but change as decimation progresses. The schedule starts in a softer regime to encourage exploration and gradually hardens toward the end to promote convergence, similar to simulated annealing. We consider linear and exponential schedules, discuss their physical interpretation via an effective temperature viewpoint, and explain how they integrate with soft-hard BPGD without changing the order of magnitude of its complexity. Numerical experiments with irregular and semi-regular LDGM ensembles indicate improved rate-distortion performance and reduced non-convergence compared to constant-parameter baselines, while largely eliminating expensive grid searches for a single best pair $(\beta,\mu)$.
Read the full abstract
Optimization and Control
A model of anisotropic branched optimal transport
We propose a new anisotropic optimal transport model based on the theory of currents, where the anisotropic cost function splits as the product of a factor depending only on the spatial direction and a factor depending only on the multiplicity of the current. We prove that the planar transport problem admits a minimizer. In arbitrary dimension, we show that a minimizer exists provided that the ambient space endowed with the anisotropic norm is hypermetric.
Read the full abstract
Number Theory
The sum-product phenomenon for dense subsets of finite fields
Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality $$ \max(|A+A|, |A\cdot A|) \geq (f(\alpha) - o(1))p. $$ The proof relies on a structural result for sumsets of dense subsets, established via a regularity lemma in general finite abelian groups.
Read the full abstract
Geometric Topology
Jordan curves inscribe a positive measure of rectangles
Suppose that $\gamma \subset \mathbb{C}$ is a Jordan curve of diameter $2R$ which encloses a region of area $A$. We prove that there exists a subset $I \subset (0,\pi)$ of measure at least $A/R^2$ such that if $\theta \in I$, then there exist four points on $\gamma$ at the vertices of a rectangle whose diagonals meet at angle $\theta$.
Read the full abstract
Commutative Algebra
Regularity of Squarefree Powers of Edge Ideals of Whiskered Cycles
Let $G$ be a finite simple graph and let $I(G)$ denote its edge ideal. For $q \ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by squarefree monomials corresponding to matchings of size $q$ in $G$. We denote by $\operatorname{reg}(-)$ the Castelnuovo-Mumford regularity. Das, Roy, and Saha conjectured that if $G = W(C_n)$ is a whiskered cycle, then \[ \operatorname{reg}\big(I(G)^{[q]}\big) = 2q + \left\lfloor \frac{n - q - 1}{2} \right\rfloor ~ \text{for all } 1 \le q \le \nu(G), \] where $\nu(G)$ denotes the matching number of $G$. In this paper, we confirm this conjecture by determining the exact value of $\operatorname{reg}(I(G)^{[q]})$.
Read the full abstract
Optimization and Control
Reference Condensation for Model Predictive Control with Preview
In model predictive control (MPC), preview information can greatly improve tracking. Including preview information does, however, increase the parameter dimension linearly with the preview horizon, which increases online cost and, more importantly, the complexity of explicit MPC. We introduce reference condensation, a method that compresses a future reference trajectory into a single setpoint through a linear map. For the unconstrained tracking problem, the map follows from a least-squares projection. For receding-horizon MPC, we also study a weighted variant that prioritizes the first applied control. Numerical experiments on a double integrator and a higher-order aircraft example show that the weighted condensation closely matches full preview while keeping the parameter dimension independent of the preview horizon.
Read the full abstract
Analysis of PDEs
The Dirichlet problem for double divergence form elliptic equations with measures as boundary conditions
We introduce and study the Dirichlet problem for double divergence form elliptic equations with coefficients of low regularity and boundary conditions given by general Borel measures. Under broad assumptions we establish the solvability of this problem. It is also shown that a solution to a double divergence form equation on a domain serves as a solution to the Dirichlet problem on inner subdomains. The obtained results are applied to the study of properties of solutions to stationary Fokker–Planck–Kolmogorov equations.
Read the full abstract
Optimization and Control
Boţ-Nguyen Acceleration, Weighted Mean Ergodic Iteration, and the Beta-Binomial Distribution
In 2023, Boţ and Nguyen introduced a new class of accelerated algorithms for finding a fixed point of a nonexpansive operator as the weak limit of a sequence. In this paper, we analyze a particular instance of their algorithm when the nonexpansive operator is assumed to be linear. Surprisingly, the Boţ-Nguyen acceleration then fits naturally into the framework of weighted mean ergodic iterations. This allows us to identify the weak limit as the projection of the starting point onto the fixed point set. Moreover, the weights involved are closely related to the beta-binomial distribution. Finally, when the parameter is equal to 4, then we obtain strong convergence of the iterates.
Read the full abstract
Number Theory
Stabilization of isogeny spaces between supersingular Drinfeld modules
Let $\mathfrak{p}$ be a prime of degree $d$ in $A = \mathbb{F}_q[T]$ and let $\phi, \psi$ be supersingular Drinfeld modules of rank $r \geq 2$ in $A$-characteristic $\mathfrak{p}$. We study the $\mathbb{F}_q$-dimension of the space $M_s(\phi, \psi) = \{u \in \mathrm{Hom}(\phi, \psi) : \mathrm{deg}_\tau u \leq s\}$ as a function of $s$. By analyzing $\mathrm{Hom}(\phi, \psi)$ as a normed $A$-lattice in the local division algebra at $\infty$ via its successive minima, we obtain an exact closed-form expression for $\dim_{\mathbb{F}_q} M_s(\phi, \psi)$ valid for every $s \geq 0$, together with structural constraints on the successive-minima multiset which imply the stabilization formula $\dim_{\mathbb{F}_q} M_s(\phi, \psi) = r(s+1) - \frac{r(r-1)(d-1)}{2}$ for all $s \geq r^2(r-1)(d-1)/2$. We conjecture that the optimal threshold is $s \geq (r-1)(d-1) - 1$, and prove this sharp form for $r = 2$ by independent automorphic methods, using the decomposition of a Brandt-type theta series on the Bruhat-Tits tree of $\mathrm{PGL}_2(F_\infty)$ into Eisenstein and cuspidal parts together with the polynomiality of the cuspidal $L$-function. We also recast our results in Mornev's geometric framework, in which the conjecture becomes a cohomology-vanishing statement for a family of vector bundles on $\mathbb{P}^1$, and illustrate the theory with explicit examples in which all successive-minima multisets permitted by our constraints are realized.
Read the full abstract
Number Theory
The Limiting Distribution of Elliptic Dedekind Sums
We consider elliptic Dedekind sums that were introduced by Sczech as generalizations of the classical ones to complex lattices. We prove that these sums – suitably normalized – have a Gaussian limiting distribution. As an application, we prove a conjecture due to Ito.
Combinatorics
Wug-snake graphs and Markov numbers of matrix semigroups
Classically, Markov numbers are recovered as perfect matching numbers of domino snake graphs. We extend this correspondence by introducing weighted universal generalised snake graphs, or wug-snake graphs. These are weighted ordered bipartite graphs whose perfect matching sequences encode linear recurrences. To every wug-snake graph we associate a continuant matrix and prove that the determinant of this matrix equals the weighted perfect matching sum. We then introduce polyomino wug-tiles, bodies of wug-snake graphs that act linearly on state vectors. Every integer matrix admits a canonical polyomino wug-tile. Our main result identifies the wug-snake determinant of a tile representing a matrix $A$ with the Markov-Davenport form of $A$. Consequently, algebraic and geometric Markov numbers of matrices and matrix semigroups can be expressed as weighted perfect matching determinants. Further we define Frobenius maps for matrix semigroups and discuss examples recovering classical Markov numbers and higher-dimensional lattice realisations.
Read the full abstract
Optimization and Control
Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence
Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structured problems, these global constants can be arbitrarily conservative and fail to capture the geometry actually encountered by optimization trajectories. In this paper, we develop a trajectory-restricted framework for linear convergence based on localized geometric regularity. We introduce restricted variants of the Polyak–Łojasiewicz inequality, error bound, and quadratic growth conditions that are required to hold only on subsets of the domain. We show that classical convergence guarantees extend under these localized conditions, and in key cases, we develop new arguments that yield explicit relationships between the corresponding constants. The resulting rates are governed by geometric quantities associated with the regions traversed by the algorithm. For polyhedral composite problems, we prove that convergence is controlled by restricted Hoffman constants corresponding to the active polyhedral faces visited along the trajectory. Once the iterates enter a well-conditioned face, the effective condition number improves accordingly. Our work provides a geometric quantification for fast local convergence after active-set or manifold identification and more broadly suggests that linear convergence is fundamentally governed by the geometry of the subsets explored by the algorithm, rather than by worst-case global conditioning.
Read the full abstract
Probability · Cross-listed from cs.LG
Reference-state System Reliability method for scalable uncertainty quantification of coherent systems
Coherent systems are representative of many practical applications, ranging from infrastructure networks to supply chains. Probabilistic evaluation of such systems remains challenging, however, because existing decomposition-based methods scale poorly as the number of components grows. To address this limitation, this study proposes the Reference-state System Reliability (RSR) method. Like existing approaches, RSR characterises the boundary between different system states using reference states in the component-state space. Where it departs from these methods is in how the state space is explored: rather than using reference states to decompose the space into disjoint hypercubes, RSR uses them to classify Monte Carlo samples, making computational cost significantly less sensitive to the number of reference states. To make this classification efficient, samples and reference states are stored as matrices and compared using batched matrix operations, allowing RSR to exploit the advances in high-throughput matrix computing driven by modern machine learning. We demonstrate that RSR evaluates the system-state probability of a graph with 119 nodes and 295 edges within 10~seconds, highlighting its potential for real-time risk assessment of large-scale systems. We further show that RSR scales to problems involving hundreds of thousands of reference states – well beyond the reach of existing methods – and extends naturally to multi-state systems. Nevertheless, when the number of boundary reference states grows exceedingly large, RSR's convergence slows down, a limitation shared with existing reference-state-based approaches that motivates future research into learning-based representations of system-state boundaries.
Read the full abstract
Optimization and Control
On convergence rates of subgradient descent on semialgebraic functions
We analyze the constant step size subgradient method on nonsmooth, nonconvex functions. We identify geometric assumptions on the objective function under which i) its domain admits a partition (stratification) into smooth manifolds (strata) on which the function is smooth; ii) a global projection formula for Clarke subgradients holds; and iii) quantitative curvature bounds hold on each stratum. Under these conditions, we prove that the iterates of the subgradient method locally shadow a Riemannian gradient descent on nearby strata, which we use to measure stationarity. We introduce a selection rule for the active stratum and develop a mechanism that assembles local descent inequalities across successive strata into explicit convergence rates. These rates are expressed in terms of the number of dimensions present in the stratification, improve as the number of strata decreases, and recover, up to constants, the classical rates in the smooth case. We show that the stated assumptions follow from the existence of Lipschitz stratifications of semialgebraic sets, and are therefore automatically satisfied for semialgebraic functions and, more generally, for functions definable in polynomially bounded o-minimal structures, yielding the first known convergence rates in these settings. As intermediate results of independent interest, we establish tubular neighborhood estimates for Lipschitz stratifications and a global projection formula for Clarke subgradients. Finally, we show that our framework extends to decreasing step size and recovers, via an alternative argument, the recently announced result of Lai and Song on sequential convergence of the subgradient method with step sizes 1/k.
Read the full abstract
Number Theory
Non-liftability of Families of Abelian Varieties with Small $l$-adic Local System
We study families of abelian varieties over smooth proper curves with small $l$-adic local system over characteristic $p$. We show that such abelian schemes have a non-nef Hodge bundle and cannot be lifted to $W_2(k)$. We also establish an Arakelov-type inequality for families of abelian varieties over smooth proper curves in characteristic $p$, assuming $W_2(k)$-liftability.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Operator-Valued Hardy Spaces and Kramers–Kronig Relations for Non-Markovian Quantum Memory Kernels
Retarded support, upper-half-plane holomorphy, and Hardy boundary control are distinct properties of a memory kernel. We give sufficient conditions linking them for the Nakajima–Zwanzig kernel of an open system with finite-dimensional system Liouville space. If the projected kernel has an absolutely continuous real-axis representation with density w in L1 intersect Lp0, no singular part, and p0 > 1, its transform lies in the operator-valued Hardy class Hp(B) for 1 < p <= p0. A finite-dimensional componentwise argument yields the corresponding principal-value and once-subtracted Kramers–Kronig (KK) boundary formulas; the H1 endpoint is separate. Microscopic unitary evolution gives holomorphy and a trace-norm bound for reduced-state transforms for arbitrary trace-class initial states, without that spectral hypothesis. On a common analytic domain, a perturbative force-fit equation has a first-order quotient pole at a simple baseline state-transform zero zeta only when the first-order inhomogeneous numerator I_tilde^(1)(zeta) is nonzero; at finite perturbation the actual zero and numerator must be checked, while matrix reconstructions additionally require adjugate non-cancellation. For rational reconstructions, the printed local or global clearing and no-cancellation hypotheses convert a rational kernel pole into a genuine upper-half-plane propagator pole. Such a pole is incompatible with a uniformly bounded CPTP family when the transforms agree on an open set, with Vieta's formula giving the imaginary-part budget. We formalize these paper-specific implications in Lean 4 from named classical inputs. A finite Jaynes–Cummings calculation provides a shifted, distributional KK check with a 0.024 percent fixed-truncation residual.
Read the full abstract
Differential Geometry
Deformation rigidity for Z/2 eigensections
We prove a rigidity result for certain critical Z/2 eigensections of the Laplacian on S^2 associated to a flat real line bundle determined by a branch-point configuration. More precisely, we show that every minimal non-degenerate critical eigensection is deformation rigid: any sufficiently small deformation of the configuration that still admits a critical eigensection must come from an SO(3)-rotation. This generalizes the rigidity phenomenon previously discovered in symmetric examples of Taubes-Wu.
Read the full abstract
Quantum Algebra
Lie Quandles, Leibniz Racks and Noether's First Theorem
In [Internat. J. Theoret. Phys. 64 (2025), 73, 10 pages], Fritz was motivated by the structure of Hamiltonian/Heisenberg mechanics to define the notion of ”Lie quandle”, which he argued is a nonlinear generalization of finite-dimensional real Lie algebras. In this article, we will investigate a linear/nonlinear correspondence to which Fritz's is a special case, classify a family of generalizations of these objects, as well as describe some results in the direction of a nonlinear analogue of Noether's first theorem first described by Fritz.
Read the full abstract
Logic
Characterizing relative decidability in terms of model completeness
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that for complete theories $T$, $T$ is relatively decidable if and only if $T$ has a conservative model complete extension of the form $T \cup \{\varphi(\bar{c})\}$ where $T \models \exists \bar{x} \; \varphi(\bar{x})$. We also show that no such characterization works for incomplete theories.
Read the full abstract
Combinatorics
Hypergraphs without Subgraphs of Given Connectivity
In this paper, we study the problem of determining the maximum number $F_r(n,k)$ of edges in an $n$-vertex $r$-uniform hypergraph that contains no $(k+1)$-connected subgraph. The graph case, initiated by Mader, is a classical problem in graph theory that remains open. We first establish a limit theorem for $F_r(n,k)$ for all $k\ge r\ge 2$. As a consequence, we prove for the first time that, in Mader's problem (i.e., $r=2$), there exists a constant $c_k>0$ such that $F_2(n,k)=c_k n+O_k(1)$, and, for every $r\ge 3$, we determine $F_r(n,k)$ up to an $O(n)$ error term, thereby identifying its leading asymptotic term. We also address a related question of Carmesin by establishing a tight bound for $r$-uniform hypergraphs with no $(k+1)$-connected subgraph on more than $Ck$ vertices for any constant $C>2$ and sufficiently large $r$, and further obtain an asymptotically tight bound in the case $C=2$. Our proof combines the separator tree method introduced by Carmesin with several new combinatorial and optimization techniques, and we conclude with related remarks and open problems.
Read the full abstract
Functional Analysis
The Quaternion Boostlet Transform: Definition, Properties and Uncertainty Principles
In this article, we introduce the notion of Quaternion Boostlet Transform (QBT), a hypercomplex framework designed to unify the analysis of multi-component wavefields by merging the algebraic richness of quaternions with the relativistic, hyperbolic geometry of the boostlet system. By treating coupled physical phenomena such as acoustic pressure with particle velocity or orthogonally polarized elastic displacements as single quaternion-valued entities, the QBT preserves intrinsic geometric correlations that are typically lost in component-wise processing. We also establish a rigorous mathematical foundation for the transform, including the admissibility condition, a convolution-based representation, a Plancherel theorem for energy conservation, and an explicit inversion formula ensuring perfect signal reconstruction. Furthermore, the work derives a comprehensive set of uncertainty principles namely Heisenberg, logarithmic, and Pitt's inequalities that define the precise localization constraints of QBT coefficients in the augmented phase space. The theoretical development is substantiated with illustrative examples, wherein the QBT is applied to a quaternion-valued plane wave featuring coupled pressure-velocity components and to a Gaussian-modulated circularly polarized elastic wave packet. These examples demonstrate how the transform naturally encodes wavefront orientation and polarization state through quaternion phase, offering a physically coherent and sparse dictionary for vector-valued wavefield analysis in acoustics and seismology.
Read the full abstract
Number Theory
On Regular Higher Power Rational Diophantine Triples
A rational Diophantine $m$-tuple is a set $\{a_1,\ldots,a_m\}$ of distinct nonzero rational numbers such that $a_i a_j+1$ is a square for all $1\leq i < j\leq m$. Similarly, we may ask when $a_ia_j+1$ is a $k$-th power. Here, we study the case $k=4$ and produce some non-trivial infinite families of such triples. We show that there are infinitely many triples with positive elements for $k=4$. We also briefly consider the $k=6$ (sextic) and $k=8$ (octic) cases, explaining the difficulties in extending the method to higher exponents.
Read the full abstract
Geometric Topology
The Cayley graph of a quandle
In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we prove that for an Alexander quandle $A_t(G)$ over a finite abelian group $G$, the connected components of the Cayley graph correspond to the cosets of the subgroup $\mathrm{im}(\mathrm{id}-t)$. We also show that the Cayley graphs of generalized Alexander quandles are regular. When the defining automorphism is inner, we give an explicit description of the forward orbits and prove that the connected components correspond to cosets of the subgroup generated by commutators with the defining element.