Probability · Cross-listed from cs.LO
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of statistical reasoning and, by extension, in reasoning about computing systems that are based on statistical inference such as probabilistic programing languages, programs with optimisation, and machine learning components. However, there is no general theory of CLT-like results currently, which forces practitioners to redo proofs without having a good handle on the essential ingredients of CLT-type results. In this paper, we introduce dilated seminorm-enriched category theory as a unifying framework for central limits, and we establish an abstract central limit theorem within that framework. We illustrate how a strengthened version of the classical CLT and the law of large numbers can be obtained as instances of our framework. Moreover, we derive from our framework a novel central limit theorem for symplectic manifolds, the CLT for observables, which finds applications in statistical mechanics.
Combinatorics
Sampling Colorings with Fixed Color Class Sizes
In 1970 Hajnal and Szemerédi proved a conjecture of Erdös that for a graph with maximum degree $\Delta$, there exists an equitable $\Delta+1$ coloring; that is a coloring where color class sizes differ by at most $1$. In 2007 Kierstand and Kostochka reproved their result and provided a polynomial-time algorithm which produces such a coloring. In this paper we study the problem of approximately sampling uniformly random equitable colorings. A series of works gives polynomial-time sampling algorithms for colorings without the color class constraint, the latest improvement being by Carlson and Vigoda for $q\geq 1.809 \Delta$. In this paper we give a polynomial-time sampling algorithm for equitable colorings when $q> 2\Delta$. Moreover, our results extend to colorings with small deviations from equitable (and as a corollary, establishing their existence). The proof uses the framework of the geometry of polynomials for multivariate polynomials, and as a consequence establishes a multivariate local Central Limit Theorem for color class sizes of uniform random colorings.
Read the full abstract
Complex Variables
Kleinian hyperelliptic funtions of weight 2 associated with curves of genus 2
We introduce a new collection of special functions associated to a complex curve of genus 2 similar to Kleinian hyperelliptic $\sigma$-function. These functions are related to weight 2 $\theta$-functions in the same fashion as $\sigma$-function is related to the classical $\theta$-function. A key feature of the introduced functions is the fact that they are well-defined for genus 2 algebraic curves without any restrictions (in particular it is not needed to assume that the curve has a Weierstrass point at infinity).
Read the full abstract
Complex Variables
The Levi problem over generalized Hirzebruch manifolds
We review classical methods to solve the Levi problem in the presence of symmetries, established by Hirschowitz and by Grauert-Remmert-Ueda. We then illustrate these methods by solving the Levi problem in some new situations, namely generalized Hirzebruch manifolds and primary Hopf surfaces of non-diagonal type.
Read the full abstract
Information Theory
Capacity of Non-Separable Networks with Restricted Adversaries
This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set bounds are no longer tight, and achieving capacity typically requires a joint design of the outer code and the inner (network) code. This stands in sharp contrast with the case of unrestricted adversaries, where capacity can be achieved by combining linear network coding with appropriate rank-metric outer codes. Building on the framework of network decoding, we determine the exact one-shot capacity of one of the fundamental families of 2-level networks introduced in [4], and we improve the best currently known lower bounds for another such family. In addition, we introduce a new family of networks that generalizes several known examples, and derive partial capacity results that illustrate a variety of phenomena that arise specifically in the restricted-adversary setting. Finally, we investigate the concept of separability of networks with respect to both the rank metric and the Hamming metric.
Read the full abstract
Algebraic Geometry
Heights on toric varieties for singular metrics: Global theory
In this paper, we develop a toric analog of the theory of adelic divisors on quasi-projective arithmetic varieties introduced by Yuan and Zhang, and extend the convex-analytic descriptions of the Arakelov geometry of projective toric arithmetic varieties given by Burgos, Philippon, and Sombra. Our main result is that the arithmetic self-intersection number of a semipositive toric adelic divisor is given by the integral of a concave function on a compact convex set. These generalized arithmetic intersection numbers coincide with the ones introduced by Burgos and Kramer in 2024, and therefore, can be used to compute heights of toric arithmetic varieties with respect to line bundles equipped with toric singular metrics.
Read the full abstract
History and Overview of Mathematics
Hyperbolic elliptic parabolic disks approximated by half distance bands
Hyperbolic elliptic parabolic disks can be described by the inequality $\frac{x^2}{C^2}+2y^2-2y\leq0$ ($0<C<1$) in the unit disk based Beltrami–Cayley–Klein model of the hyperbolic geometry, up to hyperbolic congruences. The hyperbolic elliptic parabolic disks considered above are sort of close to their supporting half distance bands given by the inequalities $\frac{x^2}{C^2}+ y^2-1\leq0$ and $y\geq0$. Here we consider what `close' might mean, and we look for even more precise approximations, in terms of area and circumference.
Read the full abstract
Numerical Analysis
Caveats on formulating finite elasto-plasticity in curvilinear coordinates
Tensor analysis provides a frame-invariant foundation for continuum mechanics, yet numerical implementations rely on matrix representations expressed in user-selected bases. When these bases are non-Cartesian and non-orthonormal, additional terms arise that are normally absent or implicit in Cartesian formulations. Using cavity expansion as an initial model problem, this paper clarifies the roles of the deformation gradient, Jacobian, and shifter in finite-strain kinematics under axisymmetry. These quantities, typically straightforward in Cartesian frames, require more careful treatment in curvilinear coordinates, particularly in applications involving large deformations where axisymmetric reductions provide substantial computational savings. The formulation is further complicated when anelastic effects are included: the elastic and anelastic components of the deformation gradient and Jacobian must be distinguished, and the Cauchy stress depends on configuration changes beyond the current elastic state. This increases the complexity of the consistent linearisation required for finite element implementation. The paper provides a clear, step-by-step procedure for handling these contributions. The focus is practical rather than geometric. Instead of adopting a differential-geometric manifold framework, we work within standard Cartesian representations and use explicit changes of basis to obtain the required curvilinear forms. The resulting methodology enables robust finite element analysis of axisymmetric elasto-plastic problems undergoing finite strains.
Read the full abstract
Analysis of PDEs
An asymptotic model of Poisson–Nernst–Planck–Stokes systems in narrow channels
Ion transport through narrow channels is described by the coupled Poisson–Nernst–Planck–Stokes equations (PNPS) on a continuum scale. However, direct numerical simulations in two or three dimensions of boundary value problems for small aspect ratio geometries, a crucial characteristic of nanopores, can quickly become computationally intensive and thus limit the insights into the underlying mechanisms that control electrokinetic phenomena. Taking advantage of the small aspect ratio, we derive a systematic asymptotic reduction of the PNPS system. In contrast to existing one-dimensional reductions, which assume a Debye length much smaller than the channel radius, our analysis identifies a distinguished asymptotic regime in which the Debye length is allowed to be comparable to the channel width. Our approach has a significantly larger range of validity and contains existing approximations such as the Helmholtz–Smoluchowski approximation as limiting cases. The derived asymptotic model extends also to a generalized PNPS system, where finite-size constraints and solvation effects are taken into account and thus applies to other well-known models such as the Bikerman–Freise model. Using our asymptotic model we demonstrate that the ion current can undergo a number of different flow transitions and in particular predict that positively charged ions can be pushed against their electrostatic gradient. Furthermore, we show how finite-size effects can influence the ion current and enhance ion selectivity. Finally, we revisit case studies of protein-based channels from the literature to illustrate the predictive potential of our asymptotic model.
Read the full abstract
Numerical Analysis
Algorithm with variable coefficients for computing matrix inverses
We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where $A$ is square real matrix and $a_0^{(k)}$ and $a_0^{(k)}$ are dynamical coefficients. We are going to present basic case of the problem, while formulas are derived analogically in other cases but are more complicated. Constructed method is optimal, meaning that coefficients are chosen in optimal way in terms of Frobenius norm. We have done some numerical testing that confirm theoretical approach. Through construction and numerical testing of method we have considered numerical stability as well. In the end, constructed method in it's final form is numerically stable and optimal.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
WKB-asymptotics for multipoint Virasoro conformal blocks and applications
We study multipoint Virasoro conformal blocks on the sphere in the comb channel. We arrive at the asymptotic expression for these blocks at large intermediate dimensions, applying WKB method for "classical BPZ equation", which is used to study (classical) Virasoro blocks via monodromy method. Several applications of this asymptotic are discussed, such as the possibility to generalize Zamolodchikov's elliptic recursion and numerical evaluation of amplitudes in minimal string theory. Our expressions pass nontrivial checks, such as agreement with known exact expressions for 5-point blocks in special cases and the usual series expansion of Virasoro blocks computed using AGT correspondence.
Read the full abstract
Functional Analysis
Pointwise estimates for rough operators in a metric measure framework under some Ahlfors regularity conditions
We establish a new pointwise estimate for a class of rough operators in the setting of metric measure spaces endowed with a measure which is Ahlfors regular. This pointwise inequality can be divided in two steps: the first one relies in a subrepresentation formula that involves a modified Riesz potential and the upper gradient of the function considered and the second step gives a pointwise control of the Riesz potential in terms of a maximal function and a Morrey norm. We also investigate a family of functional inequalities that can be deduced from this pointwise estimate.
Read the full abstract
Functional Analysis
Convexity of Berezin Range and Berezin Radius Inequalities via a class of Seminorm
Let $B(\mathcal{H})$ denote the $C^*$-algebra of all bounded linear operators acting on a reproducing kernel Hilbert space $\mathcal{H}(\Omega).$ In this paper, we introduce a new family of seminorms on $B(\mathcal{H})$, called the $\sigma_t$-Berezin norm, defined as $$ \|A\|_{{ber}_{\sigma_t}} = \sup_{\lambda,\mu\in \Omega} \left\{ \left( \left|\left\langle A\hat{k}_\lambda,\hat{k}_\mu\right\rangle\right|^p \, \sigma_t \, \left|\left\langle A^*\hat{k}_\lambda,\hat{k}_\mu\right\rangle\right|^p \right)^{\frac{1}{p}} \right\}, $$ where $A\in B(\mathcal{H}), ~p \geq 1, ~t \in [0,1]$ and ~$\sigma_t$ denotes an interpolation path of a symmetric mean $\sigma$. We show that this family of seminorms characterizes invertible operators that are unitary. Several fundamental properties of the $\sigma_t$-Berezin norm are established, along with a collection of new inequalities that yield refined upper bounds for the Berezin radius of bounded linear operators, thereby improving existing results in the literature. Furthermore, we investigate the convexity of the Berezin range of operators acting on weighted Hardy space and Fock space over $\mathbb{C}^n$. We characterised the convexity of the Berezin range of composition operator with elliptic automorphism and finite rank operators with different weights on the weighted Hardy space. We also characterized convexity of the Berezin range of composition operator on Fock space over $\mathbb{C}^n$ with symbol $\phi(z)=Az$, where $A$ is a scalar matrix of order $n$.
Read the full abstract
Differential Geometry
Fat Lie Theory
We discuss a new point of view of representation theory of Lie groupoids and algebroids: fat Lie theory. The category of fat extensions is introduced, as well as the category of abstract $2$-term representations up to homotopy (ruths) – the intrinsic objects behind usual (split) $2$-term ruths. We obtain a one-to-one correspondence between them, and relate to the well-known equivalence between $2$-term ruths and VB-groupoids/algebroids. On the other hand, we show that fat extensions of groupoids correspond to general linear PB-groupoids. The differentiation procedure of fat extensions is discussed, as well as the functorial aspects of all mentioned correspondences. In particular, we upgrade the one-to-one correspondence between general linear PB-groupoids and VB-groupoids of Cattafi and Garmendia to an equivalence of categories. Fat extensions are intimately related to another notion we introduce: core extensions. We show that they correspond to vertically/horizontally core-transitive double groupoids, generalising work by Brown, Jotz-Lean and Mackenzie. This way, we also realise regular fat extensions as general linear double groupoids.
Read the full abstract
Representation Theory
Primitive elements in Ringel-Hall algebras of tame hereditary algebras
We study primitive elements in the Ringel-Hall algebra H(A) of an algebra A over a finite field associated with a quiver with automorphism. When A is a tame hereditary algebra, we give a description of primitive elements in H(A) which generalizes and improves a result of Hennecart (IMRN 2021) for tame quivers. Moreover, we obtain an identity concerning primitive elements in the subalgebra of H(A) generated by regular A-modules which enables us to construct an explicit basis for the space of primitive elements in H(A).
Read the full abstract
Optimization and Control
Outlier-robust Autocovariance Least Square Estimation via Iteratively Reweighted Least Square
The autocovariance least squares (ALS) method is a computationally efficient approach for estimating noise covariances in Kalman filters without requiring specific noise models. However, conventional ALS and its variants rely on the classic least mean squares (LMS) criterion, making them highly sensitive to measurement outliers and prone to severe performance degradation. To overcome this limitation, this paper proposes a novel outlier-robust ALS algorithm, termed ALS-IRLS, based on the iteratively reweighted least squares (IRLS) framework. Specifically, the proposed approach introduces a two-tier robustification strategy. First, an innovation-level adaptive thresholding mechanism is employed to filter out heavily contaminated data. Second, the outlier-contaminated autocovariance is formulated using an $\epsilon$-contamination model, where the standard LMS criterion is replaced by the Huber cost function. The IRLS method is then utilized to iteratively adjust data weights based on estimation deviations, effectively mitigating the influence of residual outliers. Comparative simulations demonstrate that ALS-IRLS reduces the root-mean-square error (RMSE) of noise covariance estimates by over two orders of magnitude compared to standard ALS. Furthermore, it significantly enhances downstream state estimation accuracy, outperforming existing outlier-robust Kalman filters and achieving performance nearly equivalent to the ideal Oracle lower bound in the presence of noisy and anomalous data.
Read the full abstract
Optimization and Control
Optimal Embedding of Wiring Diagrams in Constrained Three-Dimensional Spaces
This paper investigates the Wiring Diagram Problem (WDP), a three-dimensional layout design problem arising in industrial applications such as cable harness design and pipeline routing in constrained environments. In these settings, hierarchical tree-like systems composed of supply units, intermediate devices (e.g., valves or junctions), and terminal components must be spatially arranged and interconnected while satisfying stringent engineering requirements, including safety separation distances, obstacle avoidance, geometric feasibility, and constructibility constraints. We develop an optimization-based framework that formulates the WDP as a mixed-integer linear programming model capturing both topological and spatial design requirements within a unified formulation. To address the combinatorial and geometric complexity of three-dimensional routing, the feasible design space is discretized into structured network graphs that preserve engineering constraints while reducing dimensionality. The resulting model minimizes total cable or pipeline length while ensuring compliance with all technical specifications. Computational experiments on representative industrial instances demonstrate the robustness and practical applicability of the proposed approach for automated layout generation.
Read the full abstract
Statistics Theory
The W-footrule coefficient: A copula-based measure of countermonotonicity
We introduce the $W$-footrule coefficient $\Phi_C$, a copula-based coefficient of negative association defined as the $L^1$-distance to the countermonotonic copula $W$. We prove that Gini's gamma admits the decomposition $\gamma_C = \frac{2}{3}(\varphi_C+\Phi_C)$, linking it to Spearman's footrule $\varphi_C$. A rank-based estimator is introduced, with its strong consistency and asymptotic normality established via the functional delta method. Monte Carlo simulations confirm the estimator's finite-sample validity and its sensitivity to negative dependence structures.
Read the full abstract
Functional Analysis
Eigenvalue accumulation for operator convolutions on locally compact groups
Within the framework of quantum harmonic analysis, for a locally compact group $G$ with a square-integrable, irreducible unitary representation, we analyze the eigenvalue distributions of convolutions between indicator functions on $G$ and a fixed density operator on the representation space, a concept which generalizes localization operators. In particular, we consider a sequence of such operators and the asymptotic number of eigenvalues that lie within a small distance of $1$. We show that a previously postulated type of asymptotic behavior occurs if and only if the group is unimodular and the sets underlying the indicator functions form a Følner sequence. Applying this, we obtain positive results for nilpotent and homogeneous Lie groups, recovering an established result for the Heisenberg group as a special case.
Read the full abstract
Differential Geometry
A reverse isoperimetric inequality in three-dimensional space forms
A $\lambda$-convex body in a three-dimensional space form $M^3(c)$ of constant curvature $c$ is a compact convex set $K$ whose boundary $\partial K$ has normal curvatures bounded below by a constant $\lambda>0$ (in a weak sense). Within this class, we prove a sharp reverse isoperimetric inequality: among all $\lambda$-convex bodies in $M^3(c)$, with a fixed surface area, the body of minimal volume is the $\lambda$-convex lens, i.e., the domain bounded by two totally umbilical caps of curvature $\lambda$. Moreover, this minimizer is unique. This result confirms Borisenko's Conjecture in the three-dimensional model spaces of constant curvature for $c\neq 0$, and complements recent progress on the conjecture in the Euclidean case $c=0$. As a by-product, our method also yields an alternative proof of the corresponding reverse isoperimetric inequality in two-dimensional hyperbolic space.
Read the full abstract
Group Theory
Proportion of chiral maps with automorphism group $\mathcal{S}_n$ and $\mathcal{A}_n$
Orientably-regular maps are highly symmetric embeddings of graphs in oriented surfaces. Among them, chiral maps are those which fail to be isomorphic to their mirror images. We prove that, as $n\to\infty$, chirality is generic for orientably-regular maps with automorphism groups $S_n$ or $A_n$: the proportion of chiral maps tends to $1$ in both families. We also obtain the corresponding asymptotic result for orientably-regular hypermaps with automorphism groups $S_n$ or $A_n$. A key ingredient is a sharp asymptotic generation statement: if one chooses an involution of $S_n$ uniformly at random and then chooses an independent uniformly random element of $S_n$, the probability that these two elements generate $S_n$ and $A_n$ tends to $\frac{3}{4}$ and $\frac{1}{4}$ as $n\to\infty$, respectively.
Read the full abstract
Combinatorics
A note on hyperseparating set systems
We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element underlying set, generalizing a very recent result for $k=2$ by Batíková, Kepka, and Nemĕc. We say that $\mathcal{F}$ is $k$-hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ such that no other vertex is contained by exactly the same sets out of these $k$ sets. We determine the minimum size of $2$-hyperseparating set systems on an $n$-element underlying set.
Read the full abstract
Number Theory
A short remark on the $\ell$-torsion part of class groups
In a 2008 paper Ellenberg suggested a strategy to improve the known upper bounds for the $\ell$-torsion part of class groups of number fields of fixed degree $d$. Motivated by this he proposed a question about the number of primitive elements of small height in a number field. Here we answer Ellenberg's question. We also improve Heath-Brown's bound for the $\ell$-torsion part of class groups of purely cubic number fields, and we generalize our improvement to pure fields of arbitrary odd degree $d$.
Read the full abstract
Combinatorics · Cross-listed from cs.DM
A new proof of Delahan's induced-universality result
We give a short and self-contained proof of Delahan's theorem stating that every simple graph on $n$ vertices occurs as an induced subgraph of a Steinhaus graph on $\frac{n(n-1)}{2}+1$ vertices. This new proof is obtained by considering the notion of generating index sets for Steinhaus triangles.
Read the full abstract
Numerical Analysis
A Semi-Discrete Optimal Transport Scheme for the Semi-Geostrophic Slice Compressible Model
We develop a semi-discrete optimal transport scheme for the compressible semi-geostrophic equations, a system that plays an important role in modelling large-scale atmospheric dynamics and frontogenesis. Unlike the incompressible case, the compressible equations involve variable density and internal energy, but can be recast into a variational framework that naturally couples the dynamics with an optimal transport formulation. This is done by a change to the so-called geostrophic coordinates, via a transformation inspired by the incompressible case. The discrete version of this variational formulation provides the basis for a numerical particle scheme. The implementation of this scheme presents considerable challenges, due to a non-quadratic cost function and parabolic $c$-Laguerre cells. To address these challenges, we use $c$-exponential charts to construct $c$-Laguerre tessellations efficiently, ensuring conservation of mass and energy while preserving key geometric structures. We analyse the scheme and validate its convergence through numerical experiments, including a single-seed benchmark and error analysis. This work provides a significant new generalisation of existing semi-discrete optimal transport techniques, offering a robust and structure-preserving tool for simulating realistic atmospheric flows.
Read the full abstract
Commutative Algebra
Topological insights into Monoids and Module systems
Let $H$ be a monoid and let $G$ denote its quotient groupoid. We introduce the Riemann-Zariski space $\textup{Zar}(G| H)$ associated with $H$ and prove that it is a spectral space. We then show that, if $H$ is an $s$-Prüfer monoid, the space $\textup{Zar}(G| H)$ is homeomorphic to the prime $s$-spectrum of $H$ endowed with the Zariski topology. Next, given a finitary ideal system $r$ on $H$, we prove that the space of $r$-ideals $\mathcal{I}_r(H)$, endowed with the Zariski topology, is spectral, and that the prime $r$-spectrum of $H$ is proconstructible in $\mathcal{I}_r(H)$. We also introduce a new topology on the set $\mathcal{X}$ of all generalized $H$-module systems and study its properties. In particular, we show that $\mathcal{X}$ and its subspace $\mathcal{X}_{\textup{fin}}$ of finitary generalized $H$-module systems are spectral spaces. Finally, we provide a characterization of those subsets of the set of overmonoids of $H$ that are quasi-compact.
Read the full abstract
Number Theory
An Equivalent form of Twin Prime Conjecture connected with a sequence of arithmetic progressions
We give an equivalent form of the Twin prime conjecture relating to a symmetric property that is observed for terms present in a certain sequence of arithmetic progressions defined for a pair of co-prime integers.
Algebraic Geometry
Introduction to non-Abelian Patchworking
The note introduces a novel concept of non-Abelian patchworking arising as real locus of non-Abelian complex-phase tropical hypersurfaces, the theory of which is now developed enough to allow the proposed spin-off. Although, non-Abelian Tropical Geometry makes sense for an arbitrary reductive complex group, the state of the art is that of full understanding of tropicalizations of surfaces within three dimensional groups $PGL_2(\mathbb{C})$ and $SL_2(\mathbb{C}),$ which are closely related via the two-fold covering. We stress our point, that this is an announcement of a framework, taking care of explaining explicitly the input, which is more geometric and less combinatorial than in the original Viro's method, to construct possible types of real algebraic surfaces in the real projective 3-space, and verify that it reproduces all the existing isotopy types of surfaces up to degree three. We obtain two general theorems concerning the topology of primitive PGL2 surfaces, observing in particular that they may have different Euler charteristic for a fixed degree greater than one, not necessarily equal to the signature of the corresponding complex surface, which would be the case for primitive combinatorial patchworking due to a result of Itenberg.
Read the full abstract
Optimization and Control
Stability of Two-Stage Stochastic Programs Under Problem-Dependent Costs
Classical stability theory for stochastic programming relies on the Wasserstein-Fortet-Mourier duality, which requires the ground cost to be a distance. When using problem-dependent costs instead of metrics, this duality no longer yields Fortet-Mourier bounds. This paper develops a direct stability approach using the primal optimal transport formulation. We prove that under minimal regularity conditions and a regret domination property, the optimal value function remains Lipschitz continuous with respect to problem-dependent transport costs. Our approach works directly with transport couplings rather than relying on dual representations to establish stability bounds. We present two applications: (1) For linear programs with continuous second-stage, we show that regret domination holds with constants depending on dual bounds and Lipschitz properties, using sensitivity analysis. (2) For mixed-integer second-stage problems, we show that combinatorial structure can be exploited to obtain tight regret bounds. We analyze several examples as illustrations. These results provide theoretical justification for problem-dependent scenario reduction approaches and enable their application to both continuous and discrete stochastic programs.
Read the full abstract
Geometric Topology
On embeddings of homogeneous quandles
In this paper, we study the embedding problem of homogeneous quandles. We give a necessary and sufficient condition under which a quandle homomorphism from the homogeneous quandle associated with a quandle triplet $(G,H,\sigma)$ into a conjugation quandle of a group is an embedding. This result provides a generalization of the embedding theorem of Dhanwani, Raundal and Singh for generalized Alexander quandles. As applications of the main theorem, we reinterpret Bergman's embedding of core quandles in the framework of homogeneous quandles, and construct explicit embeddings of several geometric examples, including unoriented and oriented Grassmann quandles and rotation quandles of $S^2$ arising from symmetric spaces.