Related papers: On invariant generating sets for the cycle space
We study step skew-products over a finite-state shift (base) space whose fiber maps are $C^1$ injective maps on the unit interval. We show that certain invariant sets have a multi-graph structure and can be written graphs of one, two or…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
We compute the full probability distribution of the spectral form factor in the self-dual kicked Ising model by providing an exact lower bound for each moment and verifying numerically that the latter is saturated. We show that at large…
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family,…
In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…
We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…
For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…
We introduce topological invariants for gapless systems and study the associated boundary phenomena. More generally, the symmetry properties of the low-energy conformal field theory (CFT) provide discrete invariants, establishing the notion…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…
Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…
For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense (i.e. 1-dimensional cycle group in the sense of simplicial homology theory with…
For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough…
A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…
Motivated by well known results in low-dimensional topology, we introduce and study a topology on the set CO(G) of all left-invariant circular orders on a fixed countable and discrete group G. CO(G) contains as a closed subspace LO(G), the…
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign),…
Let $\Lambda X$ be the free loop space on a simply connected finite $CW$-complex $X$ and $\beta_{i}(\Lambda X;\Bbbk)$ be the cardinality of a minimal generating set of $H^{i}(\Lambda X;\Bbbk)$ for $\Bbbk$ to be a commutative ring with unit.…
In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of…
Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…