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

4387130173 · May 202619922001200920172026
48 results for ruling polynomials

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rules. The polynomial property allows us to study such rules using …

2017-07-21abs ↗pdf ↗

Associated to Legendrian links in the standard contact three-space, Ruling polynomials are Legendrian isotopy invariants, which also compute augmentation numbers, that is, the points-counting of augmentation varieties for Legendrian links (up to a normalized factor) \cite{HR15}. In this article, we generalize this pict…

2017-07-16abs ↗pdf ↗

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph …

2019-11-20abs ↗pdf ↗

We show that for any Legendrian link LL in the 11-jet space of S1S^1 the 22-graded ruling polynomial, RL2(z)R^2_L(z), is determined by the Thurston-Bennequin number and the HOMFLY-PT polynomial. Specifically, we recover RL2(z)R^2_L(z) as a coefficient of a particular specialization of the HOMFLY-PT polynomial. Furthermore, …

2010-06-16abs ↗pdf ↗

For any Legendrian knot KK in standard contact R3{\mathbb R}^3 we relate counts of ungraded (11-graded) representations of the Legendrian contact homology DG-algebra (A(K),)(\mathcal{A}(K),\partial) with the nn-colored Kauffman polynomial. To do this, we introduce an ungraded nn-colored ruling polynomial, Rn,K1(q)R^1_{n,K}(q)

2019-08-23abs ↗pdf ↗

In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two Legendrian isotopy invariants: augmentation number via point-counting over a finite field, for the augmentation variety of the associated Chekanov-Eliashberg differential graded algebra, and ruling polynomial via…

2019-11-26abs ↗pdf ↗

For any Legendrian link, L, in (\R^3, \ker(dz-y\,dx)) we define invariants, Aug_m(L,q), as normalized counts of augmentations from the Legendrian contact homology DGA of L into a finite field of order q where the parameter m is a divisor of twice the rotation number of L. Generalizing a result of Ng and Sabloff for the…

2013-08-21abs ↗pdf ↗

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known deletion-contraction rule. This work is motivated by Khovanov's work on categorification of the…

2004-12-13abs ↗pdf ↗

Invariant Causal Set Covering Machines avoid spurious associations.

problem Learning algorithms for rule-based models are vulnerable to spurious associations.
method Building on invariant causal prediction, propose Invariant Causal Set Covering Machines for conjunctions/disjunctions of binary-valued rules.
result The method can identify causal parents of a variable of interest in polynomial time.

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of semi-algebraic proof systems that manipulate polynomial inequalities via elementary inferen…

2019-06-04abs ↗pdf ↗

We begin the systematic study of knot polynomials for the twist satellites of a knot, when its strand is substituted by a 2-strand twist knot. This is a generalization of cabling (torus satellites), when the substitute of the strand was a torus knot. We describe a general decomposition of satellite's colored HOMFLY in …

2018-01-08abs ↗pdf ↗

The Berglund-Hübsch rule connects Calabi-Yau orbifolds to Sasakian manifolds.

problem Connecting Calabi-Yau orbifolds to Sasakian manifolds.
method Applying the Berglund-Hübsch transpose rule to associate Sasaki manifolds.
result Four seven-dimensional Sasakian manifolds of positive Ricci curvature are associated with a K3 orbifold.

A graph GG is said to be pp-periodic, if the automorphism group Aut(G)Aut(G) contains an element of order pp which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph periodicity. In particular, we prove that if pp is a prime, then the coefficient…

2011-03-31abs ↗pdf ↗

The colored HOMFLY polynomial is the quantum invariant of oriented links in S3S^3 associated with irreducible representations of the quantum group Uq(slN)U_q(\mathrm{sl}_N). In this paper, using an approach to calculate quantum invariants of links via cabling-projection rule, we derive a formula for the colored HOMFLY polyn…

2006-01-11abs ↗pdf ↗

We point out that the Homfly polynomial (that is to say, Ocneanu's trace functional) contains two polynomial-valued inner products on the Hecke algebra representation of Artin's braid group. These bear a close connection to the Morton-Franks-Williams inequality. In these structures, the sets of positive, respectively n…

2009-06-30abs ↗pdf ↗

We present an easy example of mutant links with different Khovanov homology. The existence of such an example is important because it shows that Khovanov homology cannot be defined with a skein rule similar to the skein relation for the Jones polynomial.

2003-01-27abs ↗pdf ↗

Develops a new fuzzy model using QPs and ewl2 regularization to improve local region behavior.

problem Inability of constant and linear functions to accurately describe local regions in fuzzy models.
method Applied Fuzzy C-Means for structure identification, used QPs as consequents, introduced ewl2 regularization.
result Improved model's ability to describe local regions without overfitting.

Develops a generalized version of Chung's Lemma for stochastic optimization methods.

problem Establishing asymptotic convergence rates for stochastic optimization methods under various step size rules.
method Generalized version of Chung's Lemma for a broader family of step size rules.
result Demonstrates tight non-asymptotic convergence rates for various stochastic methods.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

Study disproves conjecture about low-degree polynomials in hypothesis testing.

problem Conjecture about limitations of polynomial-time algorithms in hypothesis testing.
method Used counterexamples to refute the conjecture and modified the conjecture to rule out the counterexample.
result Disproved conjecture about limitations of low-degree polynomials in hypothesis testing.

This paper derives a robust on-line equity trading algorithm that achieves the greatest possible percentage of the final wealth of the best pairs rebalancing rule in hindsight. A pairs rebalancing rule chooses some pair of stocks in the market and then perpetually executes rebalancing trades so as to maintain a target …

2018-10-04abs ↗pdf ↗

Study local moduli of Sasaki-Einstein metrics on specific polynomial links.

problem Understanding the local moduli of Sasaki-Einstein metrics on links of invertible polynomials.
method Analyzing Sasaki-Einstein metrics on links of invertible polynomials of cycle type and Thom-Sebastiani sums.
result For polynomials of cycle type, local moduli spaces are zero-dimensional. For Thom-Sebastiani sums, dimensions are positive.

The paper connects knot homology, quantum 6j-symbols, and complements of knots.

problem Investigating the relationship between knot homology, quantum 6j-symbols, and knot complements.
method Developed a grading rule for HOMFLY-PT and Kauffman homology, found relationships between A-polynomials, and conjectured closed-form expressions for quantum 6j-symbols and knot complements.
result Closed-form expressions for SO(N) quantum 6j-symbols and conjectured expressions for (a,t)-deformed F_K for knot complements.

The class of +adequate links contains both alternating and positive links. Generalizing results of Tanaka (for the positive case) and Ng (for the alternating case), we construct fronts of an arbitrary +adequate link A so that the diagram has a ruling, therefore its Thurston-Bennequin number is maximal among Legendrian …

2006-10-22abs ↗pdf ↗

A new method for sampling on manifolds reduces density estimation errors.

problem Sampling on implicitly defined manifolds in various applications.
method Polynomial-Maximization Moment (PMM) estimator replacing local k-nearest-neighbour density estimate.
result Reduces density estimation errors by 22--36% on asymmetric gamma and boundary-spacing regimes.

Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and prov…

2019-05-22abs ↗pdf ↗

We introduce a notion of cardinality for the augmentation category associated to a Legendrian knot or link in standard contact R^3. This `homotopy cardinality' is an invariant of the category and allows for a weighted count of augmentations, which we prove to be determined by the ruling polynomial of the link. We prese…

2015-11-20abs ↗pdf ↗

A new sequencing rule prevents miners from front-running transactions in decentralized exchanges.

problem Miners exploit their privileged position to front-run transactions, leading to unfair profits.
method Introduce verifiable sequencing rules that constrain transaction execution order and are verifiable.
result A verifiable sequencing rule ensures users receive at least fair execution prices, preventing front-running.

Paper proposes a method for early stopping in regression using reproducing kernels.

problem Early stopping for iterative learning algorithms in nonparametric regression.
method Data-driven rule based on minimum discrepancy principle, validated by fixed-point analysis of localized Rademacher complexities.
result The proposed rule is minimax-optimal and performs comparably to cross-validation.

Clarifies interest rate cap rules for loans with unconventional cash flows.

problem Ambiguity in applying interest rate caps to loans with non-conventional internal rate of return (IRR).
method Clarified conventional IRR definition, axiomatized, and extended to all loans.
result Unique extension of interest rate cap rule for all loans, based on net present value test.

Developable ruled surfaces generated by curvature axes of curves.

problem Creating simple and understandable ruled surfaces for practical design.
method Investigating a straightforward method to generate developable ruled surfaces using curvature axes of curves.
result Developable ruled surfaces are generated by the curvature axes of curves, and these surfaces are developable.

Diffusion models learn hierarchical composition rules from data.

problem How many samples do generative models need to learn hierarchical composition rules?
method Theoretical and empirical investigation of diffusion models on probabilistic context-free grammars.
result Diffusion models learn hierarchical composition rules with sample complexity scaling polynomially with context size.

New lower bounds show learning intersections of halfspaces is hard even for a few halfspaces.

problem Learning intersections of halfspaces in polynomial time under standard assumptions.
method Unified connection to parallel pancakes distribution for proving hardness.
result Learning ω(loglogN)ω(\log \log N) halfspaces in dimension NN requires super-polynomial time under standard assumptions.