Generative neural samplers estimate quantum spin system properties.
problem Estimating observables for quantum spin systems.
method Autoregressive models using Suzuki-Trotter transformation.
result Results for energy, specific heat, and susceptibility are in good agreement with Monte Carlo methods.
Study of surface defects in gauge theories leads to duality and separation of variables.
problem Understanding surface observables and their transitions in gauge theories.
method Utilized Fourier transformations and spectral problems to derive dualities and separation of variables.
result Exact duality between spectral problems of spin chains and Gaudin models.
New equations describe surfaces with constant curvature.
problem Characterizing and classifying third-order evolution systems for pseudospherical and spherical surfaces.
method Integrability conditions of g-valued linear problems, with g=sl(2,R) or g=su(2). result Characterization and classification of systems, including new families of coupled KdV and mKdV-type equations.
Study para-CR structures relaxing complex conjugation constraint, finding homogeneous models.
problem Para-CR structures with relaxed complex conjugation constraint.
method Cartan's method of equivalence, PDEs analysis, homogeneous models determination.
result Determined all concerned homogeneous models and their symmetries.
We completely describe Wahlquist-Estabrook prolongation structures (coverings) dependent on u, u_x, u_{xx}, u_{xxx} for the Krichever-Novikov equation u_t=u_{xxx}-3u_{xx}^2/(2u_x)+p(u)/u_x+au_x in the case when the polynomial p(u)=4u^3-g_2u-g_3 has distinct roots. We prove that there is a universal prolongation algebra…
Non-trivial conservation law found for a specific system.
problem Conservation law for a specific system with a vanishing characteristic.
method Analyzing overdetermined system with given characteristics.
result Non-trivial conservation law despite vanishing characteristic.
Study shows the second fundamental form of pseudospherical surfaces is universal and not dependent on specific solutions.
problem Dependence of the second fundamental form in local isometric immersions of pseudospherical surfaces.
method Analysis of third order differential equations and jets of finite order.
result The second fundamental form of pseudospherical surfaces is universal and not dependent on the specific solution.
In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, it is the minimal number k such that there are k different motion planning rules,…
In this paper we show that if one writes down the structure equations for the evolution of a curve embedded in an (n)-dimensional Riemannian manifold with constant curvature this leads to a symplectic, a Hamiltonian and an hereditary operator. This gives us a natural connection between finite dimensional geometry, infi…
Third-order PDEs describe spherical and pseudospherical surfaces.
problem Equations for spherical and pseudospherical surfaces.
method Classification of third-order PDEs using compatibility conditions and linear problems.
result Explicit classification of equations describing spherical and pseudospherical surfaces.
Study finds on-chain data can proxy off-chain cryptocurrency pricing.
problem Develop methods to proxy off-chain cryptocurrency pricing using on-chain data.
method Graphical models, mutual information, and ensemble machine learning.
result A significant amount of pricing information is contained in on-chain data, but precise prices are hard to recover except on short time scales.
The study connects monopole chains to Higgs bundles and classifies symmetric chains.
problem Classifying symmetric monopole chains invariant under cyclic actions.
method Formulation of a correspondence between monopole chains and spectral data, using the Nahm transform.
result Classification of symmetric monopole chains of charge k.
New proof of chain duality for simplicial complexes.
problem Proving the existence of chain duality for chain complexes over simplicial complexes.
method Geometric and conceptual treatment of chain duality.
result Fundamental for Ranicki's surgery exact sequence.
Improves multi-label classification with a new network model.
problem Improving multi-label classification accuracy.
method Introduces Classifier Chain Network (CCN) for multi-label classification.
result CCN outperforms benchmark methods in simulations and real data.
Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.
problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…
We introduce some chain maps between Khovanov complexes. Each of the chain maps commutes with a chain homotopy map and a retraction maps which obtain a Reidemeister invariance of Khovanov homology.
Paper proposes an adaptive modeling approach for row-type dependent predictive analysis in banking.
problem Accurate prediction of diverse row types within a single dataset.
method Adaptive modeling approach, tailored data pre-processing, feature engineering, traditional and ensemble machine learning models.
result All predictive approaches achieve a precision rate of no less than 90% for different row types.
Mack's estimator improves chain ladder prediction for large exposure insurance models.
problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.
Polynomial invariants classify molecular chains based on their contact arrangements.
problem No established invariants for molecular chains with both hard and soft contacts.
method Developed polynomial invariants for circuit topology of molecular chains.
result Polynomial invariants efficiently classify chains with various contact types.
Unified Morse-Bott-Smale chain complex, resolves well-definedness issue.
problem Well-definedness of Morse-Bott-Smale chain complex.
method Unified five degeneracy relations into a single condition.
result Quasi-isomorphic to Morse-Smale-Witten chain complex, alternative proof of Morse Homology Theorem.
This study aims to improve communication between fragmented blockchain systems in finance.
problem Inefficient and insecure communication in fragmented blockchain systems.
method Analysis of cross-chain interoperability protocols and their properties.
result Comparison and evaluation of cross-chain interoperability protocols.
We analyze a new Markov chain model for better sampling and optimization.
problem Developing a new Markov chain model for improved sampling and optimization.
method We introduce a new class of Ito chains with arbitrary noise and inexact drift/diffusion coefficients, proving a bound in W2-distance. result Our analysis provides improved or first results for various applications like SGLD, sampling, and boosting.
This work improves generalisation bounds using chaining and information theory.
problem Improving generalisation bounds for supervised learning algorithms.
method Developed a theoretical framework linking generalisation bounds to their chained counterparts, derived new bounds using Wasserstein distance.
result Chained generalisation bounds can be tighter than standard bounds, especially for concentrated hypothesis distributions.
The aim of this paper is to define a chain level refinement of the Batalin-Vilkovisky (BV) algebra structure on the homology of the free loop space of a closed, oriented C∞-manifold. For this purpose, we define a (nonsymmetric) cyclic dg operad which consists of "de Rham chains" of free loops with marked points…
Study on identifying AMP chain graph models under known and unknown component decompositions.
problem Identifying AMP chain graph models with known and unknown chain component decompositions.
method Analyzes conditions for identifiability of AMP models and proposes algorithms for structure recovery.
result Conditions for DAG identifiability in AMP models extend equal variance criteria for Bayes nets.
No hyperbolic group can have an infinite chain of free subgroups of fixed rank.
problem Infinite ascending chains of free subgroups in hyperbolic groups.
method Proof by contradiction and properties of hyperbolic groups.
result Hyperbolic groups do not contain strictly ascending chains of free quasiconvex subgroups of constant rank.
Enhanced coloring invariant distinguishes folded molecular chain topologies.
problem Apparent indistinguishability of folded chain topologies using current coloring invariants.
method Introduced Boltzmann weights to improve the resolving power of quandle colorings.
result Improved resolution in distinguishing folded chain topologies.
The paper provides concentration inequalities for Markov chain variance estimators.
problem Estimating the variance of Markov chains with concentration properties.
method Martingale decomposition method for uniformly geometrically ergodic Markov chains.
result Explicit control of the p-th moment of the OBM estimator difference and dependence on p and mixing time.
A new method simulates a lazy version of a Markov chain for empirical inference.
problem Estimating and testing unknown Markov chains with limited data.
method Simulates an α-lazy version of an unknown Markov chain, making it ergodic.
result The pseudo spectral gap can be applied to non-ergodic Markov chains.
The study provides bounds for geodesic diameter in Euclidean space.
problem Finding bounds for geodesic diameter in Euclidean space.
method Develops a geometric approach using locally rectifiable chains and complete normed commutative group bundles.
result Provides a new method for calculating geodesic diameter bounds.
We study the problem of learning the transition matrices of a set of Markov chains from a single stream of observations on each chain. We assume that the Markov chains are ergodic but otherwise unknown. The learner can sample Markov chains sequentially to observe their states. The goal of the learner is to sequentially…
In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…
Generic groups satisfy a chain condition for subgroups.
problem Understanding subgroup structures in generic groups.
method Proving for fixed integers m,t,k in generic m-generator t-relator groups. result Generic groups satisfy the Ascending Chain Condition for k-generated subgroups. The study proves stabilizing of ascending chains in specific groups.
problem Stabilization of ascending chains in bounded rank subgroups of 3-manifold groups.
method Reduction to hyperbolic 3-manifolds and use of geometrization.
result Ascending chains in toral relatively hyperbolic groups stabilize.
GNNs improve supply chain analytics with real-world benchmarks.
problem Limited research on applying GNNs to supply chain management.
method Conceptual discussions, detailed formulations, examples, mathematical definitions, and task guidelines.
result GNN-based models outperform other methods by 10-40% in various supply chain tasks.
We introduce and study the notion of a chain group of homeomorphisms of a one-manifold, which is a certain generalization of Thompson's group F. The resulting class of groups exhibits a combination of uniformity and diversity. On the one hand, a chain group either has a simple commutator subgroup or the action of the…
Geometrically interprets a duality theorem linking cochain and chain complexes.
problem Understanding a complex duality theorem in geometric terms.
method Introduces a chain isomorphism involving simplicial and cellular complexes.
result Establishes a geometric interpretation of Ranicki duality.
New proof for minimizing tunnel systems in satellite chain links.
problem Minimizing the tunnel number of satellite chain links.
method Proving the tunnel number is minimized for links with a specific number of components and bridge number.
result The result is sharp for satellite chain links over a 2-bridge knot.
Simpler method derived for path geometries on surfaces, characterizing projective path geometries.
problem Characterizing projective path geometries on surfaces.
method Solving the equivalence problem of sub-Riemannian geometry of signature (1,1) on a contact 3-manifold.
result Characterization of projective path geometries in terms of their chains.
In this paper, we deal with the task of building a dynamic ensemble of chain classifiers for multi-label classification. To do so, we proposed two concepts of classifier chains algorithms that are able to change label order of the chain without rebuilding the entire model. Such modes allows anticipating the instance-sp…
Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a variant of stochastic gradient descent where the random samples are taken on the t…
We compute the chains associated to the left-invariant CR structures on the three-sphere. These structures are characterized by a single real modulus a. For the standard structure a=1, the chains are well-known and are closed curves. We show that for almost all other values of the modulus a either two or three ty…
Study Markov chain gradient descent in Hilbert spaces for quadratic loss.
problem Approximating optimal solutions for quadratic loss functions.
method Developed a Markov chain-based stochastic gradient algorithm in Hilbert spaces.
result Established probabilistic upper bounds on convergence.
Crypto markets show negative spillovers between chains, not positive co-movements.
problem Negative spillovers in crypto asset returns across different blockchains.
method On-chain data from multiple blockchains (Ethereum, Solana, Binance, Arbitrum, Avalanche) analyzed over 2022-2025.
result Surges on one chain often coincide with declines on others, especially during attention shocks.
We give a new proof of the Morse Homology Theorem by constructing a chain complex associated to a Morse-Bott-Smale function that reduces to the Morse-Smale-Witten chain complex when the function is Morse-Smale and to the chain complex of smooth singular N-cube chains when the function is constant. We show that the ho…
Hidden Markov Chains and Linear-chain CRFs are equivalent.
problem Comparing Hidden Markov Chains and Conditional Random Fields.
method Constructing an HMC with the same posterior distribution as a CRF.
result HMCs and linear-chain CRFs are equivalent models.
Characterizes chains in 3D CR and para-CR structures.
problem Determining when a 3D path geometry comes from CR or para-CR chains.
method Provides necessary and sufficient conditions for a 3D path geometry to arise from chains of CR or para-CR 3-manifolds, and verifies computationally.
result Characterization of chains in 3D CR and para-CR structures.