Algebraic Topology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 28 April
We show that the loop homology algebras of polyhedral products of the form $(\underline{X},\underline{*})^{\mathcal{K}}$ can be written as a colimit over the flagification of $\mathcal{K}$, and obtain a similar result for the Poincaré series. This effectively reduces the study of the algebras $H_*(\Omega(\underline{X},\underline{*})^{\mathcal{K}})$ to the case of 1-neighbourly simplicial complexes. We give presentations of the loop homology of Davis–Januszkiewicz spaces (i.e. Yoneda algebras of Stanley–Reisner rings) and calculate the Poincaré series of looped polyhedral products associated to various families of simplicial complexes, including HMF-presented complexes and skeleta of flag complexes.
Combinatorics
Maximum ratio of (graph) irregularities
We estimate the maximum ratio between the $\sigma_t$- and $\sigma$-irregularity for graphs and trees of order $n$, which are respectively bounded by $\Theta(n^{5/2})$ and $n-2$. This answers a question and a conjecture by Filipovski et al. in an elegant way. For trees, we obtain that the (Albertson) irregularity measure $\irr$ is an upper bound for the graph variance (normalised with the order).
Read the full abstract
Representation Theory
Level-rank dualities and moving vectors
Duality relations between Lie algebras are a significant phenomenon in Lie algebra representation theory, with level-rank duality as a famous example. Level-rank dualities for affine Lie algebras of type $A^{(1)}$ were first discovered by Frenkel in 1982, and later extended to all classical non-twisted affine types by Hasegawa in 1989 through elaborate character calculations. In this paper, for all classical affine Lie algebras, we construct appropriate Fock spaces in a uniform way and establish corresponding combinatorial models (Maya diagrams and abaci), extending Uglov map to all classcial affine types. Through the action of the Virasoro algebra, we completely characterize the joint highest weight vectors in the Fock space, thereby obtaining the corresponding level-rank duality theory. Our method no longer relies on character calculations. Using this new level-rank duality theory, the defect of the cyclotomic KLR algebra $\mathscr{R}^{\Lambda}_{\beta}$ of classical affine type can be interpreted as the sum of the components of the correponding moving vector.
Read the full abstract
Optimization and Control
Observer-Based State Feedback Controller for a Mindlin Plate Model in port-Hamiltonian framework
This paper generalises an early lumped observer-based state-feedback (OBSF) control design methodology, originally developed for one-dimensional (1-D) boundary-controlled port-Hamiltonian systems, to a two-dimensional (2-D) boundary-controlled Mindlin plate. To this end, the 2-D port-Hamiltonian Mindlin plate model is first introduced and then discretized using a structure-preserving finite-difference method on staggered grids. A controllability decomposition is subsequently applied to identify the controllable modes of the discretized model. Furthermore, the state-feedback and observer gains are designed so that the OBSF controller is strictly positive real. This guarantees the stability of the closed-loop system when the finite-dimensional OBSF controller is interconnected with the 2-D boundary-controlled Mindlin plate. Numerical simulations are finally presented to illustrate the effectiveness of the proposed method.
Read the full abstract
Optimization and Control
Design and Modeling of a HASEL Actuator-Based Micro Parallel Robot
This paper presents the mechatronic design, dynamic modeling, and experimental validation of a three-degree-of-freedom (3-DOF) micro parallel robot featuring a prismatic-spherical (3PS) topology actuated by three Hydraulically Amplified Self-Healing Electrostatic (HASEL) actuators. Each soft actuator provides the prismatic motion of an individual limb, while a compliant interface to the moving platform functions as a spherical joint. A prototype incorporating three base-integrated HASEL actuators was fabricated, and the platform motion was measured using an XY laser-tracking system. For control purposes, a port-Hamiltonian (PH) model, combined with the mechanism's forward kinematics (FKM), is developed to capture the robot's nonlinear dynamic behavior, whereas the inverse kinematics (IKM) is employed to estimate the required actuator displacements. Model parameters were identified using nonlinear grey-box (NLGB) estimation, yielding a compact and control-oriented representation suitable for subsequent controller design.
Read the full abstract
Probability
Central limit theorem for slow-fast system under mixed fractional Brownian motion
This work considers a type of slow-fast system, where the slow component is driven by fractional Brownian motion (FBM) with \(H > 1/2\) and the fast component is a Markovian stationary process. Our solution mapping is defined based on the Young-Wiener sense, which is constructed via the stochastic sewing lemma. Then, we aim to show the fluctuation from the averaging limit by applying the Poisson PDE method. Unlike the case of standard Brownian motion, the Poisson PDE method must be developed to a non-Markovian fractional setting. The first part addresses the central limit theorem problem for a slow-fast system under small FBM, which is fully coupled with the fast varying one. Firstly, a Wiener-Young-Ito formula is constructed for the Wiener-Young-Ito integral. The behavior of the deviation component is related to solutions of Poisson PDEs associated with the Laplace operator of the fast process. The fast one is assumed to satisfy "stricter" Holder conditions related to the time scale parameter. The tightness is then derived through the Holder semi-norm of the fast one, the properties of the Poisson PDE solution, and a Gronwall-type result for a linear Young differential equation. The weak limit shown includes an extra Gaussian process. The second part is dedicated to the problem under a general FBM. In contrast to the former one, here the FBM integral term will be more difficult to bound due to the coupling between the regularity of the Poisson PDE solution and dependence on the unbounded Holder seminorm of the fast one.
Read the full abstract
Combinatorics
New Bounds for the Spectral Radius and Low Energy of the $A_\alpha$-Matrix of Digraphs
The $A_\alpha$-matrix of a digraph $D$ is defined as a linear convex combination $\alpha\operatorname{Deg}(D)+(1-\alpha)A(D)$ of the adjacency matrix $A(D)$ and the diagonal out-degree matrix $\operatorname{Deg}(D)$, where $\alpha\in[0,1]$. The low energy of $A_\alpha(D)$ is defined as the sum of the absolute values of the real parts of the eigenvalues of $A_\alpha(D)$. In this paper, we establish new upper bounds for the spectral radius of the $A_\alpha$-matrix and derive two Koolen–Moulton type upper bounds for its low energy, together with characterizations of the equality cases. Numerical comparisons further show that these bounds can be sharper than existing bounds for certain digraph families. Furthermore, when $\alpha=0$, our results recover several classical bounds, and in particular, the low-energy bounds generalizes the classical Koolen–Moulton bound.
Read the full abstract
Numerical Analysis · Cross-listed from quant-ph
Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions
We develop operator-output quantum algorithms for matrix equations and matrix functions using matrix-sign embeddings. For each problem, an augmented matrix $M$ is chosen so that the target operator is a block of $\text{sign}(M)$ or is recovered from blocks of $(I-\text{sign}(M))/2$. We approximate the half-plane sign by a logarithmic-sinc formula and implement the shifted inverse families by scaled multiplexing with node-dependent rebalancing. For ordinary Sylvester equations, this yields a block-encoding of the solution with query complexity linear in the relevant conditioning parameters and logarithmic in the inverse error tolerance, under either a field-of-values (FoV) gap or a strip-resolvent bound. The same method extends to generalized Sylvester and Lyapunov equations, principal square and inverse square roots, matrix geometric means, and continuous-time algebraic Riccati equations (CARE), with explicit query-complexity and block-encoding-normalization bounds that cover non-normal and non-diagonalizable cases.
Read the full abstract
Complex Variables
Stability of Blaschke products under forward iteration
Forward iteration of holomorphic self-maps generalizes the iteration of a single function in a natural way. This framework arises in complex dynamics, for instance in the study of wandering domains and in seeking suitable extensions of the Denjoy-Wolff theorem. Here, we consider forward iteration of Blaschke products. We prove that the classes of indestructible and maximal Blaschke products are stable under forward iteration.
Read the full abstract
Optimization and Control
Computing welfare and fairness in allocating identical goods with entitlements and general utility functions
A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible items are allocated to consumers and demandants with different entitlements. We assume that the utility of $t$ identical items to each agent $A$ equals $f_A(t)$, where $f_A$ is an arbitrary increasing function corresponding to $A$. We present a polynomial time algorithm that determines the maximum weighted Rawlsian and Leximin welfare for scenarios with identical goods and show that the allocation obtained by the algorithm is equitable up to any item (WEQX). Some results concerning restricted utilitarian welfare and existence of WMMS and WEFX allocations are also presented. We introduce a new quantity “total weighted deficit," for allocations, and by which we obtain a tractable algorithm to achieve equitable allocations for scenarios with identical goods and different weights via compensation by using a minimum number of identical coins. Some result are for scenarios with $k$ goods of different types.
Read the full abstract
Analysis of PDEs
Path-dependent Hamilton–Jacobi equations: Uniqueness results for viscosity solutions defined via families of compact sets
We consider a path-dependent Hamilton–Jacobi equation with coinvariant derivatives over the space of continuous functions. We prove two uniqueness results for viscosity (generalized) solutions defined in terms of coinvariantly smooth test functionals and a dense family of compact subsets of the space of continuous functions. It is assumed that the Hamiltonian is continuous and satisfies a local Lipschitz condition in the functional variable with respect to the supremum norm. When the Lipschitz constant satisfies a sublinear growth condition in the gradient (impulse) variable, uniqueness is established in the class of continuous viscosity solutions. In the general case, without any such growth conditions, uniqueness is established in the class of continuous viscosity solutions that satisfy an additional local Lipschitz condition. The proofs are based on the standard method of doubling variables, but use a novel penalty functional for constructing coinvariantly smooth test functionals. The obtained results generalize previously known ones by relaxing the assumptions on the Hamiltonian and/or enlarging the class of functionals in which uniqueness is established.
Read the full abstract
Information Theory
Correcting One Deletion and One Substitution with a Constant Number of Reads
In this paper, we investigate the problem of designing $(n, N; \mathcal{B})$-reconstruction codes for $N\in \{14,11,9,5\}$, where $\mathcal{B}$ is the single-deletion single-substitution ball function that maps a sequence to the set of all sequences obtainable via one deletion and one substitution. Such a code is defined by the requirement that the intersection size of any two distinct single-deletion single-substitution balls is strictly less than the given number of noisy reads $N$. Note that for any $1\le N<N'$, an $(n, N; \mathcal{B})$-reconstruction code is also an $(n, N'; \mathcal{B})$-reconstruction code. It follows that the problem of designing $(n, N; \mathcal{B})$-reconstruction codes with less redundancy becomes more challenging as $N$ decreases, particularly because the problem for $N=1$ already reduces to the coding problem of single-deletion and single-substitution correcting codes. To the best of our knowledge, most existing results focus on the case where $N$ is a linear function of $n$, while only a limited number consider constant $N$. When $N=1$, the best known $(n, 1; \mathcal{B})$-reconstruction codes (single-deletion and single-substitution correcting codes) require $(4+o(1))\log n$ redundant bits. In this work, we show that this redundancy can be reduced to $3\log n+4$ when $N=5$. As $N$ increases further to $9$ and $11$, the redundancy can be improved to $2\log n+12\log\log n+O(1)$ and $\log n +12\log \log n+O(1)$, respectively. Finally, for $N=14$, we provide a reconstruction code with $\log n+3$ bits of redundancy, which is only two bits more than the best known $(n, 18; \mathcal{B})$-reconstruction codes.
Read the full abstract
Algebraic Geometry
Confocal families of plane algebraic curves
We study families of plane algebraic curves sharing the same set of foci. We reformulate confocality via a focal map on equiclassical families and analyze its fibers using deformation theory.
Optimization and Control
Limitations of LTI Koopman Modeling for Nonlinear Control Systems
Koopman operator theory yields powerful tools for modeling, analysis, and control of nonlinear dynamical systems. Prominently, linear time-invariant (LTI) Koopman representations have been proposed to enable the application of linear control techniques, such as LQR and convex MPC. In this work, we investigate the implications of exact LTI Koopman representations for continuous-time nonlinear control systems. In particular, we show that, assuming a mild controllability condition and the inclusion of the coordinate maps, the dynamics of the underlying control system must be affine linear. Furthermore, we study the modeling bias introduced by the LTI structure and analyze its dependency on the choice of observables.
Read the full abstract
Number Theory
Reciprocity and the Maslov Phase
We give a metaplectic proof of Hilbert reciprocity, and hence of quadratic reciprocity, in which the local phase is the Kashiwara–Maslov phase of a triple of Lagrangians. In rank two the phase of the ordered triple $(L_\infty,L_a,L_0)$ is the one-dimensional Weil index $\gamma_v(a)$. The local Hilbert symbol appears as the defect of strict multiplicativity of these phases: \[ (a,b)_v = \frac{\gamma_v(a)\gamma_v(b)}{\gamma_v(1)\gamma_v(ab)}. \] The global step compares the local and adelic realizations of a single Bruhat word for the diagonal torus elements $m(a)\in \operatorname{SL}_2(\mathbb Q)$. Locally the raw Bruhat-word lift carries the normalization factor determined by the chosen quadratic convention. These operators form a projective representation of the diagonal torus with defect \[ \mu_v(a,b) = \frac{\gamma_v(a)\gamma_v(b)}{\gamma_v(1)\gamma_v(ab)}. \] For rational adelic data, the normalized Bruhat word is multiplicative. The reciprocity law states that the total defect $\prod_v\mu_v(a,b)$ is $1$. Combined with the local bridge above, this yields Hilbert reciprocity, while quadratic reciprocity is then the specialization to the pair of odd primes $(p,q)$.
Read the full abstract
Information Theory
Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications
Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS, we survey the integration of PASS into non-orthogonal multiple access (NOMA) networks. The locations of nodes are randomly distributed within a circular coverage region. The influencing factors of LoS and none-line-of-sight (NLoS) propagation links from PASS to non-orthogonal nodes are taken into consideration. To characterize performance of PASS-NOMA, we deduce the outage probability and ergodic data rates expressions of two nodes over LoS/NLoS fading channels. In light of these theoretical results, the formally unbounded diversity gains are also characterized with node n under ideal successive interference cancellation (ISIC) and node f over LoS links, when the SNR exceeds a finite threshold. The slopes of ergodic data rate for node n with ISIC equals to one and that of node f presents a zero slope. In addition, the PASS-NOMA system throughput are evaluated in different transmission modes. It is shown from the numerical results that: 1) The outage behaviors of PASS-NOMA networks under LoS/NLoS conditions outperform that of PASS aided orthogonal multiple access (OMA) networks and that of conventional antenna systems (CASS) aided OMA/NOMA networks; 2) The employment of PASS enables the larger ergodic data rates relative to PASS-OMA and CASS-OMA/NOMA networks; and 3) As the quantity of communication radius and PASS' height rises, the performance of PASS-NOMA networks are declined at a certain extent.
Read the full abstract
Statistics Theory
The optimal betting wealth growth rate
This paper characterizes the best possible rate of growth of wealth in a Kelly betting game when repeatedly betting against a general i.i.d. null hypothesis $\mathscr{P}$, but the data are drawn i.i.d from an arbitrary alternative $Q$. We prove that it equals $\lim_{n \to \infty}n^{-1}\inf_{P \in (\mathscr P)^n)^{\circ\circ}} \mathrm{KL}(Q^n,P)$, where ${\mathscr P}^n = \{P^n: P \in \mathscr{P}\}$ and $(\mathscr {P}^n)^{\circ\circ}$ is its bipolar, i.e., this rate is achievable and one cannot do better. This quantity is in general smaller than a more popular quantity in the literature, $\mathrm{KL}_{\inf}(Q,\mathscr{P}) := \inf_{P \in \mathscr P}\mathrm{KL}(Q,P)$. If $\mathrm{KL}_{\mathrm{inf}}(\cdot,\mathscr P)$ is weakly lowersemicontinuous (w.l.s.c.) at $Q$, we show that the two quantities are equal; in particular, this happens when $\mathscr P$ is weakly compact. For simple alternatives, we provide the first matching necessary and sufficient condition for when power-one sequential tests exist (without assumptions on $\mathscr P, Q$). We also derive the optimal worst-case growth rate against composite $\mathscr Q$. We emphasize that test supermartingales on reduced filtrations suffice for all i.i.d. testing problems, and more general e-processes are not required. We thus completely generalize the recent results of Larsson et al.~\cite{larsson2025numeraire} to the sequential setting.
Read the full abstract
Optimization and Control
Sakawa-Shindo algorithm for optimal control of time-delay systems, with applications to epidemiology
We extend the Sakawa-Shindo algorithm to solve optimal control problems where the system dynamics involve an arbitrary number of discrete state delays. We prove that the algorithm guarantees termination in a finite number of steps, asymptotic first-order optimality of the generated control sequence and convergence of a subsequence to a control satisfying first-order optimality, and we apply it to the optimal design of non-pharmaceutical interventions and vaccination plans for epidemic models with delays associated with incubation period and vaccination.
Read the full abstract
Analysis of PDEs
Uniqueness of simultaneous reconstruction of general space- and time-dependent sources and initial states in fractional diffusion equations and systems from single boundary measurements
Inverse problem to determine simultaneously a general space- and time-dependent source and an initial state in a fractional diffusion equation from an a posteriori measurement of the normal derivative of the state on a portion of a boundary of the space domain is considered. Uniqueness for this problem is proved under the assumption that an order of a fractional derivative involved in the equation is irrational. The uniqueness result is generalized to an inverse problem for a coupled system of fractional diffusion equations, where both sources and initial states are unknown and first component of the state is measured on the boundary.
Read the full abstract
Algebraic Geometry
A local-global correspondence for perfectoid purity
We introduce (lim-)perfectoid splitting, which is a global variant of (lim-)perfectoid purity. Our main result establishes a correspondence between the lim-perfectoid splitting of projective schemes and the lim-perfectoid purity of their Gorenstein section rings. As an application, we construct a new supply of examples of lim-perfectoid pure rings that go beyond the previously known complete intersection or splinter-type cases.
Read the full abstract
Numerical Analysis
Numerical approximation of a transient thermo-electromagnetic problem in axisymmetric geometries
This paper analyzes a transient thermo-electromagnetic problem arising in the modeling of induction heating processes. Unlike previous studies that focused on steady-state scenarios, we consider a time-dependent thermal problem coupled with a nonlinear time-harmonic electromagnetic problem through temperature-dependent electrical conductivity and Joule effect. Exploiting cylindrical symmetry and assuming a purely azimuthal current density, we formulate the problem on a two-dimensional meridional section. We introduce a variational formulation in appropriately weighted Sobolev spaces and prove existence of a solution by a fixed-point argument. Under reasonable assumptions on the physical parameters, we also prove uniqueness. A finite element discretization combined with implicit time stepping is used to compute the numerical solution. To evaluate the accuracy of the approximation, a priori error estimates are derived and validated by numerical experiments. Finally, numerical simulations illustrate the effectiveness of the proposed approach in an industrially relevant configuration.
Read the full abstract
Algebraic Topology
Immersions of $C_2$-projective spaces via $K\mathbb{R}$-theory
We compute the Atiyah Real $K$-theory of $C_2$-equivariant projective spaces and construct immersions of such spaces into multiples of the regular representation. These computations are made tractable by the recent geometric filtration of equivariant projective spaces due to Bhattacharya-Waugh-Zeng-Zou, together with a variant of the localized slice spectral sequence introduced by Meier-Shi-Zeng. As an immediate corollary of these computations, we obtain an equivariant analogue of James periodicity.
Read the full abstract
Optimization and Control
Regulation of Rumor Propagation via (Multi-Leader) Stackelberg Graphon Games
We study the control of rumor propagation in large networked populations by using Stackelberg graphon games. We first introduce a principal who wants to incentivize the spread of her preferred news and discourage the spread of non-preferred news. We define the Stackelberg graphon game equilibrium (SGGE), characterize the graphon game Nash equilibrium (GGNE) with a forward-backward differential equation system, and establish existence results. We further formulate a multi-leader model with two competing principals, each incentivizing her own preferred news. Finally, we propose a bi-level algorithm for computing (multi-leader) Stackelberg graphon game equilibria and conclude with numerical experiments where we show that existence of competing principals will result in strong opinion divisions in the population.
Read the full abstract
Logic
From Gödel incompleteness to the consistency of circuit lower bounds
We prove that the bounded arithmetic theory $S^1_2$ is consistent with EXP $\not\subseteq$ P/poly. More generally, we show that certain separations of $V^1_2$ from a theory $T$ imply the consistency of $T$ with EXP $\not\subseteq$ P/poly. For $T=S^1_2$, Takeuti (1988) established such a separation using a variant of Gödel's consistency statement. Analogous results hold for PSPACE $\not\subseteq$ P/poly but the required separations of theories are yet unknown. Finally, we give magnification results for the hardness of proving almost-everywhere versions of these lower bounds.
Read the full abstract
Combinatorics
Triangle packings in randomly perturbed graphs
The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and Rödl showed that, with high probability, $G(n,p)$ contains a triangle packing covering all but $o(n^2p)$ edges whenever $p\ge n^{-1/2+\varepsilon}$. In this paper, we study near-perfect triangle packings in randomly perturbed graphs. We prove that for every $d>0$ and every $p>2d/(1+2d)$, if $G_d$ is a $dn$-regular graph on $n$ vertices, then with high probability the union $G_d\cup G(n,p)$ contains a triangle packing covering all but $o(n^2)$ edges. Moreover, this bound on $p$ is best possible for $0<d\le 1/2$, thereby determining the threshold in this range. A key ingredient in the proof is a new triangle-weighting lemma for weighted complete graphs.
Read the full abstract
Representation Theory
Chebyshev quotients, Demazure multiplicities, and Dyck-path models
We study Chebyshev quotients that arise in the representation theory of Lie algebras, specifically within the theory of Demazure flags for fusion products of $\mathfrak{sl}_2[t]$-modules. Using a recent formula that expresses numerical Demazure multiplicities as coefficients of such quotients, we prove a general eventual non-negativity theorem for the same rational functions that compute these multiplicities: each quotient either terminates or has strictly positive coefficients for sufficiently large degrees, which we in turn interpret in terms of matchings and bounded walks. In several natural infinite families, these are unsigned bounded Dyck path models, giving both a structural explanation for the observed positivity phenomenon and concrete combinatorial models for key families of Demazure multiplicities. The theorems in this paper were autonomously produced and formalized in Lean/Mathlib by AxiomProver from natural-language statements.
Read the full abstract
Representation Theory
$B'$-orbits on flag varieties and symmetry breaking
Motivated by branching problems for principal series representations of the Lie group $G = GL(n,\mathbb R)$, we consider all pairs $(G', P)$ with $G'$ being the Levy factor of a parabolic subgroup of $G$ and $P$ a parabolic subgroup of $G$ for which a Borel subgroup $B'$ of $G'$ has finitely many orbits on $G/P$. We classify all such pairs $(G',P)$ for which $B'$-orbits on the generalized flag variety $G/P$ are determined by invariant functions inspired from the Bruhat decomposition. We also describe explicitly the double coset space $B'\backslash G/P$ as well as the closed $B'$-orbits on $G/P$ whenever $B'$-orbits are computed by these invariant functions.
Read the full abstract
Representation Theory
Stability of Multiplicities in Symmetry Breaking: The sl_2 Case
This expository paper explains, in the case of $\mathfrak{sl}_2$, the ideas introduced in the preprints (arXiv:2509.17007, 2604.22262), which develop a new framework for the study of multiplicities in branching laws of representations, with particular emphasis on their dependence on representation parameters. Taking the Lie algebra $\mathfrak{sl}_2$ as a guiding example, we show that multiplicities, which are often computed via ad hoc, case-by-case arguments, are in fact governed by universal systems of linear inequalities. To describe these inequalities, we introduce the notion of fences, which encode the piecewise-linear boundaries of regions in parameter space on which multiplicities remain constant. Within this framework, we give an explicit description of how multiplicities vary as parameters move inside reduced coherent families of representations. Our approach applies uniformly both to finite-dimensional representations and to admissible smooth Fréchet representations of real reductive Lie groups, and reveals a subtle and intrinsic interplay between the parameters of a group and those of its subgroup. As an application of the general theory, we establish stability results and explicit formulas that clarify and unify a variety of classical phenomena, including the Pieri rule, $K$-type formulas, fusion rules, and tensor products of Verma modules. In particular, the stability of fusion multiplicities provides a concrete manifestation of the theory. More broadly, this framework suggests a unified approach to branching multiplicities extending beyond the $\mathfrak{sl}_2$ case.
Read the full abstract
Differential Geometry
Balanced and pluriclosed metrics on real semisimple Lie groups
We characterise the existence of balanced and pluriclosed metrics on compact quotients of real semisimple Lie groups equipped with regular complex structures, in terms of Vogan diagrams. Consequently, such complex manifolds cannot simultaneously admit a balanced metric and a pluriclosed metric. Along the way, we revisit and correct the classification of regular complex structures on real semisimple Lie groups.
Read the full abstract
Algebraic Geometry