Related papers: Invariant monotone coupling need not exist
We use a 1-parameter version of gauge theory to investigate the topology of the diffeomorphism group of 4-manifolds. A polynomial invariant, analogous to the Donaldson polynomial, is defined, and is used to show that the diffeomorphism…
Hom gives an example of a knot with vanishing Upsilon invariant but nonzero epsilon invariant. We build more such knots that are linearly independent in the smooth concordance group.
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…
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…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…
We formulate a notion of the quantum automorphism group of a $2$-graph. After some preliminary computations, we define quantum isomorphism between a pair of $2$-graphs. We produce a `non-trivial' example of a pair of $2$-graphs that are not…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
This paper explores Iwasawa theory from a graph theoretic perspective, focusing on the algebraic and combinatorial properties of Cayley graphs. Using representation theory, we analyze Iwasawa-theoretic invariants within…
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…
We describe a general approach to the theory of self consistent transfer operators. These operators have been introduced as tools for the study of the statistical properties of a large number of all to all interacting dynamical systems…
Non-linear maps can possess various dynamical behaviors varying from stable steady states and cycles to chaotic oscillations. Most models assume that individuals within a given population are identical ignoring the fundamental role of…
We study a certain class of piecewise monotonic maps of interval. These maps are strictly monotone on finite interval partition, satisfies Markov condition and have generator property. We show that for a function from this class…
By studying periodic points for rational maps on $\bm{C}^d$ with $p$ invariants, we show that they form an invariant variety of dimension $p$ if the periodicity conditions are `fully correlated', and a set of isolated points if the…
We generalize the notion of the quandle polynomial to the case of singquandles. We show that the singquandle polynomial is an invariant of finite singquandles. We also construct a singular link invariant from the singquandle polynomial and…
We construct an infinite family of triples (G,S1, S2) each consisting of a group G and a pair (S1, S2) of distinct subsets of G with the following properties. i The two Cayley graphs Cay(G, S1) and Cay(G,S2) are non-isomorphic. ii The…
Synchronization transitions are investigated in coupled chaotic maps. Depending on the relative weight of linear versus nonlinear instability mechanisms associated to the single map two different scenarios for the transition may occur. When…
We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…