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

82164245327 · Jun 202019922001200920172026
48 results for Parity terms

Study shows physical drift affects put-call parity enforcement, not just option payoffs.

problem Inconsistency between quoted put-call parity and actual market behavior.
method Examined SPX and RUT index options, used drift-preserving GBM term to improve fit.
result Physical drift enters the enforcement of risk-neutral parity, not just option payoffs.

New method solves tensor equations including parity odd and even terms in 4D.

problem Solving linear tensor equations with parity odd and even terms in 4D.
method Extending previous results, solving a 30-parameter linear tensor equation step by step.
result Explicit solution for tensor field components in terms of known components.

Although portfolio management didn't change much during the 40 years after the seminal works of Markowitz and Sharpe, the development of risk budgeting techniques marked an important milestone in the deepening of the relationship between risk and asset management. Risk parity then became a popular financial model of in…

2014-03-07abs ↗pdf ↗

Researchers solved a number-theoretic hypothesis to determine the spin parity of k-differentials.

problem Determining the spin parity of k-differentials on Riemann surfaces of genus zero and one.
method Proved a number-theoretic hypothesis (Conjecture A.10) by reformulating it in terms of Jacobi symbols and reducing it to a combinatorial identity.
result The spin parity of k-differentials on Riemann surfaces of genus zero and one was completely determined.

This paper is an introduction to virtual knot theory and an exposition of new ideas and constructions, including the parity bracket polynomial, the arrow polynomial, the parity arrow polynomial and categorifications of the arrow polynomial. The paper is relatively self-contained and it describes virtual knot theory bot…

2011-01-04abs ↗pdf ↗

Any optimization algorithm based on the risk parity approach requires the formulation of portfolio total risk in terms of marginal contributions. In this paper we use the independence of the underlying factors in the market to derive the centered moments required in the risk decomposition process when the modified vers…

2014-09-28abs ↗pdf ↗

We introduce the 2-colour parity. It is a theory of parity for a large class of virtual links, defined using the interaction between orientations of the link components and a certain type of colouring. The 2-colour parity is an extension of the Gaussian parity, to which it reduces on virtual knots. We show that the 2-c…

2019-01-22abs ↗pdf ↗

In the present paper, we develop the parity theory invented in \cite{ManSb}; we construct new parities for two-component (virtual and free) links. New parities significantly depend on geometrical properties of diagrams; in particular, they are mutation-sensitive. New parities can be used practically in all problems, wh…

2015-08-23abs ↗pdf ↗

In \cite {FrKn,Sbornik} it was shown that in some knot theories the crucial role is played by {\em parity}, i.e.\ a function on crossings valued in {0,1}\{0,1\} and behaving nicely with respect to Reidemeister moves. Any parity allows one to construct functorial mappings from knots to knots, to refine many invariants and …

2011-02-24abs ↗pdf ↗

Blockchain funds balance risk and return for various investors.

problem Creating diversified portfolios with risk parity for different risk appetites.
method Developed three funds (Alpha, Beta, Gamma) with distinct risk and return profiles, setting weights inversely proportional to risk.
result Blockchain enables investors to select their preferred risk-return combination and allocate wealth accordingly.

This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.

problem Ensuring fair Bayes-optimal classifiers under predictive parity, especially when group performance levels vary widely.
method Proving the limitations of fair Bayes-optimal classifiers under predictive parity and proposing a new adaptive thresholding algorithm, FairBayes-DPP.
result Fair Bayes-optimal classifiers under predictive parity may not hold if group performance levels vary widely, leading to within-group unfairness.

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we find all Parity Biquandles arising from the Alexander Biquandle and Quaternionic …

2011-03-15abs ↗pdf ↗

Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.

problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.

Functorial maps and weak parities are equivalent descriptions of rules of substitution virtual crossings for classical in diagrams of a knot in a way compatible with Reidemeister moves. We introduce the notion of maximal weak parity and describe it for knots in a given closed oriented surface. This weak parity defines …

2012-11-02abs ↗pdf ↗

Paper solves k-sparse parity problem with sign SGD, matching SQ lower bound.

problem Solving k-sparse parity problems efficiently.
method Sign stochastic gradient descent on neural networks.
result Matches Statistical Query lower bound for solving k-sparse parity problems.

In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of 44-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present paper we slightly change the notation of the parity-biquandle bracket and give exam…

2019-11-17abs ↗pdf ↗

The study of fairness in intelligent decision systems has mostly ignored long-term influence on the underlying population. Yet fairness considerations (e.g. affirmative action) have often the implicit goal of achieving balance among groups within the population. The most basic notion of balance is eventual equality bet…

2018-12-07abs ↗pdf ↗

Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree nn Vassiliev invariants.

2012-03-13abs ↗pdf ↗

We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle φ^0 and a map φ^1 with certain compatibility conditions leading to one-variable or two-variable polynomial invariants of virtual knots. We provide …

2015-07-20abs ↗pdf ↗

Transformers solve parity problems efficiently with step-by-step reasoning.

problem Training transformers to solve complex, recursive problems like parity.
method Training a one-layer transformer to solve kk-parity, incorporating intermediate parities into the loss function, and using teacher forcing or augmented data.
result Transformers can learn parity in one gradient update with intermediate supervision or self-consistency checks.

2-dimensional knots and links are studied in the article. The notion of parity is introduced via techniques similar to the ones used by the second named author in 1-dimensional case. By using parity new invariants are constructed and known invariants are refined.

2016-06-22abs ↗pdf ↗

In [14], the second named author constructed the bracket invariant [.] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams K, the following formula holds: [K]=K', where K' is the underlying graph of the diagram, i.e., the…

2017-01-21abs ↗pdf ↗

Real-world applications of machine learning tools in high-stakes domains are often regulated to be fair, in the sense that the predicted target should satisfy some quantitative notion of parity with respect to a protected attribute. However, the exact tradeoff between fairness and accuracy is not entirely clear, even f…

2019-06-19abs ↗pdf ↗

New method controls bias in training data for fair outcomes.

problem Ensuring equal treatment between different groups in machine learning.
method Contrastive information estimation to control mutual information between representations and protected attributes.
result Our method provides strong theoretical guarantees on the parity of any downstream algorithm.

The article develops a model for skewness risk in risk parity portfolios.

problem Managing skewness risk in asset allocation models.
method Modeling asset returns with skewness and jumps, deriving analytical formulas for risk contributions.
result Skewness-based risk parity portfolios outperform volatility-based portfolios in managing jump risks.

In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is realized by diagram-valued invariants [ ] of knots such that [K]=K. It turns out that …

2015-01-03abs ↗pdf ↗

We mathematically compare four competing definitions of group-level nondiscrimination: demographic parity, equalized odds, predictive parity, and calibration. Using the theoretical framework of Friedler et al., we study the properties of each definition under various worldviews, which are assumptions about how, if at a…

2018-08-26abs ↗pdf ↗

We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads to a possibility of constructing new invariants and proving minimality and non-t…

2009-12-29abs ↗pdf ↗

The paper models exchange rate risk premium using mean-reverting dynamics.

problem Empirical failure of uncovered interest parity (UIP).
method Modeling risk premium using Ornstein-Uhlenbeck (OU) process embedded in stochastic differential equation for exchange rate.
result The model shows strong predictive performance at short and long horizons, but underperforms at intermediate horizons.

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both polynomials. We present a number of examples found through our calculations. We pro…

2011-10-21abs ↗pdf ↗

Incorrect parity-based descriptions of realizable Gauss diagrams found, but bipartite graphs provide a valid approach.

problem Incorrect descriptions of realizable Gauss diagrams using parity conditions.
method Used bipartite graphs to describe realizable Gauss diagrams.
result Realizable Gauss diagrams can be accurately described using bipartite graphs.

New framework tackles fairness in link prediction beyond demographic parity.

problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.