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.

169,291 papers · 148 categories

Trend · papers per month

18375573 · Jun 202619922001200920182026
48 results for Ramanujan's identities

Born-Infeld solitons linked to maximal surfaces via Ramanujan's identities.

problem Understanding Born-Infeld solitons and their relation to maximal surfaces.
method Combining Born-Infeld solitons with maximal surfaces, using Ramanujan's identities.
result Derived new identities from Weierstrass-Enneper representation of maximal surfaces.

The tail of the colored Jones polynomial of an alternating link is a qq-series invariant whose first nn terms coincide with the first nn terms of the nn-th colored Jones polynomial. Recently, it has been shown that the tail of the colored Jones polynomial of torus knots give rise to Ramanujan type identities. In th…

2015-12-01abs ↗pdf ↗

Researchers found a qq-series identity for a specific knot using sl3\mathfrak{sl}_3 representations.

problem Finding a qq-series tail for sl3\mathfrak{sl}_3 colored Jones polynomials.
method Explicit formulas for the tail of sl3\mathfrak{sl}_3 colored Jones polynomials for (2,2m)(2,2m)-torus links.
result An identity of qq-series connecting sl3\mathfrak{sl}_3 colored Jones polynomials and Ramanujan false theta function.

The height function of various surfaces decomposes into finite sums of scaled and translated versions of itself.

problem Decomposing the height function of different types of surfaces into simpler components.
method Using Euler-Ramanujan identities and Weierstrass-Enneper representation to decompose height functions of minimal, maximal, timelike minimal, and Born-Infeld surfaces.
result The height function of various surfaces can be expressed as a finite sum of scaled and translated versions of itself.

The paper shows how Scherk-type surfaces can be decomposed into helicoids.

problem Decomposing Scherk-type zero mean curvature surfaces.
method Using a special Euler-Ramanujan identity and Wick rotation, the paper expresses these surfaces as an infinite superposition of dilated helicoids and provides different finite decompositions.
result Scherk-type zero mean curvature surfaces can be expressed as an infinite superposition of dilated helicoids.

Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.

problem Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.
method Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.
result Derive new Euler-Ramanujan-type identities and infinite decompositions for zero mean curvature graphs in various spaces.

We conjecture that the stable Khovanov homology of torus knots can be described as the Koszul homology of an explicit non-regular sequence of quadratic polynomials. The corresponding Poincare series turns out to be related to the Rogers-Ramanujan identity.

2012-06-11abs ↗pdf ↗

The paper connects dilogarithm identities to Pell's equation solutions via continued fractions.

problem Connecting dilogarithm identities to solutions of Pell's equation.
method Using continued fraction expansions of units in the ring of integers of quadratic fields.
result Ramanujan's dilogarithm identities correspond to a hexagonal identity.

New explicit constructions of unbalanced Ramanujan bipartite graphs.

problem Constructing bipartite Ramanujan graphs with specified degrees and avoiding certain edges.
method Presented explicit constructions and discussed known methods for Ramanujan graph construction.
result Affirmative answer to constructing unbalanced Ramanujan bipartite graphs under certain conditions.

New bounds on diameters and generators for specific lattices and graphs.

problem Finding bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.
method Analyzing arithmetic lattices from Eichler orders in quaternion algebras, applying techniques to definite quaternion algebras.
result Bounds on diameters and generators for arithmetic lattices and Ramanujan graphs.

We develop the Ercolani-Sinha construction of SU(2) monopoles and make this effective for (a five parameter family of centred) charge 3 monopoles. In particular we show how to solve the transcendental constraints arising on the spectral curve. For a class of symmetric curves the transcendental constraints become a numb…

2006-01-20abs ↗pdf ↗

The tail of a sequence {Pn(q)}nN\{P_n(q)\}_{n \in \mathbb{N}} of formal power series in Z[[q]]\mathbb{Z}[[q]] is the formal power series whose first nn coefficients agree up to a common sign with the first nn coefficients of PnP_n. This paper studies the tail of a sequence of admissible trivalent graphs with edges colored nn o…

2013-08-11abs ↗pdf ↗

The paper classifies affine minimal translation surfaces and finds their properties.

problem Classifying and understanding affine minimal translation surfaces.
method Using Weierstrass-Enneper formula and hodographic coordinate system.
result Classification and properties of affine minimal translation surfaces.

This paper presents a deterministic method for matrix completion using Ramanujan graphs.

problem Exact and stable recovery of unknown matrices from a small number of measurements.
method Deterministic sampling using asymmetric Ramanujan graphs and constrained nuclear norm minimization.
result The method achieves exact recovery with noise-free measurements and stable approximation with noisy measurements.

Maximal surfaces in L3\mathbb{L}^3 correspond to timelike minimal surfaces.

problem Establishing a correspondence between maximal and timelike minimal surfaces in L3\mathbb{L}^3.
method Linear transformation between maximal surfaces and timelike minimal surfaces, preserving singularities and Gauss map.
result One-one correspondence and preservation of properties between maximal and timelike minimal surfaces.

Quantum invariants of three-manifolds linked to mock theta functions.

problem Quantum invariants of three-manifolds and their mock modular properties.
method Study of a specific class of Seifert three-manifolds and a conjecture on their quantum invariants.
result Illustration of mock modular properties of a quantum invariant for a specific three-manifold.

Proposes RBGP framework for efficient block sparse neural networks.

problem Efficiently exploit structured sparsity patterns for sparse neural networks on GPU.
method Uses Ramanujan Bipartite Graph Product to generate structured multi-level block sparse neural networks.
result Achieves 5-9x and 2-5x runtime gains over unstructured and block sparsity patterns respectively, while maintaining accuracy.

New conjectures link SU(r) Vafa-Witten invariants to Ramanujan's continued fractions.

problem Exploring new expressions for SU(r) Vafa-Witten partition functions.
method Combining S-duality, Gholampour-Thomas's theory, and Ramanujan's continued fractions.
result Conjectural expressions for SU(r) Vafa-Witten invariants in terms of theta functions and Seiberg-Witten invariants.

New volume functions for random hyperbolic surfaces link to spectral gaps.

problem Analyzing spectral gaps in random hyperbolic surfaces.
method Introduced new volume functions VgT(l)V_g^T(l), derived their asymptotic expansions, and linked them to spectral gaps.
result Coefficients in the asymptotic expansion of VgT(l)V_g^T(l) are Friedman-Ramanujan functions.

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to simplicial complexes, among them stand out coboundary expansion and topological expand…

2014-08-27abs ↗pdf ↗

In this work we present a new local to global criterion for proving a form of high dimensional expansion, which we term cosystolic expansion. Applying this criterion on Ramanujan complexes, yields for every dimension, an infinite family of bounded degree complexes with the topological overlapping property. This answer …

2015-10-03abs ↗pdf ↗

The study explores autonomous systems and their connections to contact geometry and Frobenius manifolds.

problem Understanding the connections between autonomous systems and geometric structures.
method Investigation of the Darboux-Halphen-Ramanujan system, contact geometry, and Frobenius manifolds.
result Highlighting the role of contact geometry in autonomous systems.

New cutoff phenomenon found for geodesic paths on hyperbolic manifolds.

problem Understanding the cutoff phenomenon for geodesic paths on hyperbolic manifolds.
method Spectral strategy and detailed spectral analysis of the spherical mean operator.
result Geodesic paths on compact hyperbolic manifolds exhibit cutoff for spatially localized initial conditions.

Randomly initialized networks contain subnetworks that perform similarly to target networks.

problem Proving the lottery ticket hypothesis for neural networks.
method Pruning over-parameterized neural networks to find subnetworks.
result Randomly initialized networks contain subnetworks with similar performance to target networks without additional training.

We compute the Moore-Witten regularized u-plane integral on CP^2, and we confirm their conjecture that it is the generating function for the SO(3)-Donaldson invariants of CP^2. We prove this conjecture using the theory of mock theta functions and harmonic Maass forms. We also derive further such generating functions fo…

2008-08-11abs ↗pdf ↗

New spectral conditions ensure graph rigidity and global rigidity in the Euclidean plane.

problem Ensuring graph rigidity and global rigidity in the Euclidean plane.
method Improving algebraic connectivity bounds for graph rigidity and global rigidity.
result Every 6-connected graph is rigid and globally rigid if its algebraic connectivity exceeds specific thresholds.

Explicitly constructed 3XOR instances hard for Sum-of-Squares hierarchy.

problem Hard instances for Sum-of-Squares hierarchy.
method Based on high-dimensional expanders (LSV complexes), using cosystolic expansion and local isoperimetric inequality.
result Constructs explicit 3XOR instances hard for O(logn)O(\sqrt{\log n}) levels of Sum-of-Squares hierarchy.

This paper discovers new identities linking geodesic and orthogeodesic lengths on hyperbolic surfaces.

problem Understanding relationships between geodesic and orthogeodesic lengths on hyperbolic surfaces.
method Investigates a broad family of identities involving lengths of all closed geodesics and orthogeodesics.
result Introduces new identities that include lengths of all closed geodesics, contrasting with previous identities.

The paper examines distances and random walks on hyperbolic surfaces.

problem Analyzing distances and random walks on hyperbolic surfaces.
method Utilizing density theorems of exceptional eigenvalues and algebraic group representations.
result The distances on hyperbolic surfaces are highly concentrated around the minimal value, and the discrete random walk exhibits cutoff.

Quandle homology was defined from rack homology as the quotient by a subcomplex corresponding to the idempotency, for invariance under the type I Reidemeister move. Similar subcomplexes have been considered for various identities of racks and moves on diagrams. We observe common aspects of these identities and subcompl…

2016-02-27abs ↗pdf ↗

The paper derives curvature identities for 5D and 6D Einstein manifolds.

problem Deriving curvature identities for specific dimensions of Einstein manifolds.
method Using Patterson's curvature identities and the Chern-Gauss-Bonnet Theorem, the paper provides explicit formulae for 5D and 6D Einstein manifolds.
result The curvature identities for 5D and 6D Einstein manifolds are confirmed to be consistent with previous work.

RLINK uses deep reinforcement learning to improve user identity linkage across social networks.

problem Recognizing the same user across different social networks.
method Converts user identity linkage into a sequence decision problem and uses deep reinforcement learning to optimize the linkage strategy.
result Achieves better performance than state-of-the-art methods in experiments on various datasets.