Conjectures closed-form expressions and cyclotomic expansions for knot invariants.
problem Calculating HOMFLY-PT invariants of knots colored by rectangular diagrams.
method Interpolation Macdonald polynomials and cyclotomic expansions.
result Conjectured closed-form expressions and cyclotomic expansions for knot invariants.
Method extends factorization to non-rectangular representations, revealing part of the Racah matrix.
problem Factorization of HOMFLY-PT polynomials for non-rectangular representations.
method Extending the differential expansion factorization from rectangular to non-rectangular representations.
result Extracted part of the Racah matrix for non-rectangular representations.
New formula calculates knot polynomials for rectangular representations.
problem Calculating knot polynomials for arbitrary rectangular representations.
method Rewrote differential expansion formula for HOMFLY polynomials, using quantum dimensions of symmetric representations.
result Rectangular superpolynomials are positive Laurent polynomials.
New formula for twist knots using skew Schur polynomials.
problem Understanding and generalizing knot polynomials for twist knots.
method Reformulated prescription for twist knots in double-column representations using skew Schur polynomials.
result Mysterious shift from standard topological locus complicates generalization.
New formula simplifies evolution of twist knots and calculates Racah matrices for rectangular representations.
problem Simplifying evolution of twist knots and calculating Racah matrices for rectangular representations.
method Developed a universal formula for triangular evolution matrix B applicable to rectangular representations R=[rs]. Used skew characters and Macdonald polynomials. result Explicit knowledge of twist-family evolution leads to a nearly explicit answer for Racah matrix Sˉ in arbitrary rectangular representation R. Researchers extend knot theory formulas to non-rectangular cases.
problem Applying universal-matrix precursor formulas to non-rectangular knot representations.
method Reformulated previously known formulas for simplest non-rectangular representations [r,1].
result Demonstrated drastic simplification of formulas after reformulation.
Paper computes braid monodromy for special curves using a new method.
problem Computing invariants of completely reducible n-gonal curves. method Rectangular braid diagram method and Burau representations.
result Alexander polynomial of curve complements computed successfully.
The study describes a cell structure for multisets in a rectangle.
problem Understanding the space of multisets in a rectangle.
method Developed a piecewise Euclidean bi-simplicial cell structure.
result Connected to spaces of complex polynomials and permutahedra.
Many knots and links in S^3 can be drawn as gluing of three manifolds with one or more four-punctured S^2 boundaries. We call these knot diagrams as double fat graphs whose invariants involve only the knowledge of the fusion and the braiding matrices of four-strand braids. Incorporating the properties of four-point con…
Continuing the quest for exclusive Racah matrices, which are needed for evaluation of colored arborescent-knot polynomials in Chern-Simons theory, we suggest to extract them from a new kind of a double-evolution -- that of the antiparallel double-braids, which is a simple two-parametric family of two-bridge knots, gene…
New findings on knot polynomials for specific representations.
problem Understanding HOMFLY polynomials for twist knots and their representations.
method Differential expansion of HOMFLY polynomials for twist knots and analysis of Racah matrices.
result Deviation of a specific coefficient from skew dimension in R=[333] representation.
KNTZ trick simplifies knot polynomial calculations for twist knots.
problem Completing the structure of differential expansion for twist knots.
method Converting arborescent evolution matrix into triangular form.
result Conjecture for triangular matrix B in non-rectangular case. Rectangular diagrams help analyze foliations in 3-sphere.
problem Analyzing foliations in 3-sphere complements.
method Introduced rectangular diagrams for foliations and links.
result Any co-orientable finite depth foliation can be presented by a compatible rectangular diagram.
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…
The paper studies geometric structures of polynomial spaces.
problem Understanding the geometric and combinatorial structures of polynomial spaces.
method Introducing and analyzing finite piecewise Euclidean cell complexes.
result The branched rectangle and annulus complexes are homeomorphic to specific polynomial spaces.
We study the structural properties of colored Kauffman homologies of knots. Quadruple-gradings play an essential role in revealing the differential structure of colored Kauffman homology. Using the differential structure, the Kauffman homologies carrying the symmetric tensor products of the vector representation for th…
Improved bounds for knot crossings in different mosaic patterns.
problem Finding tighter bounds for knot crossings in rectangular and hexagonal mosaics.
method Extended Howard and Kobin's proof to hexagonal mosaics and shortened the rectangular proof.
result New bounds for hexagonal mosaics with improved efficiency in rectangular mosaics.
New proof for symmetric spaces with rectangular lattices.
problem Characterizing symmetric spaces with rectangular unit lattices.
method Explicit construction of isometric embeddings and analysis of root systems.
result Symmetric spaces with rectangular unit lattices are symmetric R-spaces.
Rectangular peg problem solved for many curves.
problem Rectangular peg problem for continuous Jordan curves.
method Microlocal sheaf theory and recent work of Greene and Lobb.
result Affirmative answer for a large class of rectifiable curves.
Proves a theorem for comparing surfaces in 3D space.
problem Comparing isotopy classes of compact surfaces in 3-sphere.
method Uses rectangular diagrams to formalize and compare surfaces.
result Proves a Reidemeister type theorem for rectangular diagrams of surfaces.
If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need…
Paper studies S-rectangular DR-RL models for robust reinforcement learning with near-optimal sample complexity.
problem Addressing distributional discrepancies in reinforcement learning environments.
method Empirical value iteration algorithm for divergence-based S-rectangular DR-RL models.
result Near-optimal sample complexity bound of O(∣S∣∣A∣(1−γ)−4ε−2). In this paper Legendrian graphs in (R3,ξst) are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…
Given an oriented link in the 3-sphere, the Euler characteristic of its link Floer homology is known to coincide with its multivariate Alexander polynomial, an invariant only defined up to a sign and powers of the variables. In this paper, we get rid of this ambiguity by proving that this Euler characteristic is equal …
We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on S3 and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in p…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
problem Improving inequalities for link diagrams and understanding their properties.
method Introducing weak rectangular diagrams and proving new inequalities.
result Generalizes and subsumes many known inequalities related to multi-crossing numbers.
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.
Study reveals 1/f noise in signals made from nonoverlapping rectangular pulses.
problem Analyzing 1/f noise in signals composed of nonoverlapping pulses. method Derived a general formula for power spectral density, analyzed rectangular pulse case.
result Observed pure 1/f noise until very low frequencies with long pulse durations. If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an up…
A correspondence is studied by H. Matsuda between front projections of Legendrian links in the standard contact structure for 3-space and rectangular diagrams. In this paper, we introduce braided rectangular diagrams, and study a relationship with Legendrian links in the standard contact structure for 3-space. We show …
Rectangular Bounding Process (RBP) improves partitioning efficiency in multi-dimensional spaces.
problem Creating many unnecessary divisions in sparse regions when describing dense regions.
method Introduces Rectangular Bounding Process (RBP) to efficiently partition multi-dimensional spaces using a bounding strategy.
result The RBP is self-consistent and can be extended to infinite space, offering rich yet parsimonious expressiveness.
New geometric object for polynomials simplifies complex data.
problem Understanding the combinatorial and geometric properties of polynomials.
method Introducing a compact planar 2-complex for polynomials with distinct roots.
result Extracts combinatorial data from a geometric structure of polynomials.
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for appro…
New framework for higher-order singular-value derivatives of rectangular matrices.
problem Challenging to derive higher-order Fréchet derivatives of singular values in real rectangular matrices.
method Using Kato's analytic perturbation theory for self-adjoint operators and embedding rectangular matrices into block self-adjoint operators.
result Closed-form expressions for the n-th order spectral variations of singular values. The paper finds new constrained Willmore minimizers for non-rectangular tori.
problem Finding constrained Willmore minimizers for non-rectangular tori.
method Analyzing immersed tori in 3-space to minimize Willmore energy.
result The candidates constructed in previous work are constrained Willmore minimizers in certain non-rectangular conformal classes.
New transformations preserve link isotopy, showing complexity differences.
problem Link isotopy preservation with complexity differences.
method Introducing multiflypes of rectangular diagrams of links.
result Two diagrams of same complexity not related by simpler moves.
Paper studies robust MDPs, improving sample complexity and asymptotic performance.
problem Optimal robust policy and value function in robust MDPs with generative models.
method Improves prior results on non-asymptotic and asymptotic performances of robust MDPs, considering various uncertainty sets.
result Improved sample complexity and asymptotic normality of optimal robust value function.
Study inequalities for singular values of rectangular matrices.
problem Inequalities for singular values of rectangular matrices.
method Study convex cones associated to isotropic representations of symmetric spaces.
result Describe inequalities by cohomological conditions.
Deep learning classifies knots using rectangular diagrams.
problem Recognizing and distinguishing knots, especially the unknot.
method Represent knots as rectangular Dynnikov diagrams and use neural networks to classify them.
result Neural networks can effectively distinguish knots from each other.
Analyzes the differential expansion of knot polynomials, focusing on its applicability and modifications.
problem Understanding the differential expansion of colored knot polynomials, especially for non-trivial knots and those with defects.
method Examines the current status of differential expansion, analyzes its applicability to non-trivial knots, and introduces a new transformation.
result A new transformation V that converts Z to standard Z-factors and allows for the calculation of F. In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the monotonic simplification theorem for the unknot is given. It is shown that a mi…
Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.
problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.
The paper proves that any smooth curve can have two similar inscribed rectangles.
problem Finding two similar inscribed rectangles in a smooth Jordan curve.
method Lagrangian Floer homology and differential topological computation.
result Generic doubling of inscribed rectangles in smooth Jordan curves.
Square Clifford torus uniquely determined by isoperimetric ratio, rectangular torus not.
problem Uniqueness of 3D shape of rectangular Clifford torus based on isoperimetric ratio.
method Closed-form formulas for isoperimetric ratio of stereographic projection, strict monotonicity.
result Isoperimetric ratio does not uniquely determine rectangular Clifford torus shape.
Improved gradient descent for rectangular matrix completion without ℓ2,∞ regularization.
problem Nonconvex rectangular matrix completion without ℓ2,∞ regularization. method Gradient Descent without ℓ2,∞ regularization. result Improved sampling rate from O(poly(κ)μ3r3log3n/n) to O(μ2r2κ14logn/n). Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…
New method distinguishes Legendrian knots using surface diagrams.
problem Distinguishing Legendrian knots in 3-sphere.
method Rectangular diagrams and moves to transform presentations of isotopic surfaces.
result Two Legendrian knots of topological type 62 are not equivalent. Minimal submanifolds in matrix spaces proven for specific ranks.
problem Minimal submanifolds in matrix spaces.
method Proving semialgebraic sets of matrices are minimal.
result Rectangular, skew-symmetric, and symmetric matrices with prescribed eigenvalues are minimal.