Related papers: Notes on sets of first return

We investigate the following surprisingly widespread phenomenon which we call The Rule of Three: in order for a particular kind of commutation relation to hold for subsequences of elements of a ring labeled by any subset of indices, it is…

We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…

We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the…

We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…

We show that if a finite dimensional Hopf algebra over ${\bf C}$ has a basis such that all the structure constants are non-negative, then the Hopf algebra must be given by a finite group $G$ and a factorization $G=G_+G_-$ into two…

We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…

In this article we define a new reducibility based on the enumeration orders of r.e. sets.

We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

We show that the fundamental group of the complement of an arrangement of complex lines in the complex plane is a free group if and only if the arrangement is a union of parallel lines.

We prove that for any fixed integers $m\ge 2, t\ge 1, k\ge 2$ a generic $m$-generator $t$-relator group satisfies the Ascending Chain Condition for $k$-generated subgroups.

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent set.

We prove that for every $t\in \mathbb{N}$, there exists $\tau=\tau(t)\in \mathbb{N}$ such that every (theta, prism, $K_{1,t}$)-free graph has tree independence number at most $\tau$ (where we allow "prisms" to have one path of length zero).