Related papers: A combinatorial interpretation of harmonic cycles
A harmonic cycle $\lambda$, also called a discrete harmonic form, is a solution of the Laplace's equation with the combinatorial Laplace operator obtained from the boundary operators of a chain complex. By the combinatorial Hodge theory,…
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
We introduce a notion of harmonic chain for chain complexes over fields of positive characteristic. A list of conditions for when a Hodge decomposition theorem holds in this setting is given and we apply this theory to finite CW complexes.…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
Network representations often cannot fully account for the structural richness of complex systems spanning multiple levels of organisation. Recently proposed high-order information-theoretic signals are well-suited to capture synergistic…
We introduce an explicit combinatorial characterization of the minimal model ${\cal O}_{\infty}$ of the coloured operad ${\cal O}$ encoding non-symmetric operads. In our description of ${\cal O}_{\infty}$, the spaces of operations are…
The closed loops or cycles in a brain network embeds higher order signal transmission paths, which provide fundamental insights into the functioning of the brain. In this work, we propose an efficient algorithm for systematic identification…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…
The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a…
In this paper, we discuss the associated family of harmonic maps $\mathcal{F}: M \rightarrow G/K$ from a Riemann surface $M$ into inner symmetric spaces of compact or non-compact type which are either algebraic or totally symmetric. These…
We define the notion of a loop Hodge structure -- an infinite dimensional generalization of a Hodge structure -- and prove that a suitable variation of this object over a complex manifold is equivalent to the datum of a harmonic bundle.…
The Feynman path integral for the generalized harmonic oscillator is reviewed, and it is shown that the path integral can be used to find a complete set of wave functions for the oscillator. Harmonic oscillators with different…
We show that an algebra over a cyclic operad supplied with an additional linear algebra datum called Hodge decomposition admits a minimal model whose structure maps are given in terms of summation over trees. This minimal model is unique up…
We describe a general technique to study Dirac operators on noncommutative spaces under some additional assumptions. The main idea is to capture the compact resolvent condition in a combinatorial set up. Using this, we then prove that for a…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…