Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

306191121 · May 202619922001200920172026
48 results for branching laws

This is a second paper in a series devoted to the minimal unitary representation of O(p,q). By explicit methods from conformal geometry of pseudo-Riemannian manifolds, we find the branching law corresponding to restricting the minimal unitary representation to natural symmetric subgroups. In the case of purely discrete…

2001-11-07abs ↗pdf ↗

Let GG be a compact connected Lie group and let H be a subgroup fixed by an involution. A classical result assures that the action of the complex reductive group HCH_C on the flag variety FF of GG admits a finite number of orbits. In this article we propose a formula for the branching coefficients of the symmetric p…

2018-06-20abs ↗pdf ↗

The paper classifies and constructs differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces.

problem Classifying and constructing differential symmetry breaking operators.
method Utilizing factorization identities and branching laws of generalized Verma modules.
result Differential symmetry breaking operators from a line bundle to a vector bundle over real projective spaces are classified and constructed.

Study analyzes spectral properties on specific geometric spaces.

problem Investigates spectral analysis on standard locally homogeneous spaces.
method Uses branching laws and invariant differential operators on spherical homogeneous spaces.
result Proves essential self-adjointness and infinite point spectrum for certain spaces.

Using an algebraic Fourier transform of operators, we develop a method (F-method) to obtain explicit highest weight vectors in the branching laws by differential equations. This article gives a brief explanation of the F-method and its applications to a concrete construction of some natural equivariant operators that a…

2012-12-31abs ↗pdf ↗

We study simultaneous price drops of real stocks and show that for high drop thresholds they follow a power-law distribution. To reproduce these collective downturns, we propose a minimal self-organized model of cascade spreading based on a probabilistic response of the system elements to stress conditions. This model …

2010-03-16abs ↗pdf ↗

Hidden symmetry of a G'-space X is defined by an extension of the G'-action on X to that of a group G containing G' as a subgroup. In this setting, we study the relationship between the three objects: (A) global analysis on X by using representations of G (hidden symmetry); (B) global analysis on X by using representat…

2016-08-30abs ↗pdf ↗

This work reveals a new scaling law for optimal design of multirotor aerial vehicles.

problem Designing optimal configurations for fully-actuated multirotor aerial vehicles.
method Formulated on the product manifold of Projective Lines \RP^2^N, minimizing a coordinate-invariant Log-Volume isotropy metric.
result The topology of the global optima is governed by the symmetry of the chassis, leading to a N-5 Scaling Law.

DeepONet learns operators for PDEs with varying parameters and initial conditions.

problem Learning operators for partial differential equations with different parameters or initial conditions.
method DeepONet uses a Branch net and Trunk net to minimize error between evaluated and expected outputs, incorporating a scalar auxiliary variable approach for energy dissipation.
result DeepONet can accurately approximate operators for PDEs with varying parameters or initial conditions.

Procedure for determining less discriminatory alternatives in AI audits with limited resources.

problem Difficulty in proving less discriminatory alternatives in AI audits due to resource constraints.
method Closed-form upper bound for loss-fairness Pareto frontier, enabling claimants to fit PFs without training large models.
result A scaling law for loss-fairness Pareto frontiers, allowing claimants to determine if an LDA exists with limited resources.

ARL bridges non-Markovian decision processes with reinforcement learning, improving foresight and stability.

problem Inaccurate foresight in non-Markovian environments due to state-based methods' limitations.
method Lifted state space into a signature-augmented manifold, using a self-consistent field approach to anticipate future path-law.
result ARL achieves deterministic evaluation of expected returns with reduced computational complexity and variance.

Wide neural networks can learn complex functions like gravitational force law.

problem Learning complex functions like gravitational force law with neural networks.
method Extending theoretical bounds to analytic functions on the sphere using SGD and ReLU networks.
result Wide ReLU networks can learn analytic functions efficiently with proportional number of samples.

The study analyzes deep linear networks from random initialization, capturing dynamics and hyperparameter effects.

problem Understanding training dynamics in deep linear networks from random initialization.
method Theoretical analysis of gradient descent dynamics in deep linear networks with random initialization and large data.
result Captures the 'wider is better' effect and hyperparameter transfer effects, contrasting with neural-tangent parameterization.

A new clustering framework using fixed points for data analysis.

problem Lack of unified understanding and application of clustering algorithms in data analysis.
method Restated model-based clustering using fixed point theory, iteratively constructing contraction maps to find cluster centers.
result Unified clustering framework reveals convergence mechanisms and interconnections among clustering algorithms.

Study on moduli spaces of branched projective structures on surfaces.

problem Characterizing and understanding moduli spaces of branched projective structures.
method Analytic and geometric methods to study the moduli spaces of branched projective structures.
result The moduli space of marked branched projective structures is a complex analytic space with specific dimensions and singular points.

The study compares parametric and nonparametric models for estimating mean-variance mixtures and finds that nonparametric models perform better.

problem Estimating the distribution of a normal mean-variance mixture under uncertainty.
method Comparison of six parametric mixing laws with a grid nonparametric maximum likelihood estimator, using a paired block bootstrap for score comparison.
result Nonparametric models outperform parametric models in estimating the distribution of a normal mean-variance mixture.

We define a laminar branched surface to be a branched surface satisfying the following conditions: (1) Its horizontal boundary is incompressible; (2) there is no monogon; (3) there is no Reeb component; (4) there is no sink disk (after eliminating trivial bubbles in the branched surface). The first three conditions are…

2002-03-31abs ↗pdf ↗

We define an activity dependent branching ratio that allows comparison of different time series XtX_{t}. The branching ratio bxb_x is defined as bx=E[ξx/x]b_x= E[ξ_x/x]. The random variable ξxξ_x is the value of the next signal given that the previous one is equal to xx, so ξx={Xt+1Xt=x}ξ_x=\{X_{t+1}|X_t=x\}. If bx>1b_x>1, the process is …

2009-10-13abs ↗pdf ↗

Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected close surface N with Euler's characteristic less than or equal to 0. This …

2007-07-19abs ↗pdf ↗

Techniques for constructing codimension 2 embeddings and immersions of the 2 and 3-fold branched covers of the 3 and 4-dimensional spheres are presented. These covers are in braided form, and it is in this sense that they are folded. More precisely the composition of the embedding (or immersion) and the canonical proje…

2013-01-17abs ↗pdf ↗

New examples show transverse knots are determined by their branched covers.

problem Transverse knots and their isotopy classes.
method Constructing and analyzing non-isotopic transverse knots with contactomorphic cyclic branched covers.
result Transverse isotopy classes of many transverse knots are determined by the contactomorphism type of their cyclic branched covers.

We establish a calculus for branched spines of 3-manifolds by means of branched Matveev-Piergallini moves and branched bubble-moves. We briefly indicate some of its possible applications in the study and definition of State-Sum Quantum Invariants.

2004-02-29abs ↗pdf ↗

Quantized Coulomb branches linked to skein algebras.

problem Understanding the relationship between quantized Coulomb branches and skein algebras.
method Association of quantized Coulomb branches to surfaces, description of relationship for specific surfaces, formulation of a conjecture.
result A conjecture linking quantized Coulomb branches and skein algebras.

We prove that if S is a closed compact surface of negative Euler characteristic, and if R is a quasi-Fuchsian representation in PSL(2,C), then the deformation space M(k,R) of branched projective structures on S with total branching order k and holonomy R is connected, as soon as k>0. Equivalently, two branched projecti…

2012-03-27abs ↗pdf ↗

Branched covers between Riemann surfaces are associated with certain combinatorial data, and Hurwitz existence problem asks whether given data satisfying those combinatorial constraints can be realized by some branched cover. We connect recent development in spherical conic metrics to this old problem, and give a new m…

2018-05-08abs ↗pdf ↗

Dropout schedules can be optimized to significantly reduce model test loss.

problem Improving model performance in neural networks.
method Developed a mean-field theory of dropout at the edge of chaos, proposing front-loaded dropout schedules.
result Front-loaded dropout schedules reduce test loss by 18-35% over constant dropout.

Authors prove a contact structure result using branched covers and overtwisted disks.

problem Proving a contact structure result using branched covers and overtwisted disks.
method Explicitly constructing an overtwisted disk in the pp-fold cyclic branched cover of S3S^3.
result An overtwisted disk is contained in the complement of the branch locus.

We introduce and analyze the characteristic foliation induced by a contact structure on a branched surface, in particular a branched standard spine of a 3-manifold. We extend to (fairly general) singular foliations of branched surfaces the local existence and uniqueness results which hold for genuine surfaces. Moreover…

1998-09-29abs ↗pdf ↗