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

15304459 · Jun 202019922001200920172026
48 results for Brouwer degree

A new technique for the study of geodesic connectedness in a class of Lorentzian manifolds is introduced. It is based on arguments of Brouwer's topological degree for the solution of functional equations. It is shown to be very useful for multiwarped spacetimes, which include different types of relativistic spacetimes.

1999-09-14abs ↗pdf ↗

We give new tools for homotopy Brouwer theory. In particular, we describe a canonical reducing set (the set of "walls") which splits the plane into maximal translation areas and irreducible areas. We then focus on Brouwer mapping classes relatively to four orbits and describe them explicitly by adding to Handel's diagr…

2015-07-10abs ↗pdf ↗

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in…

2009-06-29abs ↗pdf ↗

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the Gelfand-Mazur Theorem. We give a related proof that an irreducible real polynom…

2015-02-01abs ↗pdf ↗

Paper extends Brouwer Fixed Point Theorem with amiable and almost amiable fixed sets.

problem Extending the Brouwer Fixed Point Theorem to approximate fixed sets.
method Introducing shape boundary regions in CW spaces as amiable and almost amiable fixed subsets of dpc maps.
result Variation of Jordan Curve Theorem and Fixed Cell Complex Theorem.

We prove that if nn is even, (M,g)(M,g) is a compact nn-dimensional Riemannian manifold whose Pfaffian form is a positive multiple of the volume form, and yC1,α(M;Rn+1)y\in C^{1,α}(M;\mathbb{R}^{n+1}) is an isometric immersion with n/(n+1)<α1n/(n+1)< α\leq 1, then y(M)y(M) is a surface of bounded extrinsic curvature. This is proved by showi…

2016-01-22abs ↗pdf ↗

We give an answer to the question given by T.Y.Kong in his article "Can 3-D Digital Topology be Based on Axiomatically Defined Digital Spaces?" In this article he asks the question, if so called "good pairs" of neighborhood relations can be found on the set Z^n such that the existence of digital manifolds of dimension …

2011-11-13abs ↗pdf ↗

New tiles in higher dimensions are shown to be homeomorphic to balls.

problem Characterizing self-affine tiles in higher dimensions as balls.
method Using Brouwer's invariance of domain theorem and a horizontal distance tool.
result Necessary and sufficient conditions for tiles to be dd-dimensional tame balls.

The paper generalizes Sperner's lemma to higher dimensions and calculates a new invariant.

problem Generalizing Sperner's lemma to higher dimensions and quantifying its outcomes.
method Using triangulations of (m+1)(m+1)-discs and simplicial mappings, the authors define a new invariant and prove a theorem about fully colored simplices.
result The number of fully colored simplices is not less than the new invariant μ([f]).

Paper proves a new criterion for time-like geodesics in flat spacetimes.

problem Existence and nature of time-like geodesics in asymptotically flat spacetimes.
method Generalized topological criterion using the Jordan-Brouwer Separation Theorem and differential geometry.
result Conclusively affirms the presence of time-like geodesics intersecting transversally.

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 ↗

We answer the question of when a new point can be added in a continuous way to configurations of nn distinct points in a closed ball of arbitrary dimension. We show that this is possible given an ordered configuration of nn points if and only if n1n \neq 1. On the other hand, when the points are not ordered and the d…

2018-09-18abs ↗pdf ↗

M Handel has proved in [Topology 38 (1999) 235--264] a fixed point theorem for an orientation preserving homeomorphism of the open unit disk, that may be extended to the closed disk and that satisfies a linking property of orbits. We give here a new proof of Handel's fixed point theorem, based on Brouwer theory and som…

2009-03-02abs ↗pdf ↗

We prove a discrete Jordan-Brouwer-Schoenflies separation theorem telling that a (d-1)-sphere H embedded in a d-sphere G defines two different connected graphs A,B in G such a way that the intersection of A and B is H and the union is G and such that the complementary graphs A,B are both d-balls. The graph theoretic de…

2015-06-22abs ↗pdf ↗

Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.

problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.

This is a mathematical commentary on Teichm{ü}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{ä}chen'' (Determination of extremal quasiconformal maps of closed oriented Riemann surfaces). This paper is among the last (and may be the last one) that Teich…

2015-10-09abs ↗pdf ↗

FairACE improves fairness in GNNs by balancing node performance across degree groups.

problem Degree biases in GNNs lead to unequal prediction performance among nodes with varying degrees.
method Integrates asymmetric contrastive learning with adversarial training to balance performance between high-degree and low-degree nodes.
result Significantly improves degree fairness metrics while maintaining competitive accuracy.

For harmonic maps of degree 2, a similar quantitative stability estimate does not hold uniformly.

problem Investigate the quantitative stability of harmonic maps of degree 2.
method Prove a local quantitative stability result for harmonic maps of degree 2, showing dependence on the given harmonic map.
result A uniformly quantitative stability estimate does not hold for degree 2 harmonic maps.

We survey some major contributions to Riemann's moduli space and Teichm{ü}ller space. Our report has a historical character, but the stress is on the chain of mathematical ideas. We start with the introduction of Riemann surfaces, and we end with the discovery of some of the basic structures of Riemann's moduli space a…

2016-02-23abs ↗pdf ↗

In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A recent extension by Karrer and Newman incorporates a node degree correction to mod…

2013-11-11abs ↗pdf ↗

New formula recovers degree of colored Jones polynomials for pretzel knots.

problem Determining the degree of colored Jones polynomials for specific knots.
method Alternate expansion of the colored Jones polynomial for pretzel links, focusing on 3-tangle knots.
result Determined the degrees of the colored Jones polynomials for a new family of 3-tangle pretzel knots.

Christoffel function characterizes the corruption a bounded-degree certificate cannot remove in robust halfspace learning.

problem Robust halfspace learning under malicious noise
method Sum-of-Squares degree of outlier-removal certificate
result Christoffel function bounds the corruption a bounded-degree certificate cannot remove

Low-degree method fails to predict robust subspace recovery problem.

problem Predicting computational tractability of robust subspace recovery problem.
method Low-degree polynomial framework, anti-concentration properties.
result Low-degree method fails to predict computational tractability of robust subspace recovery problem even up to high degree.

The paper corrects for node degree in spectral clustering using random walk Laplacian.

problem Node degree heterogeneity in spectral clustering.
method Graph spectral embedding using the random walk Laplacian.
result The embedding provides uniformly consistent estimates of degree-corrected latent positions.

We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint degree distributions are called dKdK-graphs in the computer science literature and…

2014-11-14abs ↗pdf ↗

GCNs favor high-degree nodes, leading to biased performance; a new method mitigates this.

problem Degree-related biases in GCNs, especially for low-degree nodes.
method Developed a novel SL-DSGC that reduces model and data biases.
result SL-DSGC improves GCN accuracy significantly for low-degree nodes.