Related papers: Geometric representation of interval exchange maps…
Recently new methods have been introduced to investigate the non-renormalization properties of the anomalies at a non perturbative level and in presence of a lattice. The issue is relevant in a number of problems ranging from the…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
We continue the development of transfer operator techniques for expanding maps on a lattice coupled by general interaction functions. We obtain a spectral gap for an appropriately defined transfer operator, and, as corollaries, the…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
A non associative, noncommutative algebra is defined that may be interpreted as a set of vector modules over a noncommutative surface of rotation. Two of these vector modules are identified with the analogues of the tangent and cotangent…
General hierarchical lattices of coupled maps are considered as dynamical systems. These models may describe many processes occurring in heterogeneous media with tree-like structures. The transition to turbulence via spatiotemporal…
We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…
The integrability condition called shape invariance is shown to have an underlying algebraic structure and the associated Lie algebras are identified. These shape-invariance algebras transform the parameters of the potentials such as…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
In this paper, we consider chaotic dynamics and variational structures of area-preserving maps. There is a lot of study on the dynamics of their maps and the works of Poincare and Birkhoff are well-known. To consider variational structures…
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
We consider divergent orbits of the group of diagonal matrices in the space of lattices in Euclidean space. We define two natural numerical invariants of such orbits: The discriminant - an integer - and the type - an integer vector. We then…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…
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,…