The study examines topological surfaces using grid structures in Euclidean and hyperbolic spaces.
problem Understanding topological surfaces in geometric spaces.
method Using gridded surfaces in cubic honeycombs of Euclidean and hyperbolic spaces.
result Topological surfaces can be represented as gridded structures in these spaces.
New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.
problem Constructing explicit examples of triple grid diagrams for Lagrangian surfaces in CP^2.
method Elegant geometric construction reducing to linear algebra.
result Explicit construction of moduli space of triple grid diagrams.
The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.
problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2 under certain conditions. Computes elastic grids that approximate 3D surfaces without physical simulations.
problem Creating planar grids that fit complex 3D surfaces efficiently.
method Uses differential geometry to minimize bending energy and nestle to the surface.
result Elastic grids can approximate 3D surfaces without physical simulations.
We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…
A neural network method for financial data nowcasting.
problem Financial data nowcasting, especially with variable grid nodes.
method Neural network architecture for variable grid nodes data.
result Outperforms interpolation benchmarks and outlier detection.
We introduce elastic geodesic grids for easy-to-fabricate, deployable structures.
problem Approximating freeform surfaces with deployable structures.
method Geodesic curves on target surfaces, kinematic mechanism, differential geometry.
result Elastic geodesic grids can approximate freeform surfaces easily and deployably.
New method characterizes surface quadrilateral layouts as special immersions.
problem Characterize surface quadrilateral layouts mathematically.
method Characterizes quadrilateral layouts as special immersions of a cut representation of the surface into the Euclidean plane.
result Mathematically describes and generalizes integer grid maps.
New algorithm tackles high-dimensional simulation optimization, converging efficiently.
problem High-dimensional simulation optimization challenges.
method Sparse grid experimental design combined with kernel ridge regression using Brownian field kernel, followed by expected improvement strategy.
result Established upper bounds on convergence rate, demonstrating superior performance in practice.
Study of discrete Koenigs nets and their properties.
problem Characterization and properties of discrete Koenigs nets.
method Generalization of inscribed conics to inscribed quadrics and study of Koenigs d-grids.
result Established a bijection between Koenigs d-grids and pairs of discrete autoconjugate curves.
Deep learning improves climate models by capturing sub-grid processes efficiently.
problem Uncertainty in climate models due to sub-grid processes, especially clouds.
method Trained a deep neural network to represent atmospheric sub-grid processes in a climate model.
result The neural network accurately reproduces climate and variability features from a cloud-resolving model.
We propose a new static parameterization of the implied volatility surface which is constructed by using polynomials of sigmoid functions combined with some other terms. This parameterization is flexible enough to fit market implied volatilities which demonstrate smile or skew. An arbitrage-free calibration algorithm i…
Researchers found algorithms to construct toric mosaics and set upper bounds for their numbers.
problem Finding efficient methods to construct toric mosaics of torus knots.
method Developed two algorithms for constructing toric mosaics on the surface of a torus.
result Provided upper bounds for the toric mosaic number of torus knots.
Proposes a multi-level learning approach for 3D object recognition.
problem Improving 3D object recognition accuracy through multi-scale spatial features.
method End-to-end multi-level learning on a multi-level voxel grid.
result Comparable object recognition performance with lower memory usage.
The study constructs non-planar nets and webs on quadrics and Minkowski space.
problem Constructing non-planar nets and webs on quadrics and Minkowski space.
method Introducing canonical parametrisations, exploiting connections with classical deformations, and using Laguerre geometric notions.
result Existence and construction of octahedral grids and webs of surfaces.
Proposes a neural network for calibrating stochastic volatility models.
problem Calibrating stochastic volatility models with robustness and efficiency.
method Combines grid approach with pointwise two-stage calibration, using random grids for training.
result Validates the approach with empirical and Monte Carlo experiments for rough Bergomi and Heston models.
The study of tiling homology on flat surfaces, proving impossibility of certain tilings.
problem Proving the non-existence of polyomino tilings on specific square-tiled surfaces.
method Study of homology groups for topological tilings, using coloring proofs.
result Several results about the non-existence of polyomino tilings on certain square-tiled surfaces.
The paper introduces surfaces with constant solid angle for designing shell structures.
problem Designing shell structures with balanced structural, spatial, aesthetic, and construction requirements.
method Proposes surfaces defined by constant solid angle at all points, using Gauss-Bonnet theorem and Newton's method.
result Constant solid angle surfaces enable control over boundary slope and span-to-height ratio, making them structurally viable.
Researchers describe isometric deformations of T-hedra and T-surfaces.
problem Understanding the isometric deformations of discrete and smooth T-surfaces.
method Synthetic and analytic descriptions of T-hedra and T-surfaces, providing parametrizations of isometric deformations.
result Explicit parametrization of isometric deformations of T-hedra and T-surfaces.
Given a grid presentation of a knot (or link) K in the three-sphere, we describe a Heegaard diagram for the knot complement in which the Heegaard surface is a torus and all elementary domains are squares. Using this diagram, we obtain a purely combinatorial description of the knot Floer homology of K.
Classifies surfaces supporting alignable nets with geodesic and conjugate properties.
problem Classifying surfaces with specific geometric properties.
method Cartan's theory of moving frames, coordinate-free classification, explicit immersion formulas.
result Two classes of alignable Voss surfaces, each with two two-parameter families, including one with an isothermal-conjugate geodesic net.
Half grid diagrams prove every link can be represented by a special type of grid diagram.
problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.
Grid homology confirms the Upsilon invariant in knot theory.
problem Verifying the equivalence of Upsilon invariants in knot theory.
method Reconstructed Upsilon invariant using grid homology and proved equivalence.
result Upsilon invariants in knot Floer and grid homology are equivalent.
GridPyM handles grid diagrams for knot theory.
problem Handling grid diagrams for knot theory.
method Generates and simplifies grids, models local transformations.
result Models local transformations between grid diagrams.
The paper simulates Lévy processes and their extremum and hitting time.
problem Simulating Lévy processes and their extremum and hitting time accurately and efficiently.
method Using characteristic functions and conditional characteristic functions, with conformal deformations and precalculated values on multi-grids.
result Accurate and fast simulation of Lévy processes and their extremum and hitting time.
Grid homology theory for spatial graphs extends skein sequence.
problem No specific problem stated; focuses on extending a sequence.
method Defined grid homology theory for spatial graphs and extended skein sequence.
result Skein exact sequence extended to grid homology for spatial graphs.
New method finds grid diagrams for many fibered knots.
problem Detecting fibered knots using grid diagrams.
method Developed an efficient method to identify grid diagrams with unique maximal Alexander grading states.
result Found suitable grid diagrams for 5385 of 5397 fibered prime knots with crossing number ≤ 13.
Extends knot invariant to filtered grid complexes.
problem Knot invariants and grid complexes.
method Combining Ozsváth-Szabó-Stipsicz crossing-change maps with Alishahi-Eftekhary l(K) invariant.
result Combinatorial formulation of knot invariant.
Grid homology properties for MOY graphs studied.
problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.
Grid homology invariant proved for lens space links.
problem Proving combinatorial invariance of grid homology for lens space links.
method Combining combinatorial methods with sign assignments to prove invariance.
result Grid homology is a link invariant for lens space links.
A 3-parameter family of helical tubular surfaces obtained by screw revolving a circle provides a useful pedagogical example of how to study geodesics on a surface that admits a 1-parameter symmetry group, but is not as simple as a surface of revolution like the torus which it contains as a special case. It serves as a …
New trading strategy beats traditional grid in crypto markets.
problem Low expected return of traditional grid trading strategy.
method Dynamic Grid Trading (DGT) strategy that adapts to market conditions.
result DGT strategy outperforms traditional grid and buy-and-hold strategies.
Bordered Floer homology associates to a parametrized oriented surface a certain differential graded algebra. We study the properties of this algebra under splittings of the surface. To the circle we associate a differential graded 2-algebra, the nilCoxeter sequential 2-algebra, and to a surface with connected boundary …
Develops equivariant grid homology for strongly invertible knots.
problem Invariants of strongly invertible knots.
method Equivariant grid diagrams and mapping cones.
result Equivariant unknotting numbers and genus bounds.
Computes homology of an obstruction chain complex in grid homology.
problem Computing the homology of an obstruction chain complex in grid homology.
method Defined and computed the homology of the obstruction chain complex of the full grid.
result Results about the existence of sign assignments in grid homology.
Grid homology shows knot unknotting lower bound.
problem Knot unknotting number determination
method Grid homology analysis
result Torsion homology classes order bounds unknotting number
We solve surface Navier-Stokes using DEC and compare with vorticity-stream function.
problem Solving the surface Navier-Stokes equation numerically.
method Discrete exterior calculus (DEC) in space and semi-implicit time discretization.
result Second order convergence demonstrated in flat space discretization.
SKI accelerates GP inference with sparse grids to handle higher dimensions.
problem SKI scales poorly in high dimensions due to dense grid size.
method Sparse grids within SKI framework, novel matrix-vector multiplication algorithm.
result SKI can be scaled to higher dimensions while maintaining accuracy.
The paper develops algorithms to accurately identify power grid topology.
problem Identifying the exact topology of a power grid in real-time.
method Graphical model framework for topology estimation using voltage measurements.
result Exact extraction of operational topology is theoretically guaranteed for grid topologies without three-node cycles.
System detects power grid health using AI and machine learning.
problem Detecting and preventing power grid malfunctions.
method Artificial intelligence, machine learning, recurrent neural networks, SVM, LSTM.
result High accuracy in detecting grid health, scalable for complex architectures.
This paper improves image generation models using a multi-grid method.
problem Improving image generation models.
method A multi-grid method for learning energy-based generative ConvNet models.
result The multi-grid method outperforms traditional models.
Data-driven method estimates urban MV and LV grid topology using smart meter data.
problem Reliability issues in urban distribution grids due to distributed energy resources.
method Probabilistic graphical model with group lasso regularization.
result Highly accurate topology estimation in various grid configurations.
Combinatorial proof shows knot invariant in Lipshitz's grid homology.
problem Proving knot invariance in Lipshitz's grid homology.
method Purely combinatorial proof.
result Proves 'minus' version of Lipshitz's double-point enhanced grid homology is a knot invariant.
The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.
problem Understanding grid homology for spatial graphs with various types of edges.
method Developed grid homology for spatial graphs with cut edges and applied it to prove a Künneth formula for connected sums.
result A Künneth formula for knot Floer homology of connected sums is proven using grid homology.
Efficiently prices options in stochastic volatility models using sparse grids.
problem Option pricing in stochastic volatility models.
method Sparse grid high-order ADI scheme for second-order in time and fourth-order in space.
result Computational efficiency gains confirmed by numerical experiments.
Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.
problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
The paper analyzes how grid cells perform path integration and learns hexagon grid patterns.
problem Understanding how grid cells perform path integration calculations.
method Theoretical analysis of a general representation model of path integration by grid cells, identifying group representation and isotropic scaling conditions.
result The learned model of hexagon grid patterns is capable of accurate long distance path integration.