相关论文: Associativity and Thompson's Group

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Let X be a set and Bin(X) the set of all binary operations on X. We say that a subset of Bin(X) is a distributive set of operations if all pairs of elements are right distributive. J.Przytycki posed the question of which groups can be…

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

A set-theoretic solution to the Pentagon Equation can be described as a \emph{pentagon} algebra $(S, \cdot, \ast)$ such that $(S, \cdot)$ is a semigroup and the operations $\cdot$ and $\ast$ are related by two additional equations. This…

We consider the Fourier-Stietljes algebra B(G) of a locally compact group G. We show that operator amenablility of B(G) implies that a certain semitolpological compactification of G admits only finitely many idempotents. In the case that G…

Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assembly index is the minimum number of…

We provide a framework for studying concrete C*-algebras associated with algebraic actions of semigroups: Given such an action, we construct an inverse semigroup, and we introduce conditions for algebraic actions that characterize…

We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…

Information inflow into a computational system is by a sequence of information items. Cognitive computing, i.e. performing transformations along that sequence, requires to represent item information as well as sequential information. Among…

Let $F$ be a global field. Let $G$ be a non trivial finite \'etale tame $F$-group scheme. We define height functions on the set of $G$-torsors over $F,$ which generalize the usual heights such as discriminant. As an analogue of the Malle…

An algebra $\mathcal{A}$ of real or complex valued functions defined on a set $\mathbf{T}$ shall be called \textit{homotonic} if $\mathcal{A}$ is closed under forming of absolute values, and for all $f$ and $g$ in $\mathcal{A}$, the product…

The distance of an operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Associative spectra were introduced in a publication by B. Cs\'ak\'any and T. Waldhauser in…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS…

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

The connections between Tarski's relation algebras and Thompson's groups F, T, V, and his monoid M are reviewed here, along with Jonsson-Tarski algebras, fork algebras, true pairing algebras, and tabular relation algebras. All of these…

Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

The purpose of this article is prove that Thompson's group F is amenable. The methods developed will then be used to prove a generalization of Hindman's theorem for the free nonassociative binary system on one generator.