Constructs continuous analogues for binomial and Catalan numbers.
problem No specific problem stated; focuses on mathematical construction.
method Uses techniques from convex polytopes, lattice paths, and directed manifolds.
result Develops a continuous analogue for the binomial distribution.
Research connects geometric structures to knot theory and algebraic combinatorics.
problem Understanding the mixed Hodge structure on cohomology of open positroid varieties.
method Relates mixed Hodge structure to Khovanov-Rozansky homology of associated links.
result Rational q,t-Catalan numbers are derived from mixed Hodge polynomials of open positroid varieties. We propose an algebraic model of the conjectural triply graded homology of Gukov, Dunfield and Rasmussen for some torus knots. It turns out to be related to the q,t-Catalan numbers of Garsia and Haiman.
For a Lattice crossing L(m,n) we show which Catalan connection between 2(m+n) points on boundary of m×n rectangle P can be realized as a Kauffman state and we give an explicit formula for the number of such Catalan connections. For the case of a Catalan connection with no arc sta…
Geometrically realized polyhedra from directed trees, including associahedra.
problem Understanding the structure of associative algebras with co-inner products.
method Geometric realization of polyhedra using directed planar trees.
result These polyhedra, including associahedra, are homeomorphic to balls.
The article counts diagrams of vector fields without fixed points in a 2-disk.
problem Counting vector fields without fixed points in a 2-disk.
method Analytical and algorithmic approaches to find all diagrams.
result The number of diagrams with 2k exceptional points on the boundary equals a specific formula involving Catalan numbers.
Researchers found unique exact Lagrangian fillings for a specific type of knot.
problem Tackling the uniqueness of exact Lagrangian fillings for Legendrian (2,n) torus knots. method Computed augmentations induced by exact Lagrangian fillings to distinguish them.
result Identified that these exact Lagrangian fillings are pairwise non-isotopic.
Study on Gaussian ensemble of matrix products with mixed moments computed.
problem Understanding the statistical properties of matrix products of Gaussian matrices.
method Analysis of a multi-Wishart ensemble and enumeration of non-crossing pairings.
result Mixed moments of the product matrix are computed and found to be weighted by Fuss-Catalan numbers at large N. Paper finds coefficients of Catalan states using Θ_A-state expansion.
problem Finding coefficients of Catalan states of lattice crossings.
method Uses Θ_A-state expansion to express coefficients as a linear combination of other states.
result Shows that coefficients can be found using Θ_A-state expansion.
New recursion computes knot homology linking Catalan sequences.
problem Computing Khovanov-Rozansky homology for specific knot families.
method Simple recursion to compute homology, interpreting results in terms of Catalan combinatorics.
result Agrees with predictions from Hilbert schemes and rational DAHA, proving conjectures.
New method finds coefficients of Catalan states using plucking polynomials.
problem Finding coefficients of Catalan states in lattice crossings.
method Using plucking polynomials of rooted trees with delay functions.
result Coefficients of Catalan states are unimodal sequences.
Researchers found the minimum volume of a 3-cusped hyperbolic 3-manifold.
problem Finding the minimum volume of a 3-cusped orientable hyperbolic 3-manifold.
method Using guts in sutured and pared manifolds.
result The volume of a 3-cusped orientable hyperbolic 3-manifold is at least 5.49... = 6 × Catalan's constant.
The study analyzes when Bayesian averaging over decision trees is reliable.
problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.
New formulas derived for lattice crossing coefficients, improving computation efficiency.
problem Computing coefficients of Catalan states in lattice crossings.
method Using plucking polynomial and Θ_A-state expansion, deriving new properties and formulas.
result Coefficients of Catalan states factor under specific conditions, leading to more efficient computation.
The paper connects Legendrian links to cluster theory and exact Lagrangian fillings.
problem Understanding the relationship between Legendrian links and cluster theory.
method Using exact Lagrangian fillings and cluster theory, the paper establishes connections between Legendrian links and cluster varieties.
result The augmentation variety of certain Legendrian 2-bridge links is isomorphic to a product of cluster varieties.
Minimal covolume group found in hyperbolic 3-space.
problem Finding groups with minimal covolume in hyperbolic 3-space.
method Proved existence of a specific group with minimal covolume.
result Minimal covolume group found with covolume equal to Catalan's constant.
We conjecturally extract the triply graded Khovanov-Rozansky homology of the (m, n) torus knot from the unique finite dimensional simple representation of the rational DAHA of type A, rank n - 1, and central character m/n. The conjectural differentials of Gukov, Dunfield and the third author receive an explicit algebra…
New model for links uses meander diagrams and combinatorics.
problem Modeling and analyzing random links.
method Random meander model based on meander diagrams and graphs, proving properties using combinatorics.
result Trivial links are unlikely, and there's a lower bound on non-isotopic knots.
We prove that the Whitehead link complement and the (-2, 3, 8) pretzel link complement are the minimal volume orientable hyperbolic 3-manifolds with two cusps, with volume 3.66... = 4 x Catalan's constant. We use topological arguments to establish the existence of an essential surface which provides a lower bound on vo…
New combinatorial method connects knot invariants to reflection groups.
problem Computing knot invariants using combinatorial techniques.
method Relating dual braid group generators, Hecke images of pure braids, and reflection groups.
result The (a,z=0)-HOMFLYPT polynomial can be computed as a solution to factorization problems. Explicit BCH series radii found for special Banach-Malcev shift algebras.
problem Finding convergence radii for BCH series in specific algebraic structures.
method Established explicit convergence radii using continuity estimates and algebraic properties.
result Explicit formula for convergence radii derived and validated for various shift algebras.
Barcelona evaluates major events for economic and social impact.
problem Evaluating the economic and social impact of major events in Barcelona.
method Analyzes the economic and social dimensions of Barcelona's major events from 1888 to 2004.
result Develops a rational argument for communicating the economic benefits of major events.
Study on knot diagrams showing bridge number can differ from crossing number.
problem Incompatibility between crossing number and bridge number for knot diagrams.
method Defined and compared various bridge number computations for knot diagrams, studied minimizing diagrams, and constructed families of minimal crossing diagrams.
result Found examples where bridge number differs from crossing number, and demonstrated this difference can grow infinitely.
A new knot measure, the untwisting number, equals the algebraic unknotting number.
problem Measuring the minimum number of twists needed to untangle a knot.
method Defined and compared the untwisting number with the unknotting number.
result The algebraic untwisting number equals the algebraic unknotting number.
Straight numbers generalize Meander and OGC numbers for all knots.
problem Defining invariants for all knots based on Meander and OGC numbers.
method Generalized Meander and OGC numbers to all knots and proved their well-definedness.
result Straight numbers and contained straight numbers are well-defined for all knots.
Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.
problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.
The paper bounds the handle number of sutured manifolds using Morse-Novikov numbers and tunnel numbers.
problem Bounding the handle number of sutured manifolds.
method Developed bounds on the Morse-Novikov number of a link in terms of its tunnel number, and used these to bound the handle number of Heegaard splittings.
result The handle number function is bounded, constant on rays from the origin, and locally maximal.
New measure shows how links can be untangled as twists increase.
problem Understanding how links can be simplified through repeated twists.
method Introduced the stable unknotting number to analyze links in a twist family.
result The stable unknotting number depends only on the winding number of the link, not the wrapping number.
The study of trivializing number for positive knots.
problem Understanding the trivializing number of positive knots.
method Analysis of minimal diagrams and relation study with unknotting number.
result Results on the trivializing number of positive 2-bridge knots.
Wirtinger number equals virtual bridge number for virtual links.
problem Calculating the virtual bridge number of virtual links.
method Algorithmically computing the minimum number of generators of the link group.
result The Wirtinger number equals the virtual bridge number for virtual links.
The study provides bounds and necessary conditions for tunnel and cutting numbers of knots and handlebody-knots.
problem Determining bounds for tunnel and cutting numbers of knots and handlebody-knots.
method Using G-family of quandles colorings and constructing handlebody-knots.
result Lower bounds and necessary conditions for tunnel and cutting numbers of knots and handlebody-knots.
Study unlinking numbers of 10-crossing links using link invariants.
problem Investigate unlinking numbers of 10-crossing links.
method Use various link invariants and explore their behavior with crossing changes.
result Find the unlinking numbers of all but 2 of the 287 prime, non-split links with crossing number 10.
New number bounds knot complexity, including unknotting and crosscap numbers.
problem Bounding knot complexity and understanding knot types.
method Introducing an unknotting-type number to estimate crosscap number.
result Determines set of knots with crosscap number at most two.
New invariant refines Milnor's triple linking number, revealing more information for complex links.
problem Indeterminacy of Milnor's triple linking number in complex link configurations.
method Introduced a new invariant called the total triple linking number, refining Milnor's original.
result The total triple linking number is non-trivial for every (n≥6)-component link, providing more information than classical triple linking numbers. Paper shows that for torus knots, the pinch number equals the unoriented band unknotting number.
problem Determining the minimum number of band surgeries to unknot torus knots.
method Used the torsion order of unoriented knot Floer homology.
result Pinch number and unoriented band unknotting number coincide for torus knots.
The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.
problem Understanding the tunnel and bridge numbers of composite genus 2 spatial graphs.
method Analyzes connected sum and trivalent vertex sum operations on genus 2 spatial graphs, proving bounds for tunnel and bridge numbers.
result Sharp bounds for the tunnel number of composite genus 2 spatial graphs, including lower bounds for bridge numbers.
We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist infinitely many positive knots with any dealternating number (or any alternation…
The paper finds bounds and specific tile numbers for knot mosaics.
problem Determining the minimum number of tiles needed to represent knots.
method Analyzing the relationship between tile number and mosaic number of knots.
result Strict bounds and specific tile numbers for various knots are determined.
Delta-unlinking number measures how to unlink algebraically split links.
problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.
The paper explores different types of knot unknotting numbers using various local moves.
problem Investigating the unknotting numbers of knots using different local moves.
method Examined ribbon-move and pass-move on 2-knots and 1-knots, and high-dimensional-pass-move on high-dimensional knots.
result Found examples and bounds for various unknotting numbers associated with different local moves.
Study confirms a knot's crosscap number equals its splice-unknotting number for alternating knots.
problem Determining the crosscap number of alternating knots.
method Using a splice-unknotting number defined by Ito-Takimura, and computing through Gauss codes.
result Crosscap numbers of all prime alternating knots up to 13 crossings are computed.
Study on knot properties, showing relation between unknotting and crossing numbers.
problem Relations between unknotting and crossing numbers of spatial embeddings.
method Analyzes handcuff-graphs and theta curves, extends known results to handlebody-knots.
result Characterizes handlebody-knots satisfying the equality between unknotting and crossing numbers.
Odd crossing numbers and even rotation numbers for cycles in plane immersions.
problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.
Lower bound found for Perron-Frobenius degrees of certain complex numbers.
problem Finding lower bounds for the Perron-Frobenius degree of complex numbers.
method Using Doug Lind's idea, proving results for both cubic and biPerron numbers.
result Arbitrary large Perron-Frobenius degrees for certain complex numbers.
This paper calculates stick numbers for rail arcs and knot classes.
problem Calculating the minimum number of sticks needed for rail arcs and knot classes.
method Rail isotopies, ambient isotopies, winding number invariant, and lattice stick number.
result Calculates stick numbers for rail arcs and knot classes with crossing number at most 9.
The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…
Study computability of real numbers from group properties.
problem Computability of real numbers from group properties.
method Analyzing L2-Betti numbers and L2-torsion of groups. result Real numbers as L2-Betti numbers or L2-torsion are computable. We define the basket number, the flat plumbing number and the flat plumbing basket number of a link. Then we provide some upperbounds for these plumbing numbers by using Seifert's algorithm. We study the relation between these plumbing numbers and the genera of links.