Related papers: Phase transitions in infinitely generated groups, …
The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…
The purpose of this article is to discuss recent advances in the growing field of phase retrieval, and to publicize open problems that we believe will be of interest to mathematicians in general, and algebraists in particular.
It has been proposed (Phys. Rev. E {\bf 71}, 026121 (2005)) that unlike the short range contact process, a long-range counterpart may lead to the existence a discontinuous phase transition in one dimension. Aiming at exploring such link,…
For every $\alpha \leq \beta$ in a left neighborhood $[\alpha_0,1]$ of 1, a group $G(\alpha,\beta)$ is constructed, the growth function of which satisfies $\limsup \frac{\log \log b_{G(\alpha,\beta)}(r)}{\log r}=\alpha$ and $\liminf…
If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…
In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…
This paper extends and applies algebraic invariants and constructions for mixing finite group extensions of shifts of finite type. For a finite abelian group G, Parry showed how to define a G-extension S_A from a square matrix A over Z_+G,…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by $\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is topological one defines similarly the notion of topological invariable generation. A…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…
We deal with two forms of the "uniqueness cases" in the classification of large simple $K^*$-groups of finite Morley rank of odd type, where large means the $m_2(G)$ at least three. This substantially extends results known for even larger…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
We analyze the properties of the contact process with long-range interactions by the use of a kinetic ensemble in which the total number of particles is strictly conserved. In this ensemble, both annihilation and creation processes are…
Motivated by a model of an area-wide integrated pest management, we develop an interacting particle system evolving in a random environment. It is a generalised contact process in which the birth rate takes two possible values, determined…
A new point of view about the deep origin of thermodynamic phase transitions is sketched. The main idea is to link the appearance of phase transitions to some major topology change of suitable submanifolds of phase space instead of linking…
Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…
An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…