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

25507499 · Jun 202019922001200920172026
48 results for quasi polynomials

Sharp upper bound for quasi polynomial degree of manifold configuration spaces.

problem Determining the exact degree of quasi-polynomial homology groups of configuration spaces.
method Analyzing extremal homology groups of unordered configuration spaces of manifolds.
result The upper bound for the degree of quasi-polynomials is sharp for every manifold.

We prove that twisting any quasi-alternating link LL with no gaps in its Jones polynomial VL(t)V_L(t) at the crossing where it is quasi-alternating produces a link LL^{*} with no gaps in its Jones polynomial VL(t)V_{L^*}(t). This leads us to conjecture that the Jones polynomial of any prime quasi-alternating link, other th…

2018-10-28abs ↗pdf ↗

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. The Bollobás-Riordan-Tutte polynomial is a three-variable polynomial that extends the Tutte polynomial to oriented ribbon graphs. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chor…

2007-05-23abs ↗pdf ↗

New quasi-alternating links created from existing ones.

problem Creating new quasi-alternating links from existing ones.
method Extending the construction of quasi-alternating links by replacing a crossing with an alternating tangle of the same type.
result Jones polynomial of new quasi-alternating links has no gap if the original link has no gap.

Algorithm distinguishes Gaussian mixtures from pure Gaussians in quasi-polynomial time.

problem Distinguishing mixtures of Gaussian components from pure Gaussians, especially when components are well-separated.
method Sum-of-Squares method, quasi-polynomial time algorithm, bipartitioning sample to separate components.
result Algorithm can reliably distinguish between mixtures and pure Gaussians in quasi-polynomial time.

We give a counterexample to the Kawauchi conjecture on the Conway polynomial of achiral knots which asserts that the Conway polynomial C(z)C(z) of an achiral knot satisfies the splitting property C(z)=F(z)F(z)C(z)=F(z)F(-z) for a polynomial F(z)F(z) with integer coefficients. We show that the Bonahon-Siebenmann decomposition of an ac…

2011-06-28abs ↗pdf ↗

The study classifies Heintze groups up to isometry and quasi-isometry in low dimensions.

problem Classifying Heintze groups up to isometry and quasi-isometry in low dimensions.
method Analyzing quasi-isometries and isometries of Heintze groups, applying existing tools to groups of dimension 4 and 5.
result Complete classification of simply connected solvable groups in dimension 4 and groups of polynomial growth in dimension 5 up to isometry.

It was shown by Kaup that every origin-preserving automorphism of quasi-circular domains is a polynomial mapping. In this paper, we study how the weight of quasi-circular domains and the degree of such automorphisms are related. By using the Bergman mapping, we prove that every origin-preserving automorphism of normal …

2014-03-17abs ↗pdf ↗

Consider a Riemannian metric on two-torus. We prove that the question of existence of polynomial first integrals leads naturally to a remarkable system of quasi-linear equations which turns out to be a Rich system of conservation laws. This reduces the question of integrability to the question of existence of smooth (q…

2009-07-29abs ↗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.

Robust learning mixtures of linear regressions improve robustness.

problem Improving robustness in learning mixtures of linear regressions.
method Connecting mixtures of linear regressions and mixtures of Gaussians with thresholding for a quasi-polynomial time algorithm.
result The algorithm has significantly better robustness than previous results.

The paper studies degenerations of rational maps and their limits as geometrically finite rational maps.

problem Understanding the limits of quasi post-critically finite degenerations of rational maps.
method Constructing limits as geometrically finite rational maps on a tree of Riemann spheres, proving boundedness, and giving convergence criteria.
result Progress towards Thurston's compactness theorem and double limit theorem in complex dynamics.

We prove that the degree of the Brandt-Lickorish-Millet polynomial of any quasi-alternating link is less than its determinant. Therefore, we obtain a new and a simple obstruction criterion for quasi-alternateness. As an application, we identify some knots of 12 crossings or less and some links of 9 crossings or less th…

2014-06-02abs ↗pdf ↗

We introduce W-spin structures on a Riemann surface and give a precise definition to the corresponding W-spin equations for any quasi-homogeneous polynomial W. Then, we construct examples of nonzero solutions of spin equations in the presence of Ramond marked points. The main result of the paper is a compactness theore…

2004-09-22abs ↗pdf ↗

Maps and embeddings between hyperbolic spaces and their boundaries studied.

problem Understanding relations between maps and embeddings between relatively hyperbolic spaces and their boundaries.
method Establishing correspondences between quasi-isometric embeddings and quasisymmetric embeddings, using polynomial distortion.
result Characterization of hyperbolic relative groups with polynomial distortion embeddings.

Quasi-alternating links are a natural generalization of alternating links. In this paper, we show that quasi-alternating links are "homologically thin" for both Khovanov homology and knot Floer homology. In particular, their bigraded homology groups are determined by the signature of the link, together with the Euler c…

2007-08-23abs ↗pdf ↗

Study integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.

problem Integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.
method Semi-Hamiltonian systems of PDEs and generalized hodograph method.
result Construction of many local explicit and implicit integrable examples with polynomial first integrals of degrees 3, 4, 5.

A sequence of rational functions in a variable qq is qq-holonomic if it satisfies a linear recursion with coefficients polynomials in qq and qnq^n. We prove that the degree of a qq-holonomic sequence is eventually a quadratic quasi-polynomial. Our proof uses differential Galois theory (adapting proofs regarding hol…

2010-05-25abs ↗pdf ↗

Efficient algorithm for identifying causal effects in linear models.

problem Determining causal effects from observational data under latent confounding.
method Symbolic computation and efficient algorithm for finding identifying formulas.
result Proves the existence of identifying formulas of a specified degree in quasi-polynomial time.

Nonexistence of quasi-harmonic spheres is necessary for long time existence and convergence of harmonic map heat flows. Let (N,h)(N,h) be a complete noncompact Riemannian manifolds. Assume the universal covering of (N,h)(N,h) admits a nonnegative strictly convex function with polynomial growth. Then there is no quasi-harmoni…

2010-10-12abs ↗pdf ↗

Paper defines quasi-Strebel structures for meromorphic k-differentials and proves their existence.

problem Existence of quasi-Strebel structures for meromorphic k-differentials.
method Introduced quasi-Strebel structures and proved their existence for meromorphic k-differentials.
result Every differential of even order k > 2 satisfying certain conditions admits a quasi-Strebel structure.

We present new rectification theorems of degenerate quasi-conformal structures that give a meaning to quotients of Riemann surfaces with empty interior "fundamental domains". These techniques are used to define the unique renormalization of polynomials with Cantor set Julia sets.

2014-05-22abs ↗pdf ↗

The action of the mapping class group of the thrice-punctured projective plane on its GL(2,C)\mathrm{GL}(2,\mathbb{C}) character variety produces an algorithm for generating the simple length spectra of quasi-Fuchsian thrice-punctured projective planes. We apply this algorithm to quasi-Fuchsian representations of the corres…

2013-12-26abs ↗pdf ↗

We introduce and study the notion of the GG-Tutte polynomial for a list A\mathcal{A} of elements in a finitely generated abelian group ΓΓ and an abelian group GG, which is defined by counting the number of homomorphisms from associated finite abelian groups to GG. The GG-Tutte polynomial is a common generalizatio…

2017-07-14abs ↗pdf ↗

Simplified geometric derivation of quantum A-polynomials for knots.

problem Deriving quantum A-polynomials for knots in a simple geometric way.
method Geometric derivation using Ward identities in Chern-Simons theory, contact geometry, and Kauffman calculus.
result Simplified presentation of quantum A-polynomials, making them accessible to a broader audience.

It is well known that Sparse PCA (Sparse Principal Component Analysis) is NP-hard to solve exactly on worst-case instances. What is the complexity of solving Sparse PCA approximately? Our contributions include: 1) a simple and efficient algorithm that achieves an n1/3n^{-1/3}-approximation; 2) NP-hardness of approximatio…

2015-07-21abs ↗pdf ↗

The paper establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

problem Learning Latent Markov Decision Processes (LMDPs) with separated components.
method The paper considers various notions of separation and establishes a nearly-sharp statistical threshold for efficient learning. It also presents a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold under a weaker assumption of separability under the optimal policy, and a near-matching time complexity lower bound under the exponential time hypothesis.
result Establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram LL, there is an associated ribbon graph whose quasi-trees correspond bijectively to …

2007-05-23abs ↗pdf ↗

We construct analytically the signature operator for a new family of topological manifolds. This family contains the quasi-conformal manifolds and the topological manifolds modeled on germs of homeomorphisms of R^n possessing a derivative which is in L^p, with p > n(n+1)/2. We obtain an unbounded Fredholm module which …

1999-05-01abs ↗pdf ↗

New algorithm for MDS with quasi-polynomial dependency on aspect ratio.

problem Finding an embedding that minimizes a specific objective function for given dissimilarities.
method A novel geometry-aware analysis of a conditional rounding of the Sherali-Adams LP hierarchy.
result Achieved a solution with cost \(O(\log Δ) \cdot extrm{OPT}^{Ω(1)} + ε\) in quasi-polynomial time.