Paper proves vanishing homology groups for certain hyperbolic groups.
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.
Trend · papers per month
The computation of the fundamental group of the complement of an algebraic plane curve has been theoretically solved since Zariski-van Kampen, but actual computations are usually cumbersome. In this work, we describe the notion of Wirtinger presentation of such a group relying on the real picture of the curve and with …
The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a virtual link equals its virtual bridge number. Since the Wirtinger number…
Study on weakly G-slim complexes and non-positive immersions for group presentations.
We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. …
New formula for knot group representations and hyperbolic structures.
Link's sphere number equals its bridge number.
A generalization of the affine-geometric Wirtinger inequality for curves to hypersurfaces is given.
We define the Wirtinger width of a knot. Then we prove the Wirtinger width of a knot equals its Gabai width. The algorithmic nature of the Wirtinger width leads to an efficient technique for establishing upper bounds on Gabai width. As an application, we use this technique to calculate the Gabai width of approximately …
Sharp bounds for curve isoperimetric deficit derived.
New method for quandle presentations of surface knots in 4-manifolds.
Considering Wirtinger's inequality for piece-wise equipartite functions we find a discrete version of this classical inequality. The main tool we use is the theorem of classification of isometries. Our approach provides a new elementary proof of Wirtinger's inequality that also allows to study the case of equality. Mor…
New theory classifies knotted spheres in 4D space.
The paper presents fundamental groups of complements of shadows in 4-balls.
New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.
This research explores complex-valued neural networks and their implementation.
We study the phase retrieval problem, which solves quadratic system of equations, i.e., recovers a vector from its magnitude measurements . We develop a gradient-like algorithm (referred to as RWF representing reshaped W…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph Reidemeister moves, generalizing the Dehn presentation of the knot group analogously to…
A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a linear algorithm detecting whether a Gauss paragraph encodes a classical link. W…
We study optimal curvature-free inequalities of the type discovered by C. Loewner and M. Gromov, using a generalisation of the Wirtinger inequality for the comass. Using a model for the classifying space BS^3 built inductively out of BS^1, we prove that the symmetric metrics of certain two-point homogeneous manifolds t…
A {\em word labeled oriented graph} (WLOG) is an oriented graph on vertices , where each oriented edge is labeled by a word in . WLOGs give rise to presentations which generalize Wirtinger presentations of knots. WLOG presentations, where the underlying graph is a tree are of …
In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As in the quandle theory, one can define Alexander quandle and get Alexander polynom…
Free surface-links are shown to be ribbon links.
For any subvariety of a compact holomorphic symplectic Kaehler manifold, we define the number W(X), which we call Wirtinger number. We show that , and the equality is reached if and only if the subvariety is trianalytic, i. e. compactible with the hyperkaehler structure on M. For a sequence $X_…
Paper introduces danceability index as a new bridge index definition.
Core groups are link invariants defined by arc or region presentations.
The paper proves existence and uniqueness of slant immersions in complex space forms.
Hadamard Wirtinger Flow recovers sparse signals from fewer measurements.
Over-the-air computation (AirComp) shows great promise to support fast data fusion in Internet-of-Things (IoT) networks. AirComp typically computes desired functions of distributed sensing data by exploiting superposed data transmission in multiple access channels. To overcome its reliance on channel station informatio…
We prove an inequality that generalizes the Fan-Taussky-Todd discrete analog of the Wirtinger inequality. It is equivalent to an estimate on the spectral gap of a weighted discrete Laplacian on the circle. The proof uses a geometric construction related to the discrete isoperimetric problem on the surface of a cone. In…
We consider the robust phase retrieval problem of recovering the unknown signal from the magnitude-only measurements, where the measurements can be contaminated by both sparse arbitrary corruption and bounded random noise. We propose a new nonconvex algorithm for robust phase retrieval, namely Robust Wirtinger Flow to …
The paper defines and explores Coxeter type LOTs for ribbon 2-knots.
Study calculates fundamental groups of torus knots using algebraic topology.
This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal from noisy quadratic measurements , , with independent sub-exponential noise . The goals are to understand the effect of the sparsity of on the estimation prec…
In the present paper, we construct an invariant for virtual knots in the thickened sphere with g handles; this invariant is a Laurent polynomial in 2g+3 variables. To this end, we use a modification of the Wirtinger presentation of the knot group and the concept of parity introduced by V.O.Manturov. The section 4 of th…
Paper estimates differences in conditional independence graphs from time-dependent data.
In this paper we study some aspects of knots and links in lens spaces. Namely, if we consider lens spaces as quotient of the unit ball with suitable identification of boundary points, then we can project the links on the equatorial disk of , obtaining a regular diagram for them. In this contest, we obtai…
The paper explores representations of specific knot groups and their properties.
New approach to quantify posterior concentration rates using Wasserstein dynamics.
Study homotopy types of free racks and quandles, proving analogs of Milnor's theorem.
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on meridional rank are obtained via Coxeter quotients of the groups of link complement…
Paper tackles phase retrieval with robust gradient descent for noisy data.
Given a braid presentation of a hyperbolic knot, Hikami and Inoue consider a system of polynomial equations arising from a sequence of cluster mutations determined by . They show that any solution gives rise to shape parameters and thus determines a boundary-parabolic -representation …
Algorithms compute invariants of 4-manifolds as branched covers.
The paper explores group presentations for links in thickened surfaces, proving their relationship and introducing new invariants.
A new deep learning model improves phase retrieval performance.
The paper connects complex normalizing flows to Kähler-Ricci flows using geometric and statistical perspectives.
Existing nonconvex statistical optimization theory and methods crucially rely on the correct specification of the underlying "true" statistical models. To address this issue, we take a first step towards taming model misspecification by studying the high-dimensional sparse phase retrieval problem with misspecified link…