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

8.8%17.5%26.3%35.0% · Feb 202619922001200920172026
48 results for integer sets

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 ↗

The study explores which sets of integers can be realized as the degrees of maps between manifolds.

problem Which sets of integers can be realized as the degrees of maps between manifolds?
method Analyzes the set of degrees of maps between closed oriented manifolds of the same dimension.
result Finite arithmetic progressions and geometric progressions starting from 1 can be realized as degrees of maps between manifolds.

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.

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.

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.

In this paper we investigate discrete time trading under integer constraints, that is, we assume that the offered goods or shares are traded in integer quantities instead of the usual real quantity assumption. For finite probability spaces and rational asset prices this has little effect on the core of the theory of no…

2017-08-25abs ↗pdf ↗

Introduces integer-valued Heegaard Floer theory with canonical orientations.

problem Defining and proving properties of Heegaard Floer homology over integers.
method Using canonical orientations from coupled Spin structures, proving naturality and surgery exact triangle.
result Established integer-valued Heegaard Floer theory and proved its properties.

The study examines vector fields with integer singularities in 3D balls.

problem Characterizing the strong LpL^p-closure of vector fields with finitely many integer singularities.
method Characterization and decomposition of vector fields with finitely many integer singularities.
result Decomposition theorem for elements in LZ1(B)L_{\mathbb{Z}}^1(B), revealing information about mass-minimizing currents.

We establish the existence of an integer degree for the natural projection map from the space of parameterizations of asymptotically conical self-expanders to the space of parameterizations of the asymptotic cones when this map is proper. As an application we show that there is an open set in the space of cones in the …

2018-07-17abs ↗pdf ↗

Study extends contact cosmetic surgeries to non-trivial Legendrian knots in L-spaces.

problem Contact cosmetic surgeries for Legendrian knots in L-spaces.
method Adapting techniques from S3 to L-spaces, incorporating Heegaard Floer theory constraints.
result Contact cosmetic surgery conjecture holds for non-trivial Legendrian knots, except for Lagrangian slice knots.

In the paper, we focus on the connectedness of planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det (A)|=3 and a collinear digit set D={0,1,b}v{\mathcal{D}}=\{0,1,b\}v, where b>1b>1 and vR2v\in {\mathbb{R}}^2 such that {v,Av}\{v, Av\} is linearly independent. We discuss the domain of…

2012-05-16abs ↗pdf ↗

A referee found an error in the proof of the Theorem 2 that we could not fix. More precisely, the proof of Lemma 2.1 is incorrect. Hence the fact that integer cohomology of complement of toric Weyl arrangements is torsion free is still a conjecture. ----- A toric arrangement is a finite set of hypersurfaces in a comple…

2010-08-03abs ↗pdf ↗

We consider a two-valued function uu that is either Dirichlet energy minimizing, C1,μC^{1,μ} harmonic, or in C1,μC^{1,μ} with an area-stationary graph such that Almgren's frequency (restricted to the singular set) is continuous at a singular point Y0Y_0. As a corollary of recent work of Wickramasekera and the author, if t…

2014-10-27abs ↗pdf ↗

Let XX be a topological space and f:XXf:X\to X a bijection. Let C(X,f){\mathcal C}(X,f) be a set of integers such that an integer nn is an element of C(X,f){\mathcal C}(X,f) if and only if the bijection fn:XXf^n:X\to X is continuous. A subset SS of the set of integers Z{\mathbb Z} is said to be realizable if there is a topologi…

2013-10-07abs ↗pdf ↗

Study Betti and Hodge numbers of solvmanifolds from integer polynomials.

problem Computing Betti and Hodge numbers of solvmanifolds constructed from integer polynomials.
method Analyzing de Rham and Dolbeault cohomology of solvmanifolds under algebraic conditions.
result Explicit generating polynomials for Hodge numbers in quasi full rank case.

Study non-integer power-law potentials for Schrödinger operators using Lie-Rinehart algebras.

problem Analyzing Schrödinger operators with non-integer power-law potentials.
method Using Lie-Rinehart algebras and microlocal analysis.
result Microlocal analysis can be applied to Schrödinger operators with non-integer power-law potentials.

Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow-based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, con…

2019-05-17abs ↗pdf ↗

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.

We study the problem of instance segmentation in biological images with crowded and compact cells. We formulate this task as an integer program where variables correspond to cells and constraints enforce that cells do not overlap. To solve this integer program, we propose a column generation formulation where the prici…

2017-09-21abs ↗pdf ↗

The 3D index of Dimofte-Gaiotto-Gukov a partially defined function on the set of ideal triangulations of 3-manifolds with rr torii boundary components. For a fixed 2r2r tuple of integers, the index takes values in the set of qq-series with integer coefficients. Our goal is to give an axiomatic definition of the tetra…

2012-08-08abs ↗pdf ↗

This paper classifies quadratic form parameters over integers and computes their Witt groups.

problem Classifying quadratic form parameters over integers and computing their Witt groups.
method Study of quadratic forms and extended quadratic forms over the integers, defining and comparing different definitions of extended quadratic forms.
result Classification of all quadratic form parameters over the integers and computation of their Witt groups.

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.

We introduce the Schubert form a 33-bridge link diagram, as a generalization of the Schubert normal form of a 33-bridge link. It consists of a set of six positive integers, written as (p/n,q/m,s/l)\left( p/n,q/m,s/l\right) , with some conditions and it is based on the concept of 33-butterfly. Using the Schubert normal form of …

2017-02-28abs ↗pdf ↗

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.

A new method computes Teichmüller polynomials from integer permutations.

problem Computing Teichmüller polynomials for fibered 3-manifolds.
method Using integer permutations to characterize pseudo-Anosov homeomorphisms and train tracks.
result Direct implementation of McMullen's algorithm for Teichmüller polynomials.

Paper designs optimal ECOCs using IP for robust multiclass classification.

problem Designing robust ECOCs for multiclass classification.
method Integer Programming formulation to minimize codebooks with desirable error-correcting properties, leveraging graph-theoretic structure and edge clique covers.
result IP-generated codebooks achieve high nominal and robust adversarial accuracy.

Study on coloring virtual tangles with integer and modular arithmetic.

problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=ZR=\mathbb{Z}, realizability depends on divisibility of the alternating sum. For R=Z/pZR=\mathbb{Z}/p\mathbb{Z}, all vectors are realizable.

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.

This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a "mixed pol…

2019-01-02abs ↗pdf ↗

Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.

problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.

New harmonic functions show nodal sets can be topologically complex despite frequency and regularity constraints.

problem Understanding the topology of nodal sets of harmonic functions with bounded frequency and regularity.
method Constructing harmonic functions on the unit ball with specific properties.
result The Betti numbers of the nodal set can be arbitrarily large, contradicting previous topological bounds.

Study proves existence of a specific type of flow in geometry.

problem Existence of canonical multi-phase free boundary Brakke flows.
method Global-in-time existence established using Brakke flow and uniform density ratio assumption.
result Existence of the flow with no positive mass on the free boundary for some short time.

This dissertation uses ILP to learn Bayesian network structures efficiently.

problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.

Analyzes biased random walks and corrupted intervals in adversarial settings.

problem Learning thresholds and intervals in adversarial conditions.
method Analyzes biased random walks and corrupted intervals under adversarial design.
result Analyzes the expected behavior of biased random walks and corrupted intervals.