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

20405979 · May 202619922001200920172026
48 results for strictly stronger

Quantum polynomials are derived from a specific tribracket structure.

problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.

Recently, the Weisfeiler-Lehman (WL) graph isomorphism test was used to measure the expressive power of graph neural networks (GNN). It was shown that the popular message passing GNN cannot distinguish between graphs that are indistinguishable by the 1-WL test (Morris et al. 2018; Xu et al. 2019). Unfortunately, many s…

2019-05-27abs ↗pdf ↗

We show that if a Riemannian manifold satisfies (3,3)-bipolar comparisons and has an open flat subset then it is flat. The same holds for a version of MTW where the perpendicularity is dropped. In particular we get that the (3,3)-bipolar comparison is strictly stronger than the Alexandrov comparison.

2018-07-07abs ↗pdf ↗

We prove the following stronger verson of the positivity of quasi-local mass stated in gr-qc/0303019: the quasi-local energy (mass) of each connected component of the boundary of a compact spacelike hypersurface which satisfies the local energy condition is strictly positive unless the spacetime is flat along the space…

2004-12-15abs ↗pdf ↗

We extend the rack algebra Z[X] defined by Andruskiewitsch and Grana to the case of biracks, enabling a notion of birack modules. We use these birack modules to define an enhancement of the birack counting invariant generalizing the birack module counting invariant in [8]. We provide examples demonstrating that the enh…

2011-03-01abs ↗pdf ↗

We introduce a modified rack algebra Z[X] for racks X with finite rack rank N. We use representations of Z[X] into rings, known as rack modules, to define enhancements of the rack counting invariant for classical and virtual knots and links. We provide computations and examples to show that the new invariants are stric…

2010-07-31abs ↗pdf ↗

The paper solves min-max widths on a 3-sphere and strengthens multiplicity theorems.

problem Which min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π?
method Homological min-max theory and stronger versions of multiplicity one theorems.
result Proves the 10th to 13th min-max widths of the unit 3-sphere lie between 2π22π^2 and 8π.

In a previous paper we constructed a spectrum-level refinement of Khovanov homology. This refinement induces stable cohomology operations on Khovanov homology. In this paper we show that these cohomology operations commute with cobordism maps on Khovanov homology. As a consequence we obtain a refinement of Rasmussen's …

2012-06-15abs ↗pdf ↗

The working mathematician fears complicated words but loves pictures and diagrams. We thus give a no-fancy-anything picture rich glimpse into Khovanov's novel construction of `the categorification of the Jones polynomial'. For the same low cost we also provide some computations, including one that shows that Khovanov's…

2002-01-07abs ↗pdf ↗

Optimally shows the distance between perturbed convex functions and their Γ-regularizations.

problem Understanding the difference between perturbed convex functions and their Γ-regularizations.
method Analyzing the compactly supported perturbation and the Γ-regularization of a strictly convex function.
result The optimal estimate of the distance between perturbed convex functions and their Γ-regularizations is shown to be o(ε)o(ε).

Let ε(0,1)\varepsilon\in(0,1) and XRdX\subset\mathbb R^d be arbitrary with X|X| having size n>1n>1. The Johnson-Lindenstrauss lemma states there exists f:XRmf:X\rightarrow\mathbb R^m with m=O(ε2logn)m = O(\varepsilon^{-2}\log n) such that xX yX,xy2f(x)f(y)2(1+ε)xy2. \forall x\in X\ \forall y\in X, \|x-y\|_2 \le \|f(x)-f(y)\|_2 \le (1+\varepsilon)\|x-y\|_2 .

2018-10-22abs ↗pdf ↗

We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks, quandles, rack and quandle cocycles, and central extensions of groups. We prove that o…

2016-12-11abs ↗pdf ↗

In the context of a general continuous financial market model, we study whether the additional information associated with an honest time gives rise to arbitrage profits. By relying on the theory of progressive enlargement of filtrations, we explicitly show that no kind of arbitrage profit can ever be realised strictly…

2012-07-07abs ↗pdf ↗

Surgery triangles are an important computational tool in Floer homology. Given a connected oriented surface ΣΣ, we consider the abelian group K(Σ)K(Σ) generated by bordered 3-manifolds with boundary ΣΣ, modulo the relation that the three manifolds involved in any surgery triangle sum to zero. We show that K(Σ)K(Σ) is a f…

2014-10-14abs ↗pdf ↗

The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these knots. The topology of these spaces for the case n = 6 and n = 7 is described. In…

1999-04-08abs ↗pdf ↗

This note is a study of nonnegativity conditions on curvature which are preserved by the Ricci flow. We focus on specific kinds of curvature conditions which we call noncoercive, these are the conditions for which nonnegative curvature and vanishing scalar curvature doesn't imply flatness. We show that, in dimensions g…

2013-08-06abs ↗pdf ↗

Study equivalence between Hessian and Born structures on tangent bundles.

problem Equivalence between Hessian and Born structures on tangent bundles.
method Analyzing conditions for Hessian structures and integrability of induced almost Born structures.
result Conditions for equivalence between Hessian and Born structures are established.

If LL is a classical link then the multivariate Alexander quandle, QA(L)Q_A(L), is a substructure of the multivariate Alexander module, MA(L)M_A(L). In the first paper of this series we showed that if two links LL and LL' have QA(L)QA(L)Q_A(L) \cong Q_A(L'), then after an appropriate re-indexing of the components of LL and LL',…

2019-05-20abs ↗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 ↗

Generative Cross-Entropy improves classification with fewer labels.

problem Limited sample efficiency of cross-entropy loss in data-scarce scenarios.
method Proposes Generative Cross-Entropy (GenCE), a new loss function that incorporates generative principles into a standard discriminative network.
result Generative Cross-Entropy outperforms traditional cross-entropy loss across various datasets and conditions.

A new polynomial invariant for strongly involutive links.

problem Characterizing strongly involutive links using polynomial invariants.
method Introducing a two-variable polynomial invariant \(P^e\) with equivariant skein relations.
result Specialisation of \(P^e\) recovers the graded Euler characteristic of a spectral sequence.

The study presents examples of CD(0,N)CD(0,N) spaces with varying dimensions and discusses the limitations of the CD(0,N)CD(0,N) condition.

problem Exploring the properties and limitations of CD(0,N)CD(0,N) spaces with varying dimensions.
method Generalizing results from previous work, presenting examples and analyzing the conditions under which the CD(0,N)CD(0,N) condition fails.
result The CD(0,N)CD(0,N) condition is not stable under measured Gromov-Hausdorff convergence and may fail in various ways.

Quantitative CLTs show neural network distributions converge to Gaussian as width increases.

problem Understanding the distribution of fully connected neural networks with random weights and biases.
method Analyzing the distribution of a fully connected neural network with random Gaussian weights and biases, proving quantitative bounds on normal approximations.
result The distance between a random fully connected network and the corresponding infinite width Gaussian process scales like nγn^{-γ} for γ>0γ>0.

Paper optimizes statistical estimation for randomized smoothing to reduce adversarial robustness certification time.

problem Efficiently estimating robustness of points against adversarial attacks.
method Developed estimation procedures using confidence sequences and randomized Clopper-Pearson intervals.
result Achieved optimal sample complexities and stronger certificates with reduced computational burden.

New algorithm detects communities near KS threshold with optimal rate, even in noisy conditions.

problem Community detection in symmetric stochastic block models with noisy data.
method Polynomial-time algorithm using Sum-of-Squares framework and robust majority voting.
result Achieves minimax-optimal misclassification rate near Kesten-Stigum threshold, even with node corruption.

Method adapts frozen models for few-shot tasks without training.

problem Deployment constraints limit model updates, necessitating new adaptation methods.
method Exponential tilting of latent distribution for inference.
result Method outperforms parameter-update methods across benchmarks.

Proposes CCE to assess point-wise reliability of neural network predictions.

problem Overconfidence and misaligned predictive distributions in neural networks.
method Introduces Conditional Congruence (CCE) metric using conditional kernel mean embeddings.
result CCE exhibits correctness, monotonicity, reliability, and robustness in high-dimensional regression tasks.

New method exploits independence in instrumental variable models for better causal inference.

problem Identify causal functions in the presence of unobserved confounders.
method HSIC-X method that exploits independence between response, hidden confounders, and instruments.
result The method provides better finite sample results and is invariant to distributional shifts.

Improved lower bound for first Dirichlet eigenvalue using variance refinement.

problem Finding a more precise lower bound for the first Dirichlet eigenvalue.
method Refined Jensen-Hölder averaging using variance term.
result Explicit closed-form in-diameter bound strictly stronger than previous estimates.

Paper tackles constrained bandit problems with a new learning framework.

problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.

This paper analyzes user-level local differential privacy in distributed systems.

problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.

In this paper, we show that if the tangent bundle of a smooth projective variety is strictly nef, then it is isomorphic to a projective space; if a projective variety XnX^n (n>4)(n>4) has strictly nef Λ2TXΛ^2 TX, then it is isomorphic to Pn\mathbb{P}^n or quadric Qn\mathbb{Q}^n. We also prove that on elliptic curves, strict…

2016-09-22abs ↗pdf ↗