Classifies trees with strictly unimodal q-polynomials.
problem Classifying rooted trees with strictly unimodal q-polynomials.
method Classification based on plucking polynomials and criteria for trapezoidal shapes.
result Generalizes results on strict unimodality of q-binomial coefficients.
Reconstruct trapezoidal surfaces from point clouds.
problem Reconstructing trapezoidal surfaces from point clouds.
method Kinematic approach: find axis direction, polygonal path, and reconstruct surface.
result Reconstructs trapezoidal surfaces from point clouds.
Trapezoids uniquely identified by their Dirichlet Laplace spectrum.
problem Identifying trapezoids based on their spectral properties.
method Analyzing the Dirichlet Laplace spectrum of non-obtuse trapezoids.
result Non-obtuse trapezoids are uniquely determined by their Dirichlet Laplace spectrum.
New Jordan Floer homology shows every curve inscribes every isosceles trapezoid.
problem Understanding inscriptions of isosceles trapezoids in Jordan curves.
method Constructing a new Lagrangian Floer homology chain complex.
result Establishes new cases of non-smooth Jordan curves inscribing isosceles trapezoids.
The paper finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.
problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
Inverse spectral theory reveals shapes from sound.
problem Can the shape of a drum be determined by its sound?
method Inverse isospectral techniques applied to specific shapes.
result The regular n-gon can be uniquely determined by its eigenvalues.
Continuous curves inscribe isosceles trapezoids in complex plane.
problem Proving periodic curves inscribe isosceles trapezoids.
method Lagrangian intersection problem and convergence argument.
result Continuous curves inscribe trapezoids with any similarity type.
The abstract shows how embeddings inscribe trapezoids or map three points to a line, proving nonexistence of certain maps.
problem Proving the nonexistence of affinely 3-regular maps in infinitely many dimensions.
method Elementary proof using embeddings and nonsingular bilinear maps.
result Recovery of nonexistence results for affinely 3-regular maps without complex algebraic techniques.
Study on Fox's trapezoidal conjecture for specific alternating links.
problem Investigating Fox's trapezoidal conjecture for alternating links.
method Diagrammatic Murasugi sums, Alexander polynomial, and concordance analysis.
result Established inequalities and conditions for the Alexander polynomial and trapezoidal conjecture.
Alternative proof of Alexander polynomial trapezoid conjecture using dimers.
problem Alexander polynomial trapezoid conjecture for special alternating links.
method Dimer model approach to Alexander polynomial.
result Shorter and more accessible proof of Azarpendar, Juhász, and Kálmán's result.
New proof of trapezoidal property for Alexander polynomials of special alternating links.
problem Proving trapezoidal property of Alexander polynomials for special alternating links.
method Analyzing vector configurations from matroids and totally positive matrices.
result Alexander polynomials of special alternating links exhibit log-concavity and trapezoidal properties.
Optimal Reeb graphs identified for polygon decomposition.
problem Investigating the topological structure of planar polygon decomposition.
method Using oriented Reeb graphs with a marked vertex for height functions.
result Described all possible optimal Reeb graphs for specific polygon configurations.
Characterizes a specific type of alternating knot.
problem Identifying a special class of genus g alternating knots.
method Uses Ozsváth and Szabó's work on alternating knots.
result Shows that if the coefficients of Alexander polynomial satisfy a certain condition, the knot is a specific torus knot.
Study proves Alexander polynomials of certain 4-braid knots satisfy a conjecture and gives formulas for log-concave sequences.
problem Proving the Alexander polynomials of certain 4-braid knots satisfy Fox's Trapezoidal Conjecture.
method Analyzes families of alternating 4-braids and n-braids, providing explicit formulas and verifying log-concavity. result Explicit formulas for signature and first 4 coefficients of Alexander polynomials, showing log-concavity.
Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.
problem Alexander polynomial of plane graphs and unimodality of coefficients.
method Introduces clock moves for plane graphs and develops a spanning tree model of Alexander polynomial.
result Proves unimodal property of Alexander polynomial coefficients and confirms conjectures.
Fox's trapezoidal conjecture for four-strand Turk's head knots is proven.
problem Proving log-concavity of the coefficient sequence of Dn(z) for four-strand Turk's head knots. method Four-block smoothing theorem for products of reciprocal quartics.
result The coefficient sequence of Dn(z) is log-concave. The paper evaluates functions of stable Lévy processes and their extrema efficiently.
problem Efficiently evaluating functions of stable Lévy processes and their extrema.
method Integral representations, conformal acceleration technique, simplified trapezoid rule.
result Efficient numerical procedures for cumulative probability distribution functions (cpdfs) are developed.
New methods for Z-transform inversion and Wiener-Hopf factorization.
problem Efficient numerical inversion of Z-transforms and factorization of functions. method Sinh-deformations of contours, variable changes, and simplified trapezoid rule.
result High precision and speed in evaluating moments and constructing filters.
Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.
problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.
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.
TENP prunes experts and neurons in Mixture-of-Experts models for efficient deployment.
problem Efficient deployment of large language models constrained by static parameter footprint.
method Structured Trapezoidal ExpertNeuron Pruning (TENP) identifies and retains important experts and neurons.
result DeepSeek model achieves 10% better performance on code generation tasks with 40% expert sparsity.
Path integral method calculates barrier option prices.
problem Barrier option pricing in finance.
method Path integral method applied to trapezoid and square potential barriers.
result Analytical expressions for option pricing derived.
New approach improves computational efficiency of Bass Local Volatility model.
problem Eliminate interpolation and improve computational efficiency in local volatility models.
method Combines local quadratic estimation and lognormal mixture tails for state price densities; uses trapezoidal rule for numerical convolutions.
result Proposed method outperforms traditional numerical methods in option pricing and market case studies.
Proves a conjecture about knots and their invariants.
problem Relation between Alexander polynomial and signature invariant for two-bridge knots.
method Analyzes two-bridge knots using Fox's conjecture and signature invariant.
result Proves Hirasawa-Murasugi conjecture for two-bridge knots.
This paper provides algebraic descriptions for aperiodic monotilings.
problem Tackles the aperiodic monotilings introduced by Taylor and Socolar.
method Gives decoration-free algebraic descriptions and shows how monotilings can be derived from a single equation.
result Algebraic equations can describe aperiodic monotilings without needing decorations.
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.
Log-concave coefficient sequences for two-bridge knots proved.
problem Proving log-concavity of Alexander polynomial coefficient sequences for alternating knots.
method Introducing a polynomial Δ(t) associated to Christoffel words and proving its log-concavity. result Strong Fox conjecture for two-bridge knots proved.
We apply multilevel Monte Carlo for option pricing problems using exponential Lévy models with a uniform timestep discretisation to monitor the running maximum required for lookback and barrier options. The numerical results demonstrate the computational efficiency of this approach. We derive estimates of the convergen…
Study fibered alternating links using Coxeter transformations.
problem Understanding the Alexander polynomial and monodromy of fibered links.
method Alternating-sign Hopf plumbing and Coxeter transformations.
result Strong support for Hoste's conjecture and bi-orderability of link groups.
We consider Conway polynomials of two-bridge links as Euler continuant polynomials. As a consequence, we obtain new and elementary proofs of classical Murasugi's 1958 alternating theorem and Hartley's 1979 trapezoidal theorem. We give a modulo 2 congruence for links, which implies the classical Murasugi's 1971 congruen…
Paper simulates LR fuzzy intervals with interval-valued cores.
problem Generating random fuzzy intervals with interval-valued cores.
method Developed algorithms for simulating LR fuzzy numbers with interval-valued cores.
result Numerically efficient algorithm for simulating fuzzy values.
Hamiltonian method applied to floating barrier options pricing.
problem Pricing of floating barrier options.
method Hamiltonian approach in quantum mechanics applied to barrier options.
result Analytical expressions for pricing kernel and option price derived.
In this paper, we study open complete metric spaces with non-negative curvature. Among other things, we establish an extension of Perelman's soul theorem for possibly singular spaces: "Let X be a complete, non-compact, finite dimensional Alexandrov space with non-negative curvature. Suppose that X has no boundary and h…
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.
Geomstats introduces shape module for analyzing shapes of objects.
problem Analyzing shapes of objects represented as landmarks, curves, and surfaces.
method Implementing shape spaces, group actions, fiber bundles, quotient spaces, and Riemannian metrics.
result Users can compare, average, and interpolate shapes inside shape spaces.
A new shape space allows optimization of non-smooth shapes in fluid mechanics.
problem Optimizing non-smooth shapes in fluid mechanics.
method Constructing a product manifold to include piecewise-smooth shapes.
result Numerical results show applicability in minimizing viscous energy dissipation.
Introduces Star-Shaped deviation measures for risk analysis.
problem Risk measurement and analysis in finance.
method Characterizes Star-Shaped deviation measures through acceptance sets and convex deviation measures.
result Exposes the relationship between Star-Shaped risk measures and deviation measures.
Optimizes shapes in uncertain Navier-Stokes flow problems.
problem Optimizing shapes with geometric constraints and physical uncertainty.
method Multi-shape calculus and stochastic augmented Lagrangian method.
result Successfully optimized shapes in uncertain Navier-Stokes flow.
Defines a general shape space in manifold for shape analysis.
problem Vagueness in shape spaces for various shapes.
method General definition of shape space in manifold, LDDMM methods, Hamiltonian geodesic flow.
result Offers a rigorous framework for shape analysis.
New method reconstructs 3D shapes from 2D images using Kendall's shape space.
problem Reconstruct 3D shapes from 2D images, especially for rare specimens.
method Kendall's shape space approach with prior information.
result More robust and plausible shapes compared to previous methods.
Bayesian method classifies shapes in 2D and 3D.
problem Shape classification in 2D and 3D.
method Bayesian framework for modeling and classification.
result Efficiency and efficacy evaluated on Kimia database.
A novel method predicts shape development using Riemannian shape spaces.
problem Predicting future shape development from a single observation.
method Proposes a novel prediction method that encodes shapes in a Riemannian shape space and learns hierarchical statistical models.
result Outperforms deep learning-supported variants and state-of-the-art methods in predicting shape development.
The paper derives formulas for option pricing and random walk expectations.
problem Calculating the price of barrier and lookback options.
method Inverse Z-transform, Fourier/Laplace inversion, Wiener-Hopf factorization, and numerical methods.
result Efficient numerical methods for option pricing are developed.
This paper tackles shape denoising in computer vision and medical imaging.
problem Handling shapes with missing pieces or outliers in shape modeling.
method Introduces six types of noise and an objective measure for shape denoising.
result Evaluates seven shape denoising methods, six of which are based on deep learning.
Generative model disentangles 3D shapes into independent factors.
problem Learning rich representations of deformable 3D shapes.
method Supervised 3D mesh-convolutional Variational AutoEncoder with latent feature disentanglement.
result Explicit disentanglement of latent factors improves shape generation and downstream tasks.
Local deformation factors for 3D shapes improve flexibility and interpretability.
problem Global support of shape deformation factors limits flexibility and interpretability.
method Graph-based structured matrix factorisation with sparsity and graph-based regularisation.
result Local support deformation factors outperform global ones in generalisation and shape reconstruction.
Paper analyzes shapes of brain arterial networks using statistical methods.
problem Quantifying and comparing shapes of brain arterial networks.
method Mathematical representation of BAN shapes as elastic shape graphs, development of Riemannian metrics and geometrical tools.
result Age has a clear, quantifiable effect on BAN shapes, with increased variance in shapes as age increases.
Develops new shape metrics for high-dimensional objects.
problem Lack of single metrics to describe shape in high dimensions.
method Introduces hyper-Sphericity and hyper-Shape Proportion metrics.
result Discriminates between different shapes in high dimensions.