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

53106158211 · May 202619922001200920172026
48 results for Hasse norm principle

We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle questions, which we answer in a more general setting. As an application, we prove a Has…

2020-01-20abs ↗pdf ↗

Hasse principle applied to area-minimizing submanifolds across different homology types.

problem Understanding the behavior of area-minimizing submanifolds in various homology contexts.
method Extending the Hasse principle from number theory to geometric variational problems.
result Recovering information about area-minimizing submanifolds in integral homology from those in real and mod nn homology.

We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of Agol, Hass, and Thurston [ArXiv, 2002].

2004-07-05abs ↗pdf ↗

In this paper we analyze both the scientific activities of Cahit Arf, a Turkish mathematician, and the social context in which he worked. We also discuss his work and social environment leading to the discovery of Arf invariant, Arf rings, Arf closure and Hasse-Arf theorem.

2013-01-16abs ↗pdf ↗

The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.

problem Understanding curvature tensors and their minimal norm.
method Analyzing minimal norm tensors for third and fourth covariant tensors, including Riemannian curvature and divergence.
result Weyl tensor and Cotten tensor are identified as minimal norm tensors of Riemannian curvature and divergence tensors, respectively.

A combinatorial condition is obtained for when immersed or embedded incompressible surfaces in compact 3-manifolds with tori boundary components remain incompressible after Dehn surgery. A combinatorial characterisation of hierarchies is described. A new proof is given of the topological rigidity theorem of Hass and Sc…

2000-08-30abs ↗pdf ↗

In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link diagram invariant using irregular smoothing, and give an example of a knot diagram…

2011-03-26abs ↗pdf ↗

Improved online PCA algorithm learns from evolving norm of parameter vector.

problem Discarding evolving norm in online PCA leads to suboptimal learning.
method Implicitly Normalized Online PCA (INO-PCA) removes unit-norm constraint.
result Parameter norm evolution leads to improved learning behavior.

Study normal curves in sub-Finsler Lie groups with specific norms, focusing on branching and face stability.

problem Analyzing normal curves in sub-Finsler Lie groups with different norms.
method Using tools from convex analysis, the Pontryagin Maximum Principle is revisited to express the normal equation as a differential inclusion involving the subdifferential of the dual norm.
result Normal curves in polyhedral norms have controls that locally take values in a single face of a sphere with respect to the norm.

We consider geometric flow equations for contracting and expanding normal velocities, including powers of the Gauss curvature, of the mean curvature, and of the norm of the second fundamental form, and ask whether - after appropriate rescaling - closed strictly convex surfaces converge to spheres. To prove this, many a…

2015-01-28abs ↗pdf ↗

We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it admits upper and lower approximations leading to various practical strategies. Specifically, this perspective (i) provides a common umbrella f…

2018-09-30abs ↗pdf ↗

We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this matching along with discrete Morse theory and some topological techniques to cl…

2011-08-30abs ↗pdf ↗

We address the problem of {\it adaptivity} in the framework of reproducing kernel Hilbert space (RKHS) regression. More precisely, we analyze estimators arising from a linear regularization scheme $g_\lam$. In practical applications, an important task is to choose the regularization parameter $\lam$ appropriately, i.e.…

2018-04-15abs ↗pdf ↗

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being unknotted with resp…

2010-12-18abs ↗pdf ↗

We show that the number of stabilizations needed to interchange the handlebodies of a Heegaard splitting of a closed 3-manifold by an isotopy is bounded below by the smaller of twice its genus or half its Hempel distance. This is a combinatorial version of a proof by Hass, Thompson and Thurston of a similar theorem, bu…

2008-05-28abs ↗pdf ↗

Optimal hidden-target learning for online inventory optimization on general convex sets.

problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.

The paper studies how norms of random vectors are preserved by random projections.

problem Understanding how random matrix affects norms of random vectors.
method Proved the distribution of the norm of random vector is preserved by random projection.
result Random matrix preserves the distribution of the norm of random vectors with i.i.d. entries.

Any Riemannian manifold has a canonical collection of valuations (finitely additive measures) attached to it, known as the intrinsic volumes or Lipschitz-Killing valuations. They date back to the remarkable discovery of H. Weyl that the coefficients of the tube volume polynomial are intrinsic invariants of the metric. …

2019-12-19abs ↗pdf ↗

A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let …

2006-06-08abs ↗pdf ↗

The paper explores how over-parameterized linear regression models generalize without violating learning theory principles.

problem Understanding how over-parameterized linear regression models generalize without violating learning theory principles.
method The paper uses the predictive normalized maximum likelihood (pNML) learner to investigate the minimum norm solution of over-parameterized linear regression models.
result The model generalizes well when the test sample lies in a subspace spanned by eigenvectors associated with large eigenvalues of the training data.

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a polynomial-length certificate that can be verified in polynomial time to prove that K…

2011-12-05abs ↗pdf ↗

Extends fractional LpL^p uncertainty principles with extremizers and stability results.

problem Investigating uncertainty principles in fractional LpL^p settings.
method Analyzing the fractional Schrödinger equation to find extremal functions and sharp constants.
result Proves stability of extremizers for fractional uncertainty inequalities.

Study on discrepancy principle for learning algorithms in nonparametric regression.

problem Determining optimal iteration number in nonparametric regression with unknown optimal iteration.
method Investigates discrepancy principle and modified principles for kernelized spectral filters, using deviation inequalities and change-of-norm arguments.
result Classical discrepancy principle is adaptive for slow rates, while modified principles are adaptive for faster rates.

Optimal scaling found to depend on operator norm across large models and datasets.

problem Lack of unifying principle for optimal hyperparameter scaling across models and datasets.
method Discovered that optimal scaling is conditioned on the operator norm of the output layer.
result The optimal learning rate/batch size pair (η,B)(η^{\ast}, B^{\ast}) consistently has the same operator norm value.

The paper finds the maximum scalar curvature for 3D minimal hypersurfaces in hyperbolic 4-space.

problem Finding the maximum scalar curvature for 3D minimal hypersurfaces in hyperbolic 4-space.
method Using the Generalized Maximum Principle, the paper proves that a 3D complete minimal hypersurface with constant scalar curvature in H4(1)H^{4}(-1) satisfies S2129S \leq \frac{21}{29}.
result A 3D complete minimal hypersurface in H4(1)H^{4}(-1) with constant scalar curvature satisfies S2129S \leq \frac{21}{29}.

It is our purpose to study complete self-shrinkers in Euclidean space. By introducing a generalized maximum principle for L\mathcal{L}-operator, we give estimates on supremum and infimum of the squared norm of the second fundamental form of self-shrinkers without assumption on \emph{polynomial volume growth}, which is…

2012-02-06abs ↗pdf ↗

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

Study of complete space-like self-expanders in Minkovski space.

problem Characterize complete space-like self-expanders in Minkovski space.
method Use of maximum principle of Omori-Yau type to prove rigidity theorems.
result Classification of 2-dimensional complete space-like self-expanders with constant squared norm of the second fundamental form.

We study some basic problems of translating solitons: the volume growth, generalized maximum principle, Gauss maps and certain functions related to the Gauss maps, finally we carry out point-wise estimates and integral estimates for the squared norm of the second fundamental form. Those estimates give rigidity theorems…

2014-10-19abs ↗pdf ↗

The paper classifies certain types of Lagrangian translators and self-expanders in complex 2-space.

problem Classifying Lagrangian translators and self-expanders in complex 2-space.
method Using a new Omori-Yau type maximum principle proved by Chen and Qiu.
result Several classification results of 2-dimensional complete Lagrangian translators and self-expanders.