For a finite Coxeter group W and a Coxeter element c of W, the c-Cambrian fan is a coarsening of the fan defined by the reflecting hyperplanes of W. Its maximal cones are naturally indexed by the c-sortable elements of W. The main result of this paper is that the known bijection cl_c between c-sortable elements and c-clusters induces a combinatorial isomorphism of fans. In particular, the c-Cambrian fan is combinatorially isomorphic to the normal fan of the generalized associahedron for W. The rays of the c-Cambrian fan are generated by certain vectors in the W-orbit of the fundamental weights, while the rays of the c-cluster fan are generated by certain roots. For particular ("bipartite") choices of c, we show that the c-Cambrian fan is linearly isomorphic to the c-cluster fan. We characterize, in terms of the combinatorics of clusters, the partial order induced, via the map cl_c, on c-clusters by the c-Cambrian lattice. We give a simple bijection from c-clusters to c-noncrossing partitions that respects the refined (Narayana) enumeration. We relate the Cambrian fan to well known objects in the theory of cluster algebras, providing a geometric context for g-vectors and quasi-Cartan companions.

We show that the Coxeter-sortable elements in a finite Coxeter group W are the minimal congruence-class representatives of a lattice congruence of the weak order on W. We identify this congruence as the Cambrian congruence on W, so that the Cambrian lattice is the weak order on Coxeter-sortable elements. These results exhibit W-Catalan combinatorics arising in the context of the lattice theory of the weak order on W.

We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.

These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of root systems, generalized associahedra, and the combinatorics of clusters. Lectures 1-2 cover classical material: root systems, finite reflection groups, and the Cartan-Killing classification. Lectures 3-4 provide an introduction to cluster algebras from a combinatorial perspective. Lecture 5 is devoted to related topics in enumerative combinatorics.

We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or, equivalently, to the cluster complexes for the cluster algebras of finite type. Our computation of the face numbers and h-vectors of these complexes produces the enumerative invariants defined in other contexts by C.A.Athanasiadis, suggesting links to a host of well studied problems in algebraic combinatorics of finite Coxeter groups, root systems, and hyperplane arrangements. Recurrences satisfied by the face numbers of our complexes lead to combinatorial algorithms for determining Coxeter-theoretic invariants. That is, starting with a Coxeter diagram of a finite Coxeter group, one can compute the Coxeter number, the exponents, and other classical invariants by a recursive procedure that only uses most basic graph-theoretic concepts applied to the input diagram. In types A and B, we rediscover the constructions and results obtained by E.Tzanaki <math.CO/0501100>.

For an arbitrary finite Coxeter group W we define the family of Cambrian lattices for W as quotients of the weak order on W with respect to certain lattice congruences. We associate to each Cambrian lattice a complete fan, which we conjecture is the normal fan of a polytope combinatorially isomorphic to the generalized associahedron for W. In types A and B we obtain, by means of a fiber-polytope construction, combinatorial realizations of the Cambrian lattices in terms of triangulations and in terms of permutations. Using this combinatorial information, we prove in types A and B that the Cambrian fans are combinatorially isomorphic to the normal fans of the generalized associahedra and that one of the Cambrian fans is linearly isomorphic to Fomin and Zelevinsky's construction of the normal fan as a "cluster fan." Our construction does not require a crystallographic Coxeter group and therefore suggests a definition, at least on the level of cellular spheres, of a generalized associahedron for any finite Coxeter group. The Tamari lattice is one of the Cambrian lattices of type A, and two "Tamari" lattices in type B are identified and characterized in terms of signed pattern avoidance. We also show that open intervals in Cambrian lattices are either contractible or homotopy equivalent to spheres.

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric description of the poset of join-irreducibles of the congruence lattice of the poset of regions in terms of certain polyhedral decompositions of the hyperplanes. For a finite Coxeter system (W,S) and a subset K of S, let η_K:w \mapsto w_K be the projection onto the parabolic subgroup W_K. We show that the fibers of η_K constitute the smallest lattice congruence with 1\equiv s for every s\in(S-K). We give an algorithm for determining the congruence lattice of the weak order for any finite Coxeter group and for a finite Coxeter group of type A or B we define a directed graph on subsets or signed subsets such that the transitive closure of the directed graph is the poset of join-irreducibles of the congruence lattice of the weak order.

We study flag enumeration in intervals in the Bruhat order on a Coxeter group by means of a structural recursion on intervals in the Bruhat order. The recursion gives the isomorphism type of a Bruhat interval in terms of smaller intervals, using basic geometric operations which preserve PL sphericity and have a simple effect on the cd-index. This leads to a new proof that Bruhat intervals are PL spheres as well a recursive formula for the cd-index of a Bruhat interval. This recursive formula is used to prove that the cd-indices of Bruhat intervals span the space of cd-polynomials. The structural recursion leads to a conjecture that Bruhat spheres are "smaller" than polytopes. More precisely, we conjecture that if one fixes the lengths of x and y, then the cd-index of a certain dual stacked polytope is a coefficientwise upper bound on the cd-indices of Bruhat intervals [x,y]. We show that this upper bound would be tight by constructing Bruhat intervals which are the face lattices of these dual stacked polytopes. As a weakening of a special case of the conjecture, we show that the flag h-vectors of lower Bruhat intervals are bounded above by the flag h-vectors of Boolean algebras (i.e. simplices).

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified approach which, in particular, leads to a simpler treatment of the previously known cases, types A and B. The result for weak orders follows from an upper bound on the dimension of the poset of regions of an arbitrary hyperplane arrangement. In some cases, including the weak orders, the upper bound is the chromatic number of a certain graph. For the weak orders, this graph has the positive roots as its vertex set, and the edges are related to the pairwise inner products of the roots.

The hierarchical Pitman-Yor process is a discrete random measure used as a prior in Bayesian nonparametrics. It is motivated by the study of groups of clustered data exhibiting power law behavior. Our focus in this paper is on the Gaussian behavior of a family of statistics, namely the power sum symmetric polynomials for the vector of weights of the process, as the concentration parameters tend to infinity. We establish a central limit theorem and obtain explicit representations for the asymptotic variance, with the latter clearly showing the impact of each component in the hierarchical structure. These results are crucial for understanding the asymptotic behavior of the sampling formulas associated with the process. In comparison with the known results for the hierarchical Dirichlet process, the results for the hierarchical Pitman-Yor process are mathematically more challenging and structurally more revealing of power law behavior.

We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously known bounds show that the support size of the capacity-achieving distribution is lower-bounded by a term of order $\sqrt n$ and upper-bounded by a term of order $n/2$, where $n$ is the number of trials. In this work, we derive a new lower bound on the support size of order $\sqrt{n\log\log n}$, up to explicit constants. The proof consists of three main steps. First, we derive new upper and lower bounds on the capacity with a gap that vanishes as $n\to\infty$, which yields $C(n)=\frac12\log\frac{nπ}{2e}+o(1)$. Second, we show that the Beta-binomial output distribution induced by the reference input $X_r\sim\mathrm{Beta}(1/2,1/2)$ is asymptotically optimal: it approaches the capacity-achieving output distribution in relative entropy and, after a comparison step, in $χ^2$ divergence. Third, we prove a quantitative $χ^2$ approximation lower bound showing that this Beta-binomial output cannot be approximated too well by the output induced by a $K$-point input. Combining these ingredients forces the capacity-achieving input distribution to have at least order $\sqrt{n\log\log n}$ mass points.

We discuss various forms of refinements of Vogel's universality in Chern-Simons theory. While the original universality applies to arbitrary simple Lie groups, its counterpart in refined Chyrn-Simons theory is restricted to simply laced Lie groups.

It was recently proven that, in contrast to their matrix analogues, the moments of a real Gaussian tensor of size N do not in general factorize over their connected components in the asymptotic large N limit. While the original proof of this rather surprising result was not constructive, explicit examples of non-factorizing moments, which are expectation values of trace-invariants, have since then been discovered. We explore further aspects of this problem, with a focus on Haar-distributed (or Gaussian) complex random tensors, which are more directly relevant to quantum information. We start out by exhibiting an explicit example of non-factorizing trace-invariant, thereby filling a gap in the recent literature. We then turn to the opposite question: that of finding interesting families of trace-invariants that do in fact factorize at large N. We establish three main theorems in this regard. The first one provides a sufficient combinatorial bound ensuring large N factorization, that is also simple enough to be applicable to various cases of practical relevance. Our second main result shows that the expectation value of any compatible trace-invariant is dominated by certain tree-like combinatorial structures at large N, which we refer to as tree-like dominant pairings. Our third main theorem establishes that any trace-invariant admitting tree-like dominant pairings does actually factorize at large N. In this way, we are able to prove that various families of trace-invariants that have been previously studied in the literature do factorize at large N. We apply our findings to the theory of multipartite quantum entanglement: to any trace-invariant is associated a multipartite generalization of Rényi entanglement entropy, whose typical expectation value in the uniform random quantum state can be explicitly computed assuming large N factorization.

In this article, we study the growth rate of Reeb orbits on fiberwise star-shaped hypersurfaces in the cotangent bundle of a closed manifold. We prove that under a suitable topological condition on the base manifold the Reeb flow on any such hypersurface carries infinitely many simple closed orbits. Moreover, the number of simple Reeb orbits with period at most T grows at least like the prime numbers, that is, like T/log(T). The topological condition we assume is the existence of a non-nilpotent class in the homology of the free loop space of the manifold, with respect to the Chas-Sullivan product, lying in a connected component associated to a non-torsion class in the first homology of the manifold. In particular, for any Riemannian metric on a manifold satisfying such a topological condition, the number of geometrically distinct closed geodesics with length at most l grows at least like l/log(l). We also prove, using symplectic homology, that if a Liouville domain of dimension at least 4 with vanishing first Chern class admits a Reeb symplectically degenerate maximum representing a non-torsion first homology class of the domain, then the number of simple Reeb orbits with period at most T grows at least like T/log(T).

We propose an algorithm to sample from composite log-concave distributions over $\mathbb{R}^d$, i.e., densities of the form $π\propto e^{-f-g}$, assuming access to gradient evaluations of $f$ and a restricted Gaussian oracle (RGO) for $g$. The latter requirement means that we can easily sample from the density $\text{RGO}_{g,h,y}(x) \propto \exp(-g(x) -\frac{1}{2h}||y-x||^2)$, which is the sampling analogue of the proximal operator for $g$. If $f + g$ is $α$-strongly convex and $f$ is $β$-smooth, our sampler achieves $\varepsilon$ error in total variation distance in $\widetilde{\mathcal O}(κ\sqrt d \log^4(1/\varepsilon))$ iterations where $κ:= β/α$, which matches prior state-of-the-art results for the case $g=0$. We further extend our results to cases where (1) $π$ is non-log-concave but satisfies a Poincaré or log-Sobolev inequality, and (2) $f$ is non-smooth but Lipschitz.

We thoroughly investigate the trace ideals of projective modules over the endomorphism ring of a uniserial module. After the work of Dubrovin and Puninski, it is known that this class of rings provides examples of trace ideals of projective right modules that are not trace ideals of projective left modules. In this paper we further investigate when this happens, giving an intrinsic description of such trace ideals and their properties. We also use the theory associated to lifting projective modules modulo a trace ideal to give an alternative approach to Puninski's construction of a direct summand of a serial module that is not serial.

We study exact-regenerating codes for entanglement-assisted distributed storage systems. Consider an $(n,k,d,α,β_{\mathsf{q}},B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes with each node storing $α$ symbols. A data collector can recover the file by accessing any $k$ nodes. When a node fails, any $d$ surviving nodes share an entangled state, and each of them transmits a quantum system of $β_{\mathsf{q}}$ qudits to a newcomer. The newcomer then performs a measurement on the received quantum systems to generate its storage. Recent work [1] showed that, under functional repair where the regenerated content may differ from that of the failed node, there exists a unique optimal regenerating point that \emph{simultaneously minimizes both storage $α$ and repair bandwidth $d β_{\mathsf{q}}$} when $d \geq 2k-2$. In this paper, we show that, under \emph{exact repair}, where the newcomer reproduces exactly the same content as the failed node, this optimal point remains achievable. Our construction builds on the classical product-matrix framework and the Calderbank-Shor-Steane (CSS)-based stabilizer formalism.

Dengue transmission is shaped by the population dynamics of the Aedes aegypti mosquito, making vector control a central strategy for disease mitigation. The impact of interventions such as larvicide, adulticide, and breeding-site reduction depends critically on their timing under fluctuating environmental conditions. We build on a high-fidelity, non-Markovian mechanistic model of the Aedes life cycle that captures stage-structured, temperature-dependent developmental delays, and mortality, and extend it to incorporate multiple vector control measures. Rather than using continuous abstract control amplitudes as in standard optimal control formulations, we introduce intervention-specific temporal profiles that better reflect operational practice. We then develop an adjoint-based gradient descent framework to compute the optimal timing of a sequence of interventions by minimizing the time-dependent dengue reproduction number, R0. Numerical simulations based on seasonal temperature data from Miami, Florida, show that appropriately timed combinations of interventions can substantially suppress transmission risk, with outcomes strongly influenced by seasonal temperature variation and intervention duration. We further propose embedding the resulting optimization framework within a Model Predictive Control architecture, yielding a closed-loop approach for real-time, surveillance-driven vector management under environmental and operational uncertainty.

We undertake a systematic study of the mapping properties of forms based on distance graphs in $\mathbb{Z}^{d}$ to see how the structure of a graph, $G$, affects the $\ell^{p}$ improving estimates of the form, $Λ_{G}$, based on $G$. This extends previous work on $\ell^{p}$ improving properties for the spherical averaging operator, which corresponds to a distance graph of a single distance. We obtain $\ell^{p}$ improving estimates for the collection of forms based on all graphs with 2, 3, and 4 vertices, as well as chains and simplexes of any size in $\mathbb{Z}^{d}$. Surprisingly, certain mapping properties only seem to depend on the number of vertices in the graph, not its structure, and forms based on subgraphs of a graph, $G$, do not necessarily inherit all mapping properties from $G$.

Multi-objective optimization is central to many engineering and machine learning applications, where multiple objectives must be optimized in balance. While multi-gradient based optimization methods combine these objectives in each step, such methods require computing gradients with respect to all variables at every iteration, resulting in high computational costs in large-scale settings. In this work, we propose a framework that simultaneously alternates the optimization of each objective and the (stochastic) gradient update with respect to each variable block. Our framework reduces per-iteration computational cost while enabling exploration of the Pareto front by allocating a prescribed number of gradient steps to each objective. We establish rigorous convergence guarantees across several stochastic smooth settings, including convex, non-convex, and Polyak-Lojasiewicz conditions, recovering classical convergence rates of single-objective methods. Numerical experiments demonstrate that our framework outperforms non-alternating methods on multi-target regression and produces a competitive Pareto front approximation, highlighting its computational efficiency and practical effectiveness.

We extend an energy introduced by Mather to the setting of Almgren-Pitts min-max theory and obtain a parametric, higher-dimensional analogue of Mather's variational barrier theory for twist maps and geodesics on tori. We use this energy to establish several criteria for the existence of foliations of the $n$-torus by minimal hypersurfaces. We show that for a generic metric, whenever a lamination by area-minimizing hypersurfaces of the $n$-torus contains a gap, there exists a minimal hypersurface inside the gap that is not area-minimizing. As an application, we derive a recurrence property for totally irrational minimal foliations.

For minimally rigid graphs, the same edge-length data can admit multiple realizations (up to translations and rotations). Finding graphs with exceptionally many realizations is an extremal problem in rigidity theory, but exhaustive search quickly becomes infeasible due to the super-exponential growth of the number of candidate graphs and the high cost of realization-count evaluation. We propose a reinforcement-learning approach that constructs minimally rigid graphs via 0- and 1-extensions, also known as Henneberg moves. We optimize realization-count invariants using the Deep Cross-Entropy Method with a policy parameterized by a Graph Isomorphism Network encoder and a permutation-equivariant extension-level action head. Empirically, our method matches the known optima for planar realization counts and improves the best known bounds for spherical realization counts, yielding new record graphs.

This article proposes a novel least-squares weak Galerkin (LS-WG) method for second-order elliptic equations in non-divergence form. The approach leverages a locally defined discrete weak Hessian operator constructed within the weak Galerkin framework. A key feature of the resulting algorithm is that it yields a symmetric and positive definite linear system while remaining applicable to general polygonal and polyhedral meshes. We establish optimal-order error estimates for the approximation in a discrete $H^2$-equivalent norm. Finally, comprehensive numerical experiments are presented to validate the theoretical analysis and demonstrate the efficiency and robustness of the method.

We propose and analyze a model-based bootstrap for transition kernels in finite controlled Markov chains (CMCs) with possibly nonstationary or history-dependent control policies, a setting that arises naturally in offline reinforcement learning (RL) when the behavior policy generating the data is unknown. We establish distributional consistency of the bootstrap transition estimator in both a single long-chain regime and the episodic offline RL regime. The key technical tools are a novel bootstrap law of large numbers (LLN) for the visitation counts and a novel use of the martingale central limit theorem (CLT) for the bootstrap transition increments. We extend bootstrap distributional consistency to the downstream targets of offline policy evaluation (OPE) and optimal policy recovery (OPR) via the delta method by verifying Hadamard differentiability of the Bellman operators, yielding asymptotically valid confidence intervals for value and $Q$-functions. Experiments on the RiverSwim problem show that the proposed bootstrap confidence intervals (CIs), especially the percentile CIs, outperform the episodic bootstrap and plug-in CLT CIs, and are often close to nominal ($50\%$, $90\%$, $95\%$) coverage, while the baselines are poorly calibrated at small sample sizes and short episode lengths.

A Wiener-Hopf-type integral equation for the stationary PDF of a reflected random walk is derived rigorously based on modern probability theory, and an application to battery energy storage systems (BESS), specifically the sizing of the inverter, is discussed in depth. The methodological steps include the construction of a Markov kernel, the derivation of a Fredholm integral equation of the second kind for the PDF of the BESS power, and an analytical solution of the equation based on a Neumann series. The analytical results were compared against numerical solutions obtained with the Nystrom method, as well as against the results of an algorithmic simulation using simulated input time series. The use of truncated versions of the analytic solution allows for the construction of simplified design rules for the power systems practitioner. General insights into inverter sizing criteria of storage systems for ramp-rate control of variable renewable energy (VRE) sources such as wind and solar are provided.

In this paper, we investigate two curvature-free effects from volume growth and ends-counting, respectively. Motivated by generalizing classical results from Ricci curvature to other common curvatures, we establish two main theorems. First, any complete non-compact manifold with lower sublinear volume growth admits a smooth bounded mean-concave exhaustion. Second, any complete manifold with infinitely many ends contains escaping geodesic lines outside every compact subset. As applications, we provide new proofs of the Calabi--Yau minimal volume growth theorem and the Cai--Li--Tam finite-ends theorem for nonnegative Ricci curvature, without relying on the Bishop--Gromov volume comparison theorem or analytic tools specific to Ricci curvature. We further extend these results to Riemannian manifolds with nonnegative scalar curvature and Kähler manifolds with positive holomorphic sectional curvature.

This study is the $5^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 4. Here, we study Type-2 isomorphic circulant graphs of $C_{48}(r_1,r_2,r_3)$, $C_{81}(r_1,r_2,r_3)$ and $C_{96}(r_1,r_2,r_3,r_4)$. We find that the total number of pairs of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 of the forms $C_{n}(r_1,r_2,r_3)$ and $C_{n}(s_1,s_2,s_3)$ are 18 and 72 for $n$ = 48, 96, respectively and the total number of triples of isomorphic circulant graphs of Type-2 w.r.t. $m$ = 3 of the form $C_{81}(x_1,x_2,x_3)$, $C_{81}(y_1,y_2,y_3)$ and $C_{81}(z_1,z_2,z_3)$ are 27.

This paper considers an inverse shape problem for recovering an unknown clamped obstacle in two dimensions from far--field measurements generated by a single incident wave or just a few incident waves for the biharmonic (flexural) wave equation. Here we will develop a new extended sampling method (ESM) that is derived using the analysis of the well--known factorization method. We will also consider an ESM using both sound--soft and sound--hard sampling disks to identify sampling points where the reference disk intersects the unknown cavity. The use of a sound--hard sampling disk has not been studied in the literature whereas the sound--soft sampling disk has been used in most recent works. Traditionally the ESM seeks to find the location of the scatterer from limited incident directional data. Here, our method acts more like the factorization method to obtain the location as well as the size (and possibly the shape) of the obstacle. We present numerical experiments with synthetic data that demonstrate how effective this new implementation is with respect to noisy data and illustrate the influence of the reference disk radius on the reconstruction.

We establish sharp lower bounds for the mass of asymptotically locally Euclidean (ALE) and asymptotically locally flat (ALF) toric 4-manifolds, in terms of equilibrium geometries consisting of gravitational instantons. More precisely, the mass of a complete ALE or ALF toric 4-manifold with nonnegative scalar curvature is bounded below by a sum comprised of the following quantities: the mass of the corresponding toric gravitational instanton having the same orbit space (rod) structure as the original ALE/ALF manifold, and an expression determined by the conical angle defects of totally geodesic 2-spheres within the instanton that serve as generators for its second homology. The inequality may be generalized to the situation in which the ALE/ALF manifold also possesses conical singularities as well as orbifold singularities, and it suggests a refined notion of `total mass' in which the result simply states that the total mass of the ALE/ALF manifold is not less than that of the corresponding gravitational instanton. Furthermore, we prove rigidity for these statements, namely the inequality is saturated only when the ALE/ALF manifold is Ricci flat and in fact agrees with the corresponding instanton. These results may be viewed in the context of positive mass theorems, providing an explanation of how positivity can fail in the ALE/ALF setting. Moreover, the main theorem may be interpreted as yielding a variational characterization of the relevant toric gravitational instantons.

Dyadic Green's function is an important tool of computational photonics, giving deeper insights into light-matter interaction. We present an operator approach to the derivation of the dyadic Green's function of a generic anisotropic planarly-layered medium for both electric and magnetic fields. The resulting Green's function is expressed through the evolution operators (a kind of transfer matrices) of the comprising layers and the surface impedance tensors, the singular term being naturally separated from other terms. The operator approach to the Green's function simplifies both the conceptual understanding of the problem and the subsequent practical applications, some of which are demonstrated here. The proposed approach can be easily generalized to the case of spherical and cylindrical layers. The obtained results can be applied in nanophotonics engineering problems.