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

109218326435 · Jun 202019922001200920172026
48 results for Helly number

Automorphisms and subdivisions of Helly graphs are studied, leading to explicit models and rational translation lengths.

problem Understanding automorphisms and subdivisions of Helly graphs.
method Simple fine simplicial subdivisions and explicit simplicial models of the injective hull.
result Any automorphism of a Helly graph is either elliptic or hyperbolic, with rational translation lengths.

Lecture notes on group actions on injective spaces and Helly graphs.

problem Understanding group actions on specific metric spaces.
method Review of injective metric spaces and Helly graphs, elementary properties, constructions, and exercises.
result Presentation of various constructions of injective metric spaces and Helly graphs with interesting group actions.

A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin groups are Helly, that is, they act geometrically on Helly graphs. In particular, such groups act geometrically on spaces with convex geodesic bico…

2019-04-19abs ↗pdf ↗

Paper characterizes classes for which optimal sample complexity can be achieved by proper learning algorithms.

problem Characterizing classes for which optimal sample complexity can be achieved by proper learning algorithms.
method Identifying dual Helly number and its relation to proper learning algorithms.
result Optimal sample complexity can be achieved by proper learning algorithms for classes with bounded dual Helly number.

The paper conjectures and proves fixed points for certain group actions on nonpositively curved spaces.

problem Actions by automorphisms of finitely generated groups on nonpositively curved complexes without fixed points.
method Use of Helly graphs and geodesic clique paths to prove ellipticity results.
result Finitely generated torsion groups cannot act without fixed points on nonpositively curved spaces.

The study proves fixed-point theorems for groups acting on CAT(0) spaces.

problem Finding fixed points for groups acting on CAT(0) spaces.
method Bootstrapping technique with Helly-type theorems to prove intersections of fixed-point sets.
result Lower bounds on the smallest dimension for groups to act on CAT(0) spaces without global fixed points.

Theory of space-time currents for geometric evolutions.

problem Analysis of geometric evolutions driven by dislocations.
method Development of space-time integral currents with bounded variation, introduction of Lipschitz deformation distance.
result Agreement of Lipschitz deformation distance with integral Whitney flat metric for boundaryless currents.

This paper shows that a construction, which was introduced by Piotr Minc in connection with a problem that came from Helly type theorems and that allows to replace three PL-arcs with a "sheltered middle path", can in the case of general (non-PL) paths result in the topologist's sine curve.

2012-06-20abs ↗pdf ↗

We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex bodies connect with some classical results of Convex Geometry, as Helly theorem, an…

2008-08-13abs ↗pdf ↗

Reduces conjecture for Artin groups to simpler cases.

problem Proving K(π,1)K(π,1) for Artin groups with specific spherical parabolics.
method Reduces to simpler cases, uses injective metric spaces, combinatorial convexity, and Bestvina-type inequalities.
result Deduces K(π,1)K(π,1) conjecture for specific Artin groups.

We improve the bound on Kühnel's problem to determine the smallest nn such that the kk-skeleton of an nn-simplex Δn(k)Δ_n^{(k)} does not embed into a compact PL 2k2k-manifold MM by showing that if Δn(k)Δ_n^{(k)} embeds into MM, then n(2k+1)+(k+1)βk(M;Z2)n\leq (2k+1)+(k+1)β_k(M;\mathbb Z_2). As a consequence we obtain improved Radon and He…

2019-04-04abs ↗pdf ↗

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

2015-07-15abs ↗pdf ↗

The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.

problem Bounding the handle number of sutured manifolds.
method Developed bounds on the Morse-Novikov number of a link in terms of its tunnel number, and used these to bound the handle number of Heegaard splittings.
result The handle number function is bounded, constant on rays from the origin, and locally maximal.

New measure shows how links can be untangled as twists increase.

problem Understanding how links can be simplified through repeated twists.
method Introduced the stable unknotting number to analyze links in a twist family.
result The stable unknotting number depends only on the winding number of the link, not the wrapping number.

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist infinitely many positive knots with any dealternating number (or any alternation…

2008-08-05abs ↗pdf ↗

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

Study on knot properties, showing relation between unknotting and crossing numbers.

problem Relations between unknotting and crossing numbers of spatial embeddings.
method Analyzes handcuff-graphs and theta curves, extends known results to handlebody-knots.
result Characterizes handlebody-knots satisfying the equality between unknotting and crossing numbers.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

2011-07-25abs ↗pdf ↗

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking numbers of links with crossing number at most 9. Ultimately, we find the unlinkin…

2017-01-05abs ↗pdf ↗

This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number. Finally we prove that its clock number is equal to its crossing number if and only if …

2011-03-01abs ↗pdf ↗

We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the minimal number of crossing changes to a slice knot; and the concordanc…

2013-11-26abs ↗pdf ↗

Jablan and Radović originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number of a knot, respectively, and prove they are well defined. We answer two questions a…

2018-01-31abs ↗pdf ↗

A rational linear combination of Chern numbers is an oriented diffeomorphism invariant of smooth complex projective varieties if and only if it is a linear combination of the Euler and Pontryagin numbers. In dimension at least three only multiples of the top Chern number, which is the Euler characteristic, are invarian…

2011-10-31abs ↗pdf ↗

An nn-crossing is a point in the projection of a knot where nn strands cross so that each strand bisects the crossing. An übercrossing projection has a single nn-crossing and a petal projection has a single nn-crossing such that there are no loops nested within others. The übercrossing number, u¨(K)\text{ü}(K), is the…

2013-11-03abs ↗pdf ↗

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite …

2019-12-18abs ↗pdf ↗

The paper tabulates and computes the number of alternating pretzel links up to a given crossing number.

problem Computing the total number of alternating pretzel links for a given crossing number.
method Derived a closed formula to compute the total number of alternating pretzel links, P(c)\mathcal{P}(c), for any given crossing number cc.
result The number of alternating pretzel links grows exponentially with the crossing number.

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that LL has vanishing pairwise linking numbers, this triple linking number gives an integ…

2019-01-16abs ↗pdf ↗

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain mm-component T2T^2-link (m3m \geq 3) determined from two commutative pure mm-braids aa and bb. We present the triple linking number of such a T2T^2-link, by usin…

2011-02-18abs ↗pdf ↗