Alexander trick applied to homology spheres for manifold homeomorphisms.
problem Group of homeomorphisms of contractible manifolds.
method Strong uniqueness statement for one-sided h-cobordisms.
result Group of homeomorphisms is contractible for d≥6. Study of skateboard flips as continuous curves in SO(3) group.
problem Characterize skateboard flip tricks as continuous motions.
method Model flips as curves in SO(3), analyze lifts to S3, derive formulas. result There are only four distinct flip tricks up to continuous deformation.
Nash's theorem proved with Günther's trick
problem Proving Nash's smooth embedding theorem
method Using Günther's trick
result Nash's theorem proved
Explains Conway's tangle trick and its mathematical origins.
problem Understanding the relationship between braids and elliptic curves.
method Discusses the tangle trick, its mathematical underpinnings, and historical context.
result Establishes the connection between braids and elliptic curves.
Unified framework for gradient estimation in combinatorial spaces.
problem Scaling relaxed gradient estimators to large combinatorial distributions.
method Introducing stochastic softmax tricks within the perturbation model framework.
result Stochastic softmax tricks improve model performance and discover more latent structure.
We prove all knots can be transformed into a trefoil using special diagrams.
problem Transforming any knot into a trefoil using magic tricks.
method Introducing knotholder diagrams to encode transformations.
result All knots can be transformed into a trefoil.
Geometric trick simplifies link homotopy and concordance.
problem Homotopy and concordance of links in homology spheres.
method Relative Whitney trick to remove double points.
result Links in homology spheres can be simplified to topologically slice links.
Outlier based Robust Principal Component Analysis (RPCA) requires centering of the non-outliers. We show a "bias trick" that automatically centers these non-outliers. Using this bias trick we obtain the first RPCA algorithm that is optimal with respect to centering.
The Gumbel-max trick and its extensions simplify sampling from categorical distributions in machine learning.
problem Sampling from categorical distributions with unnormalized probabilities.
method Extensions of the Gumbel-max trick for various applications.
result Simplified and efficient methods for sampling and gradient estimation.
A new gradient estimator for categorical distributions reduces bias and variance.
problem Intractability of gradients for categorical distributions in discrete latent variable models.
method CatLog-Derivative trick and IndeCateR gradient estimator.
result IndeCateR reduces bias and variance of gradients for categorical distributions.
Establishes necessary and sufficient conditions for smooth triviality of Lie subalgebras and Lie ideals, and proves Moser's trick for foliations.
problem Smooth triviality of Lie subalgebras and Lie ideals
method Establishing necessary and sufficient conditions and proving Moser's trick for foliations
result Direct proof of Moser's trick for foliations
Retail Product Image Classification is an important Computer Vision and Machine Learning problem for building real world systems like self-checkout stores and automated retail execution evaluation. In this work, we present various tricks to increase accuracy of Deep Learning models on different types of retail product …
Study of twisted Alexander matrices for certain quandles and their invariants.
problem Investigate f-twisted Alexander matrices for quandles associated with Alexander pairs. method Define and analyze f-twisted Alexander matrices of certain quandles, relate to Carter-Saito-Satoh's invariant, and discuss connections to quandle homology groups. result 0-th elementary ideal of f-twisted Alexander matrix can be described using Carter-Saito-Satoh's invariant. Triple-point Whitney trick classifies ornaments of 3-manifolds.
problem Classifying ornaments of 3-manifolds in high dimensions.
method Triple-point Whitney trick applied to orientable manifolds.
result Classification of ornaments by the μ-invariant.
Establishes connection between Alexander polynomials and triangulations.
problem Alexander polynomials and their variants for knots.
method Introduces twisted Neumann--Zagier matrices for ideal triangulations.
result Formulas for Alexander polynomial and its variants.
Embolic volume of compact manifolds is defined in terms of Berger's embolic inequality. In this paper, we show a result of relating embolic volume to the first Betti number. The proof relies on Gromov's covering argument appeared in systolic geometry. Berger called this method covering trick. We exploit and present mor…
Expands Bredon's trick for applications in geometry and topology.
problem Local-to-global extension principles in geometric and topological contexts.
method Novel applications and frameworks for stratified pseudomanifolds, Ricci flow, and persistent homology.
result Establishes Bredon's trick as a unifying framework.
Researchers extend Alexander polynomial to knotoids and linkoids.
problem Defining and studying Alexander polynomial extensions for knotoids and linkoids.
method Developed and proved conjecture on mock Alexander polynomial for knotoids and linkoids.
result Proved conjecture on mock Alexander polynomial for knotoids and linkoids.
Study Alexander matrices for link quandles and their relation to knot invariants.
problem Understanding Alexander matrices for link quandles and their applications to knot invariants.
method Investigate f-twisted Alexander matrices and their connection to quandle cocycle invariants. result Show that f-twisted Alexander invariants of knot quandles are stronger than those of knot groups. Bredon's trick helps extend local properties to global topological spaces.
problem Extending local properties to global topological spaces.
method Bredon's trick for local properties to global spaces.
result Bredon's trick allows for natural alternative demonstrations of classic results.
Study Alexander polynomials of ribbon and virtual knots using ribbon's intrinsic singularity.
problem Determining Alexander polynomials for ribbon and virtual knots.
method Using ribbon's intrinsic singularity information, defining half Alexander polynomial, and developing simplified formulas.
result New formulas for Alexander polynomials of general knots and virtual knots in terms of Gauss diagrams.
Paper discusses groups where twisted Alexander polynomials vanish.
problem Understanding groups with vanishing twisted Alexander polynomials.
method Introduced and studied twisted Alexander vanishing groups, constructed knots, and analyzed representations.
result Every faithful irreducible representation of a TAV group causes the twisted Alexander polynomial to be zero.
We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the formalism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterizati…
We introduce a family of pairwise stochastic gradient estimators for gradients of expectations, which are related to the log-derivative trick, but involve pairwise interactions between samples. The simplest example of our new estimator, dubbed the fundamental trick estimator, is shown to arise from either a) introducin…
The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each time solving for the most likely configuration. We derive an entire family of r…
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…
An online reinforcement learning algorithm is anytime if it does not need to know in advance the horizon T of the experiment. A well-known technique to obtain an anytime algorithm from any non-anytime algorithm is the "Doubling Trick". In the context of adversarial or stochastic multi-armed bandits, the performance of …
Study calculates twisted Alexander polynomials for Montesinos knots.
problem Tackles the calculation of twisted Alexander polynomials for Montesinos knots.
method Uses SL2(C)-representations to calculate leading coefficients and degrees of the polynomials. result Obtains non-monic twisted Alexander polynomials for some nonfibered knots.
The paper studies twisted Alexander polynomials for knot groups in various extensions.
problem Understanding twisted Alexander polynomials in knot groups for different extensions.
method Developed mod p formula for twisted Alexander polynomials and studied central extensions.
result Established formulas for twisted Alexander polynomials in knot groups for various extensions.
Formula for Alexander polynomial of links with twists.
problem Computing Alexander polynomial of links with twists.
method Using vector space representation of Uq(gl(1∣1)). result Alexander polynomials stabilize after adding enough twists.
Study on a knot invariant's vanishing order.
problem Understanding the vanishing order of twisted Alexander polynomials.
method Defined and explored properties of the twisted Alexander vanishing order.
result Listed twisted Alexander vanishing groups of order less than 201.
We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We recover the classical torsionness and divisibility results, which say that, unde…
A simplified proof of the Alexander-Conway polynomial exists.
problem Existence of the Alexander-Conway polynomial for links in 3D space.
method Presented an accurate detailed exposition of the proof.
result Existence of the Alexander-Conway polynomial proved.
It follows from earlier work of Silver-Williams and the authors that twisted Alexander polynomials detect the unknot and the Hopf link. We now show that twisted Alexander polynomials also detect the trefoil and the figure-8 knot, that twisted Alexander polynomials detect whether a link is split and that twisted Alexand…
The Alexander polynomial of a knot has been generalized in three different ways to give twisted invariants. The resulting invariants are usually referred to as twisted Alexander polynomials, higher-order Alexander polynomials and L2-Alexander invariants of knots. We quickly recall the definitions and we summarize an…
New Alexander polynomial for singular knots improves upon existing methods.
problem Defining a polynomial invariant for singular knots.
method Introducing a perturbed Alexander polynomial.
result The new polynomial agrees with previous definitions for long knots.
New Alexander invariants for knot groups computed using K1-groups.
problem Computing Alexander invariants for knot groups.
method Introducing K1-classes and comparing them with other Alexander polynomials. result Non-triviality of computed K1-classes for some knots. In this paper, we study the colorability of link diagrams by the Alexander quandles. We show that if the reduced Alexander polynomial ΔL(t) is vanishing, then L admits a non-trivial coloring by any non-trivial Alexander quandle Q, and that if ΔL(t)=1, then L admits only the trivial coloring by any Alexa…
New methods compute Alexander polynomials for complex knots.
problem Efficiently computing higher order Alexander polynomials for complex knots.
method Developed new algorithms to compute the Smith normal form of Alexander matrices.
result Computed Alexander polynomials for knots up to 100 crossings.
Paper computes Alexander polynomials for arborescent links.
problem Explicit formulas for Alexander polynomials are hard to compute for most link families.
method Efficient method for arborescent links, using recursive polynomials.
result Explicit closed formulas for pretzel links derived.
Given a virtual knot K, we construct a group VGK called the virtual knot group, and we use the elementary ideals of VGK to define invariants of K called the virtual Alexander invariants. For instance, associated to the k=0 ideal is a polynomial HK(s,t,q) in three variables which we call the virtual Alexa…
Inference in popular nonparametric Bayesian models typically relies on sampling or other approximations. This paper presents a general methodology for constructing novel tractable nonparametric Bayesian methods by applying the kernel trick to inference in a parametric Bayesian model. For example, Gaussian process regre…
Alexander quandles can be embedded into groups.
problem Embedding Alexander quandles into groups.
method For any twisted conjugate quandle, find a group such that the quandle is embedded into the conjugation quandle of the group.
result Alexander quandles can be embedded into groups.
Explicit formulas for pretzel knots' Alexander polynomials.
problem Alexander polynomial of pretzel knots
method Provided explicit formulas
result Characterization of pretzel knots with trivial Alexander polynomial
Murasugi discovered two criteria that must be satisfied by the Alexander polynomial of a periodic knot. We generalize these to the case of twisted Alexander polynomials. Examples demonstrate the application of these new criteria, including to knots with trivial Alexander polynomial, such as the two polynomial 1 knots w…
Homology handles with trivial Alexander polynomial bound a 3D sphere.
problem Understanding when homology handles bound 3D spheres.
method Using Freedman and Quinn's result for Z-homology 3-spheres. result A distinguished homology handle with trivial Alexander polynomial bounds a homology S1imesD3. Study of embedding calculus using infinite operads.
problem Spaces of embeddings and automorphisms of manifolds.
method Infinite operadic towers and Morita (∞,2)-categories. result Generalization of embedding calculus to bordism categories.
Study Alexander polynomials of links in 3-torus.
problem Investigate Alexander polynomials of links in 3-torus.
method Diagrammatic approach, Reidemeister moves, fundamental group, homology group, Alexander polynomials, twisted Alexander polynomials.
result Computed Alexander and twisted Alexander polynomials of links in 3-torus.