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

100201301401 · Jun 202019922001200920172026
48 results for parametrized Borsuk-Ulam property

The paper connects sectional category and parametrized Borsuk-Ulam property for fibrations.

problem Parametrized Borsuk-Ulam property for fibrations.
method Investigation of sectional category connections and fibrations.
result The sectional category of qq being larger than qpq^{p'} implies the parametrized Borsuk-Ulam property for the triple (p,τ;p)(p,τ;p').

Study determines Borsuk-Ulam property for maps between torus and Klein bottle.

problem Determining maps with Borsuk-Ulam property between torus and Klein bottle.
method Analyzing homotopy classes of maps and using fundamental groups.
result Identifies specific homotopy classes of maps with Borsuk-Ulam property.

The paper identifies Borsuk-Ulam property for specific map classes between torus and Klein bottle.

problem Determining Borsuk-Ulam property for map classes between torus and Klein bottle.
method Using homotopy classes and free involutions of spaces, the paper analyzes fundamental groups to find the property.
result Homotopy classes of maps from torus to Klein bottle with specific involutions have the Borsuk-Ulam property.

We consider spaces with free involutions that satisfy the Borsuk - Ulam theorems (BUT-spaces). There are several equivalent definitions for BUT-spaces that can be considered as their properties. Our main technical tool is Yang's cohomological index.

2015-07-31abs ↗pdf ↗

Let (X, t, S) be a triple, where S is a compact, connected surface without boundary, and t is a free cellular involution on a CW-complex X. The triple (X, t, S) is said to satisfy the Borsuk-Ulam property if for every continuous map f:X-->S, there exists a point x belonging to X satisfying f(t(x))=f(x). In this paper, …

2010-03-25abs ↗pdf ↗

Extends Borsuk-Ulam theorem with applications in sphere coverings and colorings.

problem Complexity bounds and structural insights for triangulated sphere mappings.
method Combinatorial labeling and order type analysis of finite point sets.
result New topological Hall theorem and generalizations of hypergraph Hall theorems.

Thickenings of a metric space capture local geometric properties of the space. Here we exhibit applications of lower bounding the topology of thickenings of the circle and more generally the sphere. We explain interconnections with the geometry of circle actions on Euclidean space, the structure of zeros of trigonometr…

2019-07-14abs ↗pdf ↗

The paper connects geometric and topological concepts to bound distances between metric spaces.

problem Bounding distances between metric spaces using Gromov-Hausdorff distance.
method Using Borsuk-Ulam theorems and Vietoris-Rips complexes, the paper obstructs the existence of certain continuous maps between complexes to bound discontinuities of functions.
result The paper provides new bounds on Gromov-Hausdorff distances between spheres of different dimensions.

We compute the rings H(N;F2)H^*(N;\mathbb{F}_2) for NN a closed Sol3\mathbb{S}ol^3-manifold and then determine the Borsuk-Ulam indices BU(N,φ)BU(N,φ) with φ0φ\not=0 in H1(N;F2)H^1(N;\mathbb{F}_2).

2013-01-06abs ↗pdf ↗

We prove several new results around Gromov's waist theorem. We give a simple proof of Vaaler's theorem on sections of the unit cube using the Borsuk--Ulam--Crofton technique. We consider waists of real and complex projective spaces, flat tori, convex bodies in Euclidean space. We establish waist-type results in terms o…

2016-12-20abs ↗pdf ↗

The study connects projective codes to the distribution of zeros of odd maps.

problem Understanding the distribution of zeros of odd maps from spheres to Euclidean space.
method Using the topology of the space of probability measures on the sphere.
result Generalization of the Borsuk-Ulam theorem and its four consequences.

Researchers create black holes isometric to extremal Reissner-Nordström.

problem Third law of black hole thermodynamics.
method Novel CkC^k characteristic gluing procedure and scalar field pulses.
result Definitive disproof of the third law of black hole thermodynamics.

Tucker and Ky Fan's lemma are combinatorial analogs of the Borsuk-Ulam theorem (BUT). In 1996, Yu. A. Shashkin proved a version of Fan's lemma, which is a combinatorial analog of the odd mapping theorem (OMT). We consider generalizations of these lemmas for BUT-manifolds, i.e. for manifolds that satisfy BUT. Proofs rel…

2014-09-30abs ↗pdf ↗

We introduce and study a new family of extensions for the Borsuk-Ulam and topological Radon type theorems. The defining idea for this new family is to replace requirements of the form `a subset that is large in some sense goes to a singleton' with requirements of the milder form `a subset that is large in some sense go…

2018-12-28abs ↗pdf ↗

Introduces injective category number for continuous maps, linking classical and contemporary research.

problem Understanding conditions for a continuous map to be injective.
method Defines injective category number and examines its behavior under various operations.
result Provides a cohomological lower bound and expressions for injective category numbers in specific cases.

The paper explores how to reduce classification tasks to optimization problems in Euclidean space.

problem Understanding the minimum dimension needed for reducing classification tasks to optimization problems.
method Developed a generalization of the Borsuk-Ulam Theorem to analyze the expressivity of reductions.
result The minimum Euclidean dimension required can be exponentially larger than the VC dimension, even for slightly non-trivial reductions.

This paper explores how to choose scoring rules for estimating properties with parametric assumptions.

problem Indirect elicitation of properties with parametric assumptions.
method Developed a framework for choosing proper scoring rules for indirect elicitation, considering constraints and optimal solutions.
result The optimal estimation of the target property changes monotonically with the increase of each weight, and often setting some weights as zero yields the best configuration.

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric form for a class of parametric polynomial minimal surfaces of arbitrary degree. It …

2010-08-01abs ↗pdf ↗

Let VV and WW be orthogonal representations of GG with VG=WG={0}V^G= W^G=\{0\}. Let S(V)S(V ) be the sphere of VV and f:S(V)Wf : S(V ) \to W be a GG-equivariant mapping. We give an estimate for the dimension of the set Zf=f1{0}Z_f=f^{-1}\{0\} in terms of dimV \dim V and dimW\dim W, if GG is the torus Tk\mathbb T^k, or the pp-torus $\ma…

2013-02-06abs ↗pdf ↗

The width ww of a curve γγ in Euclidean space RnR^n is the infimum of the distances between all pairs of parallel hyperplanes which bound γγ, while its inradius rr is the supremum of the radii of all spheres which are contained in the convex hull of γγ and are disjoint from γγ. We use a mixture of topological and…

2016-05-04abs ↗pdf ↗

This work introduces benchmarks for evaluating nanophotonic structures in design simulations.

problem Design and understanding of nanophotonic structures for various applications.
method Development of frameworks and benchmarks for evaluating nanophotonic structures in parametric design problems.
result Strategic use of evaluation fidelity in enhancing structure designs.

Minimum-norm solutions generalize well in over-parametrized neural networks.

problem Generalization error in over-parametrized neural networks.
method Analyzing three models: random feature model, two-layer neural network, and residual network.
result Generalization error for minimum-norm solutions is comparable to Monte Carlo rate, up to logarithmic terms.

It is proved that for a product action of (Zp)k(\mathbb Z_p)^k on a product of (mod p) homology spheres Nn1×...×NnkN^{n_1}\times...\times N^{n_k}, where all nin_i's are assumed to be odd if pp is odd, and any continuous map f ⁣:Nn1×...×NnkRmf\colon N^{n_1}\times...\times N^{n_k}\to \mathbb R^m the set $A(f)=\{x\in N^{n_1}\times...\times N^{n_k}…

2005-10-05abs ↗pdf ↗

This paper connects ultrametric overlap gap properties to parametric RDT for symmetric binary perceptrons.

problem Characterizing statistical computational gaps in symmetric binary perceptrons.
method Developed an analytical union-bounding program to rigorously upper-bound constraint densities of ultrametric overlap gap properties.
result Obtained tightest bounds at the first two levels of ultrametric overlap gap properties, closely approaching parametric RDT estimates.

Cookbook transforms constrained statistical inference into unconstrained problems.

problem Transforming constrained statistical inference into unconstrained problems.
method Bijective and diffeomorphisms parametrizations.
result Maintains statistical inference properties like identifiability.

Machine learning finds a compact fixed point action for SU(3) gauge theory.

problem Finding accurate and compact parametrizations of fixed point actions for SU(3) gauge theory.
method Used machine learning, specifically a gauge equivariant convolutional neural network.
result Obtained a superior parametrization of a fixed point action for SU(3) gauge theory.

SMD outperforms SGD in over-parametrized linear models for certain data distributions.

problem Understanding the generalization performance of SMD in over-parametrized linear models.
method Analysis of SMD for over-parametrized linear models with binary classification.
result Empirical validation of SMD's generalization performance differing from SGD.

Proof of learning rate transfer in MLPs with μμP parameterization.

problem Understanding and optimizing learning rates in neural networks with different parameterizations.
method Theoretical analysis and empirical validation of learning rate transfer in MLPs with μμP, SP, and NTP parameterizations.
result The optimal learning rate converges to a non-zero constant as width goes to infinity under μμP, explaining learning rate transfer.

The study characterizes loxodromes on specific rotational surfaces in 3D space.

problem Characterizing loxodromes on rotational surfaces with special geometric properties.
method Parametrizations and curvature/torsion calculations for loxodromes on various rotational surfaces.
result The loxodrome on a flat rotational surface is a general helix.

We propose a new non parametric technique to estimate the CALL function based on the superhedging principle. Our approach does not require absence of arbitrage and easily accommodates bid/ask spreads and other market imperfections. We prove some optimal statistical properties of our estimates. As an application we firs…

2015-02-13abs ↗pdf ↗

The article applies Lusternik-Schnirelmann theory to establish lower bounds on critical points using sequential and parametrized topological complexity.

problem Establishing lower bounds on the number of critical points of functions using topological complexity.
method Applying Lusternik-Schnirelmann theory to sequential and parametrized topological complexity.
result Established various lower bounds on the number of critical points using sequential and parametrized topological complexity.