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,695 papers · 148 categories

Trend · papers per month

157314471628 · Jun 202019922001200920172026
48 results for reducible representations

Characterizes Anosov reducible representations in terms of eigenvalues.

problem Understanding Anosov representations in reducible settings.
method Characterizes Anosov representations using eigenvalue magnitudes of irreducible block factors.
result Connected components of character varieties do not contain reducible representations for many non-elementary hyperbolic groups.

Study Anosov representations of reducible suspensions of hyperbolic groups.

problem Characterize dynamical properties of reducible suspensions of Anosov representations.
method Analyzing linear representations of non-elementary hyperbolic groups, focusing on weak unipotent actions on subspaces.
result Characterize when reducible suspensions are discrete and faithful, quasi-isometrically embedded, and Anosov.

Let MφM_φ be a surface bundle over a circle with monodromy φ:SSφ:S \rightarrow S. We study deformations of certain reducible representations of π1(Mφ)π_1(M_φ) into SL(n,C)\text{SL}(n,\mathbb{C}), obtained by composing a reducible representation into SL(2,C)\text{SL}(2,\mathbb{C}) with the irreducible representation $\text{SL}(2,\mathb…

2015-09-24abs ↗pdf ↗

We show how Conway's multivariable potential function can be constructed using braids and the reduced Gassner representation. The resulting formula is a multivariable generalization of a construction, due to Kassel-Turaev, of the Alexander-Conway polynomial in terms of the Burau representation. Apart from providing an …

2017-09-11abs ↗pdf ↗

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

In this article we give examples which show that the TQFT representations of the mapping class groups derived from quantum SU(N) for N>2 are generically decomposable. One general decomposition of the representations is induced by the symmetry which exchanges SU(N) representation labels by their conjugates. The respecti…

2007-06-26abs ↗pdf ↗

The paper studies how the singularity of character varieties changes when representations are extended.

problem Understanding the singularity of character varieties for extended representations.
method Analyzes the variety of characters of fundamental groups in different matrix groups.
result Character varieties become singular when irreducible representations are extended, and the singularity is described.

The Lawrence representation Ln,mL_{n,m} is a family of homological representation of the braid group BnB_n, which specializes to the reduced Burau and the Lawrence-Krammer representation when mm is 1 and 2. In this article we show that the Lawrence representation is faithful for m2m \geq 2.

2005-09-04abs ↗pdf ↗

We show how a polar representation of a compact connected Lie group can be linearly determined from its dimension and isotropy subgroup data in the general reducible case.

2017-04-11abs ↗pdf ↗

We give explicit equations that describe the character variety of the figure eight knot for the groups SL(3,C), GL(3,C) and PGL(3,C). This has five components of dimension 2, one consisting of totally reducible representations, another one consisting of partially reducible representations, and three components of irred…

2015-05-17abs ↗pdf ↗

The reduced Burau representation VnV_n of the braid group BnB_n is obtained from the action of BnB_n on the homology of an infinite cyclic cover of the disc with nn punctures. The group homology H(Bn;Vn)H_*(B_n;V_n) of braid groups with coefficients in the complexified reduced Burau representation is calculated. Our topolog…

2015-06-06abs ↗pdf ↗

Symbolic LSTM improves time series forecasting by reducing hyperparameter sensitivity.

problem High sensitivity to hyperparameters and random initialization in numerical time series forecasting.
method Combining LSTM with a dimension-reducing symbolic representation.
result Symbolic representation alleviates forecasting problems and speeds up training.

The aim of this article is to study the existence of certain reducible, metabelian representations of knot groups into SL(n,C)\mathrm{SL}(n,\mathbf{C}) which generalise the representations studied previously by G.~Burde and G.~de Rham. Under specific hypotheses we prove the existence of irreducible deformations of such repr…

2015-02-13abs ↗pdf ↗

New technique reduces bias in DNN models without sensitive attribute annotations.

problem Existing bias mitigation methods require instance-level annotations and do not guarantee removal of all sensitive information.
method Representation Neutralization for Fairness (RNF) debiases only the classification head of DNN models using neutralized representations.
result RNF effectively reduces discrimination of DNN models with minimal performance degradation.

Researchers describe character varieties for Hopf links, proving geometric properties.

problem Character variety geometry of Hopf links with nn twists.
method Geometric descriptions of irreducible and totally reducible representations.
result Complete geometric description of SU(2)\mathrm{SU}(2)-character variety for r=2r=2.

Proposes Fair Archetypal Analysis to reduce fairness concerns in data representation.

problem Inadvertent encoding of sensitive attributes in Archetypal Analysis.
method Integrates fairness regularization into Archetypal Analysis and its nonlinear extension.
result Reduces group separability without significantly compromising explained variance.

Reduces data leakage in distributed deep learning models.

problem Prevents reconstruction of sensitive raw data patterns during client communications.
method Reduces distance correlation between raw data and learned representations.
result Resilient to reconstruction attacks while maintaining model accuracy.

This paper addresses law invariant coherent risk measures and their Kusuoka representations. By elaborating the existence of a minimal representation we show that every Kusuoka representation can be reduced to its minimal representation. Uniqueness -- in a sense specified in the paper -- of the risk measure's Kusuoka r…

2012-10-26abs ↗pdf ↗

We investigate a family of (reducible) representations of Artin's braid groups corresponding to a specific solution to the Yang-Baxter equation. The images of the braid groups under these representations are finite groups, and we identify them precisely as extensions of extra-special 2-groups. The decompositions of the…

2005-03-21abs ↗pdf ↗

In this paper, we study the monodromy of the Hitchin fibration for rank 2 vector bundles over hyperelliptic curves. We reduce the problem to studying a surface braid group generalization of the classical Burau representation, and give a combinatorial method for computing this representation.

2004-12-14abs ↗pdf ↗

A spherical topological manifold of dimension n-1 forms a prototile on its cover, the (n-1)-sphere. The tiling is generated by the fixpoint-free action of the group of deck transformations. By a general theorem, this group is isomorphic to the first homotopy group. Multiplicity and selection rules appear in the form of…

2008-10-19abs ↗pdf ↗

We study properties of irreducible and completely reducible representations of finitely generated groups Gamma into reductive algebraic groups G in in the context of the geometric invariant theory of the G-action on Hom(Gamma,G) by conjugation. In particular, we study properties of character varieties, X_G(Gamma)=Hom(G…

2009-02-16abs ↗pdf ↗

Self-supervised learning improves by predicting known information, reducing labeled data needs.

problem Efficiently learn useful semantic representations without labeled data.
method Develops a mechanism exploiting statistical connections between pretext tasks to learn representations that solve downstream tasks.
result Proves linear layer yields small approximation error and drastically reduces labeled sample complexity.

The surface singular braid monoid corresponds to marked graph diagrams of knotted surfaces in braid form. In a quest to resolve linearity problem for this monoid, we will show that if it is defined on at least two or at least three strands, then its two or respectively three dimensional representations are not faithful…

2016-02-28abs ↗pdf ↗

Quantum representations of mapping class groups are locally rigid at prime levels.

problem Locally rigid properties of quantum representations of mapping class groups.
method Proving local rigidity for Fibonacci representations of mapping class groups at prime levels.
result Local rigidity of Fibonacci representations of mapping class groups at prime levels.

This paper improves few-shot learning by reducing sample complexity using representation learning.

problem Reducing sample complexity for target tasks with limited data.
method Representation learning to pool all source task samples for target task learning.
result Representation learning can achieve substantial sample size reduction, bypassing the $Ω( rac{1}{T})$ barrier.

We discuss techniques for analysing the structure of the group obtained by reducing the image of the Burau representation of the braid group modulo a prime. The main tools are a certain sesquilinear form first introduced by Squier and consideration of the action of the group on a Euclidean building.

1998-10-26abs ↗pdf ↗

Researchers provide a simple topological method for Burau representations of loop braid groups.

problem Constructing Burau representations of loop braid groups.
method Simple topological construction of the Burau representations.
result One of the representations is more subtle and topologically natural but not easily combinatorially obvious.

Unified representation of density-power-based divergences simplifies estimation to M-estimation.

problem Outliers in density estimation.
method Define a norm-based Bregman density power divergence (NB-DPD) that reduces to M-estimation.
result NB-DPD connects and generalizes existing divergences, highlighting robustness properties.

Researchers create projective representations of Hecke groups using TQFT.

problem Constructing projective representations of Hecke groups.
method Using Witten-Reshetikhin-Turaev topological quantum field theory of higher genus surfaces.
result The representation's image group is infinite at low levels in genus 2.

This paper evaluates fairness in deep metric learning and proposes a method to reduce subgroup performance gaps.

problem The negative impact of deep metric learning representations on minority subgroup performance in downstream tasks.
method Definition of fairness in DML through inter-class, intra-class, and uniformity properties; finDML benchmark; Partial Attribute De-correlation (PARADE) method.
result Bias in DML representations propagates to downstream tasks, even with balanced training data.

Extends RRR to capture nonlinear interactions in multi-response regression.

problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.