Related papers: Approximation of Generating Function Barcode for H…
We outline the construction of invariants of Hamiltonian group actions on symplectic manifolds. These invariants can be viewed as an equivariant version of Gromov-Witten invariants. They are derived from solutions of a PDE involving the…
The Hamiltonian Monte Carlo (HMC) algorithm is a powerful Markov Chain Monte Carlo (MCMC) method that uses Hamiltonian dynamics to generate samples from a target distribution. To fully exploit its potential, we must understand how…
We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group…
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
In this paper, we use Floer theory to study the Hofer length functional for paths of Hamiltonian diffeomorphisms which are sufficiently short. In particular, the length minimizing properties of a short Hamiltonian path are related to the…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
By considering the Einstein vacuum field equations linearized about the Minkowski metric, the evolution equations for the gauge-invariant quantities characterizing the gravitational field are written in a Hamiltonian form by using a…
In this paper, we develop a mini-max theory of the action functional over the semi-infinite cycles via the chain level Floer homology theory and construct spectral invariants of Hamiltonian diffeomorphisms on arbitrary, especially on {\it…
Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensional vector space…
We study Hamiltonian flows in a real separable Hilbert space endowed with a symplectic structure. Measures on the Hilbert space that are invariant with respect to the flows of completely integrable Hamiltonian systems are investigated.…
In this paper, we introduce a novel persistence framework for Morse decompositions in Markov chains using combinatorial multivector fields. Our approach provides a structured method to analyze recurrence and stability in finite-state…
It is well-known that the cohomology ring has a richer structure than homology groups. However, until recently, the use of cohomology in persistence setting has been limited to speeding up of barcode computations. Some of the recently…
We study how the vector-field structure of nonlinear port-Hamiltonian systems is reflected in the infinitesimal Koopman generator. The generator admits a natural bracket decomposition into a conservative interconnection-bracket derivation,…
Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…
Metric-preserving functions (here, metric aggregation functions) offer a natural method for constructing metrics on Cartesian products of metric spaces or for aggregating multiple metrics defined on a common set. Strongly metric-preserving…
This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…
The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…
Traditionally, the field of computational Bayesian statistics has been divided into two main subfields: variational methods and Markov chain Monte Carlo (MCMC). In recent years, however, several methods have been proposed based on combining…