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

6121824 · Jun 202619922001200920172026
48 results for square-free integers

New lattices in higher rank contain a fixed 3-manifold group with increasing systole.

problem Finding lattices with a fixed 3-manifold group and large systole.
method Constructing arithmetic lattices in SL(8,R)SL(8,\mathbb{R}) with specific properties.
result Existence of lattices with large systole containing a fixed 3-manifold group.

Let nn be a positive integer, and let >1\ell>1 be square-free odd. We classify the set of equivariant homeomorphism classes of free CC_\ell-actions on the product S1×SnS^1 \times S^n of spheres, up to indeterminacy bounded in \ell. The description is expressed in terms of number theory. The techniques are various appl…

2014-05-04abs ↗pdf ↗

In this paper, we compute the covolume of the group of units of the quadratic form f_d^n(x) = x_1^2 + x_2^2 + . . . + x_n^2 - d x_{n+1}^2 with d an odd, positive, square-free integer. Mcleod has determined the hyperbolic Coxeter fundamental domain of the reflection subgroup of the group of units of the quadratic form f…

2012-03-29abs ↗pdf ↗

The study proves conjecture for specific Artin groups.

problem Proving conjecture about Artin groups' properties.
method Analyzing Artin groups associated to triangle-free graphs and cones over square-free bipartite graphs.
result Proves conjecture for specific Artin groups.

The cosmetic crossing conjecture (also known as the "nugatory crossing conjecture") asserts that the only crossing changes that preserve the oriented isotopy class of a knot in the 3-sphere are nugatory. We use the Dehn surgery characterization of the unknot to prove this conjecture for knots in integer homology sphere…

2015-07-02abs ↗pdf ↗

We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids and of their conjugacy classes.

2010-03-31abs ↗pdf ↗

Band surgery is an operation relating pairs of knots or links in the three-sphere. We prove that if two quasi-alternating knots KK and KK' of the same square-free determinant are related by a band surgery, then the absolute value of the difference in their signatures is either 0 or 8. This obstruction follows from a …

2018-06-06abs ↗pdf ↗

The study counts Salem numbers linked to arithmetic hyperbolic orbifolds.

problem Bounding the proportion of Salem numbers in arithmetic lattices.
method Using results on the distribution of Salem numbers, classical methods for counting Pythagorean triples, and Gauss' lattice-counting argument.
result Improved bounds on the proportion of Salem numbers and strong exponential growth of averages.

Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…

2010-03-04abs ↗pdf ↗

We give a complete classification of homomorphisms from the braid group on nn strands to the braid group on 2n2n strands when nn is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from the commutator subgroup of the braid group on nn strands to the braid group on …

2019-10-01abs ↗pdf ↗

We study the topology of exact and Stein fillings of the canonical contact structure on the unit cotangent bundle of a closed surface ΣgΣ_g, where gg is at least 2. In particular, we prove a uniqueness theorem asserting that any Stein filling must be s-cobordant rel boundary to the disk cotangent bundle of ΣgΣ_g. For …

2015-10-22abs ↗pdf ↗

Given knots K and J, one can ask whether a single smoothing of a crossing in a diagram for K can convert it into a diagram for J. As an interesting example, Zekovic discovered that the torus knot T(2,5) can be converted into T(2,-5) with a single smoothing. On the other hand, Moore and Vasquez have shown that among tor…

2018-09-20abs ↗pdf ↗

Let Γ<SL2(Z)Γ<\mathrm{SL}_2(\mathbb{Z}) be a non-elementary finitely generated subgroup and let Γ(q)Γ(q) be its congruence subgroup of level qq for each qNq\in \mathbb{N}. We obtain an asymptotic formula for the matrix coefficients of L2(Γ(q)\SL2(R))L^2(Γ(q) \backslash \mathrm{SL}_2(\mathbb{R})) with a {\it uniform} exponential error term…

2014-10-16abs ↗pdf ↗

Let HH be a hyperexponential function in nn variables x=(x1,,xn)x=(x_1,\dots,x_n) with coefficients in a field K\mathbb{K}, [K:Q]<[\mathbb{K}:\mathbb{Q}] <\infty, and ωω a rational differential 11-form. Assume that Hω is closed and HH transcendental. We prove using Schanuel conjecture that there exist a univariate function…

2019-01-25abs ↗pdf ↗

Cyclotomic polynomials help classify mapping classes on surfaces.

problem Characterizing mapping classes on surfaces using cyclotomic polynomials.
method Investigating characteristic polynomials of integral symplectic matrices and using cyclotomic polynomials to classify them.
result For n3n \geq 3, the polynomial φn(x)\varphi_n(x) is realized by a mapping class of algebraically finite type if and only if nn has at most two distinct prime divisors.

New q-deformed integers help compute Jones polynomials efficiently.

problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.

Generalized Steinberg module presentation for Gaussian and Eisenstein integers.

problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.

Surgery obstructions extended to integer homology spheres using Heegaard Floer homology.

problem Obstructing knots in integer homology spheres using surgery.
method Extending Heegaard Floer homology obstructions to all integer homology spheres for both positive and negative surgeries.
result Deduced a lower bound on b2(W)b_2(W) for smooth cobordism between integer homology spheres.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.

We use Nathanson's gg-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets SS to problems in additive number theory. If SS consists of all powers of a fixed integer gg, we find explicit formulas for the smallest positive intege…

2017-11-02abs ↗pdf ↗

New method for probabilistic modeling of integer submodular functions.

problem Lack of probabilistic modeling for integer submodular functions.
method Proposed Generalized Multilinear Extension and block-coordinate ascent algorithm.
result Demonstrated effectiveness and viability on real-world datasets.

Neural networks with integer weights approximate continuous functions efficiently.

problem Approximating continuous functions using neural networks with integer weights.
method Integrates superexpressive activation functions and integer weights.
result Convergence rate of order n2β2β+dlog2nn^{\frac{-2β}{2β+d}}\log_2n for neural network regression.

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we show that the stable commutator length of elements in a surgery family is a ratio …

2010-11-05abs ↗pdf ↗

The article calculates a multiplying factor to convert rational Vassiliev invariants to integer-valued ones.

problem Converting rational valued Vassiliev invariants to integer-valued ones.
method Calculates the minimal multiplying factor λ needed for rational Vassiliev invariants to become integer-valued.
result Obtains a set of integer-valued Vassiliev invariants.

Improved RTM uses integer weights to reduce computation and increase interpretability.

problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.

Paper develops machine learning algorithms to learn optimal integer weights for clinical risk scores.

problem Deriving optimal integer weights for clinical risk scores without computational burden.
method Flexible greedy optimization strategy to directly optimize a value function.
result Constructed an integer-weighted comorbidity score for measuring post-discharge mortality risk.

New symplectic embedding obstructions found for polydisks into half-integer ellipsoids.

problem Obstructing symplectic embeddings of polydisks into half-integer ellipsoids.
method Combinatorial criterion developed by Hutchings to obstruct symplectic embeddings.
result Optimal inclusion conditions for symplectic embeddings of polydisks into half-integer ellipsoids.

Proves surgery exact triangle for monopole Floer homology over integers.

problem Proving the surgery exact triangle for monopole Floer homology over integer coefficients.
method Modification of Kronheimer--Mrowka's local system and adaptation of Freeman's computation.
result Obtains a spectral sequence over integer coefficients for an oriented link in S3S^3.

The paper uses clustering and integer programming to optimize stock selection for investment funds.

problem Maximizing profits and minimizing risk in stock markets.
method Data-oriented analysis and clustering techniques with integer programming.
result Reconstructed NASDAQ 100 index fund example demonstrates effectiveness.

Optimizes intervention design for causal discovery using integer programming.

problem Identifying causal structures from observational data due to confounding variables.
method Uses integer programming to design minimal intervention sets for causal structure identifiability.
result Provides exact and modular solutions adaptable to various experimental settings and constraints.