New knot concept extends welded knots, simplifying classification.
problem Classifying welded knots and their complements.
method Introducing 'wen knots', proving subset relationships, characterizing complements.
result Extended welded knots can be fully characterized by the parity of wens.
The theory of welded and extended welded knots is a generalization of classical knot theory. Welded (resp. extended welded) knot diagrams include virtual crossings (resp. virtual crossings and wen marks) and are equivalent under an extended set of Reidemeister-type moves. We present a new class of invariants for welded…
Develops Hermitian TQFTs from quantum groups, defining new topological phases.
problem Defining Hermitian non-semisimple TQFTs.
method Categorical context and representation theory of quantum groups.
result New pseudo-Hermitian topological phases from quantum group representations.
It is known that every ribbon category with unimodality allows symmetrized 6j-symbols with full tetrahedral symmetries while a spherical category does not in general. We give an explicit counterexample for this, namely the category E. We define the mirror conjugate symmetry of 6j-symbols instead and sho…
In Levin-Wen (LW) models, a wide class of exactly solvable discrete models, for two dimensional topological phases, it is relatively easy to describe only single fluxon excitations, but not the charge and dyonic as well as many-fluxon excitations. To incorporate charged and dyonic excitations in (doubled) topological p…
New algorithm finds optimal policy with polynomial trajectories in deterministic systems.
problem Finding optimal policy in deterministic systems with function approximation.
method Novel recursion-based algorithm with tight bounds on error and sample complexity.
result Optimal policy found using O(dimE) trajectories with $δ= O\left(ρ/\sqrt{\dim_E}
ight)$. New pseudo-Hermitian models from non-semisimple TQFTs.
problem Constructing exactly solvable pseudo-Hermitian spin Hamiltonians.
method Identifying ground states on surfaces using non-semisimple TQFTs.
result Ground states depend only on spatial topology and can be assigned by non-semisimple TQFTs.
Generalizes string-net modular functors to non-spherical categories.
problem Extending string-net models to non-spherical categories.
method Using non-semisimple string-nets and Drinfeld centers.
result Equivalence between string-net and Lyubashenko modular functors.
The paper connects discrete choice models to multi-armed bandit algorithms with sublinear regret bounds.
problem Optimizing user choices in a multi-armed bandit setting.
method Establishes connections between discrete choice models and multi-armed bandit algorithms, providing sublinear regret bounds and novel algorithms.
result Sublinear regret bounds for a family of algorithms, including the Exp3 algorithm.
MQTransformer improves forecast accuracy with context-aware attention.
problem Improving probabilistic demand prediction accuracy.
method Incorporates Transformer architectures for context alignment and feedback-aware attention.
result Significant improvements in forecast accuracy, reducing excess variability.
Training large machine learning models requires a distributed computing approach, with communication of the model updates being the bottleneck. For this reason, several methods based on the compression (e.g., sparsification and/or quantization) of updates were recently proposed, including QSGD (Alistarh et al., 2017), …
Framework predicts responses in misspecified systems using GPLFM and BNNs.
problem Predicting responses in dynamical systems with model misspecification.
method Integrates GPLFM and BNNs for uncertainty-aware inference and prediction.
result Systematic propagation of uncertainty from diagnosis to prediction.
mNARX+ creates accurate surrogate models for complex systems without requiring domain expertise.
problem Creating accurate surrogate models for complex dynamical systems without extensive domain knowledge.
method Data-driven, recursive algorithm that automatically selects temporal features and their causal ordering.
result Automatically identifies critical auxiliary quantities and their order for accurate modeling.
Geometrically interprets cup products and defines combinatorial Pin structures.
problem Understanding Steenrod's cup products and their geometric interpretation.
method Constructs vector fields and combinatorial frames to interpret cochain-level formulas.
result Geometrically interprets cup products and defines Pin structures combinatorially.
New methods improve Bayesian inference and decision-making in online learning.
problem Current Bayesian deep learning does not fully utilize joint predictives for sequential decision-making.
method Proposes new evaluation settings for active learning and active sampling, focusing on marginal and joint cross-entropies.
result Initial experiments suggest challenges in applying current BDL inference techniques in high-dimensional spaces.
The paper tackles ride-hailing fleet repositioning with a calibrated demand approach.
problem Repositioning idle supply before future demand is observed in ride-hailing.
method A predict-then-optimize approach using calibrated demand regimes, a similarity gate, and spatial queue-regret decomposition.
result The spatial gate reduces mean wait time to 82.3s compared to 85.3s for a hand-tuned similarity gate and 85.8s for a distributional-only baseline.
The prevalence of online media has attracted researchers from various domains to explore human behavior and make interesting predictions. In this research, we leverage heterogeneous social media data collected from various online platforms to predict Taiwan's 2016 presidential election. In contrast to most existing res…
The study derives generalization bounds for neural oscillators, improving their performance with regularization.
problem Quantifying the generalization capacities of neural oscillators.
method Using Rademacher complexity and squared Wasserstein-1 distances, the study derives theoretical upper PAC generalization bounds for neural oscillators.
result Theoretical bounds show polynomial growth in estimation errors with MLP size and time length, and regularization improves performance.
Polynomially parametrize interesting knotted surfaces.
problem Constructing polynomial parametrizations of knotted surfaces.
method Develop polynomial parametrization methods for specific knotted surfaces.
result Examples of polynomial parametrizations for knotted spheres, tori, and planes.
New 2-knots found with same knot group but different quandles.
problem Identifying 2-knots with identical knot groups but distinct quandles.
method Analyzing knot quandles of twist spins.
result First example of 2-knots with same knot group but different quandles.
New knot quandles distinguish ribbon knots with isomorphic groups.
problem Distinguishing knots with isomorphic fundamental groups.
method Examined knot quandles of Suciu's ribbon knots and computed their types.
result Knot quandles of Suciu's ribbon knots are mutually non-isomorphic.
Proved colored HOMFLY-PT polynomials for specific knots.
problem Calculating colored HOMFLY-PT polynomials for specific knots.
method Rigorous mathematical proof for trefoil, figure-eight, and twist knots.
result Colored HOMFLY-PT polynomials expressed as sums for different knots.
Knot contact homology is an invariant of knots derived from Legendrian contact homology which has numerous connections to the knot group. We use basic properties of knot groups to prove that knot contact homology detects every torus knot. Further, if the knot contact homology of a knot is isomorphic to that of a cable …
Gated Recurrent Unit (GRU) is a recently-developed variation of the long short-term memory (LSTM) unit, both of which are types of recurrent neural network (RNN). Through empirical evidence, both models have been proven to be effective in a wide variety of machine learning tasks such as natural language processing (Wen…
The paper explores non-trivial welded knots and ribbon torus-knots, proving their existence.
problem Proving the non-triviality of welded knots and ribbon torus-knots.
method By generating examples and determining the fundamental group of the concerned welded knot.
result Non-triviality of welded knots and ribbon torus-knots is demonstrated.
We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we analyze the Legendrian knots in knot types obtained from K by cabling, in terms of Legendrian knots in the knot type K. As a corollary of this analysis, we show that the (2,3)-cable of the (2,3)-torus knot is not transver…
Study concordance of alternating torus knots to L-space knots.
problem When are linear combinations of alternating torus knots concordant to L-space knots?
method Proved Allen's conjecture for alternating torus knots and established a necessary condition.
result Linear combinations of alternating torus knots are concordant to L-space knots if and only if they are a single torus knot.
This paper studies how knots combine using Alexander Polynomials.
problem How knots combine and their determinants behave.
method Basic knot theory, Alexander Polynomials, and composition techniques.
result Generalized solution for knot determinants in compositions.
The paper classifies a special family of knots in lens spaces using knot Floer homology.
problem Classifying constrained knots in lens spaces.
method Parameterization by five integers, characterization via spinc structures, and knot Floer homology calculations. result Complete classification of constrained knots based on knot Floer homology.
The study confirms conjectures about slopes of knots using knot Floer homology.
problem Verifying conjectures about non-integer characterizing slopes of knots.
method Using knot Floer homology, the study verifies conjectures for specific classes of knots.
result Almost all slopes are characterizing for many knots, and infinitely many for L-space knots. 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.
New diagonal knots found with non-torus structure.
problem Identifying knots with diagonal grid diagrams.
method Analysis of knots represented by diagonal grid diagrams.
result All diagonal knots are positive, and a new non-torus example is found.
New hyperbolic knots not concordant to algebraic ones found.
problem Identifying knots not concordant to algebraic knots.
method Constructing hyperbolic L-space knots.
result Found hyperbolic knots that are not concordant to algebraic knots.
Formula for Alexander polynomial of twisted torus knots derived.
problem Calculating Alexander polynomial for a specific class of knots.
method Knot group presentation combined with Fox's calculus.
result Explicit formula for Alexander polynomial of twisted torus knots.
A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecan…
Expanded Legendrian knot atlas for 10-arc index knots.
problem Lack of Legendrian knot data for knots with high arc index.
method Created an atlas of Legendrian knots up to arc index 10.
result Legendrian knots of arc index 10 have been cataloged.
The paper conjectures Khovanov homology can distinguish torus and twist knots.
problem Detecting and distinguishing knots using Khovanov homology.
method Examining all prime knots with up to 20 crossings, conjecturing Legendrian simplicity.
result Numerical evidence supports Khovanov homology distinguishing torus and twist knots.
Two complete knot invariants from diagrams, finite or infinite.
problem Classifying knots completely.
method Constructed two invariants from knot diagrams, finite or infinite.
result Finite set reveals knotting number.
Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.
problem Determine grid homology of diagonal knots and compare them to other knot types.
method Use grid diagrams and combinatorial knot Floer homology to analyze diagonal knots.
result Grid homology detects the number of prime factors and decompositions of the knot into non-integer tangles.
New spectral sequences define knot invariants.
problem Understanding strongly invertible knots.
method Two spectral sequences in knot Floer homology.
result Numerical invariant defined for strongly invertible knots.
Polynomially parameterizes knots and spheres, proving analogous results.
problem Parameterizing knots and spheres using polynomials.
method Analogous to classical knots, parameterized long 2-knots and certain classes of knotted spheres.
result Polynomial parameterizations for knotted spheres constructed.
New infinite families of twisted torus knots found.
problem Identifying new types of twisted torus knots.
method Finding new infinite families of twisted torus knots with a single negative twist.
result Eight new infinite families of twisted torus knots are discovered.
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylinder knots: after dividing cylinder knots by possible rotational symmetries we obtain ribbon knots. We obtain an upper bound for the number of cylinder knots with two fixed parameters (out of three). In addition we prove …
Two-bridge ribbon knots have symmetric union presentations.
problem Characterizing two-bridge ribbon knots.
method Symmetric union presentations and partial knot analysis.
result Symmetric union presentations for various two-bridge ribbon knots.
This paper determines nonhyperbolicity conditions for P/P and P/SF knots.
problem Classifying hyperbolic P/P and P/SF knots.
method Providing necessary, sufficient, or equivalent conditions for nonhyperbolicity.
result Necessary, sufficient, or equivalent conditions for P/P or P/SF knots being nonhyperbolic.
Algorithm calculates knot Floer homology for a specific knot type.
problem Computing knot Floer homology for (1,1) knots. method Algorithm based on fundamental group of (1,1) knots. result Algorithm successfully computes knot Floer homology.
Researchers confirm a relation between knot invariants and provide formulas for torus knots.
problem Confirming a relation between knot invariants and providing formulas.
method Explicit formulas and algorithms for certain ADO-invariants of torus knots obtained from the series invariant of knot complements.
result Explicit formulas and algorithms for certain ADO-invariants of torus knots.
Rectangular mosaics extend virtual knot studies to larger polygons.
problem Studying virtual knots using mosaic techniques.
method Introduced rectangular mosaics, modified mosaic moves, and provided invariants.
result Developed algorithms for computing virtual knot invariants.