Defines slice depth for 2-knots and sets upper bounds for specific knots.
problem Determining the minimum dimension for a 2-knot to be slice.
method Introduces slice depth, defines it for 2-knots, and provides upper bounds for specific knot types.
result Upper bounds for slice depth of certain 2-knots.
Proposes an online method for high-dimensional streaming data.
problem Increasing variable dimensions with sample size in online kernel sliced inverse regression.
method Introduces approximate linear dependence condition and dictionary variable sets to address the problem. Transforms into online generalized eigen-decomposition problem and uses stochastic optimization for updates.
result Achieves close performance to batch processing kernel sliced inverse regression.
Unified method for deriving ridgelet transforms for various neural network architectures.
problem Deriving closed-form expressions for ridgelet transforms in modern neural network architectures.
method Unified Fourier slice method to derive ridgelet transforms for diverse neural network types.
result Systematic method to derive ridgelet transforms for various neural network architectures.
We obtain new invariants of topological link concordance and homology cobordism of 3-manifolds from Hirzebruch-type intersection form defects of towers of iterated p-covers. Our invariants can extract geometric information from an arbitrary depth of the derived series of the fundamental group, and can detect torsion wh…
Many data are naturally modeled by an unobserved hierarchical structure. In this paper we propose a flexible nonparametric prior over unknown data hierarchies. The approach uses nested stick-breaking processes to allow for trees of unbounded width and depth, where data can live at any node and are infinitely exchangeab…
Study on r−shake slice knots and proves 0-shake slice knots are slice.
problem Understanding and characterizing r−shake slice knots. method Exploring the relation to corks and proving slice properties.
result Proves 0-shake slice knots are slice.
Proves certain knots are slice without shaking.
problem Identifying slice knots without using traditional methods.
method Direct proof for 0−shake slice knots. result Proves 0−shake slice knots are slice. Proves a special knot type is slice.
problem Characterizing slice knots.
method Proof by contradiction and algebraic topology.
result 0-shake slice knots are indeed slice.
New findings on knots that are both topologically and rationally slice.
problem Understanding knots that are both topologically and rationally slice.
method Analyzing the concordance group of knots in S3. result There are infinitely many topologically slice knots that are strongly rationally slice but not slice.
Regular sliceness implies once-stably decomposable sliceness in symplectizations.
problem Relationship between regular and decomposable Lagrangian cobordisms in symplectizations.
method Stabilization-free strategy and satellite operations.
result Regular sliceness implies once-stably decomposable sliceness.
We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that if traces converge `horocyclically' to 2 then associated linear slices converge…
The paper defines new knot genera and finds bounds for stabilization distances.
problem Finding bounds for stabilization distances of symmetric surfaces.
method Defining new knot genera and using them to find bounds.
result Constructs unknotted symmetric 2-spheres without symmetric 3-ball bounds.
New knots found with tough, unsliceable discs.
problem Finding tough knots that can't be sliced smoothly.
method Constructed infinitely many knots with non-approximable slice discs.
result Smoothly sliceable knots have non-approximable slice discs.
The study examines obstructions to links being shake slice.
problem Understanding when links are not shake slice.
method Examined shake concordance and zero surgery manifolds, and provided obstructions based on Arf invariants and algebraic sliceness.
result Links that are shake concordant have homology cobordant zero surgery manifolds, and provided specific obstructions to shake sliceness.
A new slicing method speeds up sliced Wasserstein estimation.
problem Efficiently estimating sliced Wasserstein distance.
method Random-Path Projecting Direction (RPD) for fast sampling.
result RPSW and IWRPSW show favorable performance in training generative models.
A knot is said to be slice if it bounds a smooth properly embedded disk in the 4-ball. We demonstrate that the Conway knot, 11n34 in the Rolfsen tables, is not slice. This completes the classification of slice knots under 13 crossings, and gives the first example of a non-slice knot which is both topologically slice an…
Khovanov homology fails to differentiate certain slice disks.
problem Differentiating roll-spun slice disks from trivial ones.
method Using Khovanov homology and Morse theory.
result Khovanov homology cannot distinguish roll-spun slice disks from trivial ones.
Characterizes values of slice-torus invariants related to knot genus.
problem Understanding the values of slice-torus invariants for knots.
method Characterization based on stable smooth slice genus.
result Existence of slice torus invariants without explicit constructions.
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
The study classifies χ−slice pretzel links and Seifert fiber spaces.
problem Understanding χ−slice pretzel links and their properties. method Analyzing the sliceness of pretzel knots and extending results to pretzel links.
result Complete classifications of positive and negative pretzel links that are χ−slice, and partial classifications of 3-stranded and 4-stranded pretzel links. Study slice-regular polynomial functions via twistor space group actions.
problem Characterize slice-regular functions and their polynomial subclasses.
method Employ the twistor construction and group actions of PGL(2,H). result Characterize slice-regular functions with planar twistor lifts and normal classes of polynomials.
The paper shows some Montesinos links can't be doubly sliced strongly.
problem Understanding double sliceness for Montesinos links.
method Using branched double covers and Seifert fibered spaces.
result A large family of Montesinos links are not strongly doubly slice.
Study shows most knots in a family are not slice.
problem Determining which 3-stranded pretzel knots are slice.
method Analyzing a specific infinite family of knots and proving their non-slice properties.
result Four-fifths of the remaining knots in the family are not slice.
We use techniques of Freedman and Teichner to prove that, under certain circumstances, the multi-infection of a slice link is again slice (not necessarily smoothly slice). We provide a general context for proving links are slice that includes many of the previously known results.
Study on slicing knots in 4-manifolds, focusing on CP^2-slicing numbers.
problem Understanding the slicing properties of knots in 4-manifolds.
method Lower and upper bounds on CP^2-slicing numbers using double branched covers and Seifert forms.
result Findings on the finite and distinct CP^2-slicing numbers for certain knots.
New invariant measures doubly slice links, disproving previous bounds.
problem Understanding doubly slice links and their invariants.
method Introduced new invariant gst to measure doubly slice links and disproved previous bounds. result Examples of links with large doubly slice genus but gst=1. New knots show linear independence in slice concordance.
problem Understanding the structure of rationally slice knots.
method Provided an infinite family of knots that are linearly independent.
result Found knots that are linearly independent and infinite order.
Study shows certain knots can't be sliced using 2-fold branched covers.
problem Determining which algebraically slice knots are actually slice.
method Used d invariants of 2-fold branched covers to show nonsliceness.
result Shows nonsliceness of a set of algebraically slice knots.
Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if B(K) is boundary slice, then K is algebraically slice. We also show that the Ras…
In the present paper we extend the definition of slice-torus invariant to links. We prove a few properties of the newly-defined slice-torus link invariants: the behaviour under crossing change, a slice genus bound, an obstruction to strong sliceness, and a combinatorial bound. Furthermore, we provide an application to …
We use recently introduced Rasmussen invariant to find knots that are topologically locally-flatly slice but not smoothly slice. We note that this invariant can be used to give a combinatorial proof of the slice-Bennequin inequality. Finally, we compute the Rasmussen invariant for quasipositive knots and show that most…
Paper explores properties of slice-matching operators for measure transfer.
problem Efficiently transferring measures in high dimensions.
method Examines an associated slice-matching operator with source, target measures and slicing directions.
result Establishes invariance, equivariance, Lipschitz continuity, and error bounds.
We prove that there are infinitely many (1,1)-knots which are topologically slice, but not smoothly slice, which was a conjecture proposed by Béla András Rácz.
The paper calculates the slicing degree of knots using advanced homology theories.
problem Determining the minimum slicing degree of knots.
method Rasmussen's s-invariant, knot Floer homology, and singular instanton homology.
result Computed slicing degrees for many small knots and some families of torus knots.
We study the classification of slice disks of knots up to isotopy and diffeomorphism using an invariant in knot Floer homology. We compute the invariant of a slice disk obtained by deform-spinning, and show that it can be effectively used to distinguish non-isotopic slice disks with diffeomorphic complements. Given a s…
A new approach simplifies Sliced-Wasserstein distances to improve learning performance.
problem The concentration of measure phenomenon makes random projections uninformative in high dimensions.
method Propose rescaling the 1D Wasserstein distance to make all slices equally informative.
result The classical Sliced-Wasserstein, properly configured, can match or surpass complex variants.
New lower bound for doubly slice genus using knot signatures.
problem Finding a lower bound for the doubly slice genus of knots.
method Using the classical signature function to derive a new lower bound.
result Proved that for every nonnegative integer N, there exists a knot with exactly N difference between slice and doubly slice genus.
New proof for some knots being topologically slice.
problem Understanding which knots are topologically slice.
method Equivariant topological slice disks for strongly negative amphichiral knots.
result Strongly negative amphichiral knots with trivial Alexander polynomial are equivariantly topologically slice.
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a lower bound on the number of quadrilaterals of normal surfaces depending on the …
The slicing number of a knot, us(K), is the minimum number of crossing changes required to convert K to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus gs(K). We show that for many knots, previous bounds on unknotting number obtained by Ozsvath and Szabo and b…
CB-SLICE identifies concept-based error slices in deep learning models.
problem Systematic errors in deep learning models on specific groups.
method Concept Bottleneck Models (CBMs) and concept representations.
result CB-SLICE outperforms state-of-the-art methods in error slice identification.
New findings show infinitely many knots cannot be smoothly round handle slices.
problem Understanding the smoothability of knots in 4-dimensional space.
method Analyzing the properties of knots under surgery conjectures and cobordism conjectures.
result Infinitely many knots fail to be smoothly round handle slices.
We construct an infinite family of smoothly slice knots that we prove are topologically doubly slice. Using the correction terms coming from Heegaard Floer homology, we show that none of these knots is smoothly doubly slice. We use these knots to show that the subgroup of the double concordance group consisting of smoo…
Study on Whitehead doubles and their sliceness properties.
problem Understanding sliceness of Whitehead doubles of knots.
method Survey of techniques to obstruct sliceness and improve bounds on non-orientable genus.
result Improved bounds on non-orientable 4 genus of Whitehead doubles and genus 1 non-orientable cobordisms to cable knots.
Gromov-Wasserstein (GW) is a powerful tool to compare probability measures whose supports are in different metric spaces. GW suffers however from a computational drawback since it requires to solve a complex non-convex quadratic program. We consider in this work a specific family of cost metrics, namely \textit{tree me…
Defines concordance for spatial graphs and proves sliceness equivalence.
problem Understanding concordance and sliceness for spatial graphs.
method Smooth definitions and linking number conditions.
result Sliceness of a spatial graph is equivalent to a condition on linking numbers and a link.
A new method slices and sums radial kernels faster.
problem Fast computation of large kernel sums in kernel methods.
method Random projections to 1D subspaces and QMC for selecting projections.
result QMC-slicing outperforms existing methods on test datasets.
Smoothly slice a knot with specific properties.
problem Existence of certain types of knots.
method Proving the existence of a specific knot with given properties.
result Existence of a smoothly doubly slice, amphicheiral knot with Alexander polynomial 1 and unknotting number 5.