Related papers: Phase transitions in infinitely generated groups, …

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer $r$, we express the generating function of meandric systems on $2n$ points with $n-r$ loops in terms of a finite…

An enlarged group G of nonlinear transformations, modeled on the general linear group GL(2,R), leads to a beautiful, apparently unremarked symmetry between the wave function's phase and the logarithm of its amplitude. Equations Doebner and…

In this article we fully describe the domain of the infinitesimal generator of the optimal state semigroup which arises in the theory of the linear-quadratic problem for a specific class of boundary control systems. This represents an…

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

If $g\in G$ is a non-trivial element in a residually finite group, then there exists by definition a finite group $Q$ and a homomorphism $\varphi: G \to Q$ such that $\varphi(g) \neq e$. The residual finiteness growth $\text{RF}_G$ of a…

We consider a system of clusters made of elementary building blocks, monomers, and evolving via collisions between diffusing monomers and immobile composite clusters. In our model, the cluster-monomer collision can lead to the attachment of…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

A language L over a finite alphabet is growth-sensitive (or entropy sensitive) if forbidding any set of subwords F yields a sub-language L^F whose exponential growth rate (entropy) is smaller than that of L. Let (X, E, l) be an infinite,…

Recently for a class of critically intermittent random systems a phase transition was found for the finiteness of the absolutely continuous invariant measure. The systems for which this result holds are characterized by the interplay…

For a broad class of the Levy processes the new form (convolution type) of the infinitesimal generators is introduced. It leads to the new notions: a truncated generator, a quasi-potential. The probability of the Levy process remaining…

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

This paper investigates additive processes with respect to several different independences in non-commutative probability in terms of the convolution hemigroups of the distributions of the increments of the processes. In particular, we…

The emergence of phase separation is investigated in the framework of a 2D t-J model by means of a variational product ansatz, which covers the infinite lattice by two types of L x L clusters. Clusters of the first type are completely…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

The Andrews-Curtis conjecture remains one of the outstanding open problems in combinatorial group theory. It claims that every normally generating $r$-tuple of a free group $F_r$ of rank $r\geq 2$ can be reduced to a basis by means of…

We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where the algorithm is able to reduce a whole set of integers into…