Related papers: On invariant generating sets for the cycle space
We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
For a prime p>2 and q=p^n, we compute a finite generating set for the SL_2(F_q)-invariants of the second symmetric power representation, showing the invariants are a hypersurface and the field of fractions is a purely transcendental…
We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…
A finitely generated shift invariant space $V$ is a closed subspace of $L^2(\R^d)$ that is generated by the integer translates of a finite number of functions. A set of frame generators for $V$ is a set of functions whose integer translates…
Graph monoids arise naturally in the study of non-stable K-theory of graph C*-algebras and Leavitt path algebras. They play also an important role in the current approaches to the realization problem for von Neumann regular rings. In this…
A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…
We consider discrete Gaussian free fields with ergodic random conductances on a class of random subgraphs of $\mathbb{Z}^{d}$, $d \geq 2$, including i.i.d.\ supercritical percolation clusters, where the conductances are possibly unbounded…
Given a countable set of sites and a collection of flip rates at each site, we give a sufficient condition on the long-range dependancies of the flip rates ensuring the well-definedness of the corresponding spin system. This hypothesis has…
The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop $\mathrm{O}$(1) model. In this paper, we first prove that the uniform even subgraph of $Z^d$ percolates for…
The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding…
A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, if S is a maximum stable set of the subgraph induced by its closed neighborhood. It is known that the family of all local…
Applied category theory has recently developed libraries for computing with morphisms in interesting categories, while machine learning has developed ways of learning programs in interesting languages. Taking the analogy between categories…
We state the generating hypothesis in the homotopy category of G-spectra for a compact Lie group G, and prove that if G is finite, then the generating hypothesis implies the strong generating hypothesis, just as in the non-equivariant case.…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
We study the locality of critical percolation on finite graphs: let $G_n$ be a sequence of finite graphs, converging locally weakly to a (random, rooted) infinite graph $G$. Consider Bernoulli edge percolation: does the critical probability…
We show that for every two cycles $C,D$, there exists $c>0$ such that if $G$ is both $C$-free and $\overline{D}$-free then $G$ has a clique or stable set of size at least $|G|^c$. ("$H$-free" means with no induced subgraph isomorphic to…
Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…