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

Trend · papers per month

11223344 · May 202619922001200920182026
48 results for divisible subgroup

Let n be greater than or equal to 3. We prove that the quaternion group of order 8 is realised as a subgroup of the sphere braid group B\_n(S^2) if and only if n is even. If n is divisible by 4 then the commutator subgroup of B\_n(S^2) contains such a subgroup. Further, for all n greater than or equal to 3, B\_n(S^2) c…

2006-03-15abs ↗pdf ↗

Study of symmetries of sphere divisions induced by functions with isolated critical points.

problem Understanding symmetries of sphere divisions induced by functions with isolated critical points.
method Analyzing the group of diffeomorphisms that leave invariant a connected component of a level set and its complement.
result The group of such diffeomorphisms is isomorphic to a finite subgroup of SO(3)SO(3).

Let A denote the algebraic closure of the rationals Q in the complex numbers C. Suppose G is a torsion-free group which contains a congruence subgroup as a normal subgroup of finite index and denote by U(G) the C-algebra of closed densely defined unbounded operators affiliated to the group von Neumann algebra. We prove…

2005-11-30abs ↗pdf ↗

Completeness theorem for flat pseudo-Riemannian manifolds of signature (2,2).

problem Completeness of closed flat pseudo-Riemannian manifolds of signature (2,2).
method Geometric reduction and semidirect product constructions.
result Only the entire space R2,2\mathbb{R}^{2,2} is divisible by a discrete subgroup of isometries.

The study explores congruence subgroups of braid groups and their quotients.

problem Understanding the structure of congruence subgroups of braid groups.
method Utilizing the integral Burau representation and results from integral matrices, the study examines quotients of these subgroups.
result Findings of quotients that are not isomorphic to symmetric groups.

The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic groups. We have included a discussion of very recent results and conjectures on…

2013-07-04abs ↗pdf ↗

cMCA uses contrastive learning to identify latent subgroups in political party data.

problem Identifying latent subgroups within political party data.
method Contrastive learning applied to multiple correspondence analysis (MCA).
result cMCA identifies latent subgroups not seen by traditional methods.

In a previous paper, the author (together with Matthew Emerton) proved that the completed cohomology groups of SL_N(Z) are stable in fixed degree as N goes to infinity (Z may be replaced by the ring O_F of integers of any number field). In this paper, we relate these completed cohomology groups to K-theory and Galois c…

2013-11-20abs ↗pdf ↗

For 4L4 \nmid L and gg large, we calculate the integral Picard groups of the moduli spaces of curves and principally polarized abelian varieties with level LL structures. In particular, we determine the divisibility properties of the standard line bundles over these moduli spaces and we calculate the second integral …

2009-08-04abs ↗pdf ↗

Proves divisibility relations for symplectic curve polynomials.

problem Divisibility relations for symplectic curve polynomials.
method New proofs of divisibility relations for Oka and Alexander polynomials of symplectic curves.
result Proves Libgober's divisibility relations for symplectic curves.

For d=4,5,6d=4, 5, 6, we exhibit the first examples of complete finite volume hyperbolic dd-manifolds MM with cusps such that infinitely many dd-orbifolds MmM_{m} obtained from MM by generalized Dehn filling admit properly convex real projective structures. The orbifold fundamental groups of MmM_m are Gromov-hyperbolic …

2016-11-08abs ↗pdf ↗

Paper tackles division difficulty, proposing new methods to improve accuracy.

problem Division is the most challenging arithmetic operation for both humans and computers.
method Proposes two novel approaches: Neural Reciprocal Unit (NRU) and Neural Multiplicative Reciprocal Unit (NMRU), and improves an existing division module.
result Improves division accuracy from 70.2% to 91.6%.

In contrast to the many examples of convex divisible domains in real projective space, we prove that up to projective isomorphism there is only one convex divisible domain in the Grassmannian of pp-planes in R2p\mathbb{R}^{2p} when p>1p > 1. Moreover, this convex divisible domain is a model of the symmetric space associ…

2015-10-14abs ↗pdf ↗

Adopting a zonal structure of electricity market requires specification of zones' borders. In this paper we use social welfare as the measure to assess quality of various zonal divisions. The social welfare is calculated by Market Coupling algorithm. The analyzed divisions are found by the usage of extended Locational …

2014-05-05abs ↗pdf ↗

Under certain integrability and geometric conditions, we prove division theorems for the exact sequences of holomorphic vector bundles and improve the results in the case of Koszul complex. By introducing a singular Hermitian structure on the trivial bundle, our results recover Skoda's division theorem for holomorphic …

2011-02-19abs ↗pdf ↗

The paper explains the topological origin of the distinction between incidence theorems over division rings and fields.

problem Understanding the distinction between incidence theorems over division rings and fields.
method Extending the surface-graph approach to noncommutative settings, the paper analyzes the topological properties of graphs embedded on surfaces of different genera.
result Theorems associated with graphs on the sphere hold over any division ring, while those on surfaces of positive genus typically hold only if the ground ring is a field.

Researchers infer gene activity in dividing cells, accounting for protein inheritance and division history.

problem Inferring protein production kinetics in dividing cells due to protein inheritance and division history.
method Adapted conditional normalizing flows to approximate intractable likelihoods from simulated data.
result Glc3 gene is mostly inactive under stress, with brief and transient expression.

The paper introduces a method to control false splits in tree-based data aggregation.

problem Identifying the correct subgroups to treat as a single entity in tree-based data.
method Introduces the 'false split rate' and proposes a multiple hypothesis testing algorithm for tree-based aggregation.
result The proposed algorithm controls the false split rate, demonstrating its effectiveness on stock volatility and taxi fare data.

Geodesic connectedness proved for statistical manifolds with divisible cubic forms.

problem Geodesic connectedness of affine connections on statistical manifolds with divisible cubic forms.
method Analogy with Hopf-Rinow theorem in Riemannian geometry, establishing geodesic completeness.
result Geodesic connectedness established for statistical manifolds with divisible cubic forms.

Study of characteristic numbers in 24-dimensional String manifolds.

problem Characterizing and understanding characteristic numbers of 24-dimensional String manifolds.
method Using Pontryagin numbers, integral basis of String cobordism group, and divisibility results.
result Established 2- and 3-primary divisibilities of characteristic numbers.

An open convex set in real projective space is called divisible if there exists a discrete group of projective automorphisms which acts co-compactly. There are many examples of such sets and a theorem of Benoist implies that many of these examples are strictly convex, have C1C^1 boundary, and have word hyperbolic divid…

2013-08-19abs ↗pdf ↗

The Jones polynomial's divisibility is analyzed via local moves on virtual links.

problem Divisibility of the Jones polynomial under local moves on virtual links.
method Developed a general decomposition for the Jones polynomial of virtual links and analyzed divisibility conditions for various local moves.
result Succinct divisibility conditions on the Jones polynomial of virtual links differing via local moves.

Supersymmetry is deeply related to division algebras. Nonabelian Yang-Mills fields minimally coupled to massless spinors are supersymmetric if and only if the dimension of spacetime is 3, 4, 6 or 10. The same is true for the Green-Schwarz superstring. In both cases, supersymmetry relies on the vanishing of a certain tr…

2009-09-02abs ↗pdf ↗

New minimal surfaces in spheres with complex topologies from capillarity.

problem Constructing minimal surfaces in spheres with rich topologies.
method General construction of embedded minimal and constant mean curvature surfaces in Sn\mathbb{S}^n using capillary hypersurfaces.
result Non-trivial sphere bundles over various base spaces, including Stiefel manifolds and complex quadrics.

Study of congestion in negative curvature manifolds using fair-division algorithms.

problem Estimating and predicting the size and location of congestion core in negative curvature manifolds.
method Introducing a novel fair-division algorithm to estimate congestion core.
result Demonstrated the effectiveness of fair-division algorithms in estimating congestion core.

Research shows how certain flat structures behave in specific convex domains.

problem Understanding the behavior of codimension-1 simplices in divisible convex domains.
method Analyzes the set of codimension-1 flats and their images in quotient manifolds.
result The set of codimension-1 flats forms a finite collection of disjoint virtual tori, leading to cusped convex projective manifolds.

LLMs can collude in market divisions, maximizing profits.

problem Strategic collusion of LLM agents in multi-commodity markets.
method Examined LLMs in Cournot competition frameworks, analyzing pricing and resource allocation strategies.
result LLMs can monopolize specific commodities without direct human input or explicit collusion commands.