Researchers create minimal surfaces with Scherk ends and find catenoid limits.
problem Constructing minimal surfaces with specific end types and understanding their limits.
method Constructing families of embedded, singly periodic minimal surfaces with Scherk-type ends and analyzing their limits.
result The limit of the constructed surfaces are catenoid necks connecting planes, determined by Stieltjes polynomials.
The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.
problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.
Efficient methods for Lévy models using SINH-regular processes.
problem Efficient numerical methods for evaluating Lévy models.
method Defining SL-processes and sSL-processes, deriving properties of characteristic exponent, and showing all popular Lévy processes can be subordinated to Brownian motion.
result All crucial properties of characteristic exponent are consequences of a specific representation, and all popular Lévy processes are SL- or sSL-subordinated Brownian motion.
Paper defines quasi-Strebel structures for meromorphic k-differentials and proves their existence.
problem Existence of quasi-Strebel structures for meromorphic k-differentials.
method Introduced quasi-Strebel structures and proved their existence for meromorphic k-differentials.
result Every differential of even order k > 2 satisfying certain conditions admits a quasi-Strebel structure.
Active graph-based semi-supervised learning (AG-SSL) aims to select a small set of labeled examples and utilize their graph-based relation to other unlabeled examples to aid in machine learning tasks. It is also closely related to the sampling theory in graph signal processing. In this paper, we revisit the original fo…
We show that a trader, who starts with no initial wealth and is not allowed to borrow money or short sell assets, is theoretically able to attain positive wealth by continuous trading, provided that she has perfect foresight of future asset prices, given by a continuous semimartingale. Such an arbitrage strategy can be…
Study shows deterministic equivalent for neural network kernel convergence.
problem Understanding convergence of neural network kernels.
method Analyzes empirical spectral distribution of Conjugate Kernel, proving convergence to a deterministic limit.
result Obtains a deterministic equivalent for the Stieltjes transform and resolvent of the Conjugate Kernel.
New efficient method for inverse Z-transform reduces complexity significantly.
problem Efficient numerical realization of inverse Z-transform for large n.
method Derives sufficient conditions for new scheme, applies to option pricing.
result Significant reduction in complexity for large n, especially for European options.
Both analytic and geometric forms of an optimal monotone principle for Lp-integral of the Green function of a simply-connected planar domain Ω with rectifiable simple curve as boundary are established through a sharp one-dimensional power integral estimate of Riemann-Stieltjes type and the Huber analytic and geome…
Develops a new method to compute risk-sharing allocations using Laplace transforms.
problem Complex integrals in computing conditional mean risk-sharing allocations.
method Uses Laplace-Stieltjes transforms to compute risk-sharing allocations from joint transforms.
result Provides closed-form or semi-analytic solutions for a broad class of distributions.
The paper proves local laws for non-separable sample covariance matrices.
problem Analyzing non-separable sample covariance matrices with dependent or nonlinearly transformed data.
method Tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.
result Optimal averaged local law and full anisotropic local law for non-separable sample covariance matrices.
New method extrapolates spectral densities from smaller models to larger ones.
problem Limited practical computations for large machine learning models.
method Algebraic spectral curve theory for free decompression.
result Framework enables extrapolation of spectral densities with multiple or multi-modal bulks.
Estimates KRR risk from training data for various kernels and hyperparameters.
problem Predicting the generalization error of Kernel Ridge Regression.
method Introduces SCT and KARE to approximate KRR risk from training data.
result KARE provides an excellent approximation of KRR risk and helps select good kernels.
Study spectral density of neural networks using resolvent method.
problem Investigate spectral density of neural networks with random feature matrices.
method Use resolvent method from random matrix theory, cumulant expansion.
result Impossible to preserve singular value distribution with additive bias.
In 1948 Feynman introduced functional integration. Long ago the problematic aspect of measures in the space of fields was overcome with the introduction of volume elements in Probability Space, leading to stochastic formulations. More recently Cartier and DeWitt-Morette focused on the definition of a proper integration…
New F-polynomial distinguishes knotoid diagrams not previously possible.
problem Polynomial invariants for knotoids.
method Introduced F-polynomial and constructed distinguishing examples. result New invariant F distinguishes knotoids not previously possible. Derives integral representations for a Lévy process and its extremum, hitting time, with fast evaluation.
problem Efficiently evaluating the joint probability density function of a Lévy process, its supremum, and hitting time.
method Integral representations, Laplace-Fourier transforms, summation by parts, conformal deformation, trapezoid rules, Gaver-Wynn-Rho algorithm.
result Explicit calculations and fast evaluation of the joint cpdf for Lévy processes.
The paper studies polynomials and ideals from colored Jones polynomials for links.
problem Understanding the structure of colored Jones polynomials for links.
method Investigates commutative and noncommutative ideals derived from colored Jones polynomials.
result Formulates the link version of the AJ conjecture.
Paper constructs a new approach to extract Affine Index Polynomial from Sawollek Polynomial.
problem Examining relationships between Affine Index Polynomial and Sawollek Polynomial.
method New approach to extract Affine Index Polynomial from Sawollek Polynomial.
result Constructs a concise proof of Mellor's Theorem.
This paper studies the Riley polynomial of 2-bridge knots using Chebyshev polynomials.
problem Understanding the Riley polynomial of 2-bridge knots and its splitting property.
method Introducing ε-Chebyshev polynomials to express and split the Riley polynomial.
result Explicit formula for the splitting polynomial as ε-Chebyshev polynomials.
Novel knot polynomials from Gaussian calculus show half vanish and determine Jones polynomials.
problem Understanding and characterizing knot polynomials from Gaussian calculus.
method Gaussian calculus of generating series for noncommutative algebras, connected sum of knots.
result Half of the polynomials vanish and three polynomials are explicitly given.
The paper defines and classifies Cappell-Shaneson polynomials.
problem Characterizing Cappell-Shaneson polynomials.
method Algebraic conditions on polynomials, reduction modulo primes, and construction of infinite series.
result Complete lists of Cappell-Shaneson polynomials of degrees 4 and 5, and several infinite series of degree 6.
Developed algorithms to compute three polynomial invariants of veering triangulations.
problem Computing polynomial invariants of veering triangulations.
method Introduced and used algorithms for taut, veering, and Teichmüller polynomials based on upper and lower tracks of veering triangulations.
result Proved that the lower and upper taut polynomials are equal but the veering polynomials can differ.
Study links weaving knots with polynomial coefficients and lattice numbers.
problem Understanding polynomial coefficients of weaving knots and their lattice counterparts.
method Established relationships between Jones and Chebyshev polynomials, and derived explicit formulas for Alexander polynomials.
result Proved coefficients of Jones polynomial are Whitney numbers of Lucas lattices and satisfied Fox's trapezoidal conjecture.
Study revisits Alexander-Conway and Kauffman bracket polynomials for pretzel links.
problem Understanding polynomial invariants of pretzel links.
method Revisits Alexander-Conway and Kauffman bracket polynomials for pretzel links P(1,1,n). result Reveals properties of Alexander-Conway and Kauffman bracket polynomials for P(1,1,n). Paper connects AJ conjecture and colored Jones polynomial potential function.
problem Relationship between A-polynomial and colored Jones polynomial. method Connects AJ conjecture and colored Jones polynomial potential function.
result Establishes connection between A-polynomial and colored Jones polynomial potential function. Associated with each oriented link is the two variable Homflypt polynomial. The Morton-Franks-Williams (MFW) inequality gives rise to an expression for the Homflypt polynomial with MFW coefficient polynomials. These MFW coefficient polynomials are labelled in a braid-dependent manner and may be zero, but display a numb…
This paper investigates the equivalence between Yamada polynomial and Jones polynomial of associated links for brunnian θ-curves.
problem Understanding the relationship between Yamada polynomial and Jones polynomial for θ-curves.
method Investigates the equivalence between the normalized Yamada polynomial of θ-curves and the Jones polynomial of their associated links.
result Shows that the two polynomials are equivalent for brunnian θ-curves.
The taut polynomial equals a twisted Alexander polynomial.
problem Understanding the relationship between taut polynomials and Alexander polynomials.
method Defined taut polynomial of veering triangulations and proved it equals a twisted Alexander polynomial.
result The taut polynomial equals a twisted Alexander polynomial of the underlying manifold.
Quantum polynomials are derived from a specific tribracket structure.
problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.
We classify rooted trees which have strictly unimodal q-polynomials (plucking polynomial). We also give criteria for a trapezoidal shape of a plucking polynomial. We generalize results of Pak and Panova on strict unimodality of q-binomial coefficients. We discuss which polynomials can be realized as plucking polynomial…
New polynomials detect non-rotatable knotoid shapes.
problem Detecting non-rotatable knotoid shapes.
method Defined homotopy index polynomials for knotoids.
result Homotopy polynomials detect non-rotatable spherical knotoids.
Innovates polynomial invariant for tribrackets.
problem Counting and distinguishing knots and links.
method Introduces subtribracket polynomials and uses them to enhance counting.
result Enhanced counting invariant for knots and links.
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.
Unified ADO and colored Jones polynomials for knots.
problem Determining ADO polynomials from colored Jones polynomials.
method Constructing a two-variable knot invariant using completions of rings and algebra.
result Unified invariant maps colored Jones polynomials to ADO polynomials.
Generalized quandle polynomial used for stuquandles, stuck links, and RNA folding.
problem Defining polynomial invariants for stuquandles, stuck links, and RNA foldings.
method Introduced a generalized quandle polynomial and proved its invariance for stuquandles. Used this invariant to define polynomials for stuck links and RNA foldings.
result Polynomial invariants for stuquandles, stuck links, and RNA foldings.
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.
We study rack polynomials and the link invariants they define. We show that constant action racks are classified by their generalized rack polynomials and show that nsata-quandles are not classified by their generalized quandle polynomials. We use subrack polynomials to define enhanced rack counting invariants, gen…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of the odd writhe polynomial defined by the first author. The relation between this…
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.
Jones polynomials derived from K-theory of a cluster algebra.
problem Jones polynomials of knots and links.
method K-theory of a cluster C*-algebra of the sphere with two cusps.
result Interplay between Chebyshev and Jones polynomials.
We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial. Along the way we also calculate the Kauffman bracket skein module of all 2-brid…
The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to signed bipartite graphs, and we show that, in the planar case, it is equal to a par…
New skein theory for Links-Gould polynomial simplifies link evaluations.
problem Computing Links-Gould polynomial for oriented links.
method Developed a cubic braid-type skein theory.
result Skein theory can evaluate any oriented link.
Prime knots of genus one admitting diagram with at most five classical crossings were classified by Akimova and Matveev in 2014. In 2018 Kaur, Prabhakar and Vesnin introduced families of L-polynomials and F-polynomials for virtual knots which are generalizations of affine index polynomial. Here we introduce a notion of…
Jones polynomials have infinitely many roots of unity as zeros.
problem Finding roots of unity as zeros of Jones polynomials.
method Constructing families of prime knots with specific Jones polynomials.
result Infinitely many roots of unity are zeros of some Jones polynomials.
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…
Study connects group invariants through outer automorphisms and polynomial relations.
problem Understanding polynomial invariants of free-by-cyclic groups.
method Introducing orientable fully irreducible outer automorphisms to relate McMullen polynomial and Alexander polynomial.
result Characterization of when homological stretch factor equals geometric stretch factor.