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

10213141 · Jun 202619922001200920172026
48 results for Fricke signs

The paper discovers patterns in Maass forms' coefficients related to Fricke signs.

problem Identifying Fricke signs in Maass forms with unknown signs.
method Averaging Fourier coefficients, Linear Discriminant Analysis (LDA), neural networks.
result 96% accuracy in predicting Fricke signs for forms with even parity, 94% for odd parity.

In this note, we embed the set of all Fricke characters of a free group F -- the set of all characters of representations of F into SL(2,C) -- as an irreducible affine variety V in complex affine space of dimension 2^n-1. Using the Horowitz generating set as the indeterminates, we show that the ideal I of all polynomia…

2003-11-07abs ↗pdf ↗

The first eigenvalue of the Laplacian on a unique Hurwitz surface has a sevenfold multiplicity and specific numerical values.

problem Identifying the spectrum of the Laplacian on a specific Hurwitz surface.
method Analytical proof for the multiplicity and numerical identification of the first eigenvalue; numerical identification of the eigenspace representation; determination of Dirichlet domain.
result The first eigenvalue of the Laplacian on the Fricke-Macbeath surface has a sevenfold multiplicity and is contained in the interval [1.23, 1.26].

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce regular globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as an enhanced product of two copies of the Fricke space of ΣΣ and as the b…

2018-06-21abs ↗pdf ↗

This is a mathematical commentary on Teichm{ü}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{ä}chen'' (Determination of extremal quasiconformal maps of closed oriented Riemann surfaces). This paper is among the last (and may be the last one) that Teich…

2015-10-09abs ↗pdf ↗

The rigidity of marked length spectrum for closed hyperbolic surfaces due to Fricke-Klein [7] has been the motivation of many different rigidity results, specially for manifolds of negative curvature. From the works of Vigneras [18], Sunada [17] and many other authors this result is far from being true for the unmarked…

2017-01-30abs ↗pdf ↗

Given a closed binding curve γγ of a surface ΣΣ, any equivalence class of marked complete hyperbolic structure can be decomposed into polygons(possibly with a puncture) with sides being hyperbolic geodesic segments. When ΣΣ is a one-holed torus and γ=A3B2γ= A^3 B^2, we show that any equivalence class of marked complete …

2011-10-16abs ↗pdf ↗

Deformation spaces Hom(ππ,G)/G of representations of the fundamental group ππ of a surface ΣΣ in a Lie group GG admit natural actions of the mapping class group ModΣMod_Σ, preserving a Poisson structure. When GG is compact, the actions are ergodic. In contrast if GG is noncompact semisimple, the associated deformat…

2005-09-06abs ↗pdf ↗

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.

SELO model predicts link signs better than SDGNN using subgraph encoding and linear optimization.

problem Inferring the sign of links in signed networks with limited sign data.
method Subgraph Encoding via Linear Optimization (SELO) approach to learn edge embeddings.
result SELO model outperforms state-of-the-art methods on multiple real-world signed networks.

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…

2017-01-05abs ↗pdf ↗

Novel GNN for signed and directed networks using magnetic signed Laplacian.

problem Efficiently modeling signed and directed networks for tasks like clustering and link prediction.
method Introduced a magnetic signed Laplacian for directed signed graphs, used it to construct a spectral GNN.
result Demonstrated effective performance on tasks involving signed and directional information.

Sign equivariant networks improve model expressiveness for spectral geometric learning.

problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.

In this short note, we compare the combinatorial sign assignment of Manolescu, Ozsvath, Szabo and Thurston for grid homology of knots and links in 3-sphere with the sign assignment coming from a coherent system of orientations on Whitney disks. Although these constructions produce different signs, a small modification …

2018-12-06abs ↗pdf ↗

PyTorch Geometric Signed Directed fills the gap for GNNs on signed and directed graphs.

problem Lack of unified software packages for GNNs on signed and directed networks.
method Developed a software package with GNN models, synthetic and real-world data, and evaluation metrics.
result Demonstrates the effectiveness of the implemented methods through experiments.

Novel CNN array for sign language recognition using wearable IMUs.

problem Efficiently recognizing sign language from wearable IMU signals.
method Two-dimensional Convolutional Neural Network array architecture for Indian sign language recognition.
result Peak classification accuracies of 94.20% for general sentences and 95.00% for interrogative sentences achieved.

In this paper we use theory of embedded graphs on oriented and compact PLPL-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter's circles. For the case of signed Gaus…

2015-11-24abs ↗pdf ↗

Method predicts which high-dimensional correlation signs will change in the future.

problem Predicting which correlation matrix coefficients will change signs in high-dimensional data.
method Stability of correlation signs depends on three-by-three relationships, inspired by Heider social cohesion theory.
result The method accurately predicts the stability of correlation signs in high-dimensional data.

CSNE embeds signed networks by separating structural and fine-grained information.

problem Improving sign prediction in signed networks using inaccurate or incomplete balance theories.
method Conditional Signed Network Embedding (CSNE) models structural and fine-grained information separately, integrating them rigorously.
result CSNE outperforms state-of-the-art on sign prediction tasks, and MaxEnt priors are competitive in resource-constrained settings.

Signed seminorms linked to real tropical spaces and matroids.

problem Understanding signed seminorms and their real tropicalizations.
method Introducing signed Goldman-Iwahori space, identifying it as inverse limit of real tropicalizations, and giving matroid-theoretic description.
result Signed seminorms identified as inverse limit of real tropicalizations of projective space.

The paper finds sign-changing solutions for a specific type of elliptic equation.

problem Existence of sign-changing solutions for a Yamabe type equation.
method Investigates a critical elliptic equation with a Yamabe type operator on a compact manifold with boundary.
result Existence of sign-changing solutions assured under certain geometric conditions.

Unified sign-based compression for federated learning with faster convergence.

problem High communication cost in federated learning with large-scale models.
method Unified noisy perturbation scheme for sign-based compression.
result Achieves faster convergence rate than existing sign-based methods.

Signed graphs encode positive (attractive) and negative (repulsive) relations between nodes. We extend spectral clustering to signed graphs via the one-parameter family of Signed Power Mean Laplacians, defined as the matrix power mean of normalized standard and signless Laplacians of positive and negative edges. We pro…

2019-05-15abs ↗pdf ↗

Signed-permutation coordinate transport improves model alignment across checkpoints.

problem Improper alignment of coordinate-indexed objects across model checkpoints.
method Introduces sign-marginalized Hungarian matching and coordinate-preserving transport.
result Recovering signed-permutation gauge improves coordinate alignment and model performance.

New method estimates tensors from noisy data with missing entries.

problem Tensor estimation from noisy observations with missing entries.
method Sign series representation for tensor completion, addressing low- and high-rank signals.
result Excess risk bounds, estimation error rates, and sample complexities established.

Develops method for learning signed graphs from smooth signals.

problem Learning signed graphs from observed data, especially in contexts with both positive and negative interactions.
method Uses net Laplacian as graph shift operator and minimizes total variation of observed signals with ADMM.
result Theoretical proofs of convergence and estimation error bound provided.

A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.

problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.

Study on blow-up behavior of sign-changing solutions for Yamabe equation.

problem Blow-up behavior of sign-changing solutions for Yamabe equation.
method Construction of a smooth metric on space forms to prove blow-up at lowest energy level.
result Blow-up occurs at the lowest energy level for sign-changing solutions in dimensions 11 to 24.

We analyse the problem of assigning sign choices to O-planes in orientifolds of type II string theory. We show that there exists a sequence of invariant pp-gerbes with p1p\geq-1, which give rise to sign choices and are related by coboundary maps. We prove that the sign choice homomorphisms stabilise with the dimension…

2019-05-15abs ↗pdf ↗

Unified model for signed networks separates balance and anomaly effects.

problem Ignoring sign information in signed networks leads to inaccurate analysis.
method Low rank plus sparse matrix decomposition with regularized formulation.
result The model accurately detects communities and anomalies in signed networks.

Regularized spectral methods improve clustering in signed graphs, especially for sparse data.

problem Clustering signed graphs with positive and negative edges.
method Developed regularized versions of SPONGE and Signed Laplacian methods for clustering signed graphs, especially for sparse data.
result Theoretical guarantees and empirical performance improvements for clustering signed graphs, especially in sparse regimes.

Study on compact Kähler surfaces for sign-changing curvatures.

problem Prescribing sign-changing Chern scalar curvatures on compact Kähler surfaces.
method Established a Chen-Li type existence theorem and provided an alternative proof.
result Alternative proof of Ding-Liu's theorem on sign-changing Gaussian curvatures.

We introduce a property of mutation loops, called the sign stability, with a focus on an asymptotic behavior of the iteration of the tropical X\mathcal{X}-transformation. A sign-stable mutation loop has a numerical invariant which we call the cluster stretch factor, in analogy with that of a pseudo-Anosov mapping clas…

2019-11-18abs ↗pdf ↗

Voice-controlled personal and home assistants (such as the Amazon Echo and Apple Siri) are becoming increasingly popular for a variety of applications. However, the benefits of these technologies are not readily accessible to Deaf or Hard-ofHearing (DHH) users. The objective of this study is to develop and evaluate a s…

2019-09-24abs ↗pdf ↗