English
Related papers

Related papers: Product-free sets in the free semigroup

200 papers

For a finite multiset $A$ of an abelian group $G$, let $\text{FS}(A)$ denote the multiset of the $2^{|A|}$ subset sums of $A$. It is natural to ask to what extent $A$ can be reconstructed from $\text{FS}(A)$. We fully solve this problem for…

Combinatorics · Mathematics 2024-12-10 Federico Glaudo , Noah Kravitz

We present examples of closed subsets of a free group such that their product is not closed in the profinite topology. We discuss how to characterize a subset of a free group which is closed in the profinite topology and its product with…

Group Theory · Mathematics 2019-06-19 Rita Gitik , Eliyahu Rips

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…

Number Theory · Mathematics 2019-08-15 Kostadinka Lapkova , Stanley Yao Xiao

We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with…

Combinatorics · Mathematics 2018-08-07 Vsevolod F. Lev

Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent…

Combinatorics · Mathematics 2015-09-16 Danny Rorabaugh

We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…

Combinatorics · Mathematics 2013-08-14 Anthony Bonato , Jason Brown , Dieter Mitsche , Pawel Pralat

We define $(\alpha_n)$ -regular sets in uniformly perfect metric spaces. This definition is quasisymmetrically invariant and the construction resembles generalized dyadic cubes in metric spaces. For these sets we then determine the…

Classical Analysis and ODEs · Mathematics 2016-12-28 Tuomo Ojala

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

A reduction formula for compressions of von Neumann algebras arising as free products is proved. This shows that the fundamental group is all of the positive reals for some such algebras. Additionally, by taking a sort of free product with…

Operator Algebras · Mathematics 2007-05-23 Ken Dykema , Florin Radulescu

Following the works of Furstenberg and Glasner on stationary means, we strengthen and extend in this paper some recent results by Di Nasso, Goldbring, Jin, Leth, Lupini and Mahlburg on piecewise syndeticity of product sets in countable…

Dynamical Systems · Mathematics 2016-06-03 Michael Björklund

A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…

Formal Languages and Automata Theory · Computer Science 2018-01-04 Janusz A. Brzozowski , Sylvie Davies

Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to…

Formal Languages and Automata Theory · Computer Science 2011-12-15 Stefano Bilotta , Elisa Pergola , Renzo Pinzani

In this note we prove that for every sequence $(m_q)_{q}$ of positive integers and for every real $0<\delta\leqslant1$ there is a sequence $(n_q)_{q}$ of positive integers such that for every sequence $(H_q)_{q}$ of finite sets such that…

Combinatorics · Mathematics 2012-11-19 Stevo Todorcevic , Konstantinos Tyros

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $\sigma(G)$ denotes…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

In this note we give a characterization of elementary abelian 2-groups in terms of their maximal sum-free subsets.

Group Theory · Mathematics 2016-11-29 Marius Tărnăuceanu

This paper's major purpose is to continue the work of Zhu and Ma[1]. To begin, the $\mathbf{g}$-almost product property, more general irregular and regular sets, and some new notions of the Banach upper density recurrent points and…

Dynamical Systems · Mathematics 2023-03-29 Yanjie Tang , Xiaojiang Ye , Dongkui Ma

Arithmetic quasi-densities are a large family of real-valued set functions partially defined on the power set of $\mathbb{N}$, including the asymptotic density, the Banach density, the analytic density, etc. Let $B \subseteq \mathbb{N}$ be…

Number Theory · Mathematics 2024-05-22 Paolo Leonetti , Salvatore Tringali

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

Group Theory · Mathematics 2015-06-05 Nasim Karimi
‹ Prev 1 8 9 10 Next ›